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