On the concept of a $\varepsilon$-perfect cipher
Prikladnaâ diskretnaâ matematika, no. 3 (2016), pp. 45-52
Cet article a éte moissonné depuis la source Math-Net.Ru
The generalizations of the perfect cipher concept are discussed. A cipher is called $\varepsilon$-perfect if the maximum absolute value of the difference between the posterior and prior probabilities of a plaintext does not exceed $\varepsilon$. Two constructions of $\varepsilon$-perfect ciphers for a multitude of plaintexts with a minor limitation of their frequency characteristics are studied. The notion of $\varepsilon$-perfect cipher is one of the possible approximations to the notion of a perfect cipher. For studied constructions of ciphers, it is shown that, in comparison with the other such approximations, $\varepsilon$-perfectness and its analogues have much better proximity to perfectness.
Keywords:
perfect cipher, $\varepsilon$-perfect cipher.
@article{PDM_2016_3_a2,
author = {A. Yu. Zubov},
title = {On the concept of a~$\varepsilon$-perfect cipher},
journal = {Prikladna\^a diskretna\^a matematika},
pages = {45--52},
year = {2016},
number = {3},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDM_2016_3_a2/}
}
A. Yu. Zubov. On the concept of a $\varepsilon$-perfect cipher. Prikladnaâ diskretnaâ matematika, no. 3 (2016), pp. 45-52. http://geodesic.mathdoc.fr/item/PDM_2016_3_a2/
[1] Zubov A. Yu., “Almost perfect ciphers and authentication codes”, Prikladnaya Diskretnaya Matematika, 2011, no. 4(14), 28–33
[2] Zubov A. Yu., Cryptographic Methods of Information Security. Perfect Ciphers, Gelios ARV Publ., Moscow, 2005
[3] Iwamoto M., Ohta K., Security Notions for Information Theoretically Secure Encryptions, 4 Jan. 2012, 6 pp., arXiv: 1106.1731v2[cs.CR]