the Algorithm for determining the secret key of the RSA encryption algorithm: Algorithm for determining the secret key of the RSA encryption algorithm

Rahmatullayev, Ilhom, Boyquziyev, Ilxom, Axadova, O‘g‘iloy

Al-Farg'oniy avlodlari · 2024-yil

Annotatsiya

This article proposes an algorithm for determining the secret key using the public key of the RSA encryption algorithm, which belongs to the group of asymmetric encryption algorithms. The effectiveness of the proposed algorithm depends on the complexity of dividing the interval (a, b) into smaller intervals as possible and determining the interval in which the sought numbers p and q are located. This algorithm differs in efficiency from many algorithms known to date.

Maqola ma’lumotlari
MualliflarRahmatullayev, Ilhom, Boyquziyev, Ilxom, Axadova, O‘g‘iloy
JurnalAl-Farg'oniy avlodlari
Nashr sanasi2024-06-05
Son2
Betlar61-67
TilRus

Kalit so‘zlar

RSA, функция Эйлера, математическая сложность, простые числа, факторизация, RSA, Euler's function, mathematical complexity, prime numbers, factorization, RSA, Eyler funksiyasi, matematik murakkablik, tub sonlar, faktorizatsiya

Ilmiy soha

Al-Farg'oniy avlodlari jurnalidan boshqa maqolalar

Al-Farg'oniy avlodlari — barcha maqolalar