|
Theoretical Foundations of Applied Discrete Mathematics
|
|
Isomorphisms of $5$-configurations obtained from $2$-digraphs
M. M. Komiagin
|
6–9 |
|
|
Exact formula for expectation of number of pairs of coinciding $s$-chains in a random binary sequence with fixed number of zeroes and ones
V. I. Kruglov
|
9–11 |
|
|
The characteristic polynomials of geometrically split ordinary abelian varieties of dimension $3$
S. A. Novoselov
|
12–16 |
|
|
On permutations perfectly diffusing classes of partitions of $V_n^l(2^m)$
B. A. Pogorelov, M. A. Pudovkina
|
16–19 |
|
|
Medial and paramedial alebras with strong dependable operations
A. V. Cheremushkin
|
19–23 |
|
|
Discrete Functions
|
|
|
On the number of the closest bent functions to some Maiorana–McFarland bent functions
D. A. Bykov, N. A. Kolomeets
|
24–27 |
|
|
Research of boomerang uniformity of quadratic permutations
Y. S. Kalinin
|
28–34 |
|
|
On the number of functions that break subspaces of dimension $3$ and higher
N. A. Kolomeets
|
34–37 |
|
|
Characterization of generalized bent functions of algebraic degree $1$
A. V. Kutsenko
|
37–40 |
|
|
On the construction of invertible vector Boolean functions
I. A. Pankratova, P. R. Garchukova
|
40–44 |
|
|
Cryptanalytic invertibility of three-argument functions
I. A. Pankratova, A. D. Sorokoumova
|
44–48 |
|
|
On possibility to construct algebraic immune S-boxes by choosing coordinate Boolean functions
I. S. Khilchuk
|
48–50 |
|
|
Mathematical Methods of Cryptography
|
|
|
Related-Key Attacks on Signature-based Authenticated Key Establishment Protocols
E. K. Alekseev, S. N. Kyazhin
|
51–57 |
|
|
Constructing algebraic attacks on lightweight symmetric ciphers using functions with small number of output bits
K. V. Antonov, A. A. Semenov, I. V. Otpushchennikov, A. L. Pavlenko
|
57–63 |
|
|
On the security of some algorithms over a group of points of elliptic curves
A. O. Bakharev, K. D. Tsaregorodtsev
|
63–70 |
|
|
Investigation of signal conversion designs with TRNG based on ring oscillators
D. A. Bobrovskiy, D. A. Shilikov
|
70–74 |
|
|
Some properties of sequences generated by the GEA-1 encryption algorithm
A. D. Bugrov, O. V. Kamlovskii, V. V. Mizerov
|
75–78 |
|
|
Matrix of transition probabilities of differentials of 8-round Luby — Rackoff scheme
M. M. Glukhov, O. V. Denisov
|
79–81 |
|
|
Differential-linear distinguishing attacks on block ciphers
O. V. Denisov, S. M. Ramodanov
|
81–90 |
|
|
Preimage attack on 44-step MD4 compression function with weakened last step
O. S. Zaikin
|
90–93 |
|
|
Algorithm for quickly generating a key sequence using a quantum communication channel
S. Yu. Kazantsev, K. N. Pankov
|
93–98 |
|
|
Post-quantum distinguishing attack on one block ciphers mode of operation
A. M. Koreneva, G. V. Firsov
|
98–102 |
|
|
Independence of events in spaces of equally probable ciphervalues
N. V. Medvedeva, S. S. Titov
|
102–106 |
|
|
Lightweight Authentication Encryption: a Review of Approaches
S. P. Panasenko
|
106–111 |
|
|
Quantum cryptanalysis of the KB-256 block cipher
M. V. Polyakov, A. M. Koreneva
|
112–115 |
|
|
An attack on 6-round XSL-block ciphers
M. A. Pudovkina, A. M. Smirnov
|
115–117 |
|
|
Ten years of the International Olympiad in Cryptography NSUCRYPTO
N. N. Tokareva
|
117–118 |
|
|
Parameter analysis of the post-quantum Hypericum signature scheme
O. Yu. Turchenko, S. R. Usmanov
|
119–120 |
|
|
On mixing properties of register transformations of ciphers TEA1 and TEA2
P. A. Chezhegova, A. M. Koreneva, M. V. Polyakov, G. V. Firsov
|
120–122 |
|
|
Mathematical Foundations of Computer Science and Computer Security
|
|
|
On solving linear homogeneous grammars generating linear languages
O. I. Egorushkin, I. V. Kolbasina, K. V. Safonov
|
123–125 |
|
|
Application of finite dynamic systems for information security
A. V. Zharkova
|
125–129 |
|
|
Efficiency measurement system for zk-SNARK circuits internal representation
D. O. Kondyrev
|
129–131 |
|
|
Using ELF relocations for executable encryption
R. K. Lebedev, V. E. Sitnov
|
131–134 |
|
|
Applied Theory of Coding, Automata and Graphs
|
|
|
Classification of trees whose maximal subtrees are all isomorphic
M. B. Abrosimov, D. A. Tomilov
|
135–137 |
|
|
On codes with unique decoding to the nearest
D. S. Ananichev, K. L. Geut, S. S. Titov
|
138–140 |
|
|
Generalized $(L,G)$-codes in weighted Haming metric for information security
S. V. Bezzateev
|
140–143 |
|
|
Properties of the polarizing matrix of a polar code and calculation of Bhattacharyya parameters
A. D. Bolotnikova, S. G. Kolesnikov, V. M. Leontiev, A. I. Semenov
|
144–147 |
|
|
Quasi-cyclic alternant codes and analysis of their security in cryptographic applications
A. A. Kuninets
|
147–152 |
|
|
Finite-state generators with maximal period
E. S. Prudnikov
|
152–154 |
|
|
On the structure of tournaments consisting of only kings
A. O. Shabarkova, M. B. Abrosimov
|
154–156 |
|
|
Computational methods in discrete mathematics
|
|
|
Research of $k$-sieve algorithm for solving the shortest vector problem in a lattice
A. O. Bakharev
|
157–162 |
|
|
Modular arithmetic optimization in Kyber KEM
A. S. Zelenetsky, P. G. Klyucharev
|
162–166 |
Contact us: