Research ArticleOpen AccessGoogle Scholar indexed

A Generalization of NTRUEncrypt —Cryptosystem Based on Ideal Lattice

¹ Engineering Research Center of Ministry of Education for Financial Computing and Digital Engineering, Renmin University of China, Beijing, China
² Artificial Intelligence Research Institute, Beihang University, Beijing, China
³ Engineering Research Center of Ministry of Education for Financial Computing and Digital Engineering, Renmin University of China, Beijing, China
⁴ Engineering Research Center of Ministry of Education for Financial Computing and Digital Engineering, Renmin University of China, Beijing, China
⁵ Engineering Research Center of Ministry of Education for Financial Computing and Digital Engineering, Renmin University of China, Beijing, China

Journal of Information Security·Volume 13 (2022)·Pages 165–180·Published 9 June 2022·DOI10.4236/jis.2022.133010

Abstract

The purpose of this article is to extend the theory of circulant matrix to general ideal matrix, and to construct more general NTRU cryptosystem combin ed with the <i>φ</i> -cyclic code. To understand our construction, first we discuss a more general form of the ordinary cyclic code, namely <i>φ</i> -cyclic code, which firstly appeared in [1] and [2] , thus we give a more generalized NTRUEncrypt by replacing finite field with real number field R.

Keywords&lti&gtφ&lt/i&gt-Cyclic CodeIdeal MatricesConvolutional Modular LatticeNTRU

Lopez-Permouth, S.R., Parra-Avila, B.R. and Szabo, S. (2009) Dual Generalizations of the Concept of Cyclicity of Codes. Advances in Mathematics of Communications, 3, 227-234. https://doi.org/10.3934/amc.2009.3.227
Shi, M., Li, X., Sepasdar, Z. and Solé, P. (2020) Polycyclic Codes as Invariant Subspaces. Finite Fields and Their Applications, 68, Article ID: 101760. https://doi.org/10.1016/j.ffa.2020.101760
Lint, J.H.V. (1999) Introduction to Coding Theory. Volume 86 of GTM. Springer-Verlag, Berlin.
Bose, R.C. and Ray-Chaudhuri, D.K. (1960) On a Class of Error Correcting Binary Group Codes. Information and Control, 3, 68-79. https://doi.org/10.1016/S0019-9958(60)90287-4
Goppa, V.D. (1970) A New Class of Linear Error-Correcting Codes. Problemy Peredachi Informatsii, 6, 24-30.
Hoffstein, J., Pipher, J. and Silverman, J.H. (1998) NTRU: A Ring Based Public Key Cryptosystem. In: Buhler, J.P., Ed., Algorithmic Number Theory, Lecture Notes in Computer Science, Vol. 1423, Springer, Berlin, 267-288. https://doi.org/10.1007/BFb0054868
Gaborit, P., Ohler, J. and Soli, P. (2002) CTRU, a Polynomial Analogue of NTRU. Hal Inria, RR 4621.
Kouzmenko, R. (2006) Generalizations of the NTRU Cryptosystem. Diploma Project, Ecole Polytechnique Federale de Lausanne.
Coglianese, M. and Goi, B. (2005) MaTRU: A New NTRU Based Cryptosystem. Springer Verlag, Berlin, 232-243. https://doi.org/10.1007/11596219_19
Malecian, E., Zakerolhsooeini, A. and Mashatan, A. (2011) QTRU: A Lattice Attack Resistant Version of NTRU PCKS Based on Quaternion Algebra. The ISC Intrtnational Journal of Information Security, 3, 29-42.
Malecian, E. and Zakerolhsooeini, A. (2010) OTRU: A Non-Associative and High Speed Public Key Cryptosystem. IEEE 15th CSI International Symposium on Computer Architecture and Digital Systems (CADS), Tehran, 23-24 September 2010, 83-90. https://doi.org/10.1109/CADS.2010.5623536
Alsaidi, M.G. and Yassein R. (2016) BITRU: Binary Version of the NTRU Public Key Cryptosystem via Binary Algebra. International Journal of Advanced Computer Science & Applications, 7, 1-6. https://doi.org/10.14569/IJACSA.2016.071101
Lyubashevsky, V. and Micciancio, D. (2006) Generalized Compact Knapsacks Are Collision Resistant. In: Bugliesi, M., Preneel, B., Sassone, V. and Wegener, I., Eds., Automata, Languages and Programming, Lecture Notes in Computer Science, Vol. 4052, Springer, Berlin, 144-155. https://doi.org/10.1007/11787006_13

Menu

A Generalization of NTRUEncrypt —Cryptosystem Based on Ideal Lattice

Abstract

References (26)