Geodesic

Sommaire du Fascicule no. 15

Invariant subspaces of functions affine equivalent to the finite field inversion
p. 5-8
Asymptotic normality of number of multiple coincidences of chains in complete $q$-ary trees and forests with randomly marked vertices
p. 8-11
The rate of normal approximation for the distribution of the number of multiple repetitions of characters in a stationary random sequence
p. 11-13
Diffusion properties of generalized quasi-Hadamard transformations on finite Abelian groups
p. 14-17
Application of heuristic methods to search for Boolean functions with good cryptographic characteristics
p. 18-21
Lower bound for the number of bent functions at the minimum distance from Majorana~--- McFarland bent functions
p. 22-25
Properties of subfunctions of self-dual bent functions
p. 26-30
Constructing vector Boolean functions with non-degenerate coordinate functions
p. 30-33
Correlation-immune functions with optimal algebraic immunity
p. 34-40
On decomposition of bent functions in $8$ variables into the sum of two bent functions
p. 40-42
Development and comparison of quantum oracle models for the hybrid attack on post-quantum lattice-based cryptosystems
p. 43-48
On a set of impossible differences of Feistel ciphers with a non-bijective transform of a round function
p. 49-51
The criterion of minimum perfect ciphers with respect to inclusion
p. 51-54
Calculation of the differential probabilities for the sum of $k$ numbers modulo $2^n$
p. 54-57
Some conditions for the applicability of the integral cryptanalysis to $4$-rounds of AES-like ciphers
p. 57-62
$\mathsf{XS}$-circuits' properties related to the guaranteed number of activations
p. 62-66
The additive differential probability of $k$ successive exclusive-OR
p. 67-70
Key schedule based on a modified additive generator
p. 70-73
The difference relations and impossible differentials construction for the KB-256 algorithm
p. 73-77
Polynomial grammars generating an infinite set of languages
p. 78-80
Methods for deductive verification of C code using AstraVer Toolset
p. 80-90
Comparison of methods for modeling access control in OS and DBMS in Event-B for the purpose of their verification with Rodin and ProB tools
p. 90-99
Backdoors in combinatorial problems and their probabilistic generalizations
p. 100-104
The finite dynamic system of all possible orientations of a given graph with all accessible states and with inaccesible states
p. 105-107
A series of formulas for Bhattacharya parameters in the theory of polar codes
p. 108-109
About the uniqueness of the minimal $1$-edge extension of a hypercube
p. 110-112
The upper and lower bounds for the number of additional arcs in a minimal edge $1$-extension of oriented cycle
p. 112-116
One family of optimal graphs with prescribed connectivities
p. 116-119