Geodesic
Zakrevskij's cipher based on reconfigurable FSM
Prikladnaâ diskretnaâ matematika, no. 3 (2010), pp. 69-76.

Voir la notice de l'article provenant de la source Math-Net.Ru

The paper presents Zakrevskij's cipher realization based on reconfigurable finite state machine (FSM). The reconfigurable FSM generates a ciphering automaton according to a key. The ciphersystem can resist the brute-force attack and has key length which is acceptable in practice. The ciphersystem is shown can not resist the chosen-plaintext attack when a cryptanalyst knows the initial state of the ciphering automaton and has many copies of the cipher machine.
Keywords: Zakrevskij's cipher, automata ciphersystem, invertible finite automata, automata with bijective output function, multiple unconditional experiments with automata.
Mots-clés : reconfigurable finite state machine 
@article{PDM_2010_3_a5,
     author = {V. N. Trenkaev},
     title = {Zakrevskij's cipher based on reconfigurable {FSM}},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {69--76},
     publisher = {mathdoc},
     number = {3},
     year = {2010},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2010_3_a5/}
}
TY  - JOUR
AU  - V. N. Trenkaev
TI  - Zakrevskij's cipher based on reconfigurable FSM
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2010
SP  - 69
EP  - 76
IS  - 3
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2010_3_a5/
LA  - ru
ID  - PDM_2010_3_a5
ER  - 
%0 Journal Article
%A V. N. Trenkaev
%T Zakrevskij's cipher based on reconfigurable FSM
%J Prikladnaâ diskretnaâ matematika
%D 2010
%P 69-76
%N 3
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2010_3_a5/
%G ru
%F PDM_2010_3_a5
V. N. Trenkaev. Zakrevskij's cipher based on reconfigurable FSM. Prikladnaâ diskretnaâ matematika, no. 3 (2010), pp. 69-76. http://geodesic.mathdoc.fr/item/PDM_2010_3_a5/

[1] Agibalov G. P., “Konechnye avtomaty v kriptografii”, Prikladnaya diskretnaya matematika, 2009, Prilozhenie No 2, 43–73

[2] Babash A. V., Shankin G. N., Kriptografiya., SOLON-R, M., 2002, 512 pp.

[3] Zakrevskii A. D., “Metod avtomaticheskoi shifratsii soobschenii”, Prikladnaya diskretnaya matematika, 2009, no. 2, 127–137

[4] Moldovyan A. A., Moldovyan N. A., Sovetov B. Ya., Kriptografiya, Izd-vo “Lan”, SPb., 2001, 224 pp. | MR

[5] Shidlovskii S. V., Avtomaticheskoe upravlenie. Perestraivaemye struktury, Tomskii gosudarstvennyi universitet, Tomsk, 2006, 288 pp.

[6] Glaser J., Damm M., Haase J., Grimm Ch., “A dedicated reconfigurable architecture for finite state machines”, LNCS, 5992, 2010, 122–133

[7] Sklyarov V., “Reconfigurable models of finite state machines and their implementation in FPGAs”, J. Systems Architecture, 47 (2002), 1047–1064

[8] Gill A., Vvedenie v teoriyu konechnykh avtomatov, Nauka, M., 1966, 272 pp. | MR | Zbl