522 citations · 2.3k across the 64 of their papers we have counts for
Showing 2013 · quant-phShow all
3 papers · 2 filters
quant-ph2013
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…
quant-ph2013
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…
quant-ph2013★ 9 cited
Easy and hard functions for the Boolean hidden shift problem
Andrew M. Childs, Robin Kothari, Maris Ozols +1
We study the quantum query complexity of the Boolean hidden shift problem. Given oracle access to f(x+s) for a known Boolean function f, the task is to determine the n-bit string s…