The scientific journal Prikladnaya Diskretnaya Matematika has been issued since 2008. It was registered by Federal Control Service in the Sphere of Communications and Mass Media (Registration Witness PI № FS 77-33762 in October 16th, in 2008).

The journal is a quarterly. All the papers to be published in it are obligatorily verified by one or two specialists. The publication in the journal is free of charge and may be in Russian or in English.

The topics of the journal are the following:

theoretical foundations of applied discrete mathematics — algebraic structures, discrete functions, combinatorial analysis, number theory, mathematical logic, information theory, systems of equations over finite fields and rings;

mathematical methods in cryptography — synthesis of cryptosystems, methods for cryptanalysis, pseudorandom generators, appreciation of cryptosystem security, cryptographic protocols, mathematical methods in quantum cryptography;

mathematical methods in steganography — synthesis of steganosystems, methods for steganoanalysis, appreciation of steganosystem security;

mathematical methods in steganography — synthesis of steganosystems, methods for steganoanalysis, appreciation of steganosystem security;

mathematical foundations of computer security — mathematical models for computer system security, mathematical methods for the analysis of the computer system security, mathematical methods for the synthesis of protected computer systems;

mathematical foundations of computer and control system reliability — mathematical models for functionally stable computer and control systems (that is for ones that are correctly function in the presence of faults, hazards and so on), mathematical methods for the analysis of the functional stability of computer and control systems, mathematical methods for the synthesis of functionally stable computer and control systems, mathematical methods for the verification of switching circuits and for program testing, mathematical methods for the synthesis of self checking and testable circuits;

applied theory of automata — automaton models for net protocols, for cryptosystems and for control systems, information-lossless automata, experiments on automata, decomposition of automata, automaton equations, cellular automata;

logical design of discrete automata — mathematical models and methods for analysis, synthesis, optimization and complexity appreciation of discrete automata, apparatus realization of cryptographic algorithms;

mathematical foundations of informatics and programming — formal languages and grammars, algorithmic systems, programming languages, data structures, data processing algorithms, theory of computing complexity;

computing methods in discrete mathematics — number theory methods in cryptography, computing methods in number theory and abstract algebra, combinatorial algorithms, parallel computations, methods for discrete optimization, discrete-event and cellular automaton models;

mathematical foundations of intellectual systems — data bases, knowledge bases, logical inference, expert systems, mathematical linguistics;

applied graph theory — graph models in informatics and programming, in computer security, in computer and control systems, in intellectual systems;

historical records on discrete mathematics and its applications — in cryptography, in computer security, in cybernetics, in informatics, in programming and in reliability theory.