Re: (new?) factorization technique
Available news archives: comp.lang.tcl - comp.lang.python - comp.security.firewalls - sci.crypt - comp.lang.php - comp.lang.javascript
Google
 
Web news.hping.org


sci.crypt archive

Re: (new?) factorization technique

From: Mike Amling <nospam@nospam.com>
Date: Wed Jun 01 2005 - 00:18:57 CEST

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. There's well-documented Java code
> available for download that demonstrates the algorithm. I hope someone will
> find it useful, or at least interesting.
>
> http://techniker.blogspot.com/2005/05/unusual-approach-to-integer.html
>
> If you choose to leave comments, please be constructive with your feedback.

   I think this technique has no advantage over trial division, and is
considerably slower than the fastest existing methods for factoring
large composites.
   Also, what does "those numbers with have products" mean?

--Mike Amling
Received on Thu Sep 29 21:39:25 2005