FURE algoritmi orqali post-kvant xavfsizlik tizimlarining xavfsizligini oshirish
DOI:
https://doi.org/10.5281/zenodo.14910585Keywords:
kvant axborot nazariyasi, kvantdan keyingi kriptografiya, tezkor unitar tasodifiy kodlash, kalit taqsimotini kvantlash.Abstract
Kvant hisoblash texnologiyasining rivojlanishi bilan klassik kriptografik tizimlarning zaifligi oshmoqda.
Ayniqsa, Shor algoritmi [1] kabi kvant hujumlari RSA va ECC kabi tizimlarni buzish imkoniyatiga ega. Shu sababli, postkvant
kriptografiyasi (PQC) sohasida yangi algoritmlar ishlab chiqilmoqda. Ushbu maqola FURE (Fast Unitary Random
Encoding) algoritmini post-kvant xavfsizlikni oshirish vositasi sifatida ko‘rib chiqadi. FURE algoritmi unitar kodlash va
tasodifiy unitar transformatsiyalar yordamida ma’lumotlarni himoya qilishga asoslangan bo‘lib, kvant hujumlariga qarshi
sezgirlik, interferensiya va tasodifiy Fourier transformatsiyasi kabi himoya mexanizmlarini taklif etadi. Tadqiqot natijalari
FURE algoritmining post-kvant xavfsizlikni ta’minlashda istiqbolli ekanligini ko‘rsatmoqda, ammo uning keng qo‘llanilishi
uchun qo‘shimcha tadqiqotlar talab etiladi.
References
Shor, P. W. (1999). Polynomial-Time Algorithms for Prime Factorization and Discrete Logarithms on a Quantum
Computer.
National Institute of Standards and Technology (NIST). Post-Quantum Cryptography Standardization.
FURE Algoritmi: Fast Unitary Random Encoding for Quantum-Resistant Security.
Alagic, M., et al. “Post-Quantum Cryptography Based on QC-MDPC McEliece and FURE Randomness Extraction.”
Designs, Codes and Cryptography, 2020.
D’Anvers, J.P., et al. “High-Throughput Software Implementation of the FURE Hash Function.” International Workshop
on Cryptographic Hardware and Embedded Systems (CHES), 2017.
Downloads
Published
Issue
Section
License
Copyright (c) 2025 YASHIL IQTISODIYOT VA TARAQQIYOT
This work is licensed under a Creative Commons Attribution 4.0 International License.