Geodesic

Sommaire du Fascicule no. 11

On mixing digraphs of nonlinear substitutions for binary shift registers
p. 6-9
Weight properties of primitive matrices
p. 10-12
Testing of embedding with margin for discrete random sequences
p. 12-14
Lower bound on the size of the largest metrically regular subset of the Boolean cube
p. 14-16
An improved formula for the universal estimation of digraph exponents
p. 16-20
$k$-transitivity of a~class of block transformations
p. 21-23
An extension of Gluskin--Hoszu's and Malyshev's theorems to strong dependent $n$-ary operations
p. 23-25
NFS factorization: new hopes
p. 25-30
Counting points on hyperelliptic curves of type $y^2=x^{2g+1}+ax^{g+1}+bx$
p. 30-33
Construction of a~class of functions on finite fields using linear recurrences over Galois rings
p. 34-39
Vectorial $2$-to-$1$ functions as subfunctions of APN permutations
p. 39-41
Properties of a~bent function construction by a~subspace of an arbitrary dimension
p. 41-43
On some properties of self-dual bent functions
p. 44-46
Constructions of vectorial Boolean functions with maximum component algebraic immunity
p. 47-48
Improved asymptotic estimates for the number of correlation-immune Boolean functions and mappings
p. 49-52
Connection between homogeneous bent functions and intersection graphs
p. 52-53
Public key cryptosystems on Boolean functions
p. 54-57
On the properties of substitution blocks on the base of a~modified additive generator and on the base of the block cipher NASH
p. 57-61
Implantation of Russian key agreement protocols into TLS~1.3
p. 62-65
On mixing and nonlinear properties of modified additive generators
p. 65-68
Experimental research of cryptographic properties of some lightweight algorithms
p. 68-71
NSUPresent cipher: resistance to linear and differential cryptanalysis
p. 72-73
Analysis of the perfection and strong nonlinearity of encryption algorithms
p. 74-76
Propositional encoding of direct and inverse round transformations in attacks on some block ciphers
p. 76-79
On nonabelian key addition groups and markovian block ciphers
p. 79-81
Guess-and-determine attacks and automatic methods for their construction
p. 81-86
On integral distinguishers of block ciphers based on generalized Feistel schemes
p. 87-89
An effective algorithm for building a~set of the shortest attacks within the context of one model of attack development in computer networks
p. 90-95
Approaches to formal modelling access control in PostgreSQL within framework of the MROSL DP-model
p. 95-99
Breaking Google reCAPTCHA~v2
p. 99-101
The criterion of primitivity and exponent bounds for a~set of digraphs with common cycles
p. 102-104
On codes used in biometrical cryptosystems
p. 105-106
On the number of attractors in finite dynamic systems of complete graphs orientations
p. 106-109
About minimal $1$-edge extension of hypercube
p. 109-111
About the maximum number of vertices in primitive regular graphs with exponent~3
p. 112-114
Investigation of automorphism group for code associated with optimal curve of genus three
p. 115-117
Fuzzy binary search problem: approach based on finite state machines
p. 117-122
Algorithm for optimal routing in multi-service networks
p. 122-127
Syntax analysis of programs by the method of integral representations
p. 128-130
Stack management in LYaPAS
p. 130-133
On the generic complexity of discrete logarithm problem in groups of elliptic curves over finite fields
p. 133-136
Creating a~type system for a~family of assembly languages
p. 136-138
New algorithm for relaxation constrains generation in the inversion problem of~MD4-39
p. 139-141
A compact realisation of the multiplicative inverse function in the finite field~$\mathbb F_{2^{16}}$
p. 142-143