Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Prikladnaâ diskretnaâ matematika
Année 2021
Précédent
Suivant
Sommaire du
Fascicule no. 1
In memory of Teacher
I. A. Pankratova
p. 5-8
An algorithm for computing the Stickelberger ideal for multiquadratic number fields
E. A. Kirshanova
;
E. S. Malygina
;
S. A. Novoselov
;
D. O. Olefirenko
p. 9-30
The main stages of development of the cryptographic protocols SSL/TLS and IPsec
I. V. Martynenkov
p. 31-67
Group authentication scheme based~on~zero-knowledge~proof
E. A. Shliakhtina
;
D. Yu. Gamayunov
p. 68-84
On logic networks allowing short single fault detection tests under arbitrary faults of gates
K. A. Popkov
p. 85-100
Pyramid scheme for constructing biorthogonal wavelet codes over finite fields
D. V. Litichevskiy
p. 101-119
On generic complexity of the isomorphism problem for finite semigroups
A. N. Rybalov
p. 120-128
Sommaire du
Fascicule no. 2
Binary solutions to large systems of linear equations
A. V. Seliverstov
p. 5-15
Algorithmic theory of solvable groups
V. A. Roman'kov
p. 16-64
On the nonexistence of certain orthogonal arrays of strength four
R. Kiss
;
G. P. Nagy
p. 65-68
Detection of malware using an artificial neural network based on adaptive resonant theory
D. G. Bukhanov
;
V. M. Polyakov
;
M. A. Redkina
p. 69-82
The techniques of formalization of OS Astra Linux Special Edition access control model using Event-B formal method for verification using Rodin and ProB
P. N. Devyanin
;
M. A. Leonova
p. 83-96
The maximum number of vertices of primitive regular graphs of orders
$2, 3, 4$
with exponent~
$2$
M. B. Abrosimov
;
S. V. Kostin
;
I. V. Los
p. 97-104
Metric for comparing graphs with ordered vertices based on the maximum common subgraph
N. D. Moskin
p. 105-113
Discrete closed one-particle chain of contours
P. A. Myshkis
;
A. G. Tatashev
;
M. V. Yashina
p. 114-125
Sommaire du
Fascicule no. 3
Equations over direct powers of algebraic structures in relational languages
A. Shevlyakov
p. 5-11
Spectral probabilistic and statistical analysis of~Markov ciphers
O. V. Denisov
p. 12-31
Detecting server-side endpoints in web applications based on static analysis of client-side JavaScript code
D. A. Sigalov
;
A. A. Khashaev
;
D. Yu. Gamayunov
p. 32-54
The attackers power boundaries for traceability of~algebraic geometric codes on special curves
V. M. Deundyak
;
D. V. Zagumennov
p. 55-74
Characteristics of Hadamard square of special Reed~--- Muller subcodes
V. Vysotskaya
p. 75-88
Algorithms for solving systems of equations over various classes of finite graphs
A. V. Il'ev
;
V. P. Il'ev
p. 89-102
The complexity of implementation of a system of~monomials in two variables by composition circuits
S. A. Korneev
p. 103-119
The general complexity of the problem to~recognize~Hamiltonian paths
A. N. Rybalov
p. 120-126
Sommaire du
Fascicule no. 4
Researches of semigroups with planar Cayley graphs: results and problems
D. V. Solomatin
p. 5-57
Invariant subspaces in SPN block cipher
D. I. Trifonov
;
D. B. Fomin
p. 58-76
Impact of randomization in VKO mechanisms on overall security level
E. K. Alekseev
;
V. D. Nikolaev
;
S. V. Smyshlyaev
p. 77-93
Optimal algorithm for converting an acyclic digraph to a cluster
G. Sh. Tsitsiashvili
;
M. A. Osipova
p. 94-98
The palette index of Sierpi\'nski triangle graphs and Sierpi\'nski graphs
A. Ghazaryan
p. 99-108
Series of families of degree six circulant graphs
E. A. Monakhova
p. 109-124