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

Springer eBooks

Lattice-Based Cryptosystems: A Design Perspective

Jiang Zhang, Zhenfeng Zhang

Published Jan 1, 2020• 17 citations
Publisher
DOI
10.1007/978-981-15-8427-5

Related papers

A Study on Lattice-Based Public-Key Cryptosystems

Keita Xagawa

•Jan 1, 2007•0 citations

Multi-bit Cryptosystems Based on Lattice Problems

Akinori Kawachi, Keisuke Tanaka, Keita Xagawa

Springer eBooks•Jun 20, 2007•104 citations

Securities of lattice-based public-key cryptosystems

한대완

•Jan 1, 2007•0 citations

Threshold Decryption and Zero-Knowledge Proofs for Lattice-Based Cryptosystems

Rikke Bendlin, Ivan Damgård

Lecture notes in computer science•Jan 1, 2010•103 citations

Quantum algorithms for typical hard problems: a perspective of cryptanalysis

Jingwen Suo, Licheng Wang, Sijia Yang +2 more

Abstract In typical well-known cryptosystem, the hardness of classical problems plays a fundamental role in ensuring its security. While, with the booming of quantum computation, some classical hard problems tend to be vulnerable when confronted with the already-known quantum attacks, as a result, it is necessary to develop the post-quantum cryptosystem to resist the quantum attacks. With the purpose to bridge the two disciplines, it is significant to summarize known quantum algorithms and their threats toward these cryptographic intractable problems from a perspective of cryptanalysis. In this paper, we discussed the designing methodology, algorithm framework and latest progress of the mathematic hard problems on which the typical cryptosystems depend, including integer factorization problem, discrete logarithmic problem and its variants, lattice problem, dihedral hidden subgroup problems and extrapolated dihedral coset problem. It illustrated the reason why some cryptosystems such as RSA and ECC are not resistant to quantum attacks, yet some of them like lattice cryptosystems remain intact facing quantum attacks.

Quantum Information Processing•Apr 30, 2020•41 citations

Lattice-Based Cryptography: A Survey

Xiaoyun Wang, Guangwu Xu, Yang Yu

Chinese Annals of Mathematics Series B•Nov 1, 2023•60 citations
Abstract In typical well-known cryptosystem, the hardness of classical problems plays a fundamental role in ensuring its security. While, with the booming of quantum computation, some classical hard problems tend to be vulnerable when confronted with the already-known quantum attacks, as a result, it is necessary to develop the post-quantum cryptosystem to resist the quantum attacks. With the purpose to bridge the two disciplines, it is significant to summarize known quantum algorithms and their threats toward these cryptographic intractable problems from a perspective of cryptanalysis. In this paper, we discussed the designing methodology, algorithm framework and latest progress of the mathematic hard problems on which the typical cryptosystems depend, including integer factorization problem, discrete logarithmic problem and its variants, lattice problem, dihedral hidden subgroup problems and extrapolated dihedral coset problem. It illustrated the reason why some cryptosystems such as RSA and ECC are not resistant to quantum attacks, yet some of them like lattice cryptosystems remain intact facing quantum attacks.