Geodesic
Reconfigurable finite state machines based on substitutions
Prikladnaya Diskretnaya Matematika. Supplement, no. 12 (2019), pp. 192-193.

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

A structure of reconfigurable finite state machine (FSM) is proposed for using as a ciphering automata. The reconfigurable FSM consists of the following parts: basic substitutions, key substitutions, couple multiplexers and the state register. The input and output alphabets coincide with the set of states. All basic substitutions are different. The number of them equals the number of states. There are three modifiable (programmable) key substitutions. Reconfiguration or FSM consists in constructing the certain output and transition functions from substitutions. It is shown that any fixing of key substitutions produces strongly connected reduced and invertible FSM.
Mots-clés : reconfigurable finite state machine
Keywords: invertible finite state machine, automata cipher. 
@article{PDMA_2019_12_a52,
     author = {V. N. Trenkaev},
     title = {Reconfigurable finite state machines based on substitutions},
     journal = {Prikladnaya Diskretnaya Matematika. Supplement},
     pages = {192--193},
     publisher = {mathdoc},
     number = {12},
     year = {2019},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDMA_2019_12_a52/}
}
TY  - JOUR
AU  - V. N. Trenkaev
TI  - Reconfigurable finite state machines based on substitutions
JO  - Prikladnaya Diskretnaya Matematika. Supplement
PY  - 2019
SP  - 192
EP  - 193
IS  - 12
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDMA_2019_12_a52/
LA  - ru
ID  - PDMA_2019_12_a52
ER  - 
%0 Journal Article
%A V. N. Trenkaev
%T Reconfigurable finite state machines based on substitutions
%J Prikladnaya Diskretnaya Matematika. Supplement
%D 2019
%P 192-193
%N 12
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDMA_2019_12_a52/
%G ru
%F PDMA_2019_12_a52
V. N. Trenkaev. Reconfigurable finite state machines based on substitutions. Prikladnaya Diskretnaya Matematika. Supplement, no. 12 (2019), pp. 192-193. http://geodesic.mathdoc.fr/item/PDMA_2019_12_a52/

[1] Das N., Priya P. A., “FPGA implementation of reconfigurable Finite State Machine with input multiplexing architecture using Hungarian method”, Intern. J. Reconfigurable Computing, 2018, 6831901, 15 pp.

[2] Teich J., Koster M., “(Self-)reconfigurable Finite State Machines: Theory and Implementation”, Proc. DATE'02, 2002, 559–566

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

[4] Trenkaev V. N., “Realizatsiya shifra Zakrevskogo na osnove perestraivaemogo avtomata”, Prikladnaya diskretnaya matematika, 2010, no. 3, 69–77