An Efficient Method to Factorize the RSA Public Key Encryption

Ambedkar, Babasaheb; Gupta, Ashutosh; Gautam, Pratiksha; Bedi, S. S.

doi:10.1109/csnt.2011.29

Cited by 48 publications

(32 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In this algorithm, we only need to test out up to the square root of n, [11][12][13][14] meanwhile if suppose variable p is a factor, so q=N/p is also an alternative factor. If number of factors from 2… floor (√ N) (inclusive) are originate, the number is a prime.…”

Section: Trial Division Algorithmmentioning

confidence: 99%

Modified trial division algorithm using KNJ-factorization method to factorize RSA public key encryption

Lal

Singh

Kumar

2014

2014 International Conference on Contemporary Computing and Informatics (IC3I)

View full text Add to dashboard Cite

The security of RSA algorithm depends upon the positive integer N, which is the multiple of two precise large prime numbers. Factorization of such great numbers is a problematic process. There are many algorithms has been implemented in the past years. The offered KNJ -Factorization algorithm contributes a deterministic way to factorize RSA N=p*q. The algorithm limits the search by only considering the prime values. Subsequently prime numbers are odd numbers (apart from 2) accordingly it also requires smaller number steps to factorize RSA. In this paper, the anticipated algorithm is very simple besides it is very easy to understand and implement. The main concept of this KNJ-factorization algorithm is, to check only those factors which are odd and prime. The proposed KNJ-Factorization algorithm works very efficiently on those factors; which are adjoining and close to √N. The proposed factorization method can speed up if we can reduce the time for primality testing. It fundamentally decreases the time complexity.

show abstract

Section: Trial Division Algorithmmentioning

confidence: 99%

Modified trial division algorithm using KNJ-factorization method to factorize RSA public key encryption

Lal

Singh

Kumar

2014

2014 International Conference on Contemporary Computing and Informatics (IC3I)

View full text Add to dashboard Cite

show abstract

“…B R Ambedkar et al [2] proposed the method modified from Fermat factorization. This method can finish all trivial and nontrivial value of n, called Modified Fermat Factorization (MFF).…”

Section: Introductionmentioning

confidence: 99%

“…Recently, there are many factorization algorithms such as Trial division algorithm [8], Fermat factorization algorithm [2,3] and Monte Carlo factorization algorithm [8]. Trial division is the simplest factorization algorithm [7].…”

Section: Introductionmentioning

confidence: 99%

MFFV2 and MNQSV2: Improved Factorization Algorithms

Somsuk

Kasemvilas

2013

2013 International Conference on Information Science and Applications (ICISA)

View full text Add to dashboard Cite

we propose a method to decrease processing time for two factorization algorithms. One is Modified Fermat Factorization Version 2 (MFFV2) modified from Modified Fermat Factorization (MFF). The other is Modified Non -sieving Quadratic Sieve Version 2 (MNQSV2) modified from Modified Non -Sieving Quadratic Sieve (MNQS). A key concept of this method is to decrease processing time to compute an integer's square root. This method can be used with all factorization algorithms which the modulus is written as the difference of squares. The experiments showed that the speed of MFFV2 increases when compares with MFF and the speed of MNQSV2 increases when compares with MNQS. In addition, if two primes' differences are small, the factorization speed of MNQSV2 is faster than the factorization speed of MFFV2.

show abstract

“…However, the algorithm remains vulnerable to the factorization attack based on the value of modulo 'n' [11]- [15]. Factoring of the modulo reveals the two prime numbers, p, and q, which, together with the public key 'e', exposes the private key that needed for the decryption of messages [16], [17] of the modulo and several studies have also been done to secure the public key 'e' to provide another security barrier [12], [13], [18], [19].…”

Section: Introductionmentioning

confidence: 99%

Modified Key Generation in RSA Algorithm

Intila¹,

Gerardo²,

Medina³

2019

IJRTE

View full text Add to dashboard Cite

Abstract: RSA Algorithm is one of the widely used asymmetric cryptography. But with several conducts of the different studies, factorization attack based on the value of modulo 'n' and based on the public key, the value of the private key is vulnerable. With this, the study modified the RSA Algorithm based on modulo and the public key. The modulo transformed into a new value that produced a compound result in the factorization process. At the same time, the public key has been modified by choosing randomly from collected values and transformed to a different value making it a better-hidden private key. The two algorithms compared in terms of factorization, encryption and decryption, and speed . The modification of the RSA Algorithm based on modulo and public key produced a new two-tier scheme in terms of factorization, and encryption and decryption process. The new scheme in the result is resistant to factorization and has a new scheme of private key hiding.

show abstract

An Efficient Method to Factorize the RSA Public Key Encryption

Cited by 48 publications

References 4 publications

Modified trial division algorithm using KNJ-factorization method to factorize RSA public key encryption

Modified trial division algorithm using KNJ-factorization method to factorize RSA public key encryption

MFFV2 and MNQSV2: Improved Factorization Algorithms

Modified Key Generation in RSA Algorithm

Contact Info

Product

Resources

About