92. Understanding Post-Quantum Cryptography
**Introduction**
Post-Quantum Cryptography, also known as Quantum-Safe Cryptography, refers to cryptographic algorithms that are seen as secure against a potential quantum computer-based attack. An understanding of Post-Quantum Cryptography is vital in ensuring the security of future systems against the potential risks posed by the advent of quantum computing.
Quantum Computing and Its Threat to Current Cryptography
Quantum computers leverage quantum phenomena to perform complex computing tasks at rates significantly faster than traditional computers. This enables them to solve algorithms and cryptographic keys that would take traditional computers an infeasible amount of time. Essentially, a sufficiently powerful quantum computer could defeat many commonly used cryptographic schemes, including RSA (Rivest-Shamir-Adleman) and ECC (Elliptic-Curve Cryptography).
The Need for Post-Quantum Cryptography
This potential vulnerability of the existing cryptographic infrastructure to quantum computing attacks accentuates the need for Post-Quantum Cryptography. As building quantum computers is currently an active area of research, there is a significant chance we will see them become a reality in the future. When that happens, we need to ensure our cryptographic systems will remain secure.
Post-Quantum Cryptographic Algorithms
Post-Quantum Cryptography is a field of research that focuses on developing cryptographic systems that are secure against both quantum and classical computers. Some of the promising family of algorithms in this field include:
1. Lattice-Based Cryptography: These rely on the hardness of solving problems related to lattices in n-dimensional space. The most notable of such problems used are the Shortest Vector Problem (SVP) and the Closest Vector Problem (CVP).
2. Code-Based Cryptography: This form of cryptography is based on error correction codes. The most notable algorithm in this category is the McEliece cryptosystem, which has been around since 1978 and has withstood the test of time against attacks.
3. Multivariate Polynomial Cryptography: These algorithms are based around the problem of solving systems of multivariate polynomials over finite fields.
4. Hash-Based Cryptography: Hash-based signatures are known to be post-quantum secure. They involve using a cryptographic hash function.
5. Isogeny-Based Cryptography: This is a relatively new field of encryption, based on supersingular isogeny graphs.
Implementing Post-Quantum Cryptosystems
The implementation of post-quantum cryptosystems represents a significant challenge because these new algorithms often require greater computational resources compared to the current systems. They may require more bandwidth and impose longer processing times, leading to slower data transfers. Hence, transitioning to post-quantum cryptography will require strategic planning and phased implementation.
Conclusion
Undoubtedly, Post-Quantum Cryptography is an important field that will have far-reaching implications for data security in the quantum era. However, it remains to be seen which of the post-quantum algorithms will prove to be the most effective, practical, and secure. Meanwhile, researchers and cybersecurity practitioners should continue to stay abreast of developments in this important area.
References
1. Bernstein, D.J., Lange, T., (2017) ‘Post-Quantum Cryptography: State of the Art’. Cryptologia, 41:2, 97-127.
2. Mosca, M., (2018) ‘Cybersecurity in an era with quantum computers: will we be ready?’. IACR Cryptology ePrint Archive, vol. 2018, p. 464.
3. Peikert, C., (2014) ‘Lattice Cryptography for the Internet’. Post-Quantum Cryptography, vol. 8772, pp 197–219.
Additional Reading
1. Post-Quantum Cryptography, D.J. Bernstein, T. Lange, Springer.
2. Quantum Computer Science, M. Mosca, Cambridge University Press.
3. Post-Quantum Cryptography, D.A. McGrew, M.J. Curcio, I.G. Harris, Springer.
