POST-KVANT KRIPTOGRAFIYA ASOSIDA POLINOMLAR BILAN SHIFRLASH

Muhamediyeva D.T; Raupova M

POST-KVANT KRIPTOGRAFIYA ASOSIDA POLINOMLAR BILAN SHIFRLASH

Authors

Muhamediyeva D.T ”Toshkent irrigatsiya va qishloq xoʻjaligini mexanizatsiyalash muhandislari instituti” Milliy tadqiqot universiteti
Raupova M Chirchiq davlat pedagogika universiteti

Keywords:

NTRU shifrlash, Post-quantum cryptography, Polinomlar bilan shifrlash, Kvantga chidamli algoritmlar, Xavfsiz kalit almashish

Abstract

This paper presents the NTRU (N-th degree Truncated Polynomial Ring)
encryption algorithm and extends the encryption and decryption processes using polynomials. The
encryption and decryption algorithms work by generating random polynomials and converting
messages into polynomials. The paper discusses the quantum-resistant properties of the NTRU
algorithm and how it differs from classical RSA or elliptic curve algorithms.

References

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.

POST-KVANT KRIPTOGRAFIYA ASOSIDA POLINOMLAR BILAN SHIFRLASH