On the Design and Optimization of a Quantum Polynomial-Time Attack on Elliptic Curve Cryptography

DOI10.1007/978-3-540-89304-2_9zbMath1162.94346arXiv0710.1093OpenAlexW1512771024MaRDI QIDQ5503300

Dmitri Maslov, Jimson Mathew, Donny Cheung, Dhiraj K. Pradhan

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/0710.1093

Mathematics Subject Classification ID

Quantum computation (81P68) Cryptography (94A60)

Related Items

Quantum reversible circuit of AES-128 ⋮ Optimized reversible quantum circuits for \(\mathbb{F}_{2^8}\) multiplication ⋮ Quantum reversible circuits for \(\mathrm{GF}(2^8)\) multiplication based on composite field arithmetic operations ⋮ Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves ⋮ Quantum circuits for \(\mathbb F_{2^n}\)-multiplication with subquadratic gate count

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast quantum modular exponentiation
• A Theory of Galois Switching Functions
• Quantum algorithms and the Fourier transform
• Reducing elliptic curve logarithms to logarithms in a finite field
• Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer