Prikladnaya Diskretnaya Matematika. Supplement
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Prikl. Diskr. Mat. Suppl.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


2019, Issue 12  


Theoretical Foundations of Applied Discrete Mathematics
On the blocking of two-dimensional affine varieties
K. L. Geut, S. S. Titov
7
On the order of the Frobenius endomorphism action on $l$-torsion subgroup of Abelian surfaces
N. S. Kolesnikov, S. A. Novoselov
11
Calculation of $3$-torsion ideal for some class of hyperelliptic curves
E. S. Malygina
13
On the number of $f$-recurrent runs and tuples in a finite Markov chain
N. M. Mezhennaya
18
On characteristic polynomials for some genus $2$ and $3$ curves with $p$-rank $1$
E. M. Melnichuk, S. A. Novoselov
21
Variations of orthomorphisms and pseudo-Hadamard transformations on nonabelian groups
B. A. Pogorelov, M. A. Pudovkina
24
On a class of power piecewise affine permutations on nonabelian groups of order $2^m$ with cyclic subgroups of index $2$
B. A. Pogorelov, M. A. Pudovkina
27
Exact formula for exponent of mixing digraph of feedback shift register
V. M. Fomichev, Ya. E. Avezova
29
Estimation of local nonlinearity characteristics of vector space transformation iteration using matrix-graph approach
V. M. Fomichev, V. M. Bobrov
32
Properties of strong dependance $n$-ary semigroups
A. V. Cheremushkin
36
Minimal representative set for a system of frequency classes of underdetermined words
L. A. Sholomov
41
Characteristic polynomials of the curve $y^2=x^7+ax^4+bx$ over finite fields
S. A. Novoselov, Y. F. Boltnev
44

Discrete Functions
Mixing properties for some classes of permutations on $\mathbb{F}_2^n$
L. A. Karpova, I. A. Pankratova
47
Properties of bent functions constructed by a given bent function using subspaces
N. A. Kolomeets
50
About the cubic part of the algebraic normal form of arbitrary bent functions
T. A. Kuzmina
53
Isometric mappings of the set of all Boolean functions into itself which preserve self-duality and the Rayleigh quotient
A. V. Kutsenko
55
Classes of Boolean functions with limited complexity
A. I. Metalnikova, I. A. Pankratova
58
On the relationship between nonlinear and differential properties of vectorial Boolean functions
A. V. Miloserdov
60
Recursion Formulas for the number of $(n, m, k)$-resilient and correlation-immune Boolean mappings
K. N. Pankov
62
About the components of some classes of invertible vectorial Boolean functions
I. A. Pankratova
66
Linear decomposition of discrete functions in terms of shift-composition operation
I. V. Cherednik
68
Connections between quaternary and Boolean bent functions
A. S. Shaporenko
73
Class of Boolean functions constructed using significant bits of linear recurrences over the ring $\mathbb{Z}_{2^n}$
D. H. Hernández Piloto
75
Properties of associated Boolean functions of quadratic APN functions
A. A. Gorodilova
77

