Re: (new?) factorization technique

From: Michael Brown (see_at_signature.below)
Date: 05/31/05 

Date: Tue, 31 May 2005 17:50:05 +1000

vector wrote:
> Hello all,
>
> I've written an article discussing an approach I found to finding
> prime factorizations. I don't know if the technique is original, but
> I've never seen it described anywhere else before.

It's come up a few times before. You can use the binary representation of it
to transform the factoring problem into a large non-linear boolean equation
problem (which unfortunately doesn't get you anywhere ...). Essentially the
problem is that the number of possibilities that you need to test grows
exponentially with the size of the input (IIRC, someone who knows the actual
asymtotics please correct me :) ). This exponential work growth is why it's
not talked about very often ("no point" so to speak).

[...] 

-- 
Michael Brown
Add michael@ to emboss.co.nz ---+--- My inbox is always open