A low-resource quantum factoring algorithm
From MaRDI portal
Publication:1673618
DOI10.1007/978-3-319-59879-6_19zbMath1437.94048OpenAlexW2621050557MaRDI QIDQ1673618
Daniel J. Bernstein, Michele Mosca, Jean-François Biasse
Publication date: 12 September 2018
Full work available at URL: https://doi.org/10.1007/978-3-319-59879-6_19
Cryptography (94A60) Factorization (11Y05) Quantum algorithms and complexity in the theory of computing (68Q12)
Related Items (3)
Optimized quantum implementation of AES ⋮ Approximate short vectors in ideal lattices of \(\mathbb{Q}(\zeta_{p^e})\) with precomputation of \({\mathrm {Cl}}(\mathcal{O}_K)\) ⋮ Computer algebra tales on Goppa codes and McEliece cryptography
This page was built for publication: A low-resource quantum factoring algorithm
