Post-quantum cryptography: lattice signatures
From MaRDI portal
(Redirected from Publication:2390954)
Recommendations
- Post-quantum secure hybrid signcryption from lattice assumption
- Post-quantum cryptography: lattice identification schemes
- Post-quantum cryptography: Code-based signatures
- Post quantum cryptography
- 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
- scientific article; zbMATH DE number 1722680 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1088230 (Why is no real title available?)
- scientific article; zbMATH DE number 1962159 (Why is no real title available?)
- scientific article; zbMATH DE number 2081055 (Why is no real title available?)
- scientific article; zbMATH DE number 1852141 (Why is no real title available?)
- scientific article; zbMATH DE number 2120513 (Why is no real title available?)
- scientific article; zbMATH DE number 1405637 (Why is no real title available?)
- scientific article; zbMATH DE number 1418301 (Why is no real title available?)
- scientific article; zbMATH DE number 1445397 (Why is no real title available?)
- Advances in Cryptology - EUROCRYPT 2004
- Approximating \(SVP_{\infty}\) to within almost-polynomial factors is NP-hard
- Asymptotically Efficient Lattice-Based Digital Signatures
- Explicit Hard Instances of the Shortest Vector Problem
- Factoring polynomials with rational coefficients
- Generalized Compact Knapsacks Are Collision Resistant
- Hardness of approximating the shortest vector problem in lattices
- Lattice problems and norm embeddings
- Merkle Signatures with Virtually Unlimited Signature Capacity
- Merkle Tree Traversal Revisited
- On Lovász' lattice reduction and the nearest lattice point problem
- On the complexity of lattice problems with polynomial approximation factors
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- SWIFFT: A Modest Proposal for FFT Hashing
- Symplectic Lattice Reduction and NTRU
- Theory of Cryptography
- Trapdoors for hard lattices and new cryptographic constructions
- Worst‐Case to Average‐Case Reductions Based on Gaussian Measures
Cited in
(26)- Formalization and analysis of the post-quantum signature scheme FALCON with Maude
- Lattice-based cryptography: a survey
- Patent landscape in the field of hash-based post-quantum signatures (invited paper)
- The convergence of slide-type reductions
- A selection of recent lattice-based signature and encryption schemes
- Security comparisons and performance analyses of post-quantum signature algorithms
- A survey on lattice-based cryptography
- scientific article; zbMATH DE number 7259165 (Why is no real title available?)
- Post-quantum cryptography: state of the art
- A Compact Digital Signature Scheme Based on the Module-LWR Problem
- Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
- Post-quantum cryptography: lattice identification schemes
- Lattice-based Cryptography
- Post-quantum EPID signatures from symmetric primitives
- Post quantum cryptography from mutant prime knots
- Variant of Niederreiter-based signature scheme for blockchain technology
- scientific article; zbMATH DE number 7274000 (Why is no real title available?)
- Post-quantum security on the Lai-Massey scheme
- Lattice-based linearly homomorphic signature scheme over binary field
- Strongly unforgeable ring signature scheme from lattices in the standard model
- Lattice Klepto -- turning post-quantum crypto against itself
- Post-quantum cryptography: Code-based signatures
- Unconditionally secure quantum signatures
- An efficient post-quantum one-time signature scheme
- Quantum-assisted QD-CFS signatures
- SPHINCS: practical stateless hash-based signatures
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)
