The Prime Candidate: Cryptography

[CajunCenturion]

Perhaps a major breakthough in algorithmically determining whether extremely large numbers are prime.

Since prime numbers are widely used in encryption algorithms, the ability to prove the primality of a key value is paramount in showing the effectiveness of a crytographic process. When you consider that proving primality in very large numbers is so computational intensive that it cannot be done is any reasonable time frame, this breakthrough in number theory could have some major implications to cryptography.

http://www.flonnet.com/fl1917/19171290.htm

Good Luck
--------------
As a circle of light increases so does the circumference of darkness around it. - Albert Einstein

 

[sleipnir214]

It's interesting.

But the article is nearly a year old. If this algorithm were so revolutionary, wouldn't it have made a bigger splash in the last year?

Want the best answers? Ask the best questions:

http://www.catb.org/~esr/faqs/smart-questions.html

TANSTAAFL!

 

[strongm]

And the FAQ on the paper they produced has this to say:

Q12. Could this result break cryptographic algorithms?

No

Q13. Does this result have any impact in cryptography at all?

Not in any obvious ways.


(FAQ found here:

http://crypto.cs.mcgill.ca/~stiglic/PRIMES_P_FAQ.html#P)