The method for messages automatic encryption
Prikladnaâ diskretnaâ matematika, no. 2 (2009), pp. 127-137
Cet article a éte moissonné depuis la source Math-Net.Ru
This paper has been written in 1959. Here, it is published for the first time having in mind the historical accuracy. For encrypting messages, the author suggests to use finite state machines with output functions being bijective for any state.
@article{PDM_2009_2_a8,
author = {A. D. Zakrevskij},
title = {The method for messages automatic encryption},
journal = {Prikladna\^a diskretna\^a matematika},
pages = {127--137},
year = {2009},
number = {2},
language = {ru},
url = {http://geodesic.mathdoc.fr/item/PDM_2009_2_a8/}
}
A. D. Zakrevskij. The method for messages automatic encryption. Prikladnaâ diskretnaâ matematika, no. 2 (2009), pp. 127-137. http://geodesic.mathdoc.fr/item/PDM_2009_2_a8/
[1] Uiver U., “Perevod”, Mashinnyi perevod, Sbornik, IL, M., 1957
[2] Viner N., Kibernetika i obschestvo, IL, M., 1958
[3] Goldman S., Teoriya informatsii, IL, M., 1958
[4] Mur T., “Eksperimenty s posledovatelnostnymi avtomatami”, Avtomaty, Sbornik, IL, M., 1956
[5] Huffman D., “The synthesis of sequential switching circuits”, J. of the Franklin Inst., 257:3 (1954), 161–190 ; 4, 275–303 | DOI | MR | Zbl
[6] Trakhtenbrot B. A., “Sintez logicheskikh setei, operatory kotorykh opisany sredstvami ischisleniya odnomestnykh predikatov”, DAN SSSR, 118:4 (1958), 646–649 | Zbl
[7] Tseitlin M. L., “Matrichnyi metod sinteza elektronno-impulsnykh i releino-kontaktnykh (neprimitivnykh) skhem”, DAN SSSR, 117:6 (1957)