Quantum-resistant public-key encryption and signature schemes with smaller key sizes

• Published in: Cluster computing Vol. 27; no. 1; pp. 285 - 297
• Main Authors: Soni, Lacchita, Chandra, Harish, Gupta, Daya Sagar, Keval, Ram
• Format: Journal Article
• Language: English
• Published: New York Springer US 01.02.2024; Springer Nature B.V
• Subjects: Cloud computing; Communication; Computer Communication Networks; Computer Science; Cryptography; Cybersecurity; Operating Systems; Processor Architectures; Protocol; Quantum computing; Security systems; Secure communication; Lattice-based cryptography; Encryption; Small integer solution problem; Signature
• ISSN: 1386-7857; 1573-7543
• DOI: 10.1007/s10586-022-03955-y

The emergence of new complex technologies, such as cloud and quantum computing, has a complicated computational structure, which can compromise the security of traditional cryptographic protocols. It has been noted that traditional security systems utilize non-quantum resistance factorization and Diffie–Hellman (DH) hard problems for their protection. Lattice-based cryptography appears to be a potential post-quantum substitute for the presently employed public-key cryptography. As a result, we have been motivated to focus on increasingly sophisticated and challenging lattice hard assumptions capable of withstanding new modern technologies with quantum resistance properties. In this paper, we devise a new lattice-based public-key encryption and signature schemes with smaller key sizes. The proposed scheme also resists the quantum attack because of the lattice small integer solution problem and its variant. The security claim has also been proved in a well-suited model for quantum attacks. The performance analysis shows that the presented schemes outperform the DH-type schemes and compete with similar lattice-based schemes in terms of storage, communication, key sizes, and computational overheads.