NTRU-Like Random Congruential Public-Key Cryptosystem for Wireless Sensor Networks

Wireless sensor networks (WSNs) are the core of the Internet of Things and require cryptographic protection. Cryptographic methods for WSN should be fast and consume low power as these networks rely on battery-powered devices and microcontrollers. NTRU, the fastest and secure public key cryptosystem...

Full description

Bibliographic Details
Main Authors: Anas Ibrahim, Alexander Chefranov, Nagham Hamad, Yousef-Awwad Daraghmi, Ahmad Al-Khasawneh, Joel J. P. C. Rodrigues
Format: Article
Language:English
Published: MDPI AG 2020-08-01
Series:Sensors
Subjects:
Online Access:https://www.mdpi.com/1424-8220/20/16/4632
id doaj-fb2b2f995ad3458291a91fb140aa8502
record_format Article
spelling doaj-fb2b2f995ad3458291a91fb140aa85022020-11-25T03:20:39ZengMDPI AGSensors1424-82202020-08-01204632463210.3390/s20164632NTRU-Like Random Congruential Public-Key Cryptosystem for Wireless Sensor NetworksAnas Ibrahim0Alexander Chefranov1Nagham Hamad2Yousef-Awwad Daraghmi3Ahmad Al-Khasawneh4Joel J. P. C. Rodrigues5Department of Computer Systems Engineering, Palestine Technical University—Kadoorie, Tulkarm 7, PalestineDepartment of Computer Engineering, Eastern Mediterranean University, Famagusta 99628, North Cyprus via Mersin 10, TurkeyDepartment of Information Technology, Palestine Technical University—Kadoorie, Tulkarm 7, PalestineDepartment of Computer Systems Engineering, Palestine Technical University—Kadoorie, Tulkarm 7, PalestinePresident of Irbid National University, Irbid National University, P.O. Box 2600, Irbid 21110, JordanFederal University of Piauí, Teresina 64049-550, PI, BrazilWireless sensor networks (WSNs) are the core of the Internet of Things and require cryptographic protection. Cryptographic methods for WSN should be fast and consume low power as these networks rely on battery-powered devices and microcontrollers. NTRU, the fastest and secure public key cryptosystem, uses high degree, <i>N</i>, polynomials and is susceptible to the lattice basis reduction attack (LBRA). Congruential public key cryptosystem (CPKC), proposed by the NTRU authors, works on integers modulo <i>q</i> and is easily attackable by LBRA since it uses small numbers for the sake of the correct decryption. Herein, RCPKC, a random congruential public key cryptosystem working on degree <inline-formula><math display="inline"><semantics><mrow><mi>N</mi><mo>=</mo><mn>0</mn></mrow></semantics></math></inline-formula> polynomials modulo <i>q</i>, is proposed, such that the norm of a two-dimensional vector formed by its private key is greater than <inline-formula><math display="inline"><semantics><msqrt><mi>q</mi></msqrt></semantics></math></inline-formula>. RCPKC works as NTRU, and it is a secure version of insecure CPKC. RCPKC specifies a range from which the random numbers shall be selected, and it provides correct decryption for valid users and incorrect decryption for an attacker using LBRA by Gaussian lattice reduction. RCPKC asymmetric encryption padding (RAEP), similar to its NTRU analog, NAEP, is IND-CCA2 secure. Due to the use of big numbers instead of high degree polynomials, RCPKC is about 27 times faster in encryption and decryption than NTRU. Furthermore, RCPKC is more than three times faster than the most effective known NTRU variant, BQTRU. Compared to NTRU, RCPKC reduces energy consumption at least thirty times, which allows increasing the life-time of unattended WSNs more than thirty times.https://www.mdpi.com/1424-8220/20/16/4632wireless sensor networkrandom congruential public-key cryptosystemlatticeNTRUpolynomiallattice basis reduction attack
collection DOAJ
language English
format Article
sources DOAJ
author Anas Ibrahim
Alexander Chefranov
Nagham Hamad
Yousef-Awwad Daraghmi
Ahmad Al-Khasawneh
Joel J. P. C. Rodrigues
spellingShingle Anas Ibrahim
Alexander Chefranov
Nagham Hamad
Yousef-Awwad Daraghmi
Ahmad Al-Khasawneh
Joel J. P. C. Rodrigues
NTRU-Like Random Congruential Public-Key Cryptosystem for Wireless Sensor Networks
Sensors
wireless sensor network
random congruential public-key cryptosystem
lattice
NTRU
polynomial
lattice basis reduction attack
author_facet Anas Ibrahim
Alexander Chefranov
Nagham Hamad
Yousef-Awwad Daraghmi
Ahmad Al-Khasawneh
Joel J. P. C. Rodrigues
author_sort Anas Ibrahim
title NTRU-Like Random Congruential Public-Key Cryptosystem for Wireless Sensor Networks
title_short NTRU-Like Random Congruential Public-Key Cryptosystem for Wireless Sensor Networks
title_full NTRU-Like Random Congruential Public-Key Cryptosystem for Wireless Sensor Networks
title_fullStr NTRU-Like Random Congruential Public-Key Cryptosystem for Wireless Sensor Networks
title_full_unstemmed NTRU-Like Random Congruential Public-Key Cryptosystem for Wireless Sensor Networks
title_sort ntru-like random congruential public-key cryptosystem for wireless sensor networks
publisher MDPI AG
series Sensors
issn 1424-8220
publishDate 2020-08-01
description Wireless sensor networks (WSNs) are the core of the Internet of Things and require cryptographic protection. Cryptographic methods for WSN should be fast and consume low power as these networks rely on battery-powered devices and microcontrollers. NTRU, the fastest and secure public key cryptosystem, uses high degree, <i>N</i>, polynomials and is susceptible to the lattice basis reduction attack (LBRA). Congruential public key cryptosystem (CPKC), proposed by the NTRU authors, works on integers modulo <i>q</i> and is easily attackable by LBRA since it uses small numbers for the sake of the correct decryption. Herein, RCPKC, a random congruential public key cryptosystem working on degree <inline-formula><math display="inline"><semantics><mrow><mi>N</mi><mo>=</mo><mn>0</mn></mrow></semantics></math></inline-formula> polynomials modulo <i>q</i>, is proposed, such that the norm of a two-dimensional vector formed by its private key is greater than <inline-formula><math display="inline"><semantics><msqrt><mi>q</mi></msqrt></semantics></math></inline-formula>. RCPKC works as NTRU, and it is a secure version of insecure CPKC. RCPKC specifies a range from which the random numbers shall be selected, and it provides correct decryption for valid users and incorrect decryption for an attacker using LBRA by Gaussian lattice reduction. RCPKC asymmetric encryption padding (RAEP), similar to its NTRU analog, NAEP, is IND-CCA2 secure. Due to the use of big numbers instead of high degree polynomials, RCPKC is about 27 times faster in encryption and decryption than NTRU. Furthermore, RCPKC is more than three times faster than the most effective known NTRU variant, BQTRU. Compared to NTRU, RCPKC reduces energy consumption at least thirty times, which allows increasing the life-time of unattended WSNs more than thirty times.
topic wireless sensor network
random congruential public-key cryptosystem
lattice
NTRU
polynomial
lattice basis reduction attack
url https://www.mdpi.com/1424-8220/20/16/4632
work_keys_str_mv AT anasibrahim ntrulikerandomcongruentialpublickeycryptosystemforwirelesssensornetworks
AT alexanderchefranov ntrulikerandomcongruentialpublickeycryptosystemforwirelesssensornetworks
AT naghamhamad ntrulikerandomcongruentialpublickeycryptosystemforwirelesssensornetworks
AT yousefawwaddaraghmi ntrulikerandomcongruentialpublickeycryptosystemforwirelesssensornetworks
AT ahmadalkhasawneh ntrulikerandomcongruentialpublickeycryptosystemforwirelesssensornetworks
AT joeljpcrodrigues ntrulikerandomcongruentialpublickeycryptosystemforwirelesssensornetworks
_version_ 1724617529273352192