Classical and Quantum Algorithms for Exponential Congruences

DOI10.1007/978-3-540-89304-2_1zbMath1162.68829arXiv0804.1109OpenAlexW1753859231MaRDI QIDQ5503292

Wim van Dam, Igor E. Shparlinski

Publication date: 13 January 2009

Published in: Theory of Quantum Computation, Communication, and Cryptography (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Symbolic computation and algebraic computation (68W30) Quantum computation (81P68)

Related Items (5)

Riemannian quantum circuit ⋮ ON FINDING SOLUTIONS TO EXPONENTIAL CONGRUENCES ⋮ Quantum counterfeit coin problems ⋮ On zeros of exponential polynomials and quantum algorithms ⋮ A novel fault-tolerant quantum divider and its simulation

Cites Work

• Estimates of character sums with exponential function
• An Upper Bound for the Sum ∑ a + H n = a + 1 f(n) for a Certain Class of Functions f
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer
• Information Security and Privacy
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Classical and Quantum Algorithms for Exponential Congruences