Re: Factoring problem solution
From: Paul Leyland (paul_at_leyland.vispa.com)
Date: 02/11/05
- Next message: Mitch Harris: "Re: cryptology, complexity, and quantum cryptology"
- Previous message: mladensavov: "Re: Maybe not a difficult question in Probabilities"
- In reply to: Larry Hammick: "Re: Factoring problem solution"
- Next in thread: tomstdenis_at_gmail.com: "Re: Factoring problem solution"
- Reply: tomstdenis_at_gmail.com: "Re: Factoring problem solution"
- Messages sorted by: [ date ] [ thread ]
Date: 11 Feb 2005 08:36:45 +0000
"Larry Hammick" <larryhammick@OMIT-MEtelus.net> writes:
> True, because you are just guessing at what quadratics to
> use and, if they don't work, guessing again. Real sieves use
> large tables of polynomials. RSA-576 was factored with
> the aid of over half a million quadratic polynomials.
Eh?
RSA-576 was factored by GNFS using a single quintic and a single
linear polynomial.
Paul
-- Hanging on in quiet desperation is the English way. The time is gone, the song is over. Thought I'd something more to say.
- Next message: Mitch Harris: "Re: cryptology, complexity, and quantum cryptology"
- Previous message: mladensavov: "Re: Maybe not a difficult question in Probabilities"
- In reply to: Larry Hammick: "Re: Factoring problem solution"
- Next in thread: tomstdenis_at_gmail.com: "Re: Factoring problem solution"
- Reply: tomstdenis_at_gmail.com: "Re: Factoring problem solution"
- Messages sorted by: [ date ] [ thread ]