the Mathematical Foundations of Asymmetric Algorithms Based on Elliptic Curves and Problems of Their Application: Mathematical Foundations of Asymmetric Algorithms Based on Elliptic Curves and Problems of Their Application

Saydullayev, Eldorjon, Rahmatullayev, Ilhom, Boyquziyev, Ilxom, Umurzakov, Oybek

Al-Farg'oniy avlodlari · 2024-yil

Annotatsiya

This paper analyzes the mathematical foundations of the transfer of asymmetric cryptographic algorithms to elliptic curves and their applications. Asymmetric cryptography, such as RSA and Diffie-Hellman algorithms, have long been used in secure communication and data protection. However, due to the large key length and computational complexity, these systems become difficult to apply in resource-constrained environments. Elliptic curve cryptography (ECC) has emerged as an effective solution to these problems. ECC provides a high level of security in a small key length. The article describes in detail the mathematical basis of ECC algorithms, their security advantages and their practical application.

Maqola ma’lumotlari
MualliflarSaydullayev, Eldorjon, Rahmatullayev, Ilhom, Boyquziyev, Ilxom, Umurzakov, Oybek
JurnalAl-Farg'oniy avlodlari
Nashr sanasi2024-10-20
Son3
Betlar101-108
TilRus

Kalit so‘zlar

Asimmetrik kriptografiya, Elliptik egri chiziqlar, Diskret logarifm, El-Gamal shifrlash algoritmi, Xavfsizlik, Kalit uzunligi, Matematik murakkablik, Diffie-Hellman, ECC (Elliptik Egri Chiziqlar Kriptografiyasi), Asimmetrik kriptografiya, Elliptik egri chiziqlar, Diskret logarifm, El-Gamal shifrlash algoritmi, Xavfsizlik, Kalit uzunligi, Matematik murakkablik, Diffie-Hellman, ECC

Ilmiy soha

Al-Farg'oniy avlodlari jurnalidan boshqa maqolalar

Al-Farg'oniy avlodlari — barcha maqolalar