Prikl. Diskr. Mat., 2015, Number 4(30)

Prikladnaya Diskretnaya Matematika

RUS ENG

JavaScript is disabled in your browser. Please switch it on to enable full functionality of the website

2015, Number 4(30)

Theoretical Foundations of Applied Discrete Mathematics
	Piecewise-affine permutations of finite fields A. D. Bugrov	5–23
	On the complexity of circuits in bases containing monotone elements with zero weights V. V. Kochergin, A. V. Mikhailovich	24–31
	The nonlinearity index for a piecewise-linear substitution of the additive group of the field $\mathbb F_{2^n}$ A. E. Trishin	32–42

Mathematical Methods of Cryptography
	Description of non-endomorphic maximum perfect ciphers with two-valued plaintext alphabet N. V. Medvedeva, S. S. Titov	43–55
	A new hybrid encryption scheme A. Yu. Nesterenko, A. V. Pugachev	56–71

Mathematical Foundations of Computer Security
	Hooked-browser network with BeEF and Google Drive D. N. Kolegov, O. V. Broslavsky, N. E. Oleksov	72–76

Applied Coding Theory
	Comparison of the binary Golay code with the algebro-geometric code P. M. Shiriaev	77–82

Applied Graph Theory
	About some classes of extremal oriented graphs A. Yu. Zubov	83–90
	Upper bound for the number of additional edges in minimal $1$-edge extensions of starlike trees D. D. Komarov	91–99

Computational Methods in Discrete Mathematics
	Analysis and solution of discrete optimization problems with logical constraints on the base of $L$-partition approach A. V. Adelshin, A. A. Kolokolov	100–108

Discrete Models for Real Processes
	Method for estimating connection power of binary and nominal variables S. V. Dronov, I. Yu. Boyko	109–119