Re: Quickly finding large primes
 From: larryhammick@xxxxxxxxx
 Date: 21 Apr 2006 22:01:49 0700
jstevh@xxxxxxx wrote:
I have found a trivially easy way to rapidly find large primes.[flush]
No, you haven't. You read somewhere about quadratic character tables
being used to speed up factorization. As always, you ran straight to
usenet to claim, falsely, that you know more about the matter than
anyone else.
sci.crypt people: James Harris is one of world's bestknown and
mosthopeless mathematical cranks. Google up some of his _thousands_ of
claims of great new discoveries on sci.math ("Believe it or not, reply
quality there is abysmal, far worse than here.") to see what I mean.
and then you have an 88.88% probability that it is coprime to 17.
LOL. You get better odds  94%  with a completely arbitrary number.
.
 References:
 Quickly finding large primes
 From: jstevh
 Quickly finding large primes
 Prev by Date: Re: Weakness of Feistel ciphers
 Next by Date: Re: Quadratic residue method for finding primes
 Previous by thread: Re: Quickly finding large primes
 Next by thread: publickey crypto description from 19th century?!
 Index(es):
Relevant Pages
