IRMA-International.org: Creator of Knowledge
Information Resources Management Association
Advancing the Concepts & Practices of Information Resources Management in Modern Organizations

Post-Quantum Lattice-Based Cryptography: A Quantum-Resistant Cryptosystem

Post-Quantum Lattice-Based Cryptography: A Quantum-Resistant Cryptosystem
View Sample PDF
Author(s): Aarti Dadheech (Institute of Technology, Nirma University, India)
Copyright: 2021
Pages: 22
Source title: Limitations and Future Applications of Quantum Cryptography
Source Author(s)/Editor(s): Neeraj Kumar (Babasaheb Bhimrao Ambedkar University, Lucknow, India), Alka Agrawal (Babasaheb Bhimrao Ambedkar University, Lucknow, India), Brijesh K. Chaurasia (Indian Institute of Information Technology, India)and Raees Ahmad Khan (Indian Institute of Information Technology, India)
DOI: 10.4018/978-1-7998-6677-0.ch006

Purchase

View Post-Quantum Lattice-Based Cryptography: A Quantum-Resistant Cryptosystem on the publisher's website for pricing and purchasing information.

Abstract

Quantum cryptography is a branch of cryptography that is a mixture of quantum mechanics and classical cryptography. The study of quantum cryptography is to design cryptographic algorithms and protocols that are against quantum computing attacks. In this chapter, the authors focus on analyzing characteristics of the quantum-proof cryptosystem and its applications in the future internet. Lattice-based cryptography provides a much stronger belief of security, in that the average-case of certain problems is equivalent to the worst-case of those problems. With the increase in cryptanalytic attacks conventional cryptographic schemes will soon become obsolete. As the reality of quantum computing approaches, these cryptosystems will need to be replaced with efficient quantum-resistant cryptosystems. We need an alternate security mechanism which is as hard as the existing number theoretic approaches. In this chapter, the authors discuss the security dimension of lattice-based cryptography whose strength lies in the hardness of lattice problems and also study its application areas.

Related Content

Preeti Mariam Mathews, Anjali Sandeep Gaikwad, Mathu Uthaman, B. Sreelekshmi, V. Dankan Gowda. © 2024. 26 pages.
Dankan Gowda V., Joohi Garg, Shaifali Garg, K. D. V. Prasad, Sampathirao Suneetha. © 2024. 20 pages.
K. Sriprasadh. © 2024. 24 pages.
R. Valarmathi, R. Uma, P. Ramkumar, Srivatsan Venkatesh. © 2024. 20 pages.
R. Jayashree, J. Venkata Subramanian. © 2024. 14 pages.
M. Indira, K. S. Mohanasundaram, M. Saranya. © 2024. 14 pages.
R. Thenmozhi, D. Vetriselvi, A. Arokiaraj Jovith. © 2024. 26 pages.
Body Bottom