522 citations · 2.3k across the 64 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
quant-ph2012★ 2 cited
Efficient quantum circuits for binary elliptic curve arithmetic: reducing T-gate complexity
Brittanney Amento, Rainer Steinwandt, Martin Roetteler
Elliptic curves over finite fields GF(2^n) play a prominent role in modern cryptography. Published quantum algorithms dealing with such curves build on a short Weierstrass form in…
quant-ph2012
Quantum binary field inversion: improved circuit depth via choice of basis representation
Brittanney Amento, Martin Roetteler, Rainer Steinwandt
Finite fields of the form GF(2^m) play an important role in coding theory and cryptography. We show that the choice of how to represent the elements of these fields can have a sign…