|
Theoretical Foundations of Applied Discrete Mathematics
|
|
Optimal curves of genus $3$ over finite field with discriminant $-19$ E. S. Alekseenko, S. I. Aleshnikov, A. I. Zaytsev
|
6–7 |
|
Some properties of the discrete Fourier transform in the field of complex numbers and in the fields of finite characteristics A. M. Grishin
|
7–9 |
|
Constructing the classes of Boolean functions with guaranteed cryptographic properties on the base of coordinate functions of the finite field power mappings A. V. Ivanov, V. N. Romanov
|
10–11 |
|
Connections between subspaces on which bent function and its dual function are affine N. A. Kolomeec
|
11–12 |
|
A new combinatorial construction of bent functions N. N. Tokareva
|
13–14 |
|
Generation of the alternating group by semiregular involutions M. E. Tuzhilin
|
14–15 |
|
The properties of external control sequences V. M. Fomichev
|
15–19 |
|
|
Mathematical Methods of Cryptography
|
|
Development of estimation method for the dependence of GOST 28147-89 cipher security on selected key information V. U. Zolotukhin, T. A. Chalkin
|
20–21 |
|
On the reduction of key space for A5/1 S. A. Kiselyov
|
21–23 |
|
A hardware implementation of the cryptosystem based on the Zakrevskij FSM A. V. Miloshenko
|
23–24 |
|
Complexity estimation for a differential attack on a block cipher with given parameters A. I. Pestunov
|
25–27 |
|
On weak key-scheduling algorithms relatively the related-key attack M. A. Pudovkina
|
27–29 |
|
Attacks on full block cipher GOST 28147-89 with 2 or 4 related keys M. A. Pudovkina, G. I. Khoruzhenko
|
29–30 |
|
Differential attack on 6-round Whirlpool-like block ciphers M. A. Pudovkina
|
30–31 |
|
High-speed pseudorandom sequence generators based on cellular automata B. M. Sukhinin
|
32–34 |
|
The relationship between structure of the key space and hardness of the McEliece–Sidelnikov Public Key Cryptosystem I. V. Chizhov
|
34–35 |
|
Symmetric cipher on the base of non-commutative algebra of polynomials I. V. Shirokov
|
35–36 |
|
|
Mathematical Methods of Steganography
|
|
Steganography and steganalysis in video files O. V. Modenova
|
37–39 |
|
On steganographic system selection rule E. V. Razinkov, R. Kh. Latypov
|
39–41 |
|
Fingerprints resistant to collusion attacks T. M. Solovjev, R. I. Chernyak
|
41–44 |
|
About the fact of detecting the noise in finite Markov chain with an unknown transition probability matrix A. M. Shoytov
|
44–45 |
|
|
Mathematical Foundations of Computer Security
|
|
The search of $\operatorname{tg}$-paths and islands for Take-Grant security model D. M. Brechka
|
46–47 |
|
Electronic mail systems access control and information flow control modeling K. A. Grishchenko
|
47–49 |
|
Security analysis of systems with simple trajectories functioning within framework of the base role DP-model P. N. Devyanin
|
49–51 |
|
About time information flows in computer systems M. A. Kachanov
|
52–53 |
|
Teaching the protected computer nets design at the Cisco platform D. N. Kolegov
|
53–55 |
|
Adaptive algorithm for anomalous network traffic indication based on alternating process O. V. Nissenbaum, A. S. Prisyazhnuk
|
55–58 |
|
Authentication in multi-tier system using commutative encryption P. A. Pautov
|
59–60 |
|
The code injection to the process under an operating system GNU/Linux I. V. Smith
|
61–62 |
|
Design and development of Capture the Flag game server for competitions in information security N. O. Tkachenko, D. V. Chernov
|
62–64 |
|
Using Scyther for analysis SKID3 security M. I. Tsoy
|
65–66 |
|
|
Mathematical Foundations of Reliability of Computing and Control Systems
|
|
On minimal edge $k$-extensions of oriented stars M. B. Abrosimov
|
67–68 |
|
On minimal vertex 1-extensions of special form superslim trees M. B. Abrosimov, D. D. Komarov
|
68–70 |
|
Application of unreliable tests for self-diagnostics of modular computing systems with multiple faults Yu. K. Dimitriev, A. F. Zadorozhny
|
70–72 |
|
About one family of exact 2-extensions of tournaments A. A. Dolgov
|
72–73 |
|
An analytical approach to the synthesis of regular structures of fault-tolerant systems V. A. Melent'ev
|
74–75 |
|
|
Mathematical Foundations of Informatics and Programming
|
|
Elasticity of algorithms V. V. Bykova
|
76–78 |
|
Resource usage analysis in software V. V. Gorelov
|
78–79 |
|
An approach to fuzz testing data generation for applied and system software A. N. Makarov
|
79–81 |
|
Software translating of combinatorial problems to propositional logic I. V. Otpuschennikov, A. A. Semenov
|
81–82 |
|
On representation of context-free languages by diagonals of linear laguages K. V. Safonov, D. A. Kalugin-Balashov
|
82–83 |
|
Formal proof of the semantic equivalence between the core of the AOP language AspectTalk and the OOP language Smalltalk D. A. Stephantsov, A. E. Kryukova
|
84–85 |
|
|
Computational Methods in Discrete Mathematics
|
|
Cryptanalysis with graphical processing units (GPU) D. V. Bespalov, V. G. Bulavintsev, A. A. Semenov
|
86–87 |
|
Experimental estimation for software implementation speed of some block cipher's transformations A. A. Dmukh
|
87–88 |
|
Estimatiing complexity of directed enumeration in non-uniformly distributed key spaces I. V. Pankratov, O. A. Teploukhova
|
88–90 |
|
Minimization procedure for Hamiltonian Circuit and Graph Isomorphism problems R. T. Faizullin
|
90–91 |
|
|
Applied Theory of Coding, Automata and Graphs
|
|
On constructing minimal deterministic finite automaton recognizing a prefix-code of given cardinality I. R. Akishev, M. E. Dvorkin
|
92–94 |
|
About relationship between parameters of certain graphs I. A. Badeha, P. V. Roldugin
|
94–95 |
|
Bent functions and linear codes for CDMA A. V. Pavlov
|
95–97 |
|
On a new complete invariant for acyclic graphs A. V. Prolubnikov
|
97–98 |
|
On the frame of an automaton V. N. Salii
|
98–99 |
|
Classes of graphs reconstructed with
linear time complexity E. A. Tatarinov
|
99–101 |
|
Reconfigurable finite state machines with shared memory V. N. Trenkaev
|
101–102 |
|
|
Mathematical Foundations of Intelligent Systems
|
|
State estimation for stochastic object on the base of modeling trend in time series S. I. Kolesnikova, A. A. Belous
|
103–105 |
|
Logical inference on the base of optimal subset of mixed diagnostic tests for intelligent systems A. E. Yankovskaya, A. I. Gedike
|
105–108 |