Post-quantum cryptography: lattice signatures
From MaRDI portal
Publication:2390954
DOI10.1007/S00607-009-0042-YzbMATH Open1170.94010OpenAlexW2005760721MaRDI QIDQ2390954FDOQ2390954
Michael Schneider, Johannes Buchmann, Richard Lindner, Markus Rückert
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
Recommendations
- Post-quantum secure hybrid signcryption from lattice assumption
- Post-quantum cryptography: lattice identification schemes
- Post-quantum cryptography: Code-based signatures
- scientific article; zbMATH DE number 7174174
- scientific article; zbMATH DE number 7108581
- Lattice-based Cryptography
- Lattice-Based Cryptography
- Asymptotically Efficient Lattice-Based Digital Signatures
- Asymptotically efficient lattice-based digital signatures
Cites Work
- SWIFFT: A Modest Proposal for FFT Hashing
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Factoring polynomials with rational coefficients
- Trapdoors for hard lattices and new cryptographic constructions
- Title not available (Why is that?)
- Title not available (Why is that?)
- Lattice problems and norm embeddings
- Title not available (Why is that?)
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
- Asymptotically Efficient Lattice-Based Digital Signatures
- On Lovász' lattice reduction and the nearest lattice point problem
- Generalized Compact Knapsacks Are Collision Resistant
- Theory of Cryptography
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard
- Title not available (Why is that?)
- Title not available (Why is that?)
- Advances in Cryptology - EUROCRYPT 2004
- Merkle Tree Traversal Revisited
- Merkle Signatures with Virtually Unlimited Signature Capacity
- Title not available (Why is that?)
- Hardness of approximating the shortest vector problem in lattices
- Title not available (Why is that?)
- On the Complexity of Lattice Problems with Polynomial Approximation Factors
- Symplectic Lattice Reduction and NTRU
- Explicit Hard Instances of the Shortest Vector Problem
Cited In (12)
- Post-quantum security on the Lai-Massey scheme
- Post quantum cryptography from mutant prime knots
- Title not available (Why is that?)
- Lattice Klepto -- turning post-quantum crypto against itself
- Unconditionally secure quantum signatures
- Title not available (Why is that?)
- Post-quantum EPID signatures from symmetric primitives
- Strongly unforgeable ring signature scheme from lattices in the standard model
- The convergence of slide-type reductions
- A Compact Digital Signature Scheme Based on the Module-LWR Problem
- An Efficient Post-Quantum One-Time Signature Scheme
- Lattice-based Cryptography
Uses Software
This page was built for publication: Post-quantum cryptography: lattice signatures
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390954)
