Quantum algorithms for computing short discrete logarithms and factoring RSA integers

DOI10.1007/978-3-319-59879-6_20zbMath1437.94058arXiv1702.00249OpenAlexW2594615149MaRDI QIDQ1673620

Martin Ekerå, Johan T. Håstad

Publication date: 12 September 2018

Full work available at URL: https://arxiv.org/abs/1702.00249

zbMATH Keywords

RSAfactoringdiscrete logarithmsShor's algorithms

Mathematics Subject Classification ID

Algebraic coding theory; cryptography (number-theoretic aspects) (11T71) Cryptography (94A60) Factorization (11Y05) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (4)

Optimized quantum implementation of AES ⋮ On completely factoring any integer efficiently in a single run of an order-finding algorithm ⋮ On post-processing in the quantum algorithm for computing short discrete logarithms ⋮ Quantum algorithms for computing general discrete logarithms and orders with tradeoffs

This page was built for publication: Quantum algorithms for computing short discrete logarithms and factoring RSA integers