|
Zapiski Nauchnykh Seminarov 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.
Received: 02.07.2012
Citation:
D. S. Ananichev, D. D. Dublennykh, “Lower bounds for the number of keys in Zakrevskij cipher”, Combinatorics and graph theory. Part IV, RuFiDiM'11, Zap. Nauchn. Sem. POMI, 402, POMI, St. Petersburg, 2012, 40–44; J. Math. Sci. (N. Y.), 192:3 (2013), 279–281
Linking options:
https://www.mathnet.ru/eng/znsl5236 https://www.mathnet.ru/eng/znsl/v402/p40
|
Statistics & downloads: |
Abstract page: | 171 | Full-text PDF : | 60 | References: | 34 |
|