Extensions of information protocols based on mappings of finite sets
Diskretnaya Matematika, Tome 17 (2005) no. 4, pp. 18-28
We introduce the concepts of an information protocol on a finite set, its extension and expansion. A series of examples of manipulations of an adversary with information protocols are given. We propose a system of protection of information protocols which admits an expansion into a large number of extensions and calculate some probabilistic characteristics of its quality.
@article{DM_2005_17_4_a2,
author = {A. F. Ronzhin},
title = {Extensions of information protocols based on mappings of finite sets},
journal = {Diskretnaya Matematika},
pages = {18--28},
year = {2005},
volume = {17},
number = {4},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/DM_2005_17_4_a2/}
}
A. F. Ronzhin. Extensions of information protocols based on mappings of finite sets. Diskretnaya Matematika, Tome 17 (2005) no. 4, pp. 18-28. http://geodesic.mathdoc.fr/item/DM_2005_17_4_a2/
[1] Shennon K., Raboty po teorii informatsii i kibernetike, IL, Moskva, 1963
[2] Knyazev A. V., Ronzhin A. F., “O prosteishikh makhinatsiyakh v nekotorykh sistemakh notarialnogo zaverivaniya tsifrovykh podpisei”, Obozrenie prikladnoi i promyshlennoi matematiki, 10:2 (2003), 481–482
[3] Lampson B. W., “A note of the confinement problem”, Commun. ACM, 16:10 (1973), 613–615 | DOI
[4] Schneier B., Applied cryptography: protocols, algorithms and source code in C, Wiley, New York, 1996 | Zbl
[5] Grusho A. A., Timonina E. E., “Otsenka vremeni, trebuemogo dlya organizatsii skrytogo kanala”, Diskretnaya matematika, 15:2 (2003), 40–46 | MR | Zbl