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.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call