|
Theoretical Foundations of Applied Discrete Mathematics
|
|
Refractive bijections in Steiner triples
M. V. Vedunova, K. L. Geut, A. O. Ignatova, S. S. Titov
|
6 |
|
|
On homogeneous matroids corresponding to block-schemes
N. V. Medvedev, S. S. Titov
|
8 |
|
|
An algorithm for computing the Stickelberger elements for imaginary multiquadratic fields
D. O. Olefirenko, E. A. Kirshanova, E. S. Malygina, S. A. Novoselov
|
12 |
|
|
Discrete Functions
|
|
|
On the continuation to bent functions and upper bounds on their number
S. V. Agievich
|
18 |
|
|
On metrical properties of the set of self-dual bent functions
A. V. Kutsenko
|
21 |
|
|
Cryptographic properties of some vectorial Boolean functions compositions
E. S. Lipatova
|
27 |
|
|
Cryptographic properties of orthomorphic permutations
J. P. Maksimluk
|
29 |
|
|
On the decomposition of a vectorial Boolean function into a composition of two functions
G. M. Pintus
|
31 |
|
|
An estimation of the nonlinearity of balanced Boolean functions generated by generalized Dobbertin's construction
I. A. Sutormin
|
33 |
|
|
Connections between quaternary and component Boolean bent functions
A. S. Shaporenko
|
35 |
|
|
On a secondary construction of quadratic APN functions
K. V. Kalgin, V. A. Idrisova
|
37 |
|
|
On one-to-one property of a vectorial Boolean function of the special type
M. M. Zapolskiy, N. N. Tokareva
|
40 |
|
|
Cryptographic properties of a simple S-box construction based on a Boolean function and a permutation
D. A. Zyubina, N. N. Tokareva
|
41 |
|
|
Mathematical Methods of Cryptography
|
|
|
Post-quantum signature proposal for standardisation
E. A. Kirshanova, N. S. Kolesnikov, E. S. Malygina, S. A. Novoselov
|
44 |
|
|
Constructions of non-endomorphic perfect ciphers
N. V. Medvedeva, S. S. Titov
|
51 |
|
|
Construction of distinguishers for iterative block ciphers on the base of neural networks
A. A. Perov, A. I. Pestunov
|
54 |
|
|
About the hidden compact way to store data
V. A. Roman'kov
|
56 |
|
|
Experimental estimates of the computational complexity of one class of cryptoalgorithms based on the generalization of Feistel networks
V. M. Fomichev, D. A. Bobrovskiy, A. M. Koreneva
|
59 |
|
|
Characteristics of the data integrity check algorithm based on additive generators and $s$-boxes
V. M. Fomichev, A. M. Koreneva, T. R. Nabiev
|
62 |
|
|
Analysis of block cipher modes of operation for RFID devices
K. D. Tsaregorodtsev
|
67 |
|
|
One approach to constructing a multiply transitive class of block transformations
I. V. Cherednik
|
69 |
|
|
Elaboration of selfish-mine strategy
A. V. Cheremushkin
|
71 |
|
|
On the number of unsuitable Boolean functions in constructions of filter and combining models of stream ciphers
T. A. Bonich, M. A. Panferov, N. N. Tokareva
|
78 |
|
|
Efficient $S$-repetition method for constructing an IND-CCA2 secure McEliece modification in the standard model
Y. V. Kosolapov, O. Y. Turchenko
|
80 |
|
|
Mathematical Foundations of Computer Security
|
|
|
Neural network obfuscation for computations over encrypted data
V. L. Eliseev
|
85 |
|
|
Method for hiding private data in the blockchain tender system
D. O. Kondyrev
|
93 |
|
|
Validation-free offchain transactions with unlinkable double spend detection
S. N. Kyazhin, K. A. Klimenko
|
94 |
|
|
Applied Theory of Coding, Automata and Graphs
|
|
|
New estimates for dimension of Reed — Muller subcodes with maximum Hadamard square
V. V. Vysotskaya
|
98 |
|
|
On number of inaccessible states in finite dynamic systems of complete graphs orientations
A. V. Zharkova
|
100 |
|
|
On the optimality of graph implementations with prescribed connectivities
B. A. Terebin, M. B. Abrosimov
|
103 |
|
|
Mathematical Foundations of Informatics and Programming
|
|
|
Geometric condition of formal grammars solvability
O. I. Egorushkin, I. V. Kolbasina, K. V. Safonov
|
106 |
|
|
An algorithm for solving the extended parsing problem
V. V. Kishkan, K. V. Safonov
|
108 |
|
|
On generic complexity of the problem to represent natural numbers by sum of two squares
A. N. Rybalov
|
111 |
|
|
Computational methods in discrete mathematics
|
|
|
Application of SAT oracles for generation of additional linear constraints in cryptanalysis of some lightweight ciphers
K. V. Antonov, A. A. Semenov
|
114 |
|
|
On differentials for the modification of the cipher Simon based on the Lai — Messi scheme
A. A. Belousova, N. N. Tokareva
|
119 |
|
|
Coding information by Walsh matrices
M. S. Bespalov, K. M. Malkova
|
121 |
|
|
Using inverse backdoors sets to construct guess-and-determine attacks on hash-functions MD4
I. A. Gribanova, A. A. Semenov
|
124 |
|
|
Construction of cryptographic Boolean functions using SAT-solvers
A. E. Doronin, K. V. Kalgin
|
129 |
|
|
Computation of rewriting systems in finite groups
A. A. Kuznetsov
|
132 |
|
|
A compact translator of algorithms into Boolean formulas for use in cryptanalysis
D. A. Sofronova, K. V. Kalgin
|
135 |
