Zobrazeno 1 - 3
of 3
pro vyhledávání: '"Saıdu ISAH ABUBAKAR"'
Publikováno v:
Cryptography, Vol 3, Iss 1, p 2 (2018)
This paper presents new short decryption exponent attacks on RSA, which successfully leads to the factorization of RSA modulus N = p q in polynomial time. The paper has two parts. In the first part, we report the usage of the small prime difference m
Externí odkaz:
https://doaj.org/article/6e6be974c7b74e97b1fc09efa1befe04
Publikováno v:
Journal of Mathematical Sciences and Modelling, Vol 6, Iss 1, Pp 1-6 (2023)
This paper presents a cryptanalysis attack on the RSA variant with modulus $N=p^rq$ for $r\geq 2$ with three public and private exponents $(e_1,d_1),$ $(e_2,d_2),$ $(e_3,d_3)$ sharing the same modulus $N$ where $p$ and $q$ are consider to prime havin
Externí odkaz:
https://doaj.org/article/658caab3db3b4d529f8f5223003086ba
Publikováno v:
Volume: 6, Issue: 1 1-6
Journal of Mathematical Sciences and Modelling
Journal of Mathematical Sciences and Modelling
This paper presents a cryptanalysis attack on the RSA variant with modulus $N=p^rq$ for $r\geq 2$ with three public and private exponents $(e_1,d_1),$ $(e_2,d_2),$ $(e_3,d_3)$ sharing the same modulus $N$ where $p$ and $q$ are consider to prime havin