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
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/}
}
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/