|
Theoretical Backgrounds of Applied Discrete Mathematics
|
|
On the distribution of cycle lengths in the graph of $k$-multiple iteration of the uniform random substitution V. O. Mironkin
|
5–12 |
|
|
Mathematical Methods of Cryptography
|
|
On blindness of several ElGamal-type blind signatures A. A. Babueva, L. R. Akhmetzyanova, E. K. Alekseev, O. G. Taraskin
|
13–20 |
|
On the number of $\ell$-suitable Boolean functions in constructions of filter and combining models of stream ciphers T. A. Bonich, M. A. Panferov, N. N. Tokareva
|
21–28 |
|
Mathematical problems and solutions of the Ninth International Olympiad in Cryptography NSUCRYPTO V. A. Idrisova, N. N. Tokareva, A. A. Gorodilova, I. I. Beterov, T. A. Bonich, E. A. Ishchukova, N. A. Kolomeets, A. V. Kutsenko, E. S. Malygina, I. A. Pankratova, M. A. Pudovkina, A. N. Udovenko
|
29–54 |
|
|
Mathematical Backgrounds of Computer Security
|
|
The model and metrics of awareness in confidential information. Part 2. Actual awareness N. A. Gaydamakin
|
55–70 |
|
|
Mathematical Backgrounds of Computer and Control System Reliability
|
|
Short fault detection tests for contact circuits under arbitrary weakly connected faults of contacts K. A. Popkov
|
71–82 |
|
|
Applied Coding Theory
|
|
Algebraic-geometry codes and decoding by error-correcting pairs E. S. Malygina, A. A. Kuninets, V. L. Ratochka, A. G. Duplenko, D. Y. Neyman
|
83–105 |
|
Weight distribution of low-density periodic random errors and their correcting codes with error decoding probability L. Haokip, P. K. Das
|
106–118 |
|
|
Mathematical Backgrounds of Informatics and Programming
|
|
On the generic complexity of the square root modulo prime problem A. N. Rybalov
|
119–123 |