Geodesic

Tome (2008) no. 1

Sommaire

About the journal
p. 5-6
On the complexity of weakly positive and weakly negative boolean functions reducing
p. 7-9
Approximation of plateaued boolean functions by monomial ones
p. 10-14
Codes, compositions and lattices
p. 15-20
Three-basal quasigroup with generalized Word's identity
p. 21-24
Linear structures of permutation groups over finite modules
p. 25-28
Entropy of underdetermined sequences under constraints to specifications
p. 29-33
Some theoretical aspects of differential cryptanalysis of the iterated block ciphers with additive round key
p. 34-42
Cellular automaton cryptosystems
p. 43-49
Quadratic approximations of the special type for the 4-bit permutations in S-boxes
p. 50-54
Combinatorial-geometric technique to design a~key distribution patterns (an overview)
p. 55-63
Base role DP-model
p. 64-70
DP-model application for network security analysis
p. 71-87
Modern models and mechanisms in information security
p. 88-93
Implementation of security policies in computer systems by means of Aspect-Oriented Programming
p. 94-100
Семейства точных расширений турниров
p. 101-107
A toolkit for graphical analysis of word chains
p. 108-110
Transformation of grids to 1-fault-tolerant graphs
p. 111-115
Minimal primitive extensions of oriented graphs
p. 116-119
Describing progressive solutions to a~parallel FSM equation
p. 120-125
Characteristics of fixed points for linear automata over a finite ring
p. 126-130
Automaton identification in the class of Sprott's automata
p. 131-135