Differential Cryptanalysis is among the most popular types of attacks used to analyze and find vulnerabilities in modern block ciphers. To conduct a differential attack, one must first find a high-probability differential of the block cipher.
Existing search methods involve either intimate knowledge of the specific cipher that is being attacked, or use of search algorithms whose runtime rises exponentially with the number of rounds over which the search is conducted.
We present a quantum-based search method for high probability iterative differentials whose runtime scales linearly in the number of rounds over which the search is conducted and is completely agnostic of the implementation details of the cipher.