Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Prikladnaâ diskretnaâ matematika
Année 2008
Suivant
Sommaire du
Fascicule no. 1
About the journal
G. P. Agibalov
p. 5-6
On the complexity of weakly positive and weakly negative boolean functions reducing
S. P. Gorshkov
p. 7-9
Approximation of plateaued boolean functions by monomial ones
A. V. Ivanov
p. 10-14
Codes, compositions and lattices
A. M. Kut'in
p. 15-20
Three-basal quasigroup with generalized Word's identity
V. A. Kirov
p. 21-24
Linear structures of permutation groups over finite modules
M. A. Pudovkina
p. 25-28
Entropy of underdetermined sequences under constraints to specifications
L. A. Sholomov
p. 29-33
Some theoretical aspects of differential cryptanalysis of the iterated block ciphers with additive round key
G. P. Agibalov
p. 34-42
Cellular automaton cryptosystems
S. K. Rososhek
;
A. A. Borovkov
;
O. O. Evsutin
p. 43-49
Quadratic approximations of the special type for the 4-bit permutations in S-boxes
N. N. Tokareva
p. 50-54
Combinatorial-geometric technique to design a~key distribution patterns (an overview)
A. V. Cheremushkin
p. 55-63
Base role DP-model
P. N. Devyanin
p. 64-70
DP-model application for network security analysis
D. N. Kolegov
p. 71-87
Modern models and mechanisms in information security
M. M. Kutcherov
;
I. N. Kirko
;
A. A. Muller
p. 88-93
Implementation of security policies in computer systems by means of Aspect-Oriented Programming
D. A. Stephantsov
p. 94-100
Семейства точных расширений турниров
M. B. Abrosimov
;
A. A. Dolgov
p. 101-107
A toolkit for graphical analysis of word chains
A. A. Evdokimov
;
A. A. Levin
p. 108-110
Transformation of grids to 1-fault-tolerant graphs
I. A. Naumenko
;
V. G. Skobelev
p. 111-115
Minimal primitive extensions of oriented graphs
V. N. Salii
p. 116-119
Describing progressive solutions to a~parallel FSM equation
V. G. Bushkov
p. 120-125
Characteristics of fixed points for linear automata over a finite ring
V. V. Skobelev
p. 126-130
Automaton identification in the class of Sprott's automata
V. A. Sukhinin
;
V. G. Skobelev
p. 131-135
Sommaire du
Fascicule no. 2
The unicity distance of а coordinate sequences family generated by complications of LRS over a~Galois ring
D. N. Bilkov
p. 5-7
On a solving of algebraic equations systems associated with context-free languages
O. I. Yegorushkin
;
D. A. Kalugin-Balashov
;
K. V. Safonov
p. 8-11
On quasigroups arising from physical structure of
$(2,2)$
rank
R. M. Muradov
;
V. A. Kirov
p. 12-14
Generating the normal periodic sequences on the base of cyclically minimal numbers
A. G. Pozdeyev
p. 15-17
The algebraic immunity of boolean functions
M. nbspTuzhilin
p. 18-22
On
$c$
-width of finite noncyclic groups
V. M. Fomichev
p. 23-27
Some applications of quasigroups in cryptography
M. M. Glukhov
p. 28-32
Presentation of cryptosystems via polybasic algebraic system
E. A. Ivaschenko
;
V. G. Skobelev
p. 33-38
Inverse dynamical systems with variable dimension of phase space in problems of cryptographic information transformation
A. M. Kovalev
;
V. A. Kozlovskii
;
V. F. Shcherbak
p. 39-44
About the direct operational analysis of symmetric ciphers
A. M. Kukartsev
;
A. M. Popov
;
V. S. Shestakov
p. 45-49
Perfect secret sharing schemes
N. G. Parvatov
p. 50-57
Properties of Feistel's ciphers relative to two wreath products
M. A. Pudovkina
p. 58-61
Analysis of attacks onto quantum public key distribution system
V. G. Skobelev
p. 62-66
Methods for protecting speech information
A. M. Grishin
p. 67-70
Foundations of the methods for the base expert analysis of information risks
V. V. Zolotarev
;
E. A. Shirkova
p. 71-75
Security linux extension based on system calls interposition
M. A. Kachanov
;
D. N. Kolegov
p. 76-80
About the CTF -- computer security competitions
D. N. Kolegov
;
Yu. N. Chernushenko
p. 81-83
Centralized analysis of geographically-distributed network traffic
V. V. Lapshin
p. 84-86
The problem of authentication in the multi-tier applications
P. A. Pautov
p. 87-90
Process management of access rights distribution on the basis of the business-processes analysis
T. M. Pestunova
;
Z. V. Rodionova
p. 91-95
Efficiency of local self-diagnosing in computing systems with circulant diagnostic structure
Yu. K. Dimitriev
p. 96-101
Function of structural fault tolerance and
$d$
-limited connected component of cs graph
V. A. Melent'ev
p. 102-106
Searching
$(s,t)$
-cutsets of computing system graph with diameter limiting of connected components
V. A. Melent'ev
p. 107-112
Global optimization problems associated with cryptographic analysis of asymmetric ciphers
V. I. Dulkeyt
;
R. T. Faizullin
;
I. G. Khnikin
p. 113-119
Analysis of some cryptographic primitives on computer clusters
A. A. Semenov
;
O. S. Zaikin
;
D. V. Bespalov
;
P. S. Burov
;
A. E. Hmelnov
p. 120-130
Arithmetic coding of messages using random sequence
V. N. Potapov
p. 131-133