Quantum Differential Cryptanalysis
This work addresses the need for faster cryptanalysis in cryptography, offering a significant speedup for ciphers vulnerable to classical differential attacks, though it is incremental as it builds on existing quantum algorithms.
The authors tackled the problem of speeding up differential cryptanalysis by proposing a quantum version that achieves a quadratic speedup over classical methods, demonstrated through a quantum circuit implementation.
In this paper, we propose a quantum version of the differential cryptanalysis which offers a quadratic speedup over the existing classical one and show the quantum circuit implementing it. The quantum differential cryptanalysis is based on the quantum minimum/maximum-finding algorithm, where the values to be compared and filtered are obtained by calling the quantum counting algorithm. Any cipher which is vulnerable to the classical differential cryptanalysis based on counting procedures can be cracked more quickly under this quantum differential attack.