"If we determine several random divisors of (p-1)(q-1) by trying
different random values of x, then we can multiply those divisors
together to obtain (p-1)(q-1) itself. Once we know (p-1)(q-1), we can
then determine p and q. - ...."
http://blogs.ams.org/mathgradblog/2014/04/30/shors-algorithm-breaking-rsa-encryption/#sthash.h9GOM0Sn.dpbs
NEXT QUESTION :
NEXT QUESTION: WHAT'S THE HARDWARE?
http://blogs.ams.org/mathgradblog/2014/04/30/shors-algorithm-breaking-rsa-encryption/#sthash.h9GOM0Sn.dpbs
NEXT QUESTION :
What is the fastest factorization algorithm?
http://stackoverflow.com/questions/2267146/what-is-the-fastest-factorization-algorithm
NEXT QUESTION: WHAT'S THE HARDWARE?
No comments:
Post a Comment