Whew, I was holding my breath until I got to this paragraph:
Quote:
|
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."
|
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.
Linear Mode
