1. Panyukova, T.A., Kombinatorika i teoriya grafov (Combinatorics and Graph Theory), Moscow: Lenand, 2014.
2. Yablonskii, S.V., Vvedenie v diskretnuyu matematiku (Introduction to Discrete Mathematics), Moscow: Vysshaya Shkola, 2003.
3. Zaripova, E.R., Kokotchikova, M.G., and Sevast’ya-nov, L.A., Diskretnaya matematika. Chast’ II. Matematicheskaya logika (Discrete Mathematics. Part II. Mathematical Logic), Moscow: RUDN, 2013.
4. Zuev, Yu.A., Po okeanu diskretnoi matematiki. Ot perechislitel’noi kombinatoriki do sovremennoi kriptografii. T. 2. Grafy. Algoritmy. Kody, blok-skhemy, shifry (Across the Ocean of Discrete Mathematics. From Enumeration Combinatorics to Modern Cryptography, Vol. 2: Counts. Algorithms Codes, Flowcharts, Ciphers), Moscow: Librokom, 2012.
5. Gordeev, E.N., Leont’ev, V.K., and Medvedev, N.V., The properties of Boolean polynomials that are relevant to cryptosystems, Vopr. Kiberbezopasn., 2017, no. 3 (21), pp. 63–69.