Quantum Attacks on Public-Key Cryptosystems by Song Y. Yan
Requirements: ePUB Reader, 3mb
Overview: The cryptosystems based on the Integer Factorization Problem (IFP), the Discrete Logarithm Problem (DLP) and the Elliptic Curve Discrete Logarithm Problem (ECDLP) are essentially the only three types of practical public-key cryptosystems in use. The security of these cryptosystems relies heavily on these three infeasible problems, as no polynomial-time algorithms exist for them so far. However, polynomial-time quantum algorithms for IFP, DLP and ECDLP do exist, provided that a practical quantum computer exists.
Genre: Security Related
Download Instructions:
http://gestyy.com/wX0M2w
http://gestyy.com/wX0M2u
