THEORETICAL FOUNDATIONS OF APPLIED DISCRETE MATHEMATICS
6–9
Grigoriev V. S. On mixing digraphs of nonlinear substitutions for binary shift registers // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 6–9. DOI: 10.17223/2226308X/11/1
10–12
Kyazhin S. N. Weight properties of primitive matrices // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 10–12. DOI: 10.17223/2226308X/11/2
12–14
Mezhennaya N. M. Testing of embedding with margin for discrete random sequences // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 12–14. DOI: 10.17223/2226308X/11/3
14–16
Oblaukhov A. K. Lower bound on the size of the largest metrically regular subset of the boolean cube // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 14–16. DOI: 10.17223/2226308X/11/4
16–20
Fomichev V. M. An improved formula for the universal estimation of digraph exponents // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 16–20. DOI: 10.17223/2226308X/11/5
21–23
Cherednik I. V. K-transitivity of a class of block transformations // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 21–23. DOI: 10.17223/2226308X/11/6
23–25
Cheremushkin A. V. An extension of gluskin - hoszu's and maly-shev's theorems to strong dependent n-ary operations // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 23–25. DOI: 10.17223/2226308X/11/7
25–30
Kirchner P. NFS factorization: new hopes // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 25–30. DOI: 10.17223/2226308X/11/8
30–33
Novoselov S. A. Counting points on hyperelliptic curves of type y2 = x2g+1 + axg+1 + bx // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 30–33. DOI: 10.17223/2226308X/11/9
DISCRETE FUNCTIONS
34–39
Bugrov A. D. Construction of a class of functions on finite fields using linear recurrences over galois rings // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 34–39. DOI: 10.17223/2226308X/11/10
39–41
Idrisova V.A. Vectorial 2-to-1 functions as subfunctions of apn permutations // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 39–41. DOI: 10.17223/2226308X/11/11
41–43
Kolomeec N. A. Properties of a bent function construction by a subspace of an arbitrary dimension // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 41–43. DOI: 10.17223/2226308X/11/12
44–46
Kutsenko A. V. On some properties of self-dual bent functions // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 44–46. DOI: 10.17223/2226308X/11/13
47–48
Miloserdov A. V. Constructions of vectorial boolean functions with maximum component algebraic immunity // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 47–48. DOI: 10.17223/2226308X/11/14
49–52
Pankov K. N. Improved asymptotic estimates for the number of correlation-immune boolean functions and mappings // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 49–52. DOI: 10.17223/2226308X/11/15
52–53
Shaporenko A. S. Connection between homogeneous bent functions and intersection graphs // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 52–53. DOI: 10.17223/2226308X/11/16
MATHEMATICAL METHODS OF CRYPTOGRAPHY
54–57
Agibalov G. P., Pankratova I. A. Public key cryptosystems on boolean functions // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 54–57. DOI: 10.17223/2226308X/11/17
57–61
Bobrov V.M., Komissarov S. M. On the properties of substitution blocks on the base of a modified additive generator and on the base of the block cipher nash // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 57–61. DOI: 10.17223/2226308X/11/18
62–65
Grebnev S. V., Lazareva E. V., Lebedev P. A., Nesterenko A. Yu., Semenov A.M. Implantation of russian key agreement protocols into // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 62–65. DOI: 10.17223/2226308X/11/19
65–68
Koreneva A.M. On mixing and nonlinear properties of modified additive generators // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 65–68. DOI: 10.17223/2226308X/11/20
68–71
Maksimov K. V., Khairulhn I.I. Experimental research of cryptographic properties of some lightweight algorithms // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 68–71. DOI: 10.17223/2226308X/11/21
72–73
Manylov E. A. NSUPresent cipher: resistance to linear and differential cryptanalysis // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 72–73. DOI: 10.17223/2226308X/11/22
74–76
Miftakhutdinova A. R. Analysis of the perfection and strong non-linearity of encryption algorithms // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 74–76. DOI: 10.17223/2226308X/11/23
76–79
Otpuschennikov I. V., Semenov A. A., Zaikin O. S. Propositional encoding of direct and inverse round transformations in attacks on some block ciphers // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 76–79. DOI: 10.17223/2226308X/11/24
79–81
Pogorelov B. A., Pudovkina M. A. On nonabelian key addition groups and markovian block ciphers // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 79–81. DOI: 10.17223/2226308X/11/25
81–86
Semenov A. A. Guess-and-determine attacks and automatic methods for their construction // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 81–86. DOI: 10.17223/2226308X/11/26
87–89
Sorokin M.A., Pudovkina M. A. On integral distinguishers of block ciphers based on generalized feistel schemes // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 87–89. DOI: 10.17223/2226308X/11/27
MATHEMATICAL FOUNDATIONS OF COMPUTER SECURITY
90–95
Gorbatenko D.E., Semenov A. A. An effective algorithm for building a set of the shortest attacks within the context of one model of attack development in computer networks // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 90–95. DOI: 10.17223/2226308X/11/28
95–99
Devyanin P. N. Approaches to formal modelling access control in postgresql within framework of the mrosl DP-model // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 95–99. DOI: 10.17223/2226308X/11/29
99–101
Manashev I. N. Breaking Google recaptcha V2 // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 99–101. DOI: 10.17223/2226308X/11/30
APPLIED THEORY OF CODING, AUTOMATICS AND GRAPHS
102–104
Avezova Y. E. The criterion of primitivity and exponent bounds for a set of digraphs with common cycles // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 102–104. DOI: 10.17223/2226308X/11/31
105–106
Belousova A. A., Nobeleva V.I., Tokareva N. N. On codes used in biometri-cal cryptosystems // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 105–106. DOI: 10.17223/2226308X/11/32
106–109
Zharkova A. V. On the number of attractors in finite dynamic systems of complete graphs orientations // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 106–109. DOI: 10.17223/2226308X/11/33
109–111
Lobov A. A., Abrosimov M. B. About minimal 1-edge extension of hy-percube // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 109–111. DOI: 10.17223/2226308X/11/34
112–114
Los I. V., Abrosimov M. B. About the maximum number of vertices in primitive regular graphs with exponent // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 112–114. DOI: 10.17223/2226308X/11/35
115–117
Malygina E. S. Investigation of automorphism group for code associated with optimal curve of genus three // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 115–117. DOI: 10.17223/2226308X/11/36
117–122
Pankratov I. V. Fuzzy binary search problem: approach based on finite state machines // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 117–122. DOI: 10.17223/2226308X/11/37
122–127
Soldatenko A. A. Algorithm for optimal routing in multiservice networks // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 122–127. DOI: 10.17223/2226308X/11/38
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE AND PROGRAMMING
128–130
Egorushkin O.I., Kolbasina I. V., Safonov K. V. Syntax analysis of programs by the method of integral representations // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 128–130. DOI: 10.17223/2226308X/11/39
130–133
Nedyak M. S., Safonov V. O. Stack management in LYAPAS // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 130–133. DOI: 10.17223/2226308X/11/40
133–136
Rybalov A.N. On the generic complexity of discrete logarithm problem in groups of elliptic curves over finite fields // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 133–136. DOI: 10.17223/2226308X/11/41
136–138
Sorokovikov N. V. Creating a type system for a family of assembly languages // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 136–138. DOI: 10.17223/2226308X/11/42
COMPUTATIONAL METHODS IN DISCRETE MATHEMATICS
139–141
Gribanova I. A. New algorithm for relaxation constrains generation in the inversion problem of MD4-39 // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 139–141. DOI: 10.17223/2226308X/11/43
142–143
Kokoshinskiy I. E. A compact realisation of the multiplicative inverse function in the finite field F216 // Applied Discrete Mathematics. Supplement. 2018. № 11. P. 142–143. DOI: 10.17223/2226308X/11/44
