Quantum Information Processing

, Volume 14, Issue 7, pp 2373–2386

Quantum circuits for \({\mathbb {F}}_{2^{n}}\)-multiplication with subquadratic gate count


DOI: 10.1007/s11128-015-0993-1

Cite this article as:
Kepley, S. & Steinwandt, R. Quantum Inf Process (2015) 14: 2373. doi:10.1007/s11128-015-0993-1


One of the most cost-critical operations when applying Shor’s algorithm to binary elliptic curves is the underlying field arithmetic. Here, we consider binary fields \({\mathbb {F}}_{2^n}\) in polynomial basis representation, targeting especially field sizes as used in elliptic curve cryptography. Building on Karatsuba’s algorithm, our software implementation automatically synthesizes a multiplication circuit with the number of \(T\)-gates being bounded by \(7\cdot n^{\log _2(3)}\) for any given reduction polynomial of degree \(n=2^N\). If an irreducible trinomial of degree \(n\) exists, then a multiplication circuit with a total gate count of \({\mathcal {O}}(n^{\log _2(3)})\) is available.


Quantum circuits Finite field arithmetic Cryptography Circuit synthesis 

Copyright information

© Springer Science+Business Media New York 2015

Authors and Affiliations

  1. 1.Florida Atlantic UniversityBoca RatonUSA

Personalised recommendations