Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

Lecture notes in computer science

Some Recent Progress in Lattice-Based Cryptography

Chris Peikert

Published Jan 1, 2009• 32 citations
Publisher
DOI
10.1007/978-3-642-00457-5_5

Related papers

Recent Advances in Lattice-Based Cryptography

Pingyuan Zhang, Han Jiang, Jie Cai +3 more

Journal of Computer Research and Development•Oct 1, 2017•0 citations

Recent progress of R&D on quantum cryptography

Masahiro Takeoka

IEICE Technical Report; IEICE Tech. Rep.•May 23, 2019•0 citations

Lattice-based cryptography

Ayman W. Mohsen, Ayman Mohammad Bahaa-Eldin, Mohamed Sobh

Among the different cryptosystems, the Public Key Cryptosystems (PKCS) are of great usage and are used in many applications. Most of the current PKCS are based on a hard problem making the cryptanalysis of such cipher infeasible given the current computing and memory availability. However, Quantum Computing threatens all the current PKCS as they offer a new model that can solve those hard problems, e.g. the factorization problem of RSA or the discrete logarithm problem of ELGAMAL algorithm. Lattice Based PKCS are a promising filed to introduce an immune cipher system against quantum cryptanalysis. This paper presents a summary of recent progress in the field of lattice-based cryptography, by focusing on the recent advancement in lattice-based public key cryptosystems and key exchange mechanisms based on the learning with errors (LWE) problem and its ring variant Ring-LWE.

International Conference on Computer Engineering & Systems (ICCES)•Dec 1, 2017•22 citations

Progress in Lattice-Based Digital Signature

Pooja Bhatt, Rachna Navalakhe

Mostly, existing public-key cryptosystems are constructed on the mathematical complexity of large integer factorization and solving discrete logarithms, which will be irresistible to attacks of future quantum computers. Due to the rapidly growing vulnerabilities in cryptographic systems recently, post-quantum cryptography (PQC) has turned out to be a need for the crypto community and has become a necessary research domain for the welfare of society. Lattice-based cryptography is measured as the most capable PQC because of its intense security proofs based on worst-case hardness, balanced performance in security, and efficient computation. This chapter provides a mathematical foundation of lattice-based cryptography, existing digital signatures, different attacks on lattice-based signatures with toy examples, challenges in lattice-based digital signatures, and future research directions. For scholars and academicians functioning in this emerging field of post PQC, the main unresolved issues evaluated in this study will provide an easily navigable reference and a unified, comprehensive source of data on lattice-based cryptography.

CRC Press eBooks•Jun 2, 2026•0 citations

Lattice-Based Cryptography: A Survey

Xiaoyun Wang, Guangwu Xu, Yang Yu

Chinese Annals of Mathematics Series B•Nov 1, 2023•45 citations

Lattice-Based Cryptography

Oded Regev

Lecture notes in computer science•Jan 1, 2006•499 citations
Among the different cryptosystems, the Public Key Cryptosystems (PKCS) are of great usage and are used in many applications. Most of the current PKCS are based on a hard problem making the cryptanalysis of such cipher infeasible given the current computing and memory availability. However, Quantum Computing threatens all the current PKCS as they offer a new model that can solve those hard problems, e.g. the factorization problem of RSA or the discrete logarithm problem of ELGAMAL algorithm. Lattice Based PKCS are a promising filed to introduce an immune cipher system against quantum cryptanalysis. This paper presents a summary of recent progress in the field of lattice-based cryptography, by focusing on the recent advancement in lattice-based public key cryptosystems and key exchange mechanisms based on the learning with errors (LWE) problem and its ring variant Ring-LWE.
Mostly, existing public-key cryptosystems are constructed on the mathematical complexity of large integer factorization and solving discrete logarithms, which will be irresistible to attacks of future quantum computers. Due to the rapidly growing vulnerabilities in cryptographic systems recently, post-quantum cryptography (PQC) has turned out to be a need for the crypto community and has become a necessary research domain for the welfare of society. Lattice-based cryptography is measured as the most capable PQC because of its intense security proofs based on worst-case hardness, balanced performance in security, and efficient computation. This chapter provides a mathematical foundation of lattice-based cryptography, existing digital signatures, different attacks on lattice-based signatures with toy examples, challenges in lattice-based digital signatures, and future research directions. For scholars and academicians functioning in this emerging field of post PQC, the main unresolved issues evaluated in this study will provide an easily navigable reference and a unified, comprehensive source of data on lattice-based cryptography.