Quadratic Sieve Question
From: David Fabian (david.m.fabian_at_sbcglobal.net)
Date: 05/21/03
- Next message: Michael Amling: "Re: Panama hash collision question"
- Previous message: DSCOTT: "Re: "Alien" cryptanalysis: Gwyn a "two-bit troll"?"
- Next in thread: AMMS716: "Re: Quadratic Sieve Question"
- Reply: AMMS716: "Re: Quadratic Sieve Question"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]
Date: Wed, 21 May 2003 20:00:19 GMT
Does anyone have a chart that, for various values of n, gives
the number of n-bit quadratic residues (assuming you could
locate an unlimited number of them) that must be checked
(on the average), in order to produce a balance of prime
factors (assuming you save all of the quadratic residues)?
(I am trying to estimate the time it would take [to factor a
large number that is composed of two large primes], based
on the number of n-bit quadratic residues that I must locate.)
- Next message: Michael Amling: "Re: Panama hash collision question"
- Previous message: DSCOTT: "Re: "Alien" cryptanalysis: Gwyn a "two-bit troll"?"
- Next in thread: AMMS716: "Re: Quadratic Sieve Question"
- Reply: AMMS716: "Re: Quadratic Sieve Question"
- Messages sorted by: [ date ] [ thread ] [ subject ] [ author ] [ attachment ]