基于RLWE认证密钥协商算法的设计
Design of Authenticated Key Agreement Algorithm Based on RLWE
DOI: 10.12677/SEA.2021.102022, PDF,    国家自然科学基金支持
作者: 黄秀菊, 李子臣：北京印刷学院信息工程学院，北京
关键词: RLWE；数字签名；密钥协商；RLWE； Digital Signature； Key Agreement
摘要: 密钥协商算法允许参与者在非安全信道中交换信息共同协商会话密钥用于保密通信，是密码学中最关键技术之一。本文基于RLWE困难问题，利用四舍五入密钥共识算法，Filtering引理及哈希函数，设计了一个新的基于RLWE困难问题的认证密钥协商算法。新的认证密钥协商算法具有高效与可证明安全的特点。
Abstract: Key agreement algorithm allows participants to exchange information in the open channel to gener-ate a secure temporary session key to ensure secret communication, which is one of the key tech-nologies in cryptography. In this paper, a novel authenticated key agreement algorithm based on RLWE difficulty problem is proposed using rounded key consensus algorithm, filtering lemma and hash function. The new authenticated key agreement algorithm is proved to be efficient and prova-bly secure.
文章引用：黄秀菊, 李子臣. 基于RLWE认证密钥协商算法的设计[J]. 软件工程与应用, 2021, 10(2): 185-194. https://doi.org/10.12677/SEA.2021.102022

参考文献

[1] Shamir, A. (1984) A Polynomial-Time Algorithm for Breaking the Basic Merkle-Hellman Cryptosystem. IEEE Transac-tions on Information Theory, 30, 699-704. [Google Scholar] [CrossRef] 
[2] Coppersmith, D. (1996) Finding a Small Root of a Univariate Modular Equation. International Conference on the Theory and Applications of Cryptographic Techniques, Vol. 1070, 155-165. [Google Scholar] [CrossRef] 
[3] Hoffstein, J., Pipher, J. and Silverman, J.H. (1998) NTRU: A Ring-Based Public Key Cryptosystem. International Algorithmic Number Theory Symposium, Vol. 1423, 267-288. [Google Scholar] [CrossRef] 
[4] Gentry, C. (2009) Fully Homomorphic Encryption Using Ideal Lattices. Proceedings of the Forty-First Annual ACM Symposium on Theory of Computing, Bethesda, MD, May 2009, 169-178. [Google Scholar] [CrossRef] 
[5] Chen, L., Jordan, S., et al. (2016) Report on Post-Quantum Cryptography. US Department of Commerce, National Institute of Standards and Technology, Gaithersburg.
[6] Micciancio, D. and Regev, O. (2009) Lattice-Based Cryptography. In: Bernstein, D.J., Buchmann, J. and Dahmen, E., Eds., Post-Quantum Cryptography, Springer, Heidelberg, Berlin, New York, 147-191. [Google Scholar] [CrossRef] 
[7] Wang, X.Y. and Liu, M.J. (2014) Survey of Lattice-Based Cryptography. Journal of Cryptologic Research, 1, 13-27.
[8] 李子臣, 谢婷, 张卷美, 等. 基于RLWE的后量子认证密钥交换协议[J]. 计算机研究与发展, 2019, 56(12): 2694-2701.
[9] 中国密码协会. 全国密码算法设计竞赛公钥参赛算法[EB/OL]. http://sfjs.cacrnet.org.cn/site/term/list_72_1.html
[10] 高昕炜. 基于RLWE的后量子密钥交换协议构造和应用[D]: [硕士/博士学位论文]. 北京: 北京交通大学, 2019.
[11] Zhang, J., Yu, Y., Fan, S., et al. (2020) Tweaking the Asymmetry of Asymmetric-Key Cryptography on Lattices: Kems and Signatures of Smaller Sizes. IACR International Conference on Public-Key Cryptography, Vol. 12111, 37-65. [Google Scholar] [CrossRef] 
[12] Bos, J., Ducas, E., Kiltz, E., et al. (2018) CRYSTALS—Kyber: A CCA-Secure Module-Lattice-Based KEM. 2018 IEEE European Symposium on Security and Privacy (EuroS&P), London, UK, 353-367. [Google Scholar] [CrossRef] 
[13] Ding, J., Gao, X., Takagi, T. and Wang, Y. (2019) One Sample Ring-LWE with Rounding and Its Application to Key Exchange. International Conference on Applied Cryptography and Network Security, Colombia, 5-7 June 2019, 323-343. [Google Scholar] [CrossRef] 
[14] Jin, Z. and Zhao, Y. (2019) Generic and Practical Key Estab-lishment from Lattice. International Conference on Applied Cryptography and Network Security, Colombia, 5-7 June 2019, 302-322. [Google Scholar] [CrossRef] 
[15] Regev, O. (2009) On Lattices, Learning with Errors, Random Linear Codes, and Cryptography. Journal of the ACM, 56, Article No. 34. [Google Scholar] [CrossRef] 
[16] Lyubashevsky, V., Peikert, C. and Regev, O. (2013) On Ideal Lat-tices and Learning with Errors over Rings. Journal of the ACM, 60, Article No. 43. [Google Scholar] [CrossRef] 
[17] Bos, J.W., Lauter, K., Loftus, J. and Naehrig, M. (2013) Improved Security for a Ring-Based Fully Homomorphic Encryption Scheme. IMA International Conference on Cryptography and Coding, Vol. 8308, 45-64. [Google Scholar] [CrossRef] 
[18] Brakerski, Z., Gentry, C. and Vaikuntanathan, V. (2012) (Leveled) Fully Homomorphic Encryption without Bootstrapping. Proceedings of the 3rd Innovations in Theoretical Computer Science Conference, Cambridge, MA, January 2012, 309-325. [Google Scholar] [CrossRef] 
[19] Castryck, W., Iliashenko, I. and Vercauteren, F. (2016) On Error Distributions in Ring-Based LWE. LMS Journal of Computation and Mathematics, 19, 130-145. [Google Scholar] [CrossRef] 
[20] Feng, C. and Zhao, Y. (2017) Ideal Lattice Based Justifiable Secure Digital Signature Scheme. Computer Engineering, 43, 103-107.
[21] Lyubashevsky, V. (2009) Fiat-Shamir with Aborts: Applications to Lattice and Factoring-Based Signatures. International Conference on the Theory and Application of Cryptology and Information Security Springer, Vol. 5912, 598-616. [Google Scholar] [CrossRef] 

为你推荐