Prikl. Diskr. Mat., 2011, supplement № 4

JOURNALS // Prikladnaya Diskretnaya Matematika // Archive

2011, supplement № 4

Theoretical Foundations of Applied Discrete Mathematics
	An algorithm of computing $D$-gap numbers and $D$-Weierstrass points E. S. Alekseenko	6
	Coding of finite integer Lattice by means of mappings with a bounded distortion A. A. Evdokimov	8
	The number of bent functions on the minimal distance from a quadratic bent function N. A. Kolomeeс	9
	Statistical independence of the Boolean function superposition O. L. Kolcheva, I. A. Pankratova	11
	Classification of ANF graphs for quadratic bent functions in 6 variables E. P. Korsakova	13
	Weakly central clones and completeness problem for them N. G. Parvatov	14
	Description of the class of permutations, represented as a product of two permutations with fixed number of mobile points A. B. Pichkur	16
	On approximation of permutations by imprimitive groups B. A. Pogorelov, M. A. Pudovkina	17
	On perfect 2-colorings of the $q$-ary hypercube V. N. Potapov	18
	Algebras of languages associated with labelled graphs E. A. Pryanichnikova	20
	Hypotheses for the number of bent functions N. N. Tokareva	21

Mathematical Methods of Cryptography
	Polynomials over primary residue rings with a small unique distance A. V. Abornev, D. N. Bylkov	24
	Mapping enlargements preserving identification property L. N. Andreeva	26
	Provable secure dynamic group signature scheme A. V. Artamonov, P. N. Vasilev, E. B Makhovenko	27
	Algebraic cryptanalysis of one-round S-AES R. I. Voronin	29
	Discrete logarithm diophantiness S. Y. Erofeev	31
	Constructing of one-way functions based on undecidability of the endomorphism problem in groups S. Y. Erofeev, V. A. Romankov	32
	FPGA implementation of Finite Automata Public Key Cryptosystem D. S. Kovalev, V. N. Trenkaev	33
	Analysis of the GOST 28147-89 modes of operation that provide confidentiality I. A. Kukalo	34
	On the choice of slid pairs for the correlation cryptanalysis of KeeLoq O. N. Lebedeva	36
	On impossible truncated differentials of XSL ciphers M. A. Pudovkina	38

Mathematical Foundations of Computer Security
	Reliability analysis of graphical CAPTCHA-systems by the example of KCAPTCHA M. B. Abrosimov, A. A. Matorin	40
	About the role DP-model for access and information flows control in operating systems of Linux family P. N. Devyanin	42
	Role-based security model of SELinux computer system M. A. Kachanov	44
	The development feutures of network access control DP-model D. N. Kolegov	46
	The security model for cross-platform web services of municipal procurement support D. D. Kononov, S. V. Isaev	48
	Development of comprehensive taught system that protects information resources from phishing attacks A. V. Miloshenko, T. M. Solovjev, R. I. Chernyak, M. V. Shumskaya	50
	Approaches to development of discretionary DP-model of the modern secure operating systems V. G. Proskurin	55

Mathematical Foundations of Informatics and Programming
	FPT-algorithms and their classification on the base of elasticity V. V. Bykova	58
	About phrase-structure grammar property K. V. Safonov, D. A. Kalugin-Balashov	60
	A denotational semantics for the AspectTalk programming language D. A. Stephantsov, A. E. Kryukova	61
	Design and implementation of the ORM library in C++ D. A. Stephantsov, N. O. Tkachenko, D. V. Chernov, R. V. Shmakova	62

Computational Methods in Discrete Mathematics
	Solving of cryptanalysis problems in grid systems (by the example of BOINC) O. S. Zaikin	66
	“Boolean Functions” is a system for the work with boolean functions N. A. Kolomeec, A. V. Pavlov	67
	Application of SAT-approach for solving combinatorial problems A. A. Semenov, I. V. Otpuschennikov, S. E. Kochemazov	68
	On parallel computations in implementation of the meat-in-the-middle attack V. M. Fomichev	69

Applied Automata Theory
	C-model of a predator–prey growth in the ecological niche Yu. V. Berezovsky, V. A. Vorob'ev	74
	On skeleton automata V. N. Salii	76
	Fault attack on reconfigurable FSM-based cipher of Zakrevskij V. N. Trenkaev	78

Applied Graph Theory
	Minimal extensions for cycles with vertices of two types M. B. Abrosimov, P. P. Bondarenko	80
	On the uniqueness of exact vertex extensions M. B. Abrosimov, A. A. Dolgov	81
	On minimal edge 1-extensions of two special form trees M. B. Abrosimov, D. D. Komarov	83
	On properties of minimal extensions of orgraphs M. B. Abrosimov, O. V. Modenova	84
	Computational aspects of treewidth for graph V. V. Bykova	85
	On attractors of dynamical systems associated with cycles A. V. Vlasova	88
	On mobile agent self-location using topological properties of environment I. S. Grunsky, S. V. Sapunov	90
	On congruences of paths E. O. Karmanova	91
	On some prefractal graphs properties A. A. Kochkarov, L. I. Sennikova, N. N. Bolurov	93
	Compact graphs and the deterministic algorithm for their synthesis V. A. Melent'ev	94
	Restrictions on girths in compact graphs V. A. Melent'ev	96
	The improvement of exponent's estimates for primitive graphs V. M. Fomichev	98