Geodesic

Sommaire du Fascicule no. 1

In memory of Vitaly Anatolyevich Romankov
p. 5-7
Construction of balanced functions with high nonlinearity and other cryptographic properties
p. 8-23
“Sandwich”-like keyed algorithm based on the “Streebog” hash function
p. 24-48
Blind signature as a shield against backdoors in smart cards
p. 49-64
Calculation of error-correcting pairs for an algebraic-geometric code
p. 65-90
Number of attractors and cyclic states in finite dynamic systems of complete graphs orientations
p. 91-101
Contextual analysis of the bipolar structures connectivity
p. 102-108
Generically undecidable and hard problems
p. 109-116
Combinatorial properties of the bounded knapsack problem
p. 117-130

Sommaire du Fascicule no. 2

To the 85th anniversary of Gennady Petrovich Agibalov
p. 5-6
Criterion for equational Noetherianity and complexity of the solvability problem for systems of equations over partially ordered sets
p. 7-19
Comparison of outerplanarity and generalized outerplanarity properties for Cayley graphs of planar semigroups
p. 20-26
Streebog as a random oracle
p. 27-42
Graph methods for recognition of CMOS gates in transistor-level circuits
p. 43-55
Database analysis of optimal double-loop networks
p. 56-71
On the generic complexity of solving equations over natural numbers with addition
p. 72-78
Simplified formula for summing discrete values of some functions
p. 79-98
Makespan minimization in reentrant flow shop problem with identical jobs
p. 99-111
Approach to analysis and construction of algorithms for solving one clustering problem on signed graphs
p. 112-127

Sommaire du Fascicule no. 3

On permutations that break subspaces of specified dimensions
p. 5-20
Medial and paramedial general identities for strong dependance operations
p. 21-40
On the unforgeability of the Chaum — Pedersen blind signature scheme
p. 41-65
On the influence of probabilistic characteristics of discrete sources forming cryptographic keys on the practical secrecy of the key
p. 66-83
Construction of quasi-cyclic alternant codes and their application in code-based cryptography
p. 84-109
On the generic complexity of the problem of computing the Euler function
p. 110-117
On a structure of voting procedures weights space
p. 118-130

Sommaire du Fascicule no. 4

On equations in free groups with commutant restrictions on solutions
p. 5-13
Axiomatizability and decidability of universal theories of hereditary classes of models of finite and infinite languages
p. 14-29
Periodic multiplicative arithmetic functions
p. 30-35
Multiplicative residue semigroups with planar Cayley graphs
p. 36-44
Orthomorphisms of groups with minimal possible pairwise distances
p. 45-59
Forcing future public ephemeral keys to attack authenticated key establishment protocols
p. 60-77
On the properties of a finite-state generator
p. 78-85
On the existence of directed strongly regular graphs with parameters $(22, 9, 6, 3, 4)$
p. 86-96
Discovery of infinite families of optimal double-loop networks with a given template of generators
p. 97-115
On the generic complexity of the discrete logarithm problem in Lucas sequences
p. 116-122