New Prime Number Algorithm Discovered
-
From the NYT: "Three Indian computer scientists have solved a longstanding mathematics problem by devising a way for a computer to tell quickly and definitively whether a number is prime — that is, whether it is evenly divisible only by itself and 1." Click [^] Regards, Larry Antram Stardust Software "Those who choose to sacrifice freedom in order to gain security shall not have, nor do they deserve, either one" -- Benjamin Franklin
-
From the NYT: "Three Indian computer scientists have solved a longstanding mathematics problem by devising a way for a computer to tell quickly and definitively whether a number is prime — that is, whether it is evenly divisible only by itself and 1." Click [^] Regards, Larry Antram Stardust Software "Those who choose to sacrifice freedom in order to gain security shall not have, nor do they deserve, either one" -- Benjamin Franklin
Yep - it's very cool. Rama Krishna pointed us all to the paper in the Soapbox. cheers, Chris Maunder
-
From the NYT: "Three Indian computer scientists have solved a longstanding mathematics problem by devising a way for a computer to tell quickly and definitively whether a number is prime — that is, whether it is evenly divisible only by itself and 1." Click [^] Regards, Larry Antram Stardust Software "Those who choose to sacrifice freedom in order to gain security shall not have, nor do they deserve, either one" -- Benjamin Franklin
Wow.
-
Yep - it's very cool. Rama Krishna pointed us all to the paper in the Soapbox. cheers, Chris Maunder
Sorry - I missed that. :-O Regards, Larry Antram Stardust Software "Those who choose to sacrifice freedom in order to gain security shall not have, nor do they deserve, either one" -- Benjamin Franklin
-
From the NYT: "Three Indian computer scientists have solved a longstanding mathematics problem by devising a way for a computer to tell quickly and definitively whether a number is prime — that is, whether it is evenly divisible only by itself and 1." Click [^] Regards, Larry Antram Stardust Software "Those who choose to sacrifice freedom in order to gain security shall not have, nor do they deserve, either one" -- Benjamin Franklin
Cool! More info on IIT is at http://www.iitk.ac.in[^] --------------- Dan Ammasai ---------------
-
From the NYT: "Three Indian computer scientists have solved a longstanding mathematics problem by devising a way for a computer to tell quickly and definitively whether a number is prime — that is, whether it is evenly divisible only by itself and 1." Click [^] Regards, Larry Antram Stardust Software "Those who choose to sacrifice freedom in order to gain security shall not have, nor do they deserve, either one" -- Benjamin Franklin
The end of RSA?
-
The end of RSA?
It just makes it stronger.. no? Breaking RSA requires you to do prime factorization magic which is a another problem itself. I don't see that problem getting any easier because of this algorithm. FreeBSD is sexy. Getting closer and closer to actually submit an article...
-
The end of RSA?
-
Colin Leitner wrote: The end of RSA? Unlikely. To end RSA you need a different algorithm, to find a pair of primes that make a key. You can't just try by the brute force checking all the combinations - it will take ages.
With a very fast algoithm, with more CPU power and some knowledge this can become a problem for RSA. Sure now it's still save, but in 5 years?
-
From the NYT: "Three Indian computer scientists have solved a longstanding mathematics problem by devising a way for a computer to tell quickly and definitively whether a number is prime — that is, whether it is evenly divisible only by itself and 1." Click [^] Regards, Larry Antram Stardust Software "Those who choose to sacrifice freedom in order to gain security shall not have, nor do they deserve, either one" -- Benjamin Franklin
Larry Antram wrote: devising a way for a computer to tell quickly and definitively whether a number is prime Ok, please excuse this philistine, but does this have practical applications? Every now and then you hear they have discovered the next largest prime number, and life carries on, nothing really seems to be gained by it except fascination (which is a good thing.) Will this kind of thing be useful in encryption routines? (btw I am about to read the article, so if it explains in the article, sorry! :-D ) regards, Paul Watson Bluegrass Cape Town, South Africa
-
The end of RSA?
That was my first thought as well... It may have a significant impact on the time to break the encryption (if you can reduce your problem space from all numbers, to just all prime numbers). Ryan Johnston