Quantum Attacks on Public-Key Cryptosystems

Más información sobre el libro

Exploring the foundations of public-key cryptography, the book delves into the Integer Factorization Problem, Discrete Logarithm Problem, and Elliptic Curve Discrete Logarithm Problem, which underpin most practical cryptosystems. It highlights the reliance of these systems on the infeasibility of solving these problems in polynomial time. Additionally, the text discusses the implications of quantum computing, noting the existence of polynomial-time algorithms for these problems, which could threaten current cryptographic security if practical quantum computers are developed.