Geodesic

Sommaire du Fascicule no. 1

Minimization of Boolean functions of many variables~-- iterative method and program realization
p. 5-14
Bent functions: results and applications. A~survey
p. 15-37
Logical methods for design and analysis of choice models
p. 38-71
Approximate solution of the traveling salesman problem
p. 72-78
Modelling of the PKI protocols in the universally composable framework using model checkers
p. 79-92
Approaches to the construction of the DP-model of file systems
p. 93-112
Usage formal models for vulnerability analysis
p. 113-116
Security analysis of the information flows by memory in the computer systems with functional and parametric associated entities
p. 117-125

Sommaire du Fascicule no. 2

Foreword
p. 5-8
Programming language LYaPAS
p. 9-25
Discrete automata on semilattices
p. 26-49
Realization of functions on semilattices by switching networks
p. 50-55
Completeness problems for descrete functions
p. 56-78
Algorithms for constructing the shortest allowable partitions of finite sets
p. 79-95
Design and research of the parallel combinatorial algorithms
p. 96-103
50 years of cryptography in Tomsk State University
p. 104-126
The method for messages automatic encryption
p. 127-137

Sommaire du Fascicule no. 3

Lower and upper neighborhoods in set with closure property
p. 5-13
APN-functions
p. 14-20
On complexity of formal coding method for analysis of generator with monocycle substitutional transition function
p. 21-28
Almost all Latin squares have trivial autoparatopy group
p. 29-32
Discrete models of physical-chemical processes
p. 33-49
Cellular-automaton model for explosion simulation
p. 50-58
Symmetric stream and finite automaton ciphersystems
p. 59-68
Analysis of conditions for reception of access owning within the base role DP-model of computer systems without memory information flows
p. 69-84
DP-model of computer steganography system
p. 85-90
Modeling network computer systems with vulnerabilities
p. 91-99
The implementation of the DBMS credentials protection method in the web applications
p. 100-105
Test suites derivation for nondeterministic finite state mashines with respect to the separability relation
p. 106-111
An analitic approach in the theory of context-free languages Greibach normal form
p. 112-116
Method for automated program errors search in complex data processing algorithms
p. 117-127

Sommaire du Fascicule no. 4

Properties of bent functions with minimal distance
p. 5-20
About invariants for some classes of quasimonotonic functions on a~semilattice
p. 21-27
About Tseitin transformation in logical equations
p. 28-50
A recursive algorithm for cover-free family construction
p. 51-55
Differential cryptanalysis of the MARS block cipher
p. 56-63
Argument of knowledge protocol for a~Goppa codeword and for an error of a~bounded weigth
p. 64-71
Cellular automata simulation on surface triangulation for diffusion processes
p. 72-83
``Strings'' theorem and its applications
p. 84-89
Adaptive tests derivation for nondeterministic automata
p. 90-101
Modification of hierarchies analysis method for the dynamic set of alternatives
p. 102-109
Instructions and recommendations for authors to prepare articles in \LaTeX{} format for ``Applied Discrete Mathematics'' journal
p. 110-120

Sommaire du Fascicule no. 10

Solving parallel equations over $\omega$-regular languages
p. 6-7
The degree of proximity of the Boolean function reduced representation to the class of monomial functions according to basis selection
p. 7-9
Properties of bent functions with minimal distance
p. 9-10
About finite lower neighbourhood in functional space
About tseitin's transformation in logical equations
p. 12-13
APN-functions
p. 13-14
The explicit form of information characteristic for partially defined data
p. 15-16
On Quaternary and Binary Bent Functions
p. 16-18
A~hybrid approach (SAT+ROBDD) to cryptanalysis of stream encryption systems
p. 19-20
Generalized invertibility of dynamical systems for encryption problems
p. 20-21
Stream and finite automaton ciphersystems
p. 21-24
On 2-transitivity of generalized Feistel ciphers
p. 24-26
Analysis of perturbed quantization stegosystems
p. 26-28
Transitions identification experiments with information-lossless automata
p. 29-30
Argument of knowledge of a~Goppa codeword and of a~bounded error
p. 30-32
On complexity of formal coding method for analysis of generator with monocycle substitutional transition function
p. 32-34
Protocol verification tools
p. 34-36
The generalized automorphisms of Reed-Muller code and McEliece--Sidelnikov public key cryptosystem
p. 36-37
Analysis of conditions for taking ownership access within the base role DP-model without memory-information flows
p. 38-39
Teaching the models of access and information flows management within discipline ``Theoretical foundations of computer security''
p. 39-41
Closure of basic role DP-model
p. 41-44
Approaches to security of computer systems with functionally or parametrically associated entities
p. 44-46
Multivalued logic in the enterprise information management system
p. 46-48
Analysis of network safety with Markov's chains
p. 48-50
Implementation of a~method for protecting credentials in the multi-tier applications
p. 50-51
Mathematical and software tools for programs obfuscation
p. 52-53
Software implementation of closure algorithms for the basic DP-model of computer systems with discretionary access control
p. 54-55
The technology and the instrumental environment for creation of protected information processing systems
p. 55-56
Digital watermarks resistant to collusion attacks
p. 56-59
Wireless LAN security analysis in Tomsk
p. 59-60
The method for secure video streaming over distributed networks
p. 60-62
Test suites derivation for nondeterministic finite state mashines with respect to the separability relation
p. 63-65
Path delay and multiple stuck-at fault test design for circuits derived from irredundant systems with factorized synthesis method
p. 65-66
Representation of an arbitrary number with weight sum of essential subtrees
p. 66-68
Path delay fault classification
p. 68-69
Path delay fault test design for circuits obtained by covering ROBDDs with CLBs
p. 69-70
Fault tolerant combinational circuit design
p. 71-72
Analitic approach to context-free languages in the Greibach normal form
p. 73-74
Software errors search in complex data processing algorithms
p. 75-76
Routed service of data transmission
p. 76-78
Approximation of the network traffic by model of alternating process
p. 78-79
Towards the definition of the software subsystems integration measure
p. 79-81
Translation of discrete finite automata descriptions from Microsoft Visio format to source code in C~language
p. 81-83
Experimental program estimation for the quantity of prime numbers necessary for elimination of polynomial equations without integer roots
p. 84-87
Discrete logarithm problem in subgroups of prime order
p. 87-90
Main problems of linear algebra related with satisfiability problem
p. 90-91
Transformation of CNF via resolution
p. 91-93
Computational complexity of graph extensions
p. 94-95
Some properties of graph edge clique coverings
p. 95-96
Graph recognition by moving agent
p. 96-98
On exact extensions of tournaments
Algorithms for generation of rooted tree on the base of total partition procedure
p. 99-101
Algorithms for the graph isomorphism problem based on graph deregularisation
p. 101-102
On some relations between graphic images and sounds
p. 103-105
Risk management on quality indicators
p. 105-107
Correct evaluation of alternatives weight coefficients in the method of analytical hierarchies
p. 107-109
Approach to recognition of technical system state on the base of entropy conception and formalism of multisets
p. 109-111
Information protection for law students
p. 111-112
Logical-combinatorial multicriteria selection of diagnostic tests optimal subset
p. 113-114
Reduction of multicriteria selection of optimal subset tests in intelligent systems
p. 114-115

Sommaire du Fascicule no. 11

Bent functions and their generalizations
p. 5-17
Elements of underdetermined information theory
p. 18-42
Finite automata in cryptography
p. 43-73
Combinatorics-algebraic models in cryptography
p. 74-114
Cryptographic protocols
p. 115-150
Review lection of security models of computer system
p. 151-190