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 2016
no. 9
Précédent
Suivant
Volume (2016) no. 9
Sommaire
Generalized Narayana polynomials and their
$q$
-analogues
L. N. Bondarenko
;
M. L. Sharapova
p. 6-8
A criterion for checking the hypothesis about the existence of embeddings into a~binary Markov chain
A. V. Volgin
p. 9-10
An algorithm for recognizing the completeness of a~set of words and dynamics of prohibitions
A. A. Evdokimov
p. 10-12
On a~sufficient condition for impossibility to reduce the period of the high order binary digit position sequences over primary rings
S. A. Kuzmin
p. 12-14
On groups generated by mixed type permutations and key addition groups
B. A. Pogorelov
;
M. A. Pudovkina
p. 14-16
On the classification of distance-transitive orbital graphs of overgroups of the Jevons group
B. A. Pogorelov
;
M. A. Pudovkina
p. 16-18
On special class of vectorial Boolean functions and the problem of APN permutations existence
V. A. Vitkup
p. 19-21
On differential equivalence of quadratic APN functions
A. A. Gorodilova
p. 21-24
Functions with variative-coordinate polynomiality over group
A. I. Zueva
;
A. V. Karpov
p. 24-27
On the Hamming distance between two bent functions
N. A. Kolomeec
p. 27-28
On the set of values for Hamming distance between self-dual bent functions
A. V. Kutsenko
p. 29-30
Necessary condition for maximum component algebraic immunity of a~vectorial Boolean function
D. P. Pokrasenko
p. 30-32
The presentation of Magma and
$2$
-GOST block cipher semibyte substitutions by algebraic threshold functions
D. A. Soshin
p. 32-34
On the set of derivatives of a~Boolean bent function
N. N. Tokareva
On quadratic form rank distribution and asymptotic bounds of affinity level
A. V. Cheremushkin
p. 36-38
Functions on distance one from APN functions in small number of variables
G. I. Shushuev
p. 39-40
To cryptanalysis of
$2$
-cascade finite automata cryptographic generators
G. P. Agibalov
;
I. A. Pankratova
p. 41-43
On the group generated by the round functions of the block cipher Kuznechik
V. V. Vlasova
;
M. A. Pudovkina
p. 43-45
Estimations of cryptographic resistance of ciphers in the Trivium family to SAT-based cryptanalysis
O. S. Zaikin
;
I. V. Otpuschennikov
;
A. A. Semenov
p. 46-48
Experimental research on exponents of mixing matrices for generalized Feistel networks
A. M. Koreneva
;
V. N. Martyshin
p. 48-51
Sufficient variables for transition function of a~modified additive generator
A. M. Koreneva
;
V. M. Fomichev
p. 51-54
Search of an information message in noisy code blocks at repeated data transmission
Y. V. Kosolapov
;
O. Y. Turchenko
p. 55-57
On the accuracy of matrix-graph approach to investigation of transformation mixing properties
S. N. Kyazhin
;
P. V. Lebedev
p. 57-59
Mixing properties of
$2$
-cascade generators
S. N. Kyazhin
;
V. M. Fomichev
p. 60-62
Analogues of the Shannon theorem for non-minimal endomorphic perfect ciphers
N. V. Medvedeva
;
S. S. Titov
p. 62-65
A method for building a~cryptographic generator of sequences with specified index of unrepeatability
D. A. Romanko
;
V. M. Fomichev
p. 65-67
Applications of two-faced processes to pseudorandom number generation
B. Ya. Ryabko
p. 68-70
On key schedule for block ciphers without week keys
V. M. Fomichev
p. 70-73
Cryptanalysis of the McEliece PKC based on
$(k-1)$
-Reed--Muller subcodes
I. V. Chizhov
;
M. A. Borodin
p. 73-75
Undeniable onion routing protocol with message creation time verification
N. I. Anisenya
p. 76-80
On discrete automaton models of attacks in computer networks
D. E. Gorbatenko
;
S. E. Kochemazov
;
A. A. Semenov
p. 80-83
About results of designing hierarchical representation of MROSL DP-model
P. N. Devyanin
p. 83-87
Confidentiality preserving scheme for the algorithm RAID-PIR
M. R. Kascheev
;
Y. V. Kosolapov
p. 87-89
HMAC obfuscation method for implementation in untrusted systems
D. N. Kolegov
;
O. V. Broslavsky
;
N. E. Oleksov
p. 89-91
Web application firewalls identification in MitB-model
D. N. Kolegov
;
P. A. Lineytsev
p. 92-93
Lightweight implementation of ABAC mechanism on Database Firewall
D. N. Kolegov
;
N. O. Tkachenko
p. 93-95
On the reliability of circuits in the Rosser--Tourkett basis (in~
$P_k$
)
M. A. Alekhina
;
O. Yu. Barsukova
p. 96-98
The unreliability of circuits in case coalescences of elements inputs
M. A. Alekhina
;
O. A. Logvina
p. 98-100
Refinement of lower bounds for the number of additional arcs in a~minimal vertex
$1$
-extension of oriented path
M. B. Abrosimov
;
O. V. Modenova
p. 101-102
On the number of optimal
$1$
-hamiltonian graphs with the number of vertices up to~
$26$
and~
$28$
M. B. Abrosimov
;
S. A. Suhov
p. 103-105
About one heritage character in cyclic semigroups of graphs
Y. E. Avezova
;
V. M. Fomichev
p. 105-109
Enumeration of labelled flower wheel graphs
V. A. Voblyi
;
A. K. Meleshko
p. 109-110
On the full diversity of balls for graphs
A. A. Evdokimov
;
E. P. Kutcenogaya
;
T. I. Fedoryaeva
p. 110-112
On attractors in finite dynamic systems of complete graphs orientations
A. V. Zharkova
p. 112-114
About simple conditional experiments identifying invertible automata of a~certain class
A. O. Zhukovskaja
;
V. N. Trenkaev
About transitive property of mappings associated with a~finite state machines from the groups~
$AS_p$
M. V. Karandashov
p. 115-118
On consistency of systems of symbolic polynomial equations and their application
O. I. Egorushkin
;
I. V. Kolbasina
;
K. V. Safonov
p. 119-121
LYaPAS-T into fasm translator for Windows and Linux
V. N. Knyazev
;
M. S. Knyazeva
p. 121-122
Modular translator from LYaPAS
D. A. Stefantsov
;
V. O. Safonov
;
V. V. Pershin
;
S. Yu. Grechnev
;
P. A. Tomskikh
p. 122-126
Methods for synthesizing predicate program pieces
M. S. Chushkin
;
V. I. Shelekhov
p. 126-128
Application of solving SAT algorithms to constructing differential paths for finding collisions of cryptographic hash functions in the MD family
I. A. Gribanova
p. 129-132
On the growth functions of finite two generator Burnside groups of exponent five
A. A. Kuznetsov
;
S. S. Karchevsky
p. 132-135