RUS  ENG
Full version
JOURNALS // Prikladnaya Diskretnaya Matematika. Supplement // Archive

2018, Issue 11


Theoretical Foundations of Applied Discrete Mathematics
On mixing digraphs of nonlinear substitutions for binary shift registers
V. S. Grigoriev
6
Weight properties of primitive matrices
S. N. Kyazhin
10
Testing of embedding with margin for discrete random sequences
N. M. Mezhennaya
12
Lower bound on the size of the largest metrically regular subset of the Boolean cube
A. K. Oblaukhov
14
An improved formula for the universal estimation of digraph exponents
V. M. Fomichev
16
$k$-transitivity of a class of block transformations
I. V. Cherednik
21
An extension of Gluskin–Hoszu's and Malyshev's theorems to strong dependent $n$-ary operations
A. V. Cheremushkin
23
NFS factorization: new hopes
P. Kirchner
25
Counting points on hyperelliptic curves of type $y^2=x^{2g+1}+ax^{g+1}+bx$
S. A. Novoselov
30

Discrete Functions
Construction of a class of functions on finite fields using linear recurrences over Galois rings
A. D. Bugrov
34
Vectorial $2$-to-$1$ functions as subfunctions of APN permutations
V. A. Idrisova
39
Properties of a bent function construction by a subspace of an arbitrary dimension
N. A. Kolomeec
41
On some properties of self-dual bent functions
A. V. Kutsenko
44
Constructions of vectorial Boolean functions with maximum component algebraic immunity
A. V. Miloserdov
47
Improved asymptotic estimates for the number of correlation-immune Boolean functions and mappings
K. N. Pankov
49
Connection between homogeneous bent functions and intersection graphs
A. S. Shaporenko
52

Mathematical Methods of Cryptography
Public key cryptosystems on Boolean functions
G. P. Agibalov, I. A. Pankratova
54
On the properties of substitution blocks on the base of a modified additive generator and on the base of the block cipher NASH
V. M. Bobrov, S. M. Komissarov
57
Implantation of Russian key agreement protocols into TLS 1.3
S. V. Grebnev, E. V. Lazareva, P. A. Lebedev, A. Yu. Nesterenko, A. M. Semenov
62
On mixing and nonlinear properties of modified additive generators
A. M. Koreneva
65
Experimental research of cryptographic properties of some lightweight algorithms
K. V. Maksimov, I. I. Khairullin
68
NSUPresent cipher: resistance to linear and differential cryptanalysis
E. A. Manylov
72
Analysis of the perfection and strong nonlinearity of encryption algorithms
A. R. Miftakhutdinova
74
Propositional encoding of direct and inverse round transformations in attacks on some block ciphers
I. V. Otpuschennikov, A. A. Semenov, O. S. Zaikin
76
On nonabelian key addition groups and markovian block ciphers
B. A. Pogorelov, M. A. Pudovkina
79
Guess-and-determine attacks and automatic methods for their construction
A. A. Semenov
81
On integral distinguishers of block ciphers based on generalized Feistel schemes
M. A. Sorokin, M. A. Pudovkina
87

Mathematical Foundations of Computer Security
An effective algorithm for building a set of the shortest attacks within the context of one model of attack development in computer networks
D. E. Gorbatenko, A. A. Semenov
90
Approaches to formal modelling access control in PostgreSQL within framework of the MROSL DP-model
P. N. Devyanin
95
Breaking Google reCAPTCHA v2
I. N. Manashev
99

Applied Theory of Coding, Automata and Graphs
The criterion of primitivity and exponent bounds for a set of digraphs with common cycles
Y. E. Avezova
102
On codes used in biometrical cryptosystems
A. A. Belousova, V. I. Nobeleva, N. N. Tokareva
105
On the number of attractors in finite dynamic systems of complete graphs orientations
A. V. Zharkova
106
About minimal $1$-edge extension of hypercube
A. A. Lobov, M. B. Abrosimov
109
About the maximum number of vertices in primitive regular graphs with exponent 3
I. V. Los, M. B. Abrosimov
112
Investigation of automorphism group for code associated with optimal curve of genus three
E. S. Malygina
115
Fuzzy binary search problem: approach based on finite state machines
I. V. Pankratov
117
Algorithm for optimal routing in multi-service networks
A. A. Soldatenko
122

Mathematical Foundations of Informatics and Programming
Syntax analysis of programs by the method of integral representations
O. I. Egorushkin, I. V. Kolbasina, K. V. Safonov
128
Stack management in LYaPAS
M. S. Nedyak, V. O. Safonov
130
On the generic complexity of discrete logarithm problem in groups of elliptic curves over finite fields
A. N. Rybalov
133
Creating a type system for a family of assembly languages
N. V. Sorokovikov
136

Computational methods in discrete mathematics
New algorithm for relaxation constrains generation in the inversion problem of MD4-39
I. A. Gribanova
139
A compact realisation of the multiplicative inverse function in the finite field $\mathbb F_{2^{16}}$
I. E. Kokoshinskiy
142


© Steklov Math. Inst. of RAS, 2025