Title: Lattice-based lightweight cryptosystem

Authors: Shivani Jain; R. Padmavathy

Addresses: Department of Computer Science and Engineering, NIT-Warangal, Telangana, 506004, India ' Department of Computer Science and Engineering, NIT-Warangal, Telangana, 506004, India

Abstract: The lattice-based cryptographic constructions are emerging as a major contender of post quantum cryptography. The power-of-2 cyclotomic rings are widely used in lattice-based solutions but these rings have limitations in choice and are scarce. In the proposed work, prime cyclotomic rings are considered for investigation as they enjoy the same security and benefits as power-of-2 rings. In today's world of resource constraint devices, cryptographic constructions are expected to be simpler and lightweight, compared to conventional cryptography. The major concern in the deployment of lattice-based constructions is the size of the payloads. The byte modulus, which is an adaption of the LAC scheme, is used to overcome this problem. Our results show that the proposed scheme is more compact but reasonably secure and relatively efficient in comparison to other popular solutions such as LAC. Further, to withstand decryption failure, the popular BCH and Turbo code are used as error correction with the proposed scheme. The performance of BCH and Turbo code along with prime cyclotomic rings with or without byte modulus is studied and reported.

Keywords: prime cyclotomic rings; ring-learning with errors; byte modulus; lattice-based cryptography.

DOI: 10.1504/IJAHUC.2022.126109

International Journal of Ad Hoc and Ubiquitous Computing, 2022 Vol.41 No.3, pp.135 - 146

Received: 15 Jan 2021
Accepted: 01 Nov 2021
Published online: 11 Oct 2022 *

Full-text access for editors Full-text access for subscribers Purchase this article Comment on this article