Post-Quantum Cryptography: An Analysis of Code-Based and Lattice-Based Cryptosystems
By: Alexander Meyer
Potential Business Impact:
Makes secret codes safe from future computers.
Most modern cryptographic systems, such as RSA and the Diffie-Hellman Key Exchange, rely on "trapdoor" mathematical functions that are presumed to be computationally difficult with existing tools. However, quantum computers will be able to break these systems using Shor's Algorithm, necessitating the development of quantum-resistant alternatives. We first examine the McEliece cryptosystem, a code-based scheme believed to be secure against quantum attacks due to the hardness of decoding arbitrary linear codes. We then explore NTRU, a lattice-based system grounded in the difficulty of solving the Shortest Vector Problem. Finally, we establish connections between the structural foundations and security of the two systems.
Similar Papers
Complexity of Post-Quantum Cryptography in Embedded Systems and Its Optimization Strategies
Cryptography and Security
Makes computer codes safe from future quantum computers.
A Comparative Study of Classical and Post-Quantum Cryptographic Algorithms in the Era of Quantum Computing
Emerging Technologies
Protects online secrets from super-powerful computers.
A tertiary review on quantum cryptography
Cryptography and Security
Makes secret codes impossible for quantum computers to break.