Please use this identifier to cite or link to this item: https://gnanaganga.inflibnet.ac.in:8443/jspui/handle/123456789/15658
Full metadata record
DC FieldValueLanguage
dc.contributor.authorNisha, F-
dc.contributor.authorLenin, J-
dc.contributor.authorSaravanan, S K-
dc.contributor.authorRohit, V Robin-
dc.contributor.authorSelvam, P D-
dc.contributor.authorRajmohan, M-
dc.date.accessioned2024-05-29T08:51:27Z-
dc.date.available2024-05-29T08:51:27Z-
dc.date.issued2024-
dc.identifier.citationpp. 509-514en_US
dc.identifier.isbn9798350349856-
dc.identifier.urihttp://dx.doi.org/10.1109/ESIC60604.2024.10481608-
dc.identifier.urihttp://gnanaganga.inflibnet.ac.in:8080/jspui/handle/123456789/15658-
dc.description.abstractThe 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.en_US
dc.language.isoenen_US
dc.publisherESIC - 4th International Conference on Emerging Systems and Intelligent Computing, Proceedingsen_US
dc.publisherInstitute of Electrical and Electronics Engineers Inc.en_US
dc.subjectCryptographic Securityen_US
dc.subjectEncryption Algorithmsen_US
dc.subjectKyber Algorithmen_US
dc.subjectLattice-Based Cryptographyen_US
dc.subjectNth Degree Truncated Polynomial Ring Encryptionen_US
dc.subjectNth Degree Truncated Polynomial Ring Signen_US
dc.subjectQuantum Computingen_US
dc.subjectQuantum-Resistanten_US
dc.subjectRing-Lizard Algorithmen_US
dc.subjectSecure Communicationsen_US
dc.titleLattice-Based Cryptography and Ntru: Quantum-Resistant Encryption Algorithmsen_US
dc.typeArticleen_US
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.