|
Theoretical Foundations of Applied Discrete Mathematics
|
|
About the minimal primitive matrices R. I. Bar-Gnar, V. M. Fomichev
|
7 |
|
Euler's numbers on sets of permutations and analogues of Wilson's theorem L. N. Bondarenko, M. L. Sharapova
|
9 |
|
On some open questions about APN functions V. A. Vitkup
|
11 |
|
The equivalent problem of testing Fermat primes Kr. L. Geut, S. S. Titov
|
13 |
|
Characterization of APN functions by means of subfunctions A. A. Gorodilova
|
15 |
|
Classification of the functions over primary ring of residues considered in connection with the method of coordinate linearization M. V. Zaets
|
16 |
|
Research of differentiable modulo $p^n$ functions A. S. Ivachev
|
19 |
|
An upper bound for the number of bent functions at the distance $2^k$ from an arbitrary bent function in $2k$ variables N. A. Kolomeec
|
22 |
|
Nonlinearity bounds for vectorial Boolean functions of special form E. P. Korsakova
|
24 |
|
Reachability problem for continuous piecewise-affine mappings of a circle having degree 2 O. M. Kurganskyy
|
26 |
|
Compound Poisson approximation for the distribution of the number of monotone tuples in random sequence A. A. Minakov
|
29 |
|
Number of discrete functions on a primary cyclic group with a given nonlinearity degree A. V. Cheremushkin
|
31 |
|
Some properties of $q$-ary bent functions V. A. Shishkin
|
33 |
|
On a comparison of underdetermined alphabets L. A. Sholomov
|
34 |
|
Vectorial Boolean functions on distance one from APN functions G. I. Shushuev
|
36 |
|
Every cubic Boolean function in 8 variables is the sum of not more than 4 bent functions N. N. Tokareva
|
38 |
|
|
Mathematical Methods of Cryptography
|
|
Nonlinear permutations of a vector space recursively generated over a Galois ring of characteristic 4 A. V. Abornev
|
40 |
|
About primitiveness of self-decimated generator's mixing matrices Y. E. Avezova, V. M. Fomichev
|
42 |
|
SIBCiphers – symmetric iterative block ciphers composed of Boolean functions depending on small number of variables G. P. Agibalov
|
43 |
|
Asymptotic properties of the set of solutions for the distorted systems of equations A. V. Volgin
|
48 |
|
Influence of difference Hamming weight on it's propagation through arithmetic operations A. I. Pestunov
|
49 |
|
On generalizations of Markov's approach to research of block ciphers B. A. Pogorelov, M. A. Pudovkina
|
51 |
|
On probabilities of $r$-round differences of a Markov XSL block cipher with a reducible linear transformation M. A. Pudovkina
|
52 |
|
Conditions for the existence of perfect ciphers with a fixed set of parameters S. M. Ratseev
|
54 |
|
Cryptanalysis of a Diffie–Hellman's scheme analogue using conjugation and exponentiation on matrix platform V. A. Roman'kov
|
56 |
|
|
Pseudorandom Generators
|
|
Boolean functions generated by the most significant bits of linear recurrent sequences D. N. Bylkov
|
59 |
|
Estimates for exponents of mixing graphs relating to some modifications of additive generators A. M. Dorokhova
|
60 |
|
Algorithm for constructing the system of representatives of maximal length cycles of polynomial substitution over the Galois ring D. M. Ermilov
|
64 |
|
Model of complication function for generator of pseudorandom sequences over the field $\mathrm{GF}(2)$ V. M. Zakharov, R. V. Zelinsky, S. V. Shalagin
|
67 |
|
Constructing transitive polynomials over the ring $\mathbb Z_{p^2}$ A. O. Kovalevskaya
|
69 |
|
The recognition of recurrent sequences generated by conservative functions O. E. Sergeeva
|
71 |
|
|
Mathematical Methods of Steganography
|
|
Content protection with bitstream watermarking at decryption stage V. A. Anjin
|
73 |
|
Principles of associative steganography I. S. Vershinin
|
75 |
|
A new highly accurate approach to non-distorted bitmap images quantitative steganalysis V. A. Monarev
|
76 |
|
Quantitative steganalysis using binary classifier E. V. Razinkov, A. N. Almeev
|
78 |
|
|
Mathematical Foundations of Computer Security
|
|
Computationally secure DBMS based on order-preserving encryption I. Glotov, S. Ovsyannikov, V. Trenkaev
|
81 |
|
Security conditions for information flows by memory within the MROSL DP-model P. N. Devyanin
|
82 |
|
General method for HTTP messages authentication based on hash functions in web applications D. N. Kolegov
|
85 |
|
Covert timing channel over HTTP cache-control headers D. N. Kolegov, O. V. Broslavsky, N. E. Oleksov
|
89 |
|
About covert timing channels in OS Android T. I. Milovanov
|
92 |
|
Using digital certificates for authorization by proxy in OS Linux V. I. Ryzhkov
|
94 |
|
Forming indicators vectors for neural networks training to detect attacks on web applications S. N. Sorokin
|
96 |
|
Implementation of RDBMS MySQL security monitor in DBF/DAM systems N. O. Tkachenko
|
99 |
|
Method to provide safety for customer of application's store E. A. Tolyupa
|
101 |
|
Integrity control in mandatory DP-model of DBMS MySQL D. V. Chernov
|
103 |
|
The universal vulnerability exploitation platform for CTF P. Y. Sviridov, G. Y. Zaytsev, A. S. Ivachev
|
106 |
|
|
Mathematical Foundations of Reliability of Computing and Control Systems
|
|
Unreliability of circuits in the basis by Rosser–Turkett M. A. Alekhina, O. U. Barsukova
|
109 |
|
The reliability of circuits in the basis of unreliable and absolutely reliable gates M. A. Alekhina, A. E. Lakomkina
|
111 |
|
About basises with unreliability coefficient 5 A. V. Vasin
|
113 |
|
|
Applied Coding Theory
|
|
Hybrid compression algorithm for discrete-tone graphics processing D. V. Druzhinin
|
116 |
|
Probabilistic characteristics of weight spectra of random linear subcodes over $\mathrm{GF}(p)$ A. M. Zubkov, V. I. Kruglov
|
118 |
|
|
Applied graph theory
|
|
On cycles in functional graphs of circulant type gene networks with threshold functions I. S. Bykov
|
122 |
|
Algorithm for constructing T-irreducible extension of polygonal digraphs A. V. Gavrikov
|
124 |
|
On attractors in finite dynamic systems of binary vectors associated with palms orientations A. V. Zharkova
|
126 |
|
Building edge extensions of star-like trees D. D. Komarov
|
128 |
|
Sufficient conditions for local primitiveness of nonprimitive digraphs S. N. Kyazhin
|
130 |
|
On a counterexample for a T-irreducible extensions of star-like trees D. U. Osipov
|
132 |
|
The Sperner property for polygonal graphs V. N. Salii
|
135 |
|
On estimations for exponents of digraphs using Frobenius's numbers V. M. Fomichev
|
137 |
|
|
Applied Automata Theory
|
|
Estimation for an output symbol multiplicity in invertible automata D. A. Katerinskiy
|
141 |
|
Zakrevskij's cipher FPGA implementation based on the formula-defined reconfigurable FSM D. S. Kovalev, V. N. Trenkaev
|
142 |
|
Simultaneous search for several binary patterns in a stream with finite-state automaton I. V. Pankratov
|
143 |
|
|
Mathematical Foundations of Informatics and Programming
|
|
Software implementation of operations over large numbers in LYaPAS-T A. S. Gribanov, V. A. Sibiryakova
|
146 |
|
Development of automated means for proving programs properties A. O. Zhukovskaya, D. A. Stefantsov
|
148 |
|
|
Computational methods in discrete mathematics
|
|
Experimental comparison of Simulated Annealing and Balas Algorithms for Solving Linear Inequalities N. V. Anashkina, A. N. Shurupov
|
151 |
|
Structural decomposition of graphs and its application for solving optimization problems on sparse graphs V. V. Bykova
|
154 |
|
Formalization of combinatorial numbers in terms of entire solutions of systems of linear Diophantine equations V. V. Gotsulenko
|
157 |
|
An algorithm for generating a pair of special primes K. D. Zhukov, A. S. Rybakov
|
160 |
|
Hall's polynomials for finite two-generator groups of exponent seven A. A. Kuznetsov, K. V. Safonov
|
162 |
|
Heuristics for design of reliable telecommunication network R. E. Shangin
|
164 |