Geodesic
Lower bounds for the number of keys in Zakrevskij cipher
Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part IV, Tome 402 (2012), pp. 40-44 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice du chapitre de livre

We present a new lower bound for the number of pairwise non-equivalent invertible Mealy machines with strongly connected underlying digraphs. 
@article{ZNSL_2012_402_a2,
     author = {D. S. Ananichev and D. D. Dublennykh},
     title = {Lower bounds for the number of keys in {Zakrevskij} cipher},
     journal = {Zapiski Nauchnykh Seminarov POMI},
     pages = {40--44},
     year = {2012},
     volume = {402},
     language = {en},
     url = {http://geodesic.mathdoc.fr/item/ZNSL_2012_402_a2/}
}
TY  - JOUR
AU  - D. S. Ananichev
AU  - D. D. Dublennykh
TI  - Lower bounds for the number of keys in Zakrevskij cipher
JO  - Zapiski Nauchnykh Seminarov POMI
PY  - 2012
SP  - 40
EP  - 44
VL  - 402
UR  - http://geodesic.mathdoc.fr/item/ZNSL_2012_402_a2/
LA  - en
ID  - ZNSL_2012_402_a2
ER  - 
%0 Journal Article
%A D. S. Ananichev
%A D. D. Dublennykh
%T Lower bounds for the number of keys in Zakrevskij cipher
%J Zapiski Nauchnykh Seminarov POMI
%D 2012
%P 40-44
%V 402
%U http://geodesic.mathdoc.fr/item/ZNSL_2012_402_a2/
%G en
%F ZNSL_2012_402_a2
D. S. Ananichev; D. D. Dublennykh. Lower bounds for the number of keys in Zakrevskij cipher. Zapiski Nauchnykh Seminarov POMI, Combinatorics and graph theory. Part IV, Tome 402 (2012), pp. 40-44. http://geodesic.mathdoc.fr/item/ZNSL_2012_402_a2/

[1] G. P. Agibalov, “Konechnye avtomaty v kriptografii”, Prikladnaya diskretnaya matematika, 2009, no. 2, 43–73

[2] A. D. Zakrevskii, “Metod avtomaticheskoi shifratsii soobschenii”, Prikladnaya diskretnaya matematika, 2009, no. 2, 127–137