Lattice-based cryptography is considered the most promising candidate for post-quantum public key cryptography such as key encapsulation and digital signature schemes. Accurate and efficient sampling of matrix / vector elements and polynomial coefficients from specified discrete probability distributions is crucial to the security and efficiency of lattice-based cryptography protocols. In this work, a design methodology is proposed to implement these sampling operations using currently available quantum computing hardware. Quantum circuits for sampling from uniform, trinary, binomial and discrete Gaussian distributions are presented. Implementation results obtained from simulation as well as measured from real cloud-based quantum hardware are also presented and analyzed. Although the proposed circuits require only few qubits, they implement practical distribution parameters used by various lattice-based protocols. This clearly demonstrates the immediate relevance of such quantum circuits in the context of currently available small-scale quantum computers, and they have the potential to enhance post-quantum cryptography implementations on quantum-enabled cloud environments.
Lattice-based cryptography is considered the most promising candidate for post-quantum public key cryptography such as key encapsulation and digital signature schemes. Accurate and efficient sampling of matrix / vector elements and polynomial coefficients from specified discrete probability distributions is crucial to the security and efficiency of lattice-based cryptography protocols. In this work, a design methodology is proposed to implement these sampling operations using currently available quantum computing hardware. Quantum circuits for sampling from uniform, trinary, binomial and discrete Gaussian distributions are presented. Implementation results obtained from simulation as well as measured from real cloud-based quantum hardware are also presented and analyzed. Although the proposed circuits require only few qubits, they implement practical distribution parameters used by various lattice-based protocols. This clearly demonstrates the immediate relevance of such quantum circuits in the context of currently available small-scale quantum computers, and they have the potential to enhance post-quantum cryptography implementations on quantum-enabled cloud environments.
Lattice-based cryptography is considered the most promising candidate for post-quantum public key cryptography such as key encapsulation and digital signature schemes. Accurate and efficient sampling of matrix / vector elements and polynomial coefficients from specified discrete probability distributions is crucial to the security and efficiency of lattice-based cryptography protocols. In this work, a design methodology is proposed to implement these sampling operations using currently available quantum computing hardware. Quantum circuits for sampling from uniform, trinary, binomial and discrete Gaussian distributions are presented. Implementation results obtained from simulation as well as measured from real cloud-based quantum hardware are also presented and analyzed. Although the proposed circuits require only few qubits, they implement practical distribution parameters used by various lattice-based protocols. This clearly demonstrates the immediate relevance of such quantum circuits in the context of currently available small-scale quantum computers, and they have the potential to enhance post-quantum cryptography implementations on quantum-enabled cloud environments.
The security of classical public-key cryptosystems, which operate based on the computational intractability of integer factorization and discrete logarithm problems, is profoundly threatened by the rapid development of quantum computing. Post-Quantum Cryptography (PQC) has been proposed to improve security against quantum attacks. Lattice-based cryptography is widely regarded as one of the most promising PQC method because of its proven security, efficient implementation, and functional versatility, and it has achieved significant progress in both algorithmic design and engineering implementation in recent years. This paper presents a systematic survey of the status of research on lattice-based cryptographic algorithms. First, the fundamental theory of lattices and their core hard problems are discussed. Next, the technical characteristics and performance of encryption and key encapsulation mechanisms, digital signature schemes, and key exchange protocols constructed based on lattice hard problems are reviewed and compared. Subsequently, the principles and optimization paths of two key technologies for lattice cryptography implementation, namely polynomial multiplication using the fast Number Theoretic Transform (NTT) and pre-image sampling algorithms, are discussed. Finally, considering the PQC standardization process of the National Institute of Standards and Technology (NIST), an outlook on future research directions for lattice-based cryptography is presented. The research directions include the development of more "succinct" fundamental hard problems, strengthening security proofs, improving algorithm efficiency, and countering novel attacks. This review serves as a reference for promoting the practical deployment and further research of lattice-based cryptography.
The advent of large-scale quantum computers poses an existential threat to the security of current public-key cryptosystems, such as RSA and Elliptic Curve Cryptography (ECC), which rely on the computational intractability of integer factorization and discrete logarithms. This paper explores lattice-based cryptography as a promising candidate for post-quantum security. We delve into the mathematical foundations of lattices, specifically focusing on hard problems like the Shortest Vector Problem (SVP), Closest Vector Problem (CVP), Small Integer Solution (SIS), and Learning With Errors (LWE) problems, which are believed to remain intractable even for quantum computers. We provide a comprehensive review of prominent lattice-based constructions, including NTRU, Kyber, and Dilithium, highlighting their security proofs, efficiency considerations, and suitability for various cryptographic primitives such as public-key encryption, key-exchange mechanisms, and digital signatures. Furthermore, we discuss the challenges and opportunities associated with their deployment, including parameter selection, resistance to side-channel attacks, and integration into existing cryptographic infrastructures. By examining the theoretical underpinnings and practical implications, this work aims to solidify understanding of lattice-based methods as a robust and essential component of the cryptographic landscape in the quantum era, moving beyond the traditional RSA frontier.
The imminent threat posed by the development of cryptographically relevant quantum computers necessitates a paradigm shift in public-key cryptography. Traditional cryptosystems like RSA and Elliptic Curve Cryptography (ECC), which underpin global digital security, are vulnerable to quantum algorithms such as Shor's algorithm. This vulnerability mandates a proactive migration to post-quantum cryptography (PQC) to secure long-term sensitive data. Among the various candidates for post-quantum security, lattice-based cryptography has emerged as a particularly promising and robust solution. This paper explores the fundamental principles of lattice-based cryptography, detailing its security foundations rooted in the presumed hardness of lattice problems like the Short Integer Solution (SIS) and Learning With Errors (LWE) problems. We review the significant progress in the field, including its selection as a primary candidate in the NIST Post-Quantum Cryptography standardization process. We discuss its advantages in terms of provable security, versatility, and potential for efficient implementation across diverse platforms, from cloud infrastructure to the Internet of Things (IoT). We also address the practical implications and challenges of its deployment, asserting its indispensable role in fortifying public-key security against future quantum attacks, thereby establishing it as a post-quantum imperative.
The advent of quantum computing poses a significant existential threat to current public-key cryptographic standards, particularly RSA and Elliptic Curve Cryptography (ECC), which underpin global digital security. Shor's algorithm, if implemented on a sufficiently powerful quantum computer, can efficiently break these foundational schemes, rendering vast amounts of encrypted data vulnerable. This paper investigates lattice-based cryptography as a robust and promising candidate for post-quantum security. We provide a comprehensive analysis of its theoretical underpinnings, focusing on hard problems like the Shortest Vector Problem (SVP) and Learning With Errors (LWE), which are believed to be intractable even for quantum adversaries. Through a detailed literature review and methodological exposition, we examine the construction principles of prominent lattice-based Key Encapsulation Mechanisms (KEMs) and digital signature schemes, such as Kyber and Dilithium, highlighting their inherent security properties and performance characteristics. Our results demonstrate that lattice-based schemes offer competitive efficiency, compact key sizes, and strong security guarantees against both classical and quantum attacks, positioning them as essential building blocks for the post-RSA cryptographic landscape. The discussion elaborates on the practical implications, standardization efforts by NIST, and the challenges associated with the transition to quantum-resilient cryptographic infrastructure. We conclude that lattice-based cryptography is a cornerstone of quantum resilience, critical for securing future digital communications and data integrity.
The progress made in the field of quantum computing has drawn the attention of the cryptographic community to the existing systems’ security. Thus, researchers are looking for post-quantum cryptographic solutions that would be able to defend against the upcoming quantum attacks. To this end, different cryptographic approaches have been proposed. Among these approaches, lattice-based cryptography stands out as a promising candidate because of it’s efficient parameters and performance characteristics. The robustness of these post-quantum methods has been tested against the NIST criteria so that the security they offer can be trusted. In this work, we conducted a systematic literature review on lattice-based KEM and signature schemes. We have analyzed 41 papers taken from five major databases and addressed four research questions that include the current landscape of lattice-based post-quantum cryptography, the gaps in the existing literature on lattice-based post-quantum cryptography, identifying mathematical hard problems used in the papers, and future research directions. The reviewed papers primarily focus on key encapsulation mechanisms (KEM) and signature schemes. One of the key findings of this study is the identification of promising lattice-based cryptographic schemes beyond the NIST finalists, such as Qu-Octonion NTRU, Tyber, and HAETAE etc., which clearly shows there is notable progress in lattice-based post-quantum systems. In addition, this review identifies key gaps in current research, including a lack of emphasis on the tradeoffs between security and efficiency, and an insufficient design of hybrid cryptosystems. Finally, the strengths and limitations of the current lattice-based Cryptosystems and future research directions are presented.