Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Matematičeskie voprosy kriptografii
Tome 5 (2014)
Précédent
Suivant
Sommaire du
Fascicule no. 1
Transversals in splitted Latin squares of even order
V. V. Borisenko
p. 5-25
Statistical characteristics of weight spectra of random linear codes over
$\mathrm{GF}(p)$
A. M. Zubkov
;
V. I. Kruglov
p. 27-38
Constructing pseudorandom sequences by means of
$2$
-linear shift register
O. A. Kozlitin
p. 39-72
On an asymptotical property of spheres in the discrete spaces of large dimension
V. A. Kopytcev
;
V. G. Mikhailov
p. 73-83
The estimate of the convergence rate to the uniform distribution for products of elements of finite group controlled by a Markov chain
I. A. Kruglov
p. 85-94
Cyclic types of families of polylinear recurrent sequences and generators of pseudorandom numbers
A. V. Mikhalev
;
A. A. Nechaev
p. 95-125
Difference specification of substitutions and partitions in a residue ring
V. N. Sachkov
p. 127-150
Sommaire du
Fascicule no. 2
Information on the Workshop CTCrypt-2013
Recursively-generated permutations of a binary space
A. V. Abornev
p. 7-20
Smashing MASH-1
V. G. Antipkin
p. 21-28
Reconstruction of a linear recurrence of maximal period over a Galois ring of characteristic
$p^3$
by its highest digital sequence
D. N. Bylkov
p. 29-35
A construction of skew LRS of maximal period over finite fields based on the defining tuples of factors
M. A. Goltvanitsa
p. 37-46
A lightweight-friendly modification of GOST block cipher
A. A. Dmukh
;
D. M. Dygin
;
G. B. Marshalko
p. 47-55
Description of maximal skew linear recurrences in terms of multipliers
S. N. Zaitsev
p. 57-70
A method for generation of high-nonlinear S-boxes based on gradient descent
O. V. Kazymyrov
;
V. N. Kazymyrova
;
R. V. Oliynykov
p. 71-78
On a property of quadratic Boolean functions
N. A. Kolomeec
p. 79-85
On the security of a neural network-based biometric authentication scheme
G. B. Marshalko
p. 87-98
Constructions of elliptic curves endomorphisms
A. Yu. Nesterenko
p. 99-102
Estimation of the characteristics of time-memory-data tradeoff methods via generating functions of the number of particles and the total number of particles in the Galton–Watson process
D. V. Pilshchikov
p. 103-108
Construction of RNG using random automata and “one-way” functions
V. O. Popov
;
S. V. Smyshlyaev
p. 109-115
Meet-in-the-middle attacks on reduced-round GOST
G. Sekar
;
N. Mouha
;
B. Preneel
p. 117-125
On the invariance of perfect balancedness property under the choice of tapping sequence
S. V. Smyshlyaev
p. 127-135
Sommaire du
Fascicule no. 3
Moments of weights of random nonuniform Boolean functions
A. M. Zubkov
p. 5-15
Nonabsolute bounds for incomplete exponential sums of elements of linear recurrent sequences and their applications
O. V. Kamlovsky
p. 17-34
The duality of differential and linear methods in cryptography
F. M. Malyshev
p. 35-47
Local limit theorem for the distribution of incomplete vector formed by the weights of subfunctions of random binary mapping components
K. N. Pankov
p. 49-80
Permutation lattices of equivalence relations on Cartesian products
S. V. Polin
p. 81-116
Random substitutions with cycles of bounded lengths and transforming
V. N. Sachkov
p. 117-136
Sommaire du
Fascicule no. 4
Nonlinear permutations recursively generated over the Galois ring of characteristic 4
A. V. Abornev
p. 5-15
A construction of new classes of filter generators without equivalent states
D. N. Bylkov
p. 17-39
Statistical estimation of the significant arguments set of the binary vector-function with corrupted values
O. V. Denisov
p. 41-61
Poisson approximation for the distribution of the frequency of a given pattern in the outcome sequence of the MCV-generator
V. G. Mikhailov
p. 63-71
Asymptotic estimates for numbers of Boolean mappings with given cryptographic properties
K. N. Pankov
p. 73-97
Orbital derivatives on residue rings. Part I. General properties
B. A. Pogorelov
;
M. A. Pudovkina
p. 99-127
On the asymptotic normality in a scheme of allocation of non-equiprobable particle sets
V. P. Chistyakov
p. 129-138