Geodesic

Sommaire du Fascicule no. 1

Application of multiharmonic numbers for the synthesis of closed forms of parametrically modified factorial generating sequences
p. 5-13
Kleptographic (algorithmic) backdoors in~the~RSA~key~generator
p. 14-34
Image stegoanalysis using deep neural networks and~heteroassociative integral transformations
p. 35-58
Short single fault detection tests for logic networks under arbitrary faults of gates
p. 59-76
$\langle 2\rangle$-exponents of shift register transformations nonlinearity dipgraphs
p. 77-87
Unique list colorability of the graph $K^n_2+K_r$
p. 88-94
Generic complexity of~the~membership problem for~semigroups of integer matrices
p. 95-101
Building parsers based on syntax diagrams with~multiport components
p. 102-119
Implementation of point-counting algorithms on genus~$2$ hyperelliptic curves based on the birthday paradox
p. 120-128

Sommaire du Fascicule no. 2

Investigation of automorphism group for code associated with optimal curve of genus three
p. 5-16
The construction of circulant matrices related to MDS matrices
p. 17-27
Superpositions of free Fox derivations
p. 28-32
Methodology for assessing the security of cryptographic protocols
p. 33-82
Anomaly detection in JSON structured data
p. 83-103
Short complete diagnostic tests for circuits with~one~additional input in the standard basis
p. 104-112
Low power assignment of partial states of a parallel automaton
p. 113-122

Sommaire du Fascicule no. 3

Heuristic algorithm for obtaining permutations with~given cryptographic properties using~a~generalized construction
p. 5-21
On the structural security of a McEliece-type cryptosystem based on the sum of tensor products of~binary Reed~--- Muller codes
p. 22-39
A randomized analog of Chaum --- van Antwerpen undeniable signature
p. 40-51
Flaws of hypercube-like ciphers
p. 52-66
The security of the code-based signature scheme based on the Stern identification protocol
p. 67-90
The generic complexity of~the~bounded problem of graphs clustering
p. 91-97
Median for an odd number of linear order relations and its use in group choice problems
p. 98-127

Sommaire du Fascicule no. 4

Analysis of minimal distance of AG-code associated~with~maximal curve of genus three
p. 5-14
About the rate of normal approximation for~the~distribution of the number of repetitions in~a~stationary discrete random sequence
p. 15-21
On ideal class group computation of imaginary multiquadratic fields
p. 22-30
Direct powers of algebraic structures and equations
p. 31-39
Search for differences for Alzette S-Box with maximum or close to maximum differential characteristic probability
p. 40-56
The method for constructing uniform planar approximations of the filter generator
p. 57-68
A direct method for calculating cell cycles of~a~block~map of a simple planar graph
p. 69-83
About uniqueness of the minimal $1$-edge extension of~hypercube $Q_4$
p. 84-93
Effective algorithm for finding shortest paths in~dense~Gaussian networks
p. 94-104
The generic complexity of~the~graph~triangulation~problem
p. 105-111
Application of idempotent algebra methods in~genetic algorithm for solving the scheduling problem
p. 112-124