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