Geodesic

Volume (2019) no. 12

Sommaire

On the blocking of two-dimensional affine varieties
p. 7-10
On the order of the Frobenius endomorphism action on $l$-torsion subgroup of Abelian surfaces
p. 11-12
Calculation of $3$-torsion ideal for some class of hyperelliptic curves
p. 13-17
On the number of $f$-recurrent runs and tuples in a finite Markov chain
p. 18-21
On characteristic polynomials for some genus $2$ and $3$ curves with $p$-rank~$1$
p. 21-24
Variations of orthomorphisms and pseudo-Hadamard transformations on nonabelian groups
p. 24-27
On a class of power piecewise affine permutations on nonabelian groups of order $2^m$ with cyclic subgroups of index~$2$
p. 27-29
Exact formula for exponent of mixing digraph of feedback shift register
p. 29-31
Estimation of local nonlinearity characteristics of vector space transformation iteration using matrix-graph approach
p. 32-35
Properties of strong dependance $n$-ary semigroups
p. 36-41
Minimal representative set for a system of frequency classes of underdetermined words
p. 41-44
Characteristic polynomials of the curve $y^2=x^7+ax^4+bx$ over finite fields
p. 44-46
Mixing properties for some classes of permutations on $\mathbb{F}_2^n$
p. 47-50
Properties of bent functions constructed by a given bent function using subspaces
p. 50-53
About the cubic part of the algebraic normal form of arbitrary bent functions
p. 53-55
Isometric mappings of the set of all Boolean functions into itself which preserve self-duality and the Rayleigh quotient
p. 55-58
Classes of Boolean functions with limited complexity
p. 58-60
On the relationship between nonlinear and differential properties of vectorial Boolean functions
p. 60-62
Recursion Formulas for the number of $(n, m, k)$-resilient and correlation-immune Boolean mappings
p. 62-66
About the components of some classes of invertible vectorial Boolean functions
p. 66-68
Linear decomposition of discrete functions in terms of shift-composition operation
p. 68-73
Connections between quaternary and Boolean bent functions
p. 73-75
Class of Boolean functions constructed using significant bits of linear recurrences over the ring $\mathbb{Z}_{2^n}$
p. 75-77
Properties of associated Boolean functions of quadratic APN functions
p. 77-79
On mixing properties of non-stationary shift register
p. 80-83
Cryptanalytic invertibility with finite delay of finite automata
p. 84-86
On probabilities of differential trails in the Bash-f sponge function
p. 86-90
Cryptanalysis of the ACBF encryption system
p. 90-93
Blocking varieties in Steiner triples
p. 93-95
On the argument of the absence of properties of a random oracle for some cryptographic hash functions
p. 95-98
Search for equivalent keys of the McEliece--Sidelnikov cryptosystem built on the Reed--Muller binary codes
p. 98-100
On algorithmic implementation of 16-bit S-boxes with ARX and Butterfly structures
p. 101-107
Evaluation of mixing characteristics for Merkle--Damgard hash functions
p. 107-110
Homogeneous matroids and block-schemes
p. 111-113
Geometric model of perfect ciphers with three cipher plaintext values
p. 113-116
Efficient methods of algebraic cryptanalysis and protection against them
p. 117-125
Nonlinearity characteristics estimations for function compositions over vector spaces by the matrix-graph approach
p. 126-129
Search for linearizing sets in algebraic cryptanalysis as a problem of pseudo-Boolean optimization
p. 130-134
Hardware implementation of one class of 8-bit permutations
p. 134-137
On the parameters of 2-GOST round key generator
p. 137-141
On mixing properties of modified multidimensional linear generators
p. 141-145
A method for constructing permutations, involutions and orthomorphisms with strong cryptographic properties
p. 145-151
Some properties of the output sequences of combined generator over finite fields
p. 151-154
Discrete logarithm for nilpotent groups and cryptanalysis of polylinear cryptographic system
p. 154-160
About modeling of MIC and MAC in PostgreSQL within framework of the MROSL DP-model
p. 161-165
Artificial neural networks as a mechanism for obfuscation of computations
p. 165-169
Evaluation of the probability of a successful attack in blockchain network
p. 169-172
About non-isomorphic graph colouring generating by Read--Faradzhev method
p. 173-176
On indices of states in finite dynamic systems of complete graphs orientations
p. 176-179
On the generation of minimal graph extensions by the method of canonical representatives
p. 179-182
About a criterion of equality to 3 for exponent of regular primitive graph
p. 182-185
Approximate algorithm for searching shortest path in multiservice network with constrained resource
p. 186-191
Reconfigurable finite state machines based on substitutions
p. 192-193
Syntactical analysis of monomials in context-free languages taking into account the productions application order
p. 194-196
A solvability condition for arbitrary formal grammars
p. 196-198
On the generic complexity of the decoding problem for linear codes
p. 198-202
On properties of the largest probability for difference transition under a random bijective group mapping
p. 203-205
On the recognition problem for algebraic threshold functions
p. 206-211
Construction methods for MDS matrices using companion and permutation matrices for lightweight cryptography
p. 211-216
Computational experiments in finite two generator Burnside groups of exponent five
p. 216-218
On effectiveness of solving pseudo-Boolean systems of linear inequalities by simulated annealing, Balas algorithm and interior point algorithm
p. 218-227
Algorithm for ``safety'' decomposition of the formal context
p. 227-232
About using machine learning technologies for checking statistical properties of symmetric cryptography algorithms
p. 232-235
Solving undetermined systems of linear Boolean equations with corrupted right-hand side and low-weight true solution
p. 235-237
On APN-functions and division property of multisets
p. 237-239