Please use this identifier to cite or link to this item:
https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/15658
Title: | Lattice-Based Cryptography and Ntru: Quantum-Resistant Encryption Algorithms |
Authors: | Nisha, F Lenin, J Saravanan, S K Rohit, V Robin Selvam, P D Rajmohan, M |
Keywords: | Cryptographic Security Encryption Algorithms Kyber Algorithm Lattice-Based Cryptography Nth Degree Truncated Polynomial Ring Encryption Nth Degree Truncated Polynomial Ring Sign Quantum Computing Quantum-Resistant Ring-Lizard Algorithm Secure Communications |
Issue Date: | 2024 |
Publisher: | ESIC - 4th International Conference on Emerging Systems and Intelligent Computing, Proceedings Institute of Electrical and Electronics Engineers Inc. |
Citation: | pp. 509-514 |
Abstract: | The quantum-resistant qualities of various encryption methods, such as N-th degree Truncated polynomial Ring Units (NTRU) Encrypt, NTRU Sign, Ring-Lizard, and Kyber protocols are becoming more important in light of the ever-evolving nature of digital threats. An-depth analysis of the mathematical derivation of these algorithms, as well as a determination of their computing efficiency and resistance to quantum assaults is discussed in this paper. Techniques of the Ring-Lizard and Kyber algorithms to lattice-based encryption are analyzed. The study gives an overview of quantum-resistant capabilities of these algorithms and their performance measures. Strengths and weaknesses of the NTRU Encrypt, NTRU Sign, Ring-Lizard, and Kyber algorithms are discussed. The results give useful insights for cybersecurity practitioners, academics, and policymakers, aiding them in making educated choices to protect digital infrastructures against quantum attacks. © 2024 IEEE. |
URI: | http://dx.doi.org/10.1109/ESIC60604.2024.10481608 http://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/15658 |
ISBN: | 9798350349856 |
Appears in Collections: | Conference Papers |
Files in This Item:
There are no files associated with this item.
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.