Results 1 to 2 of 2
Hi.
A colleague passed this along to me. I have some interest (but few skills) in the area ... cheers, drl
A New Formula for Generating Primes...
- 08-25-2008 #1Linux Engineer
- Join Date
- Apr 2006
- Location
- Saint Paul, MN, USA / CentOS, Debian, Solaris, SuSE
- Posts
- 1,116
Mathematicians, numerologists, mystics: prime numbers
Hi.
A colleague passed this along to me. I have some interest (but few skills) in the area ... cheers, drl
A New Formula for Generating PrimesWelcome - get the most out of the forum by reading forum basics and guidelines: click here.
90% of questions can be answered by using man pages, Quick Search, Advanced Search, Google search, Wikipedia.
We look forward to helping you with the challenge of the other 10%.
( Mn, 2.6.n, AMD-64 3000+, ASUS A8V Deluxe, 1 GB, SATA + IDE, Matrox G400 AGP )
- 08-25-2008 #2Linux Engineer
- Join Date
- Jun 2006
- Location
- Arlington, VA, USA
- Posts
- 1,377
Whew, I was holding my breath until I got to this paragraph:
It seems like every year someone comes closer to a proof for the Riemann Hypothesis and that's a scary thought for anyone who relies on public key cryptography.Rowland's formula is unlikely to lead to more efficient ways of generating large primes, a crucial operation in cryptography. His formula produces the prime p only after first generating (p – 3)/2 1s. "So it takes a really long time to generate a large prime," Shallit said. Rowland "has a method for skipping over those useless 1s, but doing so essentially requires an independent test for primality."
Reply With Quote 
Posting Permissions
- You may not post new threads
- You may not post replies
- You may not post attachments
- You may not edit your posts
