Geodesic

Sommaire du Fascicule no. 9

Generalized Narayana polynomials and their $q$-analogues
p. 6-8
A criterion for checking the hypothesis about the existence of embeddings into a binary Markov chain
p. 9-10
An algorithm for recognizing the completeness of a set of words and dynamics of prohibitions
p. 10-12
On a sufficient condition for impossibility to reduce the period of the high order binary digit position sequences over primary rings
p. 12-14
On groups generated by mixed type permutations and key addition groups
p. 14-16
On the classification of distance-transitive orbital graphs of overgroups of the Jevons group
p. 16-18
On special class of vectorial Boolean functions and the problem of APN permutations existence
p. 19-21
On differential equivalence of quadratic APN functions
p. 21-24
Functions with variative-coordinate polynomiality over group
p. 24-27
On the Hamming distance between two bent functions
p. 27-28
On the set of values for Hamming distance between self-dual bent functions
p. 29-30
Necessary condition for maximum component algebraic immunity of a vectorial Boolean function
p. 30-32
The presentation of Magma and $2$-GOST block cipher semibyte substitutions by algebraic threshold functions
p. 32-34
On the set of derivatives of a Boolean bent function
On quadratic form rank distribution and asymptotic bounds of affinity level
p. 36-38
Functions on distance one from APN functions in small number of variables
p. 39-40
To cryptanalysis of $2$-cascade finite automata cryptographic generators
p. 41-43
On the group generated by the round functions of the block cipher Kuznechik
p. 43-45
Estimations of cryptographic resistance of ciphers in the Trivium family to SAT-based cryptanalysis
p. 46-48
Experimental research on exponents of mixing matrices for generalized Feistel networks
p. 48-51
Sufficient variables for transition function of a modified additive generator
p. 51-54
Search of an information message in noisy code blocks at repeated data transmission
p. 55-57
On the accuracy of matrix-graph approach to investigation of transformation mixing properties
p. 57-59
Mixing properties of $2$-cascade generators
p. 60-62
Analogues of the Shannon theorem for non-minimal endomorphic perfect ciphers
p. 62-65
A method for building a cryptographic generator of sequences with specified index of unrepeatability
p. 65-67
Applications of two-faced processes to pseudorandom number generation
p. 68-70
On key schedule for block ciphers without week keys
p. 70-73
Cryptanalysis of the McEliece PKC based on $(k-1)$-Reed–Muller subcodes
p. 73-75
Undeniable onion routing protocol with message creation time verification
p. 76-80
On discrete automaton models of attacks in computer networks
p. 80-83
About results of designing hierarchical representation of MROSL DP-model
p. 83-87
Confidentiality preserving scheme for the algorithm RAID-PIR
p. 87-89
HMAC obfuscation method for implementation in untrusted systems
p. 89-91
Web application firewalls identification in MitB-model
p. 92-93
Lightweight implementation of ABAC mechanism on Database Firewall
p. 93-95
On the reliability of circuits in the Rosser–Tourkett basis (in $P_k$)
p. 96-98
The unreliability of circuits in case coalescences of elements inputs
p. 98-100
Refinement of lower bounds for the number of additional arcs in a minimal vertex $1$-extension of oriented path
p. 101-102
On the number of optimal $1$-hamiltonian graphs with the number of vertices up to $26$ and $28$
p. 103-105
About one heritage character in cyclic semigroups of graphs
p. 105-109
Enumeration of labelled flower wheel graphs
p. 109-110
On the full diversity of balls for graphs
p. 110-112
On attractors in finite dynamic systems of complete graphs orientations
p. 112-114
About simple conditional experiments identifying invertible automata of a certain class
About transitive property of mappings associated with a finite state machines from the groups $AS_p$
p. 115-118
On consistency of systems of symbolic polynomial equations and their application
p. 119-121
LYaPAS-T into fasm translator for Windows and Linux
p. 121-122
Modular translator from LYaPAS
p. 122-126
Methods for synthesizing predicate program pieces
p. 126-128
Application of solving SAT algorithms to constructing differential paths for finding collisions of cryptographic hash functions in the MD family
p. 129-132
On the growth functions of finite two generator Burnside groups of exponent five
p. 132-135