Mathematical Methods of Cryptography
On mixing properties of non-stationary shift register
Ya. E. Avezova
80
Cryptanalytic invertibility with finite delay of finite automata
G. P. Agibalov
84
On probabilities of differential trails in the Bash-f sponge function
S. V. Agievich, A. S. Maslov, Yu. S. Yarashenya
86
Cryptanalysis of the ACBF encryption system
I. V. Borovkova, I. A. Pankratova
90
Blocking varieties in Steiner triples
M. V. Vedunova, A. O. Ignatova, K. L. Geut
93
On the argument of the absence of properties of a random oracle for some cryptographic hash functions
I. A. Gribanova, A. A. Semenov
95
Search for equivalent keys of the McEliece–Sidelnikov cryptosystem built on the Reed–Muller binary codes
A. M. Davletshina
98
On algorithmic implementation of 16-bit S-boxes with ARX and Butterfly structures
S. M. Komissarov
101
Evaluation of mixing characteristics for Merkle–Damgard hash functions
A. M. Koreneva
107
Homogeneous matroids and block-schemes
N. V. Medvedev, S. S. Titov
111
Geometric model of perfect ciphers with three cipher plaintext values
N. V. Medvedeva, S. S. Titov
113
Efficient methods of algebraic cryptanalysis and protection against them
V. A. Roman'kov
117
Nonlinearity characteristics estimations for function compositions over vector spaces by the matrix-graph approach
M. D. Sapegina
126
Search for linearizing sets in algebraic cryptanalysis as a problem of pseudo-Boolean optimization
A. A. Semenov, K. V. Antonov, I. V. Otpushchennikov
130
Hardware implementation of one class of 8-bit permutations
D. B. Fomin, D. I. Trifonov
134
On the parameters of 2-GOST round key generator
V. M. Fomichev, A. M. Koreneva, A. I. Tulebaev
137
On mixing properties of modified multidimensional linear generators
I. I. Khairullin
141
A method for constructing permutations, involutions and orthomorphisms with strong cryptographic properties
R. A. de la Cruz Jiménez
145
Some properties of the output sequences of combined generator over finite fields
Aulet R. Rodriguez
151
Discrete logarithm for nilpotent groups and cryptanalysis of polylinear cryptographic system
V. A. Roman'kov
154

Mathematical Foundations of Computer Security
About modeling of MIC and MAC in PostgreSQL within framework of the MROSL DP-model
P. N. Devyanin
161
Artificial neural networks as a mechanism for obfuscation of computations
V. L. Eliseev
165
Evaluation of the probability of a successful attack in blockchain network
I. V. Semibratov, V. M. Fomichev
169

Applied Theory of Automata and Graphs
About non-isomorphic graph colouring generating by Read–Faradzhev method
M. B. Abrosimov, P. V. Razumovskii
173
On indices of states in finite dynamic systems of complete graphs orientations
A. V. Zharkova
176
On the generation of minimal graph extensions by the method of canonical representatives
I. A. Kamil, H. H. K. Sudani, A. A. Lobov, M. B. Abrosimov
179
About a criterion of equality to 3 for exponent of regular primitive graph
I. V. Los', M. B. Abrosimov
182
Approximate algorithm for searching shortest path in multiservice network with constrained resource
A. A. Soldatenko
186
Reconfigurable finite state machines based on substitutions
V. N. Trenkaev
192

Mathematical Foundations of Informatics and Programming
Syntactical analysis of monomials in context-free languages taking into account the productions application order
V. V. Kishkan, K. V. Safonov
194
A solvability condition for arbitrary formal grammars
I. V. Kolbasina, K. V. Safonov
196
On the generic complexity of the decoding problem for linear codes
A. N. Rybalov
198

Computational methods in discrete mathematics
On properties of the largest probability for difference transition under a random bijective group mapping
V. V. Vlasova, M. A. Pudovkina
203
On the recognition problem for algebraic threshold functions
S. V. Jenevsky, S. L. Melnikov, A. N. Shurupov
206
Construction methods for MDS matrices using companion and permutation matrices for lightweight cryptography
O. Coy Puente
211
Computational experiments in finite two generator Burnside groups of exponent five
A. A. Kuznetsov
216
On effectiveness of solving pseudo-Boolean systems of linear inequalities by simulated annealing, Balas algorithm and interior point algorithm
G. O. Manyaev, A. N. Shurupov
218
Algorithm for “safety” decomposition of the formal context
Ch. M. Mongush
227
About using machine learning technologies for checking statistical properties of symmetric cryptography algorithms
A. A. Perov
232
Solving undetermined systems of linear Boolean equations with corrupted right-hand side and low-weight true solution
N. Yu. Rumenko, A. V. Kostyuk
235
On APN-functions and division property of multisets
M. A. Sorokin, M. A. Pudovkina
237
Prikladnaya Diskretnaya Matematika. Supplement
 
Contact us:
 Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2021