arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2202.02826cs.CR
收藏

后量子密码学:技术、挑战、标准化和未来研究方向

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

Ritik Bavdekar, Eashan Jayant Chopde, Ashutosh Bhatia, Kamlesh Tiwari, Sandeep Joshua Daniel, Atul

摘要:

大型量子计算机的发展将对密码学产生可怕的后果。大多数对称和非对称密码算法都容易受到量子算法的攻击。Grover的搜索算法为AES和3DES等对称方案中的密钥搜索提供了平方根时间提升。RSA、Diffie Hellman和ECC等非对称算法的安全性是基于素数分解和离散对数的数学难度。最好的经典算法需要指数时间。Shor的因式分解算法可以在多项式时间内求解。量子计算的重大突破将使所有目前广泛使用的非对称密码系统变得不安全。本文分析了经典密码系统在量子计算机背景下的脆弱性,讨论了各种后量子密码系统族,讨论了NIST后量子密码学标准化进程的现状,最后给出了该领域未来的几个研究方向。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