Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Prikladnaâ diskretnaâ matematika
Année 2025
no. 1
Précédent
Volume (2025) no. 1
Sommaire
In memory of Lev Abramovich Sholomov
p. 5-6
On the parameters of a McEliece-type cryptosystem on~
$D$
-codes based on binary Reed~--- Muller codes
Yu. V. Kosolapov
;
E. A. Lelyuk
p. 7-35
Current paradigms for construction of lattice-based digital signature schemes
A. G. Leevik
;
E. S. Malygina
;
E. M. Melnichuk
;
D. A. Nabokov
p. 36-69
On the possibility of modifying the KB-256 algorithm from the searching for impossible differentials view point
A. B. Chuhno
p. 70-79
Validation of the transmitter's behaviour in the partial erasure channel in the case of~absence of~absolutely distinguishable characters
I. B. Kazakov
p. 80-97
About the maximum number of vertices in primitive regular graphs with exponent equals
$3$
I. V. Los
;
M. B. Abrosimov
p. 98-109
On generic complexity of equation solving over~the~bicyclic monoid
A. A. Lopatin
;
A. N. Rybalov
p. 110-117
Constructive algorithms for the scheduling problem on~two processors with the maximum time offset criterion taking into account parallelization and energy consumption
Y. V. Zakharova
;
A. O. Evtina
p. 118-128