Geodesic

Sommaire du Fascicule no. 1

On equations in free monoids and semigroups with~restrictions on solutions
p. 5-19
Zero-knowledge succinct non-interactive arguments of~knowledge based on sets of polynomials
p. 20-57
Ternary forking lemma and its application to~the~analysis of one code-based signature
p. 58-71
An asymptotics for the number of labelled planar tetracyclic and pentacyclic graphs
p. 72-79
Attractors and cyclic states in finite dynamic systems of complete graphs orientations
p. 80-87
A validation algorithm of the transmitter's boundedly deterministic behaviour in a partial erasure channel
p. 88-110
A generalized dialogue graph construction and~visualization based on a corpus of dialogues
p. 111-127

Sommaire du Fascicule no. 2

Characterization of APN-permutations in terms of~Hamming distance between subgroups of~symmetric~group
p. 5-12
Properties of exponential transformations of~finite~field
p. 13-29
The number of occurrences of elements from~a~given~subset on~the complication segments of~linear~recurrence sequences
p. 30-39
Ways to improve the performance of zero-knowledge succinct non-interactivearguments of knowledge and~the analysis of the rusults achieved
p. 40-58
On additive differential probabilities of a composition of bitwise XORs
p. 59-75
On the complexity of graph clustering in~the~problem~with bounded cluster sizes
p. 76-84
Finding a family of simple circuits in graphs with~vertex semidegrees bounded by~$k$
p. 85-94
Synthesis of combinational circuits by means of bi-decomposition of Boolean functions
p. 95-105
On the solution of a general algebraic equation by power series and applications in the theory of formal grammars
p. 106-113
On generic complexity of~the~graph clustering problem with bounded clusters
p. 114-119
Solving of the maxisum location problem on network with a restriction on transport costs
p. 120-127

Sommaire du Fascicule no. 3

Discrete differentiations and integrations and their possible applications to algebra and cryptography
p. 5-14
Nonlinearity of APN functions: comparative analysis and estimates
p. 15-27
Secure formation of public parameters and elimination of vulnerabilities of zero-knowledge succint non-interactive arguments of knowledge
p. 28-43
ID-based public key cryptographic systems
p. 44-85
The model and metrics of awareness in~confidential information. Part 1. Potential awareness
p. 86-103
Using x86 mode switching for program code protection
p. 104-120
On generic complexity of the integer factorization problem
p. 121-126

Sommaire du Fascicule no. 4

On the distribution of cycle lengths in the graph of~$k$-multiple iteration of~the uniform random substitution
p. 5-12
On~blindness of several ElGamal-type blind signatures
p. 13-20
On the number of $\ell$-suitable Boolean functions in constructions of filter and combining models of stream ciphers
p. 21-28
Mathematical problems and solutions of the Ninth International Olympiad in Cryptography NSUCRYPTO
p. 29-54
The model and metrics of awareness in~confidential information. Part 2. Actual awareness
p. 55-70
Short fault detection tests for contact circuits under arbitrary weakly connected faults of contacts
p. 71-82
Algebraic-geometry codes and decoding by error-correcting pairs
p. 83-105
Weight distribution of low-density periodic random errors and their correcting codes with error decoding probability
p. 106-118
On the generic complexity of the square root modulo~prime problem
p. 119-123