|
This article is cited in 1 scientific paper (total in 1 paper)
QUANTUM INFORMATION SCIENCE
Quantum algorithm for the invariant estimate of the closeness of classical ciphers to the one-time pad
S. N. Molotkovab a Academy of Cryptography of the Russian Federation, Moscow, 121552 Russia
b Osipyan Institute of Solid State Physics, Russian Academy of Sciences,
Chernogolovka, Moscow region, 142432 Russia
Abstract:
An invariant measure of the closeness of a block cipher to the perfect (ideal) cipher of the one-time pad has been proposed. The measure is the same for any implementation of the one-time pad. A quantum algorithm based on the determination of the eigenvalue (phase) of the quantum state has been proposed to estimate the closeness of the block cipher to ideal in terms of the proposed measure with high probability and accuracy.
Received: 05.10.2022 Revised: 10.11.2022 Accepted: 17.11.2022
Citation:
S. N. Molotkov, “Quantum algorithm for the invariant estimate of the closeness of classical ciphers to the one-time pad”, Pis'ma v Zh. Èksper. Teoret. Fiz., 117:1 (2023), 80–88; JETP Letters, 117:1 (2023), 75–82
Linking options:
https://www.mathnet.ru/eng/jetpl6841 https://www.mathnet.ru/eng/jetpl/v117/i1/p80
|
|