Geodesic

Sommaire du Fascicule no. 13

Refractive bijections in Steiner triples
p. 6-8
On homogeneous matroids corresponding to block-schemes
p. 8-12
An algorithm for computing the Stickelberger elements for imaginary multiquadratic fields
p. 12-17
On the continuation to bent functions and upper bounds on their number
p. 18-21
On metrical properties of the set of self-dual bent functions
p. 21-27
Cryptographic properties of some vectorial Boolean functions compositions
p. 27-29
Cryptographic properties of orthomorphic permutations
p. 29-31
On the decomposition of a vectorial Boolean function into a composition of two functions
p. 31-32
An estimation of the nonlinearity of balanced Boolean functions generated by generalized Dobbertin's construction
p. 33-35
Connections between quaternary and component Boolean bent functions
p. 35-37
On a secondary construction of quadratic APN functions
p. 37-39
On one-to-one property of a vectorial Boolean function of the special type
p. 40-41
Cryptographic properties of a simple S-box construction based on a Boolean function and a permutation
p. 41-43
Post-quantum signature proposal for standardisation
p. 44-51
Constructions of non-endomorphic perfect ciphers
p. 51-54
Construction of distinguishers for iterative block ciphers on the base of neural networks
p. 54-56
About the hidden compact way to store data
p. 56-59
Experimental estimates of the computational complexity of one class of cryptoalgorithms based on the generalization of Feistel networks
p. 59-62
Characteristics of the data integrity check algorithm based on additive generators and $s$-boxes
p. 62-66
Analysis of block cipher modes of operation for RFID devices
p. 67-69
One approach to constructing a multiply transitive class of block transformations
p. 69-71
Elaboration of selfish-mine strategy
p. 71-77
On the number of unsuitable Boolean functions in constructions of filter and combining models of stream ciphers
p. 78-80
Efficient $S$-repetition method for constructing an IND-CCA2 secure McEliece modification in the standard model
p. 80-84
Neural network obfuscation for computations over encrypted data
p. 85-93
Method for hiding private data in the blockchain tender system
p. 93-94
Validation-free offchain transactions with unlinkable double spend detection
p. 94-97
New estimates for dimension of Reed~--- Muller subcodes with maximum Hadamard square
p. 98-100
On number of inaccessible states in finite dynamic systems of complete graphs orientations
p. 100-103
On the optimality of graph implementations with prescribed connectivities
p. 103-105
Geometric condition of formal grammars solvability
p. 106-108
An algorithm for solving the extended parsing problem
p. 108-111
On generic complexity of the problem to represent natural numbers by sum of two squares
p. 111-113
Application of SAT oracles for generation of additional linear constraints in cryptanalysis of some lightweight ciphers
p. 114-119
On differentials for the modification of the cipher Simon based on the Lai~--- Messi scheme
p. 119-121
Coding information by Walsh matrices
p. 121-124
Using inverse backdoors sets to construct guess-and-determine attacks on hash-functions MD4
p. 124-129
Construction of cryptographic Boolean functions using SAT-solvers
p. 129-132
Computation of rewriting systems in finite groups
p. 132-134
A compact translator of algorithms into Boolean formulas for use in cryptanalysis
p. 135-136