Some Notes on Post-Quantum Cryptanalysis
Cryptography as it is used today relies on a foundational level on the assumptionthat either the Integer Factoring Problem (IFP) or the DiscreteLogarithm Problem (DLP) is computationally intractable. In the 1990s PeterShor developed a quantum algorithm that solves both problems in polynomialtime. Since then alternative foundational mathematical problems to replace IFPand DLP have been suggested. T