Post Quantum Cryptography: Techniques, Challenges, Standardization, and Directions for Future Research

02/06/2022
by   Ritik Bavdekar, et al.
0

The development of large quantum computers will have dire consequences for cryptography. Most of the symmetric and asymmetric cryptographic algorithms are vulnerable to quantum algorithms. Grover's search algorithm gives a square root time boost for the searching of the key in symmetric schemes like AES and 3DES. The security of asymmetric algorithms like RSA, Diffie Hellman, and ECC is based on the mathematical hardness of prime factorization and discrete logarithm. The best classical algorithms available take exponential time. Shor's factoring algorithm can solve the problems in polynomial time. Major breakthroughs in quantum computing will render all the present-day widely used asymmetric cryptosystems insecure. This paper analyzes the vulnerability of the classical cryptosystems in the context of quantum computers discusses various post-quantum cryptosystem families, discusses the status of the NIST post-quantum cryptography standardization process, and finally provides a couple of future research directions in this field.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/31/2018

The Impact of Quantum Computing on Present Cryptography

The aim of this paper is to elucidate the implications of quantum comput...
research
04/06/2022

Post-Quantum Cryptography Algorithms Standardization and Performance Analysis

Quantum computer is no longer a hypothetical idea. It is the worlds most...
research
10/16/2021

Making Existing Software Quantum Safe: Lessons Learned

In the era of quantum computing, Shor's algorithm running on quantum com...
research
11/24/2022

Number Theoretic Transform and Its Applications in Lattice-based Cryptosystems: A Survey

Number theoretic transform (NTT) is the most efficient method for multip...
research
02/02/2023

Generalized Uncertainty Principles for Quantum Cryptography

We know the classical public cryptographic algorithms are based on certa...
research
10/21/2018

PQC: Triple Decomposition Problem Applied To GL(d, Fp) - A Secure Framework For Canonical Non-Commutative Cryptography

Post-Quantum Cryptography (PQC) attempts to find cryptographic protocols...
research
04/07/2018

Why 1.02? The root Hermite factor of LLL and stochastic sandpile models

In lattice-based cryptography, a disturbing and puzzling fact is that th...

Please sign up or login with your details

Forgot password? Click here to reset