|
Quantum differential and linear cryptanalysis
D. V. Denisenko Bauman Moscow State Technical University (BMSTU), Russia
Abstract:
We study quantum versions of differential and linear cryptanalysis based on a combination of the quantum minimum/maximum search algorithm and the quantum counting algorithm. We obtain estimates of the complexity and the required resources for the quantum differential and quantum linear cryptanalysis of block ciphers. It is shown that the implementation of the quantum linear method requires smaller logical qubits than the implementation of the quantum differential method. It is noted that the acceleration of calculations due to “quantum parallelism” in the quantum differential and linear cryptanalysis based on a combination of Grover’s quantum algorithms and quantum counting algorithm is apparently absent.
Key words:
symmetric cryptography, differential and linear cryptanalysis, block ciphers, Grover's algorithm, quantum counting.
Received 22.XI.2020
Citation:
D. V. Denisenko, “Quantum differential and linear cryptanalysis”, Mat. Vopr. Kriptogr., 12:3 (2021), 67–88
Linking options:
https://www.mathnet.ru/eng/mvk376https://doi.org/10.4213/mvk376 https://www.mathnet.ru/eng/mvk/v12/i3/p67
|
Statistics & downloads: |
Abstract page: | 327 | Full-text PDF : | 108 | References: | 38 | First page: | 16 |
|