Cryptanalysis of LWE and SIS-based cryptosystems by using quantum annealing
From MaRDI portal
Cites work
- A decade of lattice cryptography
- BKZ 2.0: Better lattice security estimates
- Efficiently embedding QUBO problems on adiabatic quantum computers
- Factoring polynomials with rational coefficients
- Finding closest lattice vectors using approximate Voronoi cells
- scientific article; zbMATH DE number 2120513 (Why is no real title available?)
- Improved Analysis of Kannan’s Shortest Lattice Vector Algorithm
- On lattices, learning with errors, random linear codes, and cryptography
- On Lovász' lattice reduction and the nearest lattice point problem
- Parallel Gauss sieve algorithm: solving the SVP challenge over a 128-dimensional ideal lattice
- Quantum bridge analytics. I: A tutorial on formulating and using QUBO models
Cited in
(1)
This page was built for publication: Cryptanalysis of LWE and SIS-based cryptosystems by using quantum annealing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6899603)