RUS  ENG
Full version
JOURNALS // Zapiski Nauchnykh Seminarov POMI // Archive
Zap. Nauchn. Sem. POMI, 2012 Volume 402, Pages 40–44 (Mi znsl5236)
Lower bounds for the number of keys in Zakrevskij cipher

D. S. Ananichev, D. D. Dublennykh

Department of Mathematics and Mechanics, Ural State University, Ekaterinburg, Russia

Abstract: We present a new lower bound for the number of pairwise non-equivalent invertible Mealy machines with strongly connected underlying digraphs.

Key words and phrases: Mealy machine, Zakrevskij cipher, finite automata, cryptoautomata.

UDC: 519.175.3

Received: 02.07.2012

Language: English


 English version: Journal of Mathematical Sciences (New York), 2013, 192:3, 279–281

Bibliographic databases:

© Steklov Math. Inst. of RAS, 2024