THEORETICAL BACKGROUNDS OF APPLIED DISCRETE MATHEMATICS
Combinatorial aspects of the q-Hafnian // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2025. № 69. P. 5–17. DOI: 10.17223/20710410/69/1
5–17
Characterization of some classes of isometric mappings that preserve self-duality of generalized bent function // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2025. № 69. P. 18–36. DOI: 10.17223/20710410/69/2
18–36
On cryptanalytic invertibility of discrete functions // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2025. № 69. P. 37–54. DOI: 10.17223/20710410/69/3
37–54
MATHEMATICAL METHODS OF CRYPTOGRAPHY
Characteristics of distinguishing attacks on 3 and 4 rounds of the Luby - Rackoff scheme in independent permutations model // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2025. № 69. P. 55–67. DOI: 10.17223/20710410/69/4
55–67
Mental poker protocol based on the problem of finding isogenies between elliptic curves // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2025. № 69. P. 68–93. DOI: 10.17223/20710410/69/5
68–93
General scheme for a class of Diffie-Hellman type protocols // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2025. № 69. P. 94–110. DOI: 10.17223/20710410/69/6
94–110
APPLIED GRAPH THEORY
Explicit construction of infinite families of strongly regular digraphs with parameters ((v + (2n+1 - 4)t)2n-1,k + (2n - 2)t,t,λ,t) // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2025. № 69. P. 111–120. DOI: 10.17223/20710410/69/7
111–120
MATHEMATICAL BACKGROUNDS OF INFORMATICS AND PROGRAMMING
On the generic complexity of graph 3-coloring problems // Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2025. № 69. P. 121–128. DOI: 10.17223/20710410/69/8
121–128
Prikladnaya Diskretnaya Matematika - Applied Discrete Mathematics. 2025. № 69.
Download full-text version
Counter downloads: 57