Zakrevskij's cipher based on reconfigurable FSM

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.