Solving some cryptanalytic problems for lattice-based cryptosystems with quantum annealing method
From MaRDI portal
Recommendations
Cites work
- A deterministic single exponential time algorithm for most lattice problems based on Voronoi cell computations
- A method for obtaining digital signatures and public-key cryptosystems
- A public key cryptosystem and a signature scheme based on discrete logarithms
- A sieve algorithm for the shortest lattice vector problem
- scientific article; zbMATH DE number 1256737 (Why is no real title available?)
- scientific article; zbMATH DE number 3078637 (Why is no real title available?)
- Improved Methods for Calculating Vectors of Short Length in a Lattice, Including a Complexity Analysis
- On the computation of lattice vectors of minimal length, successive minima and reduced bases with applications
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Solving the shortest vector problem in lattices faster using quantum search
Cited in
(4)
This page was built for publication: Solving some cryptanalytic problems for lattice-based cryptosystems with quantum annealing method
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6051902)