The 19 references in paper P. Klyucharev G., П. Ключарёв Г. (2016) “Об устойчивости обобщенных клеточных автоматов к некоторым типам коллизий // On Collision Resistance of Generalized Cellular Automata” / spz:neicon:technomag:y:2014:i:9:p:194-202

1
Kliucharev P.G. Block ciphers based on generalized cellular automata.Nauka i obrazovanie MGTU im. N.E. Baumana = Science and Education of the Bauman MSTU, 2012, no. 12, pp. 361{374. DOI:10.7463/0113.0517543(in Russian).
(check this in PDF content)
2
Kliucharev P.G. On cryptographic properties of generalized cellular automation.Nauka i obrazovanie MGTU im. N.E. Baumana = Science and Education of the Bauman MSTU, 2012, no. 3. Available at:http://technomag.bmstu.ru/doc/358973.html, accessed 01.08.2014. (in Russian).
(check this in PDF content)
3
Kliucharev P.G. Construction of pseudo-random functions based on generalized cellular automata.Nauka i obrazovanie MGTU im. N.E. Baumana = Science and Education of the Bauman MSTU, 2012, no. 10, pp. 263{274. DOI:10.7463/1112.0496381(in Russian).
(check this in PDF content)
4
Kliucharev P.G. Cryptographic hash functions based on generalized cellular automata.Nauka i obrazovanie MGTU im. N.E. Baumana = Science and Education of the Bauman MSTU, 2013, no. 1, pp. 161{172. DOI:10.7463/0113.0534640(in Russian).
(check this in PDF content)
5
Panasenko S.P.Algoritmy shifrovaniia. Spetsial'nyi spravochnik[Reference book of encryption algorithms]. St. Petersburg, BKhV-Peterburg Publ., 2009. 576 p. (in Russian).
(check this in PDF content)
6
Chichvarin N.V. The Choice of Methods of Protection Design Documents from Unauthorized Access.Informatsionnye tekhnologii, 2014, no. 5, pp. 41{48. (in Russian).
(check this in PDF content)
7
Buchmann J.Introduction to Cryptography. Springer New York, 2004. 338 p. (Ser.Undergraduate Texts in Mathematics). DOI:10.1007/978-1-4419-9003-7
(check this in PDF content)
8
Davidoff G., Sarnak P., Valette A.Elementary number theory, group theory and Ramanujan graphs. Cambridge, Cambridge University Press, 2003. 154 p. (London Mathematical Society Student Texts; vol. 55).
(check this in PDF content)
9
Hoffstein J., Pipher J., Silverman J.An Introduction to Mathematical Cryptography. Springer New York, 2008. (Ser.Undergraduate Texts in Mathematics). DOI:10.1007/ 978-0-387-77993-5
(check this in PDF content)
10
Hoory S., Linial N., Wigderson A. Expander graphs and their applications.Bulletin of the American Mathematical Society, 2006, vol. 43, no. 4, pp. 439{562.
(check this in PDF content)
11
Hopcroft J.E., Karp R.M. An n^5/2 algorithm for maximum matchings in bipartite graphs. SIAM Journal on Computing, 1973, vol. 2, no. 4, pp. 225{231.
(check this in PDF content)
12
Lubotzky A., Phillips R., Sarnak P. Ramanujan graphs.Combinatorica, 1988, vol. 8, no. 3, pp. 261{277. DOI:10.1007/BF02126799
(check this in PDF content)
13
Menezes A., van Oorschot P., Vanstone S.Handbook of Applied Cryptography. Taylor & Francis, 1996. 816 p.
(check this in PDF content)
14
Paar C., Pelzl J.Understanding Cryptography: A Textbook for Students and Practitioners. Springer Berlin Heidelberg, 2010. 372 p. DOI:10.1007/978-3-642-04101-3
(check this in PDF content)
15
Panasenko S., Smagin S. Lightweight cryptography: Underlying principles and approaches. International Journal of Computer Theory and Engineering, 2011, vol. 3, no. 4, pp. 516{520. DOI:10.7763/IJCTE.2011.V3.360
(check this in PDF content)
16
Petersen J. Die theorie der regularen graphs.Acta Mathematica, 1891, vol. 15, no. 1, pp. 193{ 220. DOI:10.1007/BF02392606
(check this in PDF content)
17
Plummer M.D. Graph factors and factorization: 1985{2003: a survey.Discrete Mathematics, 2007, vol. 307, no. 7, pp. 791{821. DOI:10.1016/j.disc.2005.11.059
(check this in PDF content)
18
Preneel B. Stream ciphers and lightweight cryptography.Proc. of the 2nd International Workshop on ZUC Algorithm and Related Topics. Beijing, China, 2011.
(check this in PDF content)
19
Baebler F.Uber die zerlegung regularer streckenkomplexe ungerader ordnung.Commentarii Mathematici Helvetici, 1937, vol. 10, no. 1, pp. 275{287.
(check this in PDF content)