Quantum Attacks On Public-key Cryptosystems

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.quantum Attacks On Public-key Cryptosystems Presemts Almost All Known Quantum Computing Based Attacks On Public-key Cryptosystems, With An Emphasis On Quantum Algorithms For Ifp, Dlp, And Ecdlp.