Re: (new?) factorization technique
From: *** T. Winter (***.Winter_at_cwi.nl)
Date: 05/31/05
- Next message: Pubkeybreaker: "Re: How long does it take to crack 64 Bit DES?"
- Previous message: Peter Schwabe: "How long does it take to crack 64 Bit DES?"
- In reply to: vector: "(new?) factorization technique"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Tue, 31 May 2005 12:32:59 GMT
In article <tKGdnXTaJK-ebAbfRVn-oA@comcast.com> "vector" <root@localhost> writes:
> 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.
See the thread with subject "factoring integers on a classical computer in
polynomial-time" in these newsgroups. There it is shown that such
algorithms are not better than trial division.
-- *** t. winter, cwi, kruislaan 413, 1098 sj amsterdam, nederland, +31205924131 home: bovenover 215, 1025 jn amsterdam, nederland; http://www.cwi.nl/~***/
- Next message: Pubkeybreaker: "Re: How long does it take to crack 64 Bit DES?"
- Previous message: Peter Schwabe: "How long does it take to crack 64 Bit DES?"
- In reply to: vector: "(new?) factorization technique"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
