Quantum-Safe Cryptography
Kunal Meher · 2023
The defense of public key cryptography (PKC) lies in computational issues like the difficulty of factorizing enormous prime numbers and the discrete logarithm calculations. Such kinds of algorithms are called one-way functions because although it is straightforward to compute output given input, it is difficult to compute input if output is given. It is expected that such numerical or computational issues which are utilized in current cryptographic plans are difficult to address for an adversary utilizing present PCs. Yet, many organizations are attempting to assemble a high-powered quantum PC and in the future quantum PCs will be available for business use. Traditional asymmetric cryptographic algorithms are not secure against strong quantum machines. Shor’s algorithm running on a powerful quantum PC is able to solve integer factorization problems and discrete logarithm problems in polynomial time. So, asymmetric algorithms that are used today, like RSA, DSA and Diffie-Hellman will become insecure. Similarly, Grover’s algorithm running on a powerful quantum computer poses a serious threat to symmetric key algorithms which uses small key size. There is a need to work on alternate algorithms to resist quantum threat. NIST has already started with a process for the standardization of algorithms which are known as post-quantum cryptography (PQC) algorithms. Specialists globally are exploring progress toward post-quantum cryptography.