An efficient quantum factoring algorithm
From MaRDI portal
Cites work
- Extending Regev's factoring algorithm to compute discrete logarithms
- Finding short lattice vectors within Mordell's inequality
- scientific article; zbMATH DE number 1617936 (Why is no real title available?)
- Integer multiplication in time \(O(n\log n)\)
- Lattices and codes. A course partially based on lectures by Friedrich Hirzebruch
- New bounds in some transference theorems in the geometry of numbers
- On lattices, learning with errors, random linear codes, and cryptography
- On post-processing in the quantum algorithm for computing short discrete logarithms
- On the Evaluation of Powers and Monomials
- On the lattice distortion problem
- Polynomial time bounded distance decoding near Minkowski's bound in discrete logarithm lattices
- Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
- Quantum algorithms for computing short discrete logarithms and factoring RSA integers
- Space-efficient and noise-robust quantum factoring
- The expected number of random elements to generate a finite Abelian group
Cited in
(8)- Lion: a new ring signature construction from lattice gadget
- Space-efficient and noise-robust quantum factoring
- Unconditional correctness of recent quantum algorithms for factoring and computing discrete logarithms
- Extending Regev's quantum algorithm to elliptic curves
- An improvement of the congruence solver of lattice isomorphism problem over totally real number fields and applications
- Reducing the number of qubits in quantum discrete logarithms on elliptic curves
- Parallel spooky pebbling makes Regev factoring more practical
- Zero-knowledge proofs of quantumness
This page was built for publication: An efficient quantum factoring algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6854556)
