3 citations · 7 across the 8 of their papers we have counts for
8 papers
Applying Grover's algorithm to AES: quantum resource estimates
Markus Grassl, Brandon Langenberg, Martin Roetteler +1
We present quantum circuits to implement an exhaustive key search for the Advanced Encryption Standard (AES) and analyze the quantum resources required to carry out such an attack.…
Automatic synthesis of quantum circuits for point addition on ordinary binary elliptic curves
Parshuram Budhathoki, Rainer Steinwandt
Implementing the group arithmetic is a cost-critical task when designing quantum circuits for Shor's algorithm to solve the discrete logarithm problem. We introduce a tool for the…
A note on quantum related-key attacks
Martin Roetteler, Rainer Steinwandt
In a basic related-key attack against a block cipher, the adversary has access to encryptions under keys that differ from the target key by bit-flips. In this short note we show th…
A quantum circuit to find discrete logarithms on ordinary binary elliptic curves in depth O(log^2 n)
Martin Roetteler, Rainer Steinwandt
Improving over an earlier construction by Kaye and Zalka, Maslov et al. describe an implementation of Shor's algorithm which can solve the discrete logarithm problem on binary elli…
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…
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…