Applied Automata Theory

Zakrevskij's cipher FPGA implementation based on the formula-defined reconfigurable FSM

D. S. Kovalev^ab, V. N. Trenkaev<sup>a

a</sup> Tomsk State University, Tomsk
^b JSC "Information Satelline Systems Reshetnev Company", Zheleznogorsk

Abstract: A new version for FPGA implementation of Zakrevskij's cipher is presented. Unlike the previous version, here a configurable FSM is specified not by tables but by some analytical expression using the operation of modulo addition. In the paper, some numerical characteristics (throughput and area) of FPGA implementations are given for both these versions. In partucular, it is shown that the throughput of PLA for the new version is up to 17–36 % higher than for the previous one.

Keywords: Zakrevskij's cipher, reconfigurable FSM, table-specified FSM, formula-specified FSM, throughput, area, FPGA, VHDL.

UDC: 004.056.55