Geodesic

Sommaire du Fascicule no. 1

Generating functions for sequences of disordered covers numbers
p. 5-13
Conditions for maximality of subclones
p. 14-25
On the number of perfectly balanced Boolean functions with barrier of length~$3$
p. 26-33
Upper bounds on nonlinearity of correlation immune Boolean functions
p. 34-69
Some proxy signature protocols
p. 70-77
Transformation rules for states in base role DP-model of access control and information flows in operating systems
p. 78-95
Technology for translating combinatorial problems into Boolean equations
p. 96-115
Parallel implementation of asynchronous cellular automata for modeling CO oxidation over palladium surface
p. 116-126

Sommaire du Fascicule no. 2

On some measures of nonlinearity for Boolean functions
p. 5-16
Formation of a~dictionary of terms in the theory of modeling the secure access and information flows control in computer systems
p. 17-39
FPT-algorithms and their classification on the basis of elasticity
p. 40-48
A note on polynomial approximation of synchronizing optimal coloring
p. 49-72
Skeleton automata
p. 73-76
Minimal edge extensions of oriented and directed stars
p. 77-89
Attractors of dynamical systems associated with cycles
p. 90-95
On congruences of paths
p. 96-100
The estimates of exponents for primitive graphs
p. 101-112
Cumulative synthesis: a~cellular-automata model of physical-chemical processes on the stage of powder revetment collapsing
p. 113-124

Sommaire du Fascicule no. 3

Fast algorithm for statistical estimation of the maximal imbalance of bilinear approximations of Boolean mappings
p. 5-11
On the complexity of proving that a~Boolean function is not a~binary read-once
p. 12-16
Method for constructing elliptic curves using complex multiplication and its optimizations
p. 17-54
Implementation of security policies in programming information processing systems
p. 55-64
Computational aspects of treewidth for graph
p. 65-79
Computational complexity of the problem of approximation by graphs with connected components of bounded size
p. 80-84
Interval on one party regular edge 5-coloring of bipatite graph
p. 85-91
Structural and communicative properties of circulant networks
p. 92-115
On implementation of the meet-in-the-middle attack by means of parallel computations
p. 116-121
Analytical incomplete multiplicative pairwise comparisons method
p. 122-128

Sommaire du Fascicule no. 4

Construction of maximal clones in the set of point functions on interval semilattice
p. 5-10
Locally invertible Boolean functions
p. 11-21
Homomorphic stability of pairs of small order groups
p. 22-27
Almost perfect ciphers and authentication codes
p. 28-33
On minimal vertex 1-extensions of special type graph union
p. 34-41
Multiplicities of sums in the explicit formulae for counting fixed length cycles in undirected graphs
p. 42-55
Some prefractal graph's connectivity characteristics estimations
p. 56-61
State assignment in a~discrete automaton targeting an implementing low power circuit
p. 62-71
Regular estimates for the complexity of polynomial multiplication and truncated Fourier transform
p. 72-88
Populations of interacting automata
p. 89-104
SIBECRYPT'11 review
p. 105-120

Sommaire du Fascicule no. 13

An algorithm of computing $D$-gap numbers and $D$-Weierstrass points
p. 6-8
Coding of finite integer Lattice by means of mappings with a~bounded distortion
p. 8-9
The number of bent functions on the minimal distance from a~quadratic bent function
p. 9-11
Statistical independence of the Boolean function superposition
p. 11-12
Classification of ANF graphs for quadratic bent functions in~6 variables
p. 13-14
Weakly central clones and completeness problem for them
p. 14-16
Description of the class of permutations, represented as a~product of two permutations with fixed number of mobile points
p. 16-17
On approximation of permutations by imprimitive groups
p. 17-18
On perfect 2-colorings of the $q$-ary hypercube
p. 18-20
Algebras of languages associated with labelled graphs
p. 20-21
Hypotheses for the number of bent functions
p. 21-23
Polynomials over primary residue rings with a~small unique distance
p. 24-25
Mapping enlargements preserving identification property
p. 26-27
Provable secure dynamic group signature scheme
p. 27-29
Algebraic cryptanalysis of one-round S-AES
p. 29-31
Discrete logarithm diophantiness
p. 31-32
Constructing of one-way functions based on undecidability of the endomorphism problem in groups
p. 32-33
FPGA implementation of Finite Automata Public Key Cryptosystem
p. 33-34
Analysis of the GOST 28147-89 modes of operation that provide confidentiality
p. 34-36
On the choice of slid pairs for the correlation cryptanalysis of KeeLoq
p. 36-38
On impossible truncated differentials of XSL ciphers
p. 38-39
Reliability analysis of graphical CAPTCHA-systems by the example of KCAPTCHA
p. 40-41
About the role DP-model for access and information flows control in operating systems of Linux family
p. 42-43
Role-based security model of SELinux computer system
p. 44-46
The development feutures of network access control DP-model
p. 46-48
The security model for cross-platform web services of municipal procurement support
p. 48-50
Development of comprehensive taught system that protects information resources from phishing attacks
p. 50-55
Approaches to development of discretionary DP-model of the modern secure operating systems
p. 55-57
FPT-algorithms and their classification on the base of elasticity
p. 58-60
About phrase-structure grammar property
p. 60-61
A denotational semantics for the AspectTalk programming language
p. 61-62
Design and implementation of the ORM library in C++
p. 62-65
Solving of cryptanalysis problems in grid systems (by the example of BOINC)
p. 66-67
``Boolean Functions'' is a~system for the work with boolean functions
p. 67-68
Application of SAT-approach for solving combinatorial problems
p. 68-69
On parallel computations in implementation of the meat-in-the-middle attack
p. 69-73
C-model of a~predator--prey growth in the ecological niche
p. 74-76
On skeleton automata
p. 76-78
Fault attack on reconfigurable FSM-based cipher of Zakrevskij
p. 78-79
Minimal extensions for cycles with vertices of two types
p. 80-81
On the uniqueness of exact vertex extensions
p. 81-82
On minimal edge 1-extensions of two special form trees
p. 83-84
On properties of minimal extensions of orgraphs
p. 84-85
Computational aspects of treewidth for graph
p. 85-87
On attractors of dynamical systems associated with cycles
p. 88-89
On mobile agent self-location using topological properties of environment
p. 90-91
On congruences of paths
p. 91-92
On some prefractal graphs properties
p. 93-94
Compact graphs and the deterministic algorithm for their synthesis
p. 94-96
Restrictions on girths in compact graphs
p. 96-98
The improvement of exponent's estimates for primitive graphs
p. 98-100