MODERN POSTQUANTUM CRYPTOGRAPHIC ALGORITHMS AND THEIR EFFICIENCY

Arabboyev, Alisher, Абдурахимов , Бахтиёр, Бойкузиев , Илхом

Al-Farg'oniy avlodlari · 2025-yil

Annotatsiya

The development of quantum computers has serious implications for cryptography. Most symmetric and asymmetric cryptographic algorithms are vulnerable to quantum algorithms. The Grover search algorithm improves the efficiency of finding the key in symmetric schemes such as AES and 3DES in square root of time. The security of asymmetric algorithms such as RSA, Diffie-Hellman, and Elliptic Curve Cryptosystems (ECC) is based on the mathematical difficulty of prime factorization and discrete logarithm problems. The best available classical algorithms take exponential time. The Shor factorization algorithm solves these problems in polynomial time.

Maqola ma’lumotlari
MualliflarArabboyev, Alisher, Абдурахимов , Бахтиёр, Бойкузиев , Илхом
JurnalAl-Farg'oniy avlodlari
Nashr sanasi2025-09-17
Son3
Betlar29-36
TilRus

Kalit so‘zlar

квантовые компьютеры, симметричные и асимметричные алгоритмы, алгоритм Шора и Гровера, постквантовые криптографические алгоритмы, quantum computers, symmetric and asymmetric algorithms, Shor and Grover algorithm, Post-quantum cryptographic algorithms, kvant kompyuterlar, simmetrik va asimmetrik algoritmlar, Shor va Grover algoritmi, Post-kvant kriptografik algoritmlar

Ilmiy soha

Al-Farg'oniy avlodlari jurnalidan boshqa maqolalar

Al-Farg'oniy avlodlari — barcha maqolalar