YANGI KRIPTOBARDOSHLI KALIT GENERATSIYALASH USULINI ISHLAB CHIQISH
Description
Kvant hisoblash texnologiyalari rivojlanishi fonida mavjud kriptotizimlarning zaifliklarini bartaraf etish dolzarb masalaga aylandi. Ushbu maqolada Galois maydonlariga asoslangan, SHA-3 bilan aralashtirilgan va tasodifiylikni kuchaytiruvchi PRNG asosidagi yangi kriptobardoshli kalit generatsiyalash algoritmi ishlab chiqildi. Yangi algoritmda asosiy yangilik sifatida: (1) GF(2^256) da tasodifiy polinomial asosda kalit bitlarini hosil qilish, (2) kvant hujumlariga qarshi bardoshlilikni oshirish uchun SHA-3 sponge-funksiyasidan foydalanish, (3) NIST SP 800-22, Dieharder, va ENT statistik testlari orqali kalit sifatini baholash yondashuvi taklif etilgan. Ushbu yondashuv klassik va kvant kriptoanaliz usullariga nisbatan sinovdan o‘tkazilib, bardoshlilik ko‘rsatkichlari taqqoslandi. Tadqiqot muallifi tomonidan ishlab chiqilgan kalit generatsiyasi moduli Python tilida amalga oshirilib, ochiq manbali test muhitida sinovdan o‘tkazildi. Mazkur yechim zamonaviy post-kvant xavfsizlik talablariga mos innovatsion yondashuv sifatida tavsiya etiladi.
Files
Allanazarova D 180-183 ACU.pdf
Additional details
References
- 1. Shor, P. W. (1997). Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer. SIAM Journal on Computing, 26(5), 1484–1509.
- 2. Grover, L. K. (1996). A fast quantum mechanical algorithm for database search. Proceedings of the 28th Annual ACM Symposium on Theory of Computing, 212–219.
- 3. NIST SP 800-22. (2010). A Statistical Test Suite for Random and Pseudorandom Number Generators for Cryptographic Applications.
- 4. Menezes, A.J., van Oorschot, P.C., & Vanstone, S.A. (1996). Handbook of Applied Cryptography. CRC Press.
- 5. Bernstein, D. J., & Lange, T. (2017). Post-quantum cryptography. Nature, 549(7671), 188–194.