POST-KVANT KRIPTOGRAFIYA ASOSIDA POLINOMLAR BILAN SHIFRLASH
Kalit so‘zlar:
NTRU shifrlash, Post-quantum cryptography, Polinomlar bilan shifrlash, Kvantga chidamli algoritmlar, Xavfsiz kalit almashishAnnotatsiya
Ushbu maqolada NTRU (N-th degree Truncated Polynomial Ring) shifrlash
algoritmi taqdim etiladi va polinomlar yordamida shifrlash va deshifrlash jarayonlari
kengaytiriladi. Shifrlash va deshifrlash algoritmlarining ishlashi, tasodifiy polinomlar yaratish va
xabarlarni polinomlarga aylantirish orqali amalga oshiriladi. Maqolada NTRU algoritmining
kvantga chidamli xususiyatlari va u qanday qilib klassik RSA yoki elliptik egri algoritmlaridan
farq qilishi haqida muhokama qilinadi.
Manbalar
Stallings W. Cryptography and Network Security: Principles and Practice. – 7th ed. – Pearson Education, 2017.
Santosh R.K., Arumugam M.S., Edumnd M.B.W. Cryptography with NTRU Encryption: From Basic Principles to Practical Implementation // International Journal of Applied Cryptography. – 2021. – Vol. 12, No. 5. – P. 35–50.
Schnorr P. Security of NTRU and Its Applications to Cryptographic Systems // Journal of Cryptology. – 2016. – Vol. 25. – P. 452–487. DOI: 10.1007/s00145-015-9223-4.