@article{IbrahimCH21,author={Ibrahim, Anas and Chefranov, Alexander G. and Hamamreh, Rushdi},title={Ciphertext-only attack on {RSA} using lattice basis reduction},journal={Int. Arab J. Inf. Technol.},volume={18},number={2},pages={237--247},year={2021},url={https://doi.org/10.34028/iajit/18/2/13},doi={10.34028/IAJIT/18/2/13},timestamp={Mon, 28 Aug 2023 21:35:42 +0200},biburl={https://dblp.org/rec/journals/iajit/IbrahimCH21.bib},bibsource={dblp computer science bibliography, https://dblp.org},}
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, N, 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 q 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 N=0 polynomials modulo q, is proposed, such that the norm of a two-dimensional vector formed by its private key is greater than q. 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.
@article{s20164632,author={Ibrahim, Anas and Chefranov, Alexander and Hamad, Nagham and Daraghmi, Yousef-Awwad and Al-Khasawneh, Ahmad and Rodrigues, Joel J. P. C.},title={NTRU-Like Random Congruential Public-Key Cryptosystem for Wireless Sensor Networks},journal={Sensors},volume={20},year={2020},number={16},article-number={4632},url={https://www.mdpi.com/1424-8220/20/16/4632},pubmedid={32824585},issn={1424-8220},doi={10.3390/s20164632},}
@article{Easttom2020TowardsAD,title={Towards A Deeper NTRU Analysis: A Multi Modal Analysis},author={Easttom, Chuck and Ibrahim, Anas and Chefranov, Alexander G. and Alsmadi, Izzat and Hansen, Richard},journal={International Journal on Cryptography and Information Security},year={2020},url={https://api.semanticscholar.org/CorpusID:220322394}}
@inproceedings{8923091,author={Ibrahim, Anas and Chefranov, Alexander and Hamad, Nagham},booktitle={2019 2nd International Conference on new Trends in Computing Sciences (ICTCS)},title={NTRU-Like Secure and Effective Congruential Public-Key Cryptosystem Using Big Numbers},year={2019},pages={1--7},keywords={Lattices;Encryption;Public key cryptography;Resistance;Computational complexity;Task analysis;Congruential public-key cryptosystem;Integer;Lattice;Lattice basis reduction attack;LLL algorithm;Minkowski's boundary for a lattice shortest vector norm;NTRU;Polynomial},doi={10.1109/ICTCS.2019.8923091},publisher={IEEE}}
NTRU encryption is a standardized public-key cryptosystem which is considered faster than RSA and ECC. For encryption, NTRU adds the product of ph*r to the plaintext, where p is a predefined public parameter, h is the public key, and r is a pseudo-randomly generated blinding polynomial. For decryption, NTRU uses two private keys. We prove that for some parameters NTRU has the modulo p flaw, so NTRU-encrypted plaintext can be disclosed just by applying modulo p operation to the ciphertext without the need of using any of NTRU secret keys. We provide also statistical estimates of the probability of having NTRU modulo p flaw cases for different values of N, where N is the order of polynomial ring used in NTRU. The probabilities show that NTRU modulo p flaw may take place rather often. NTRU amendment to withstand the flaw is proposed.
@article{Ibrahim2016NTRUP,author={Ibrahim, Anas and Chefranov, Alexander},title={NTRU Modulo p Flaw},journal={International Journal for Information Security Research (IJISR)},volume={6},year={2016},issue={3},issn={2042-4639},doi={10.3390/s20164632}}