|
Mathematical Methods of Cryptography
Quantum cryptanalysis of the KB-256 block cipher
M. V. Polyakovab, A. M. Korenevaac a "Security Code", Moscow
b Bauman Moscow State Technical University
c Financial University under the Government of the Russian Federation, Moscow
Abstract:
In this paper, we present the results of a quantum cryptanalysis of the KB-256 block cipher. First of all, we have obtained the complexity of quantum circuit implementation. This quantum circuit is a part of the oracle in Grover's algorithm. As a result, such an attack would require at least 1068 qubits and 188892 quantum gates. Also, in our analysis we have found that the cipher is resistant to attacks based on searching hidden linear structures.
Keywords:
quantum cryptanalysis, Grover's search, quantum circuits, hidden linear functions.
Citation:
M. V. Polyakov, A. M. Koreneva, “Quantum cryptanalysis of the KB-256 block cipher”, Prikl. Diskr. Mat. Suppl., 2024, no. 17, 112–115
Linking options:
https://www.mathnet.ru/eng/pdma655 https://www.mathnet.ru/eng/pdma/y2024/i17/p112
|
|