Open AccessQ-NTRU Cryptosystem for IoT Applications
Author(s) -
Omar Sapti Guma'a,
Qasim Mohammed Hussein,
Ziyad Tariq Mustafa Al-Ta’i
Publication year - 2019
Publication title -
xi'nan jiaotong daxue xuebao
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.308
H-Index - 21
ISSN - 0258-2724
DOI - 10.35741/issn.0258-2724.54.4.15
Subject(s) - ntru , cryptosystem , lattice reduction , computer science , encryption , public key cryptosystem , computer security , computation , theoretical computer science , cryptography , timing attack , mathematics , computer network , algorithm , side channel attack , channel (broadcasting) , mimo
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.