Author:
Guma'a Omar Sapti,Hussein Qasim Mohammed,Al-Ta'i Ziyad Tariq Mustafa
Abstract
Interesting in the Internet of things (IoT) has begun to grow rapidly since it deals with the everyday needs of humans and becomes dealing with a huge amount of personal information. This expansion is accompanied by a number of challenges; one of them is the need for solving the problem of security challenges by using algorithms with high security and the adversaries unable to attack them. But such algorithms need high computation power. On the other hand, the Internet of things has limited resources. Therefore, high security cryptosystem with low computation power is needed. NTRU (Nth-degree TRUncated polynomial ring) is one of lattice-based cryptosystems that meets these requirements. However, this system has weak points, including the ability to attack it under certain condition using Lenstra–Lenstra–Lovász lattice basis reduction algorithm (LLL algorithm) to discover either the original secret key, or an alternative secret key which is useful to decrypt the cipher texts. In this paper, modifications are made on the NTRU cryptosystem algorithm to ensure that the attack by using Lenstra–Lenstra–Lovász algorithm can be thwarted by adding a new parameter with a variable value. The implementation results showed that this modification gives NTRU resistance against this attack.
Publisher
Southwest Jiaotong University
Reference38 articles.
1. FREMANTLE, P.Z. (2017) An Approach to Enhancing Security and Privacy of the Internet of Things with Federated Identity. PhD Thesis, University of Portsmouth.
2. ZHAN X, ZHANG R, XIONG Z, ZHENG Z, LIU Z. (2013) Efficient implementations of NTRU. Proceedings of the 9th international conference on Wireless Communications, Networking and Mobile Computing (WICOM2013), Beijing, China, 485–492.
3. BOORGHANY, A., SARMADI, S.B., JALILI, R. (2014) On constrained implementation of Lattice-based cryptographic primitives and schemes on smart cards. ACM Transactions on Embedded Computing Systems; 14(3), pp. 1–25, Article 42.
4. HOFFSTEIN, J., PIPHER, J., and SILVERMAN, J.H. (1998) NTRU: A Ring Based Public Key Cryptosystem in Algorithmic Number Theory, Lecture Notes in Computer Science 1423, Springer-Verlag, pp. 267–288.
5. LENSTRA, A.K., LENSTRA, H.W., and LOVA'SZ, L. (1982) Factoring polynomials with rational coefficients. Mathematische Annalen, 261(4), pp. 515- 534
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献