On post-processing in the quantum algorithm for computing short discrete logarithms

DOI10.1007/s10623-020-00783-2zbMath1476.68103OpenAlexW3047966400MaRDI QIDQ2205884

Martin Ekerå

Publication date: 21 October 2020

Published in: Designs, Codes and Cryptography (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10623-020-00783-2

zbMATH Keywords

RSAfactoringdiscrete logarithmsShor's algorithms

Mathematics Subject Classification ID

Quantum computation (81P68) Cryptography (94A60) Quantum algorithms and complexity in the theory of computing (68Q12)

Related Items (2)

On completely factoring any integer efficiently in a single run of an order-finding algorithm ⋮ Quantum algorithms for computing general discrete logarithms and orders with tradeoffs

Cites Work

• Unnamed Item
• Unnamed Item
• On Lovász' lattice reduction and the nearest lattice point problem
• A hierarchy of polynomial time lattice basis reduction algorithms
• Factoring polynomials with rational coefficients
• Lattice basis reduction: Improved practical algorithms and solving subset sum problems
• Quantum algorithms for computing short discrete logarithms and factoring RSA integers
• Zur additiven Zahlentheorie. II
• New directions in cryptography
• A method for obtaining digital signatures and public-key cryptosystems
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer

This page was built for publication: On post-processing in the quantum algorithm for computing short discrete logarithms