Geodesic
On the practical safety of the key
Matematičeskie voprosy kriptografii, Tome 15 (2024) no. 4, pp. 43-59 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

We investigate sufficient conditions on the deviations of distributions of generated keys from a uniform probability distribution ensuring the safety of keys for cryptographic applications. 
@article{MVK_2024_15_4_a3,
     author = {V. O. Drelikhov},
     title = {On the practical safety of the key},
     journal = {Matemati\v{c}eskie voprosy kriptografii},
     pages = {43--59},
     year = {2024},
     volume = {15},
     number = {4},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/MVK_2024_15_4_a3/}
}
TY  - JOUR
AU  - V. O. Drelikhov
TI  - On the practical safety of the key
JO  - Matematičeskie voprosy kriptografii
PY  - 2024
SP  - 43
EP  - 59
VL  - 15
IS  - 4
UR  - http://geodesic.mathdoc.fr/item/MVK_2024_15_4_a3/
LA  - ru
ID  - MVK_2024_15_4_a3
ER  - 
%0 Journal Article
%A V. O. Drelikhov
%T On the practical safety of the key
%J Matematičeskie voprosy kriptografii
%D 2024
%P 43-59
%V 15
%N 4
%U http://geodesic.mathdoc.fr/item/MVK_2024_15_4_a3/
%G ru
%F MVK_2024_15_4_a3
V. O. Drelikhov. On the practical safety of the key. Matematičeskie voprosy kriptografii, Tome 15 (2024) no. 4, pp. 43-59. http://geodesic.mathdoc.fr/item/MVK_2024_15_4_a3/

[1] Kachalin I.F., Kuzmin A.S., Suslov E.A. i dr., “Ob osnovnykh kontseptsiyakh kriptograficheskoi stoikosti”, Obozrenie prikladnoi i promyshlennoi matematiki, 12:4 (2005), 982–983

[2] Nesterenko A.Yu., Semenov A.M., “Metodika otsenki bezopasnosti kriptograficheskikh protokolov”, Prikladnaya diskretnaya matematika, 2022, no. 56, 33–82 | Zbl

[3] Arbekov I.M., “Kriterii sekretnosti klyucha”, Matematicheskie voprosy kriptografii, 7:1 (2016), 39–56 | DOI | MR | Zbl

[4] Arbekov I.M., “Nizhnie otsenki dlya prakticheskoi sekretnosti klyucha”, Matematicheskie voprosy kriptografii, 8:2 (2017), 29–38 | DOI | MR | Zbl

[5] Babash A.V., Shankin G.P., Kriptografiya, Solon-Press, M., 2007, 512 pp.

[6] Kharin Yu.S., “Entropiinyi analiz kriptograficheskikh generatorov sluchainykh i psevdosluchainykh posledovatelnostei”, Vesnik suvyazi, 2017, no. 6 (146), 40–43

[7] Los A.B., Nesterenko A.Yu., Rogacheva O. A., “O vliyanii neravnoveroyatnosti vykhodnoi posledovatelnosti na kachestvo kriptograficheskikh preobrazovanii”, Mater. XII Mezhdunar. konf., posvyaschennoi 120-letiyu so dnya rozhdeniya akademika Andreya Nikolaevicha Kolmogorova i 60-letiyu so dnya otkrytiya shkoly-internata # 18 pri Mosk. un-te, Tulskii gos. pedagog. un-t im. L.N. Tolstogo, Tula, 2023, 151–157

[8] Malashina A.G., “Modifikatsiya odnogo algoritma vosstanovleniya tekstovykh soobschenii i matematicheskaya model raspredeleniya chisla osmyslennykh tekstov”, Elektronnye sredstva i sistemy upravleniya, Mater. dokl. XVI Mezhdunar. nauchno-prakt. konf., v. 2, V-spektr, Tomsk, 2020, 85–88

[9] Marshall A., Olkin I., Neravenstva: teoriya mazhorizatsii i ee prilozheniya, Per. s angl., Mir, M., 1983, 576 pp.

[10] Tolstov G.P., Elementy matematicheskogo analiza, v. 2, izdanie vtoroe, stereotipnoe, M., 1974, 472 pp. | MR

[11] Zubkov A.M., “Entropiya kak kharakteristika kachestva sluchainykh posledovatelnostei”, Matematicheskie voprosy kriptografii, 12:3 (2021), 31–48 | DOI | MR | Zbl