Post-quantum cryptography: lattice signatures
From MaRDI portal
Publication:2390954
DOI10.1007/s00607-009-0042-yzbMath1170.94010OpenAlexW2005760721MaRDI QIDQ2390954
Michael Schneider, Richard Lindner, Markus Rückert, Johannes A. Buchmann
Publication date: 10 August 2009
Published in: Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00607-009-0042-y
Related Items (4)
Unconditionally secure quantum signatures ⋮ An Efficient Post-Quantum One-Time Signature Scheme ⋮ The convergence of slide-type reductions ⋮ Strongly unforgeable ring signature scheme from lattices in the standard model
Uses Software
Cites Work
- On Lovász' lattice reduction and the nearest lattice point problem
- Factoring polynomials with rational coefficients
- Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard
- Lattice problems and norm embeddings
- SWIFFT: A Modest Proposal for FFT Hashing
- Merkle Tree Traversal Revisited
- Explicit Hard Instances of the Shortest Vector Problem
- Hardness of approximating the shortest vector problem in lattices
- Trapdoors for hard lattices and new cryptographic constructions
- Generalized Compact Knapsacks Are Collision Resistant
- Symplectic Lattice Reduction and NTRU
- Merkle Signatures with Virtually Unlimited Signature Capacity
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- On the Complexity of Lattice Problems with Polynomial Approximation Factors
- Advances in Cryptology - EUROCRYPT 2004
- Asymptotically Efficient Lattice-Based Digital Signatures
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Theory of Cryptography
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Post-quantum cryptography: lattice signatures
