Comment on “An Enhanced and Secured RSA Key Generation Scheme (ESRKGS)”

详细信息    查看全文

• 作者：Erkam Lü ; y^a ; Zekeriya Y. Karatas^b ; ^{zkaratas@mytu.tuskegee.edu" class="auth_mail" title="E-mail the corresponding author} ; Huseyin Ergin^c
• 关键词：Cryptanalysis ; RSA algorithm ; Public key ; Private key ; Encryption
• 刊名：Journal of Information Security and Applications
• 出版年：2016
• 出版时间：October 2016
• 年：2016
• 卷：30
• 期：Complete
• 页码：1-2
• 全文大小：355 K

文摘

In this article, we do the cryptanalysis of the Enhanced and Secured RSA Key Generation Scheme (ESRKGS) given in Thangavel et al. (2015). The authors claimed that ESRKGS is a highly secure and not easily breakable scheme compared to the traditional RSA scheme. In their scheme, the public key n is a product of two large prime numbers, but the values of Encryption E and Decryption D keys are based on the product of four large prime numbers, N, which is a multiple of n. They claimed that even if someone factorizes n, in order to obtain the private key D, brute force must be used to obtain the other two primes.

We prove that we can use an alternative private key D₁ to break the system. Someone does not need to employ brute force to break the system when n is factored. Hence, ESRKGS has the same security level as the traditional RSA.