Home

Prikladnaya Diskretnaya Matematika has been selected for coverage in Clarivate Analytics
products and services. It is indexed and abstracted in SCOPUS and WoS Core Collection (Emerging Sources Citation Index).

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:

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

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

3. mathematical methods in steganography – synthesis of steganosystems, methods for steganoanalysis, appreciation of steganosystem security;

4. mathematical backgrounds 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;

5. mathematical backgrounds 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;

6. applied coding theory – data compressing and information protecting codes, error correcting and error detecting codes, construction of optimal codes, analysis of code properties;

7. 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;

8. applied graph theory – graph models in informatics and programming, in computer security, in computer and control systems, in intellectual systems;
    

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

10. mathematical backgrounds of informatics and programming – formal languages and grammars, algorithmic systems, programming languages, data structures, data processing algorithms, theory of computing complexity;

11. computational 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;




12. mathematical backgrounds of intelligent systems – data bases, knowledge bases, logical inference, expert systems, mathematical linguistics;

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

Address: Lenin street, 36, Tomsk, Russia, 634050

E-mail: pank@mail.tsu.ru

ISSN: 2071-0410

Founder: Tomsk State University