Geodesic

Tome (2017) no. 10

Sommaire

Generalized 312-avoiding GS-permutations and Lehmer's transformation
p. 7-9
Characterization of linear transformations defined by Finite Field Hadamard Matrices and circulant matrices
p. 10-11
On reducing the order of linear recurrence equations with constant coefficients
p. 12-13
On primitivity of mixing digraphs for substitutions of shift registers
p. 14-16
Digit-polynomial construction of substitutions over Galois ring
p. 17-19
The Cayley graph of a~subgroup of the Burnside group~$B_0(2,5)$
p. 19-21
On homogeneous matroids and block-schemes
p. 21-23
On maximal metrically regular sets
p. 23-24
On the anisometric index of a~transformation
p. 25-27
One approach to constructing a~transitive class of block transformations
p. 27-29
Hyperelliptic curves, Cartier--Manin matrices and Legendre polynomials
p. 29-32
On connection between affine splitting of a~Boolean function and its algebraic, combinatorial and cryptographic properties
p. 33-34
A classification of differentially nonequivalent quadratic APN function in~5 and~6 variables
p. 35-36
On constructing special APN functions and their link with APN permutations
p. 36-38
Properties of coordinate functions for a~class of permutations on~$\mathbb F_2^n$
p. 38-40
A bent function construction by a~bent function that is affine on several cosets of a~linear subspace
p. 41-42
On some properties of known isometric mappings of the set of bent functions
p. 43-44
Permutation binomials over finite fields. Conditions of existence
p. 44-45
Lower bounds of dimension of linear codes for~CDMA
p. 45-46
Refined asymptotic estimates for the number of $(n,m,k)$-resilient Boolean mappings
p. 46-49
Component algebraic immunity of S-boxes used in some block ciphers
p. 49-51
The method for implementation of substitutions $S_{16}$ by algebraic threshold functions
p. 51-54
A condition for uniqueness of linear decomposition of a~Boolean function into disjunctive sum of indecomposable functions
p. 55-56
Some decompositions for quadratic Boolean threshold functions
p. 56-59
On primitivity of some sets of shift registers mixing digraphs
p. 60-62
Solving the problem of Boolean satisfiability for estimating the security of block ciphers Magma and PRESENT to algebraic cryptanalysis
p. 62-64
Cryptographic analysis of the generalized ElGamal's cipher over~$\operatorname{GL}(8,\mathbb F_{251})$
p. 64-66
The Reed--Muller code square and equivalence classes of McEliece--Sidelnikov cryptosystem private keys
p. 66-68
On explicit constructions for solving the problem ``A~secret sharing''
p. 68-70
The assembler program is a~container for a~text
p. 71-73
About handwritten signature verification
p. 73-76
Self-programmable cellular automata for cryptography
p. 76-81
Construction of $(4,8)$-schemes of visual cryptography on the base of a~class of linear hash functions
p. 81-83
Exponents of mixing digraphs associated with one and two feedbacks shift registers
p. 84-87
Structure of local primitive digraphs
p. 87-89
A version of the Diffie--Hellman protocol based on using additional hidden factors
p. 89-91
On properties of $W$-permutations over the residue ring
p. 92-93
On mathematical models of key mixing for iterative block encryption algorithms
p. 93-96
On characteristics of local primitive matrices and digraphs
p. 96-99
On characteristics of a~three-stage key generator with an alternating step modified with key generator ``stop-forward''
p. 99-101
S-boxes algorithmic realization based on modified additive generators
p. 102-104
On the construction of $s$-boxes of $4\times4$ size
p. 104-106
Cryptautomata: definition, cryptanalysis, example
p. 106-110
Implementation of a~non-degenerate lattice of integrity levels within the hierarchical representation of MROSL DP-model
p. 111-114
Towards ABAC Engine framework
p. 115-120
Machine learning based anomaly detection method for SQL
p. 121-122
Identification method for function calling conventions in binary applications
p. 122-123
The reliability of circuits in Rosser--Turkett basis (in $P_3$) with faults of type~$0$ at the outputs of gates
p. 124-126
On the reliability of circuits in some full bases (in $P_3$) with inverse faults at the gate outputs
p. 126-128
The unreliability of logic circuits of unreliable functional elements
p. 128-130
About primitive regular graphs with exponent~2
p. 131-134
Upper and lower bounds of the number of additional arcs in a~minimal edge $1$-extension of oriented path
p. 134-136
About generation of non-isomorphic vertex $k$-colorings
p. 136-138
On the number of spanning trees in labeled cactus
p. 139-140
Identification method for invertible finite state machine with known output function
p. 140-142
Application of edge local complementation to McEliece cryptosystem structural analysis
p. 142-144
Cyclic permutation of elements in one-dimensional array
p. 145-149
An analogue of implicit mapping theorem to formal grammars
p. 149-151
Sketch completion for predicate programs by counterexamples guided synthesis
p. 151-153
Algorithm for constructing a~non-redundant minimax basis of strong associative rules
p. 154-157
The inversion of cryptographic hash functions using unbalanced approximations of round functions
p. 157-160
Based on the relative similarity coefficients ranking characteristics forming the cluster partition
p. 160-162
About the potential for the ellipsoid method application to the threshold function recognition
p. 163-165
Threshold interpolations in solving nonlinear Boolean equation by method of separating planes
p. 165-168
Two-phase routing algorithm in the time-dependent networks
p. 168-171