Reconfigurable finite state machines based on substitutions | Applied Discrete Mathematics. Supplement. 2019. № 12. DOI: 10.17223/2226308X/12/53

Reconfigurable finite state machines based on substitutions

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.

Download file

Counter downloads: 124

Keywords

перестраиваемый автомат, обратимый автомат, автоматный шифр, reconfigurable finite state machine, invertible finite state machine, automata cipher

Authors

Name	Organization	E-mail
Trenkaev V. N.	Tomsk State University	tvnik@sibmail.com

Всего: 1

References

Das N. and Priya P. A. FPGA implementation of reconfigurable Finite State Machine with input multiplexing architecture using Hungarian method // Intern. J. Reconfigurable Computing. 2018. Article ID 6831901. 15 p.

Teich J. and Koster M. (Self-)reconfigurable Finite State Machines: Theory and Implementation // Proc. DATE'02. 2002. P. 559-566.

Агибалов Г. П. Конечные автоматы в криптографии // Прикладная дискретная математика. Приложение. 2009. №2. С. 43-73.

Тренькаев В. Н. Реализация шифра Закревского на основе перестраиваемого автомата // Прикладная дискретная математика. 2010. №3. С. 69-77.