Geodesic

Sommaire du Fascicule no. 8

MacMahon's statistics properties on sets of words
p. 6-8
Mixing digraphs of transformations based on shift registers with two feedbacks
p. 8-11
On local exponents of the mixing graphs for the functions realized by A5/1 type algorithms
p. 11-13
On some metrical properties of linear subspaces in Boolean cube
p. 13-15
Properties of the group generated by translation groups of the vector space and the residue ring
p. 15-16
$\otimes_{\mathbf W,\mathrm{ch}}$-markovian transformations
p. 17-19
On degree structure of graphs
p. 20-22
On the number of symmetric coordinate functions of APN function
p. 23-25
On intersection of derivatives images for APN functions
p. 25-27
Research of the group of bijective differentiable modulo $p^n$ functions
p. 27-30
The inverse of differentiable permutations over groups
p. 30-32
On the minimal distance graph connectivity for bent functions
p. 33-34
On self dual bent functions
p. 34-35
On the invertibility of vector Boolean functions
p. 35-37
On algebraic immunity of vector Boolean functions
p. 37-39
Properties of $p$-ary bent functions that are at minimal distance from each other
p. 39-43
Enumeration of Boolean functions with a~fixed number of affine products
p. 43-47
Some structural properties of quadratic Boolean threshold functions
p. 48-51
On properties of the set of values of an arbitrary vector Boolean function
p. 51-53
Watermarking ciphers
p. 54-59
Public-key cryptosystem based on fully homomorphic encryption
p. 59-61
Addition modulo $2^n$ in block ciphers
p. 62-63
Non-endomorphic perfect ciphers with two elements in plaintext alphabet
p. 63-66
Preliminary evaluation of a~minimal number of rounds in lightweight block ciphers for providing their satisfactory statistical properties
p. 66-68
$\otimes_{\mathbf W,\mathrm{ch}}$-markovian and imprimitive properties of block ciphers
p. 69-71
On generic complexity of the quadratic residuosity problem
p. 71-73
NSUCRYPTO~-- a~student's olympiad in cryptography: an idea, realization and results
p. 74-75
Ciphertexts-only attack on a~linear fully homomorphic cryptosystem
p. 75-78
A secure distributed protocol in a~competitive environment of a~CTF contests kind
p. 79-80
Security violation necessary conditions for time information flows in MROSL DP-model
p. 81-83
Implementation of covert timing channels based on HTTP cache headers in cloud file storage services
p. 83-85
Non-invasive integrity control method for cookie in web applications
p. 85-89
Non-invasive method of mandatory access control implementaion on DBMS layer in web applications
p. 89-92
Implementation of DNS Rebinding
p. 92-95
Attribute based access control for key-value stores
p. 95-96
The capacity of a~packet length covert channel
p. 96-99
Unreliability of circuits in case of constant failures on inputs and outputs of gates
p. 100-102
A lower bound for unreliability of circuits in the Webb basis
p. 102-103
Lower bounds for unreliability of circuits in the Rosser--Tourkett basis
p. 104-105
An upper bound for reliability of non-branching programs with an unreliable stop-operator
p. 106-108
On length, height and reliability of circuits realizing selection function
p. 108-110
Number estimation for additional arcs in a~minimal $1$-vertex extension of tournament
p. 111-113
Primitiveness conditions for systems of two graphs
p. 113-114
On number of inaccessible states in finite dynamic systems of binary vectors associated with palms orientations
p. 115-117
Perfect binary codes of infinite length
p. 117-120
Low power race-free state assignment of an asynchronous automaton
p. 120-123
The Sperner property for trees
p. 124-127
On the diversity of balls in a~graph of a~given diameter
p. 127-128
Modification of LYaPAS for operating systems development
p. 129-131
Operational semantics for LYaPAS
p. 131-132
The programming-libraries management system for LYaPAS
p. 133-134
The development of an operating system in LYaPAS
p. 134-135
Solving linear inequalities systems with local search algorithms
p. 136-138
Application of algorithms solving SAT problem to cryptanalysis of hash functions of MD family
p. 139-142
Calculation of upper bounds for graph vertex integrity based on the minimal separators
p. 142-144
Construction of an error function for solving the text ranking identification problem
p. 144-147
Hall's polynomials over Burnside groups of exponent three
p. 147-149
On the complexity of discrete logarithm problem in a~finite cyclic group with the efficient inversion
p. 149-151
Implementation of a~neural WTA-network on the memristor crossbar
p. 151-154