|
|
2025, Number 69
|
 |
|
 |
|
Theoretical Backgrounds of Applied Discrete Mathematics
|
|
Combinatorial aspects of the $q$-Hafnian
D. B. Efimov
|
5–17 |
|
|
Characterization of some classes of isometric mappings that preserve self-duality of generalized bent function
A. V. Kutsenko
|
18–36 |
|
|
On cryptanalytic invertibility of discrete functions
I. A. Pankratova, A. D. Sorokoumova
|
37–54 |
|
|
Mathematical Methods of Cryptography
|
|
|
Characteristics of distinguishing attacks on $3$ and $4$ rounds of the Luby — Rackoff scheme in independent permutations model
O. V. Denisov, E. D. Andreev, M. A. Bataev
|
55–67 |
|
|
Mental poker protocol based on the problem of finding isogenies between elliptic curves
I. D. Ioganson, V. V. Davydov, Zh.-M. N. Dakuo, A. F. Khutsaeva
|
68–93 |
|
|
General scheme for a class of Diffie — Hellman type protocols
A. V. Cheremushkin
|
94–110 |
|
|
Applied Graph Theory
|
|
|
Explicit construction of infinite families of strongly regular digraphs with parameters $((v+(2^{n+1}-4)t)2^{n-1}, k+(2^n-2)t, t, \lambda, t)$
V. A. Byzov, I. A. Pushkarev
|
111–120 |
|
|
Mathematical Backgrounds of Informatics and Programming
|
|
|
On the generic complexity of graph $3$-coloring problems
D. P. Ruzanova, A. N. Rybalov
|
121–128 |
|
|
Contact us: