Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
From MaRDI portal
Recommendations
Cites work
- A decade of lattice cryptography
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- A hierarchy of polynomial time lattice basis reduction algorithms
- A method for obtaining digital signatures and public-key cryptosystems
- A more efficient algorithm for lattice basis reduction
- A quantum distinguisher for 7/8-round SMS4 block cipher
- A sieve algorithm based on overlattices
- A sieve algorithm for the shortest lattice vector problem
- Advanced lattice sieving on GPUs, with tensor cores
- Algorithms for the shortest and closest lattice vector problems
- An Introduction to Mathematical Cryptography
- Approximating shortest lattice vectors is not harder than approximating closest lattice vectors
- Beyond locality-sensitive hashing
- BKZ 2.0: Better lattice security estimates
- Estimating quantum speedups for lattice sieves
- Factoring polynomials with rational coefficients
- Faster exponential time algorithms for the shortest vector problem
- Faster sieving for shortest lattice vectors using spherical locality-sensitive hashing
- Finding closest lattice vectors using approximate Voronoi cells
- Finding shortest lattice vectors faster using quantum search
- Gauss sieve algorithm on GPUs
- Grover meets Simon -- quantumly attacking the FX-construction
- scientific article; zbMATH DE number 3865148 (Why is no real title available?)
- scientific article; zbMATH DE number 5320241 (Why is no real title available?)
- scientific article; zbMATH DE number 5485482 (Why is no real title available?)
- scientific article; zbMATH DE number 5764780 (Why is no real title available?)
- scientific article; zbMATH DE number 1186948 (Why is no real title available?)
- scientific article; zbMATH DE number 177043 (Why is no real title available?)
- scientific article; zbMATH DE number 1256724 (Why is no real title available?)
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 1302849 (Why is no real title available?)
- scientific article; zbMATH DE number 697835 (Why is no real title available?)
- scientific article; zbMATH DE number 1088230 (Why is no real title available?)
- scientific article; zbMATH DE number 1559544 (Why is no real title available?)
- scientific article; zbMATH DE number 1775383 (Why is no real title available?)
- scientific article; zbMATH DE number 1418301 (Why is no real title available?)
- Improved algorithms for the approximate k-List problem in Euclidean norm
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- Introduction to post-quantum cryptography
- Lattice basis reduction: Improved practical algorithms and solving subset sum problems
- Lattice enumeration using extreme pruning
- Lattice problems in NP ∩ coNP
- Learning with rounding, revisited. New reduction, properties and applications
- New directions in nearest neighbor searching with applications to lattice sieving
- On lattices, learning with errors, random linear codes, and cryptography
- On the Power of Quantum Computation
- Post-Quantum Security of the Fujisaki-Okamoto and OAEP Transforms
- Progressive lattice sieving
- Pseudorandom functions and lattices
- Quantum algorithms for the approximate \(k\)-list problem and their application to lattice sieving
- Quantum attacks on some Feistel block ciphers
- Quantum Complexity Theory
- Quantum computation and quantum information. 10th anniversary edition
- Quantum cryptanalysis of hash and claw-free functions
- Quantum cryptography: public key distribution and coin tossing
- Quantum differential cryptanalysis
- Quantum theory, the Church–Turing principle and the universal quantum computer
- Quantum zero correlation linear cryptanalysis
- Rapid solution of problems by quantum computation
- Reconstructing Truncated Integer Variables Satisfying Linear Congruences
- Secure integration of asymmetric and symmetric encryption schemes
- Secure integration of asymmetric and symmetric encryption schemes
- Sieve algorithms for the shortest vector problem are practical
- Sieving for Shortest Vectors in Lattices Using Angular Locality-Sensitive Hashing
- Solving the shortest vector problem in 2ⁿ time using discrete Gaussian sampling (extended abstract)
- Speed-ups and time-memory trade-offs for tuple lattice sieving
- The shortest vector in a lattice is hard to approximate to within some constant
- Tuple lattice sieving
- Using Bernstein-Vazirani algorithm to attack block ciphers
Cited in
(2)
This page was built for publication: Post-quantum cryptosystems: open problems and solutions. Lattice-based cryptosystems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6644081)
