Quantum LLL with an application to Mersenne number cryptosystems
From MaRDI portal
Publication:2284101
Recommendations
- Algorithms and Computation
- Solving some cryptanalytic problems for lattice-based cryptosystems with quantum annealing method
- Attacks on the AJPS Mersenne based cryptosystem
- Solving the shortest vector problem in lattices faster using quantum search
- Finding shortest lattice vectors faster using quantum search
Cited in
(5)- Attacks on the AJPS Mersenne based cryptosystem
- A quantum Goldreich-Levin theorem with cryptographic applications
- Algorithms and Computation
- Improved algorithms for finding fixed-degree isogenies between supersingular elliptic curves
- Quantumly computing S-unit groups in quantified polynomial time and space
This page was built for publication: Quantum LLL with an application to Mersenne number cryptosystems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2284101)