THE NEXT DIGITAL ERA: POST-QUANTUM CRYPTOGRAPHY
Keywords:
post-quantum cryptography, quantum computing, quantum-resistant, quantum-safeAbstract
The development of quantum computers poses a serious challenge to current cryptographic systems. The RSA encryption algorithm, which is widely used, may be threatened by 2025 due to the capabilities of quantum computers. SNDL (Store Now, Decrypt Later) attacks, in which attackers collect and store data now to crack it later with quantum computers, are also a serious threat. The United States, China, Russia, and the European Union are investing heavily in quantum research and development to prepare for these challenges. The NIST (National Institute of Standards and Technology) post-quantum cryptographic standardization process has already standardized four algorithms - CRYSTALS-Kyber, CRYSTALS-Dilithium, FALCON and SPHINCS+ - and is examining four more - Classic McEliece, BIKE, HQC and SIKE in the next round. These efforts are essential to ensure future secure communications and privacy.
References
Alagic, G., Apon, D., Cooper, D., Dang, Q., Dang, T., Kelsey, J., Lichtinger, J., Liu, Y.-K., Miller, C., Moody, D., Peralta, R., Perlner, R., Robinson, A., & Smith-Tone, D. (2022). Status report on the third round of the NIST Post-Quantum Cryptography Standardization process (NIST IR 8413; p. NIST IR 8413). National Institute of Standards and Technology (U.S.). https://doi.org/10.6028/NIST.IR.8413
Amundson, J., & Sexton-Kennedy, E. (2019). Quantum Computing. EPJ Web of Conferences, 214, 09010. https://doi.org/10.1051/epjconf/201921409010
Diffie, W., & Hellman, M. (1976). New directions in cryptography. IEEE Transactions on Information Theory, 22(6), 644–654. https://doi.org/10.1109/TIT.1976.1055638
European industry is yet to embrace the potential of quantum technologies. (2024). https://sciencebusiness.net/news/quantum-computing/european-industry-yet-embrace-potential-quantum-technologies#:~:text=In%202018%2C%20the%20EU%20launched,results%20closer%20to%20industrial%20exploitation.
How is China Investing in Quantum Technology? (2023). https://www.azoquantum.com/Article.aspx?ArticleID=435
Ishita Ray. (2011). Quantum Computing. https://doi.org/10.13140/2.1.1021.7286
Khattar, T., & Yosri, N. (2023). A comment on “Factoring integers with sublinear resources on a superconducting quantum processor.” https://doi.org/10.48550/ARXIV.2307.09651
Nagy, A., & Rajnai, Z. (2024). Introduction to Quantum Communication. INNOVATIVE TECHNOLOGIES IN THE DIGITALIZATION ENVIRONMENT OF HIGHER EDUCATION : PROBLEMS AND SOLUTIONS-2024 (2024) Pp. 559-563. , 5 p.
NATIONAL QUANTUM INITIATIVE SUPPLEMENT TO THE PRESIDENT’S FY 2024 BUDGET. (2023).
Quantum Computing: The Growing Threat Of SNDL. (2024). https://www.cybersecurityintelligence.com/blog/quantum-computing-sndl-threats-are-increasing-7427.html
Rivest, R. L., Shamir, A., & Adleman, L. (1978). A method for obtaining digital signatures and public-key cryptosystems. Communications of the ACM, 21(2), 120–126. https://doi.org/10.1145/359340.359342
Russian Scientists Expect A 50-Qubit Quantum Computer By End Of 2024. (2024). https://thequantuminsider.com/2024/02/24/russian-scientists-expect-a-50-qubit-quantum-computer-by-end-of-2024/#:~:text=Initially%20part%20of%20a%20project,over%20the%20next%20five%20years.
Shor, P. W. (1997). Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM Journal on Computing, 26(5), 1484–1509. https://doi.org/10.1137/S0097539795293172
Yan, B., Tan, Z., Wei, S., Jiang, H., Wang, W., Wang, H., Luo, L., Duan, Q., Liu, Y., Shi, W., Fei, Y., Meng, X., Han, Y., Shan, Z., Chen, J., Zhu, X., Zhang, C., Jin, F., Li, H., … Long, G.-L. (2022). Factoring integers with sublinear resources on a superconducting quantum processor. https://doi.org/10.48550/ARXIV.2212.12372
Yan, Y. (2022). The Overview of Elliptic Curve Cryptography (ECC). Journal of Physics: Conference Series, 2386(1), 012019. https://doi.org/10.1088/1742-6596/2386/1/012019
Yanofsky, N. S. (2007). An Introduction to Quantum Computing (arXiv:0708.0261). arXiv. http://arxiv.org/abs/0708.0261
