Factoring RSA Modulus with Primes not Necessarily Sharing Least Significant Bits

Bahig, Hatem M.; Nassr, Dieaa I.; Bhery, Ashraf

doi:10.18576/amis/110130

Cited by 6 publications

(3 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…There are more factoring techniques, but they require more knowledge of cryptosystems or specific requirements for the prime factors (see [1,3,4,19]). Utilizing highperformance-Computing systems such as multicore systems [6,7,13,15], cloud computing systems [28], and graphics processing units [2,8] is one method for accelerating factoring algorithms.…”

Section: Of 11mentioning

confidence: 99%

See 1 more Smart Citation

Accelerating the Wheel Factoring Techniques

Zaki¹,

Bakr²,

Alsahangiti³

et al. 2023

Preprint

View full text Add to dashboard Cite

The efficiency with which an integer may be factored into its prime factors determines several public key cryptosystems′ security in use today. Although there is a quantum-based technique with a polynomial time for integer factoring, on a traditional computer, there is no polynomial time algorithm. We investigate how to enhance the wheel factoring technique in this paper. Current wheel factorization algorithms rely on a very restricted set of prime integers as a base. In this study, we intend to adapt this notion to rely on a greater number of prime integers, resulting in a considerable improvement in the execution time. The experiments on composite numbers n reveal that the proposed algorithm improves on the existing wheel factoring algorithm by about 75%

show abstract

Section: Of 11mentioning

confidence: 99%

“…Recently, subexponential-time factoring methods utilizing binary decision and the Pisano period were proposed by Raddum, Varadharajan, and Wu [14] and Wu et al [29], respectively. The number field sieve method with time complexity of e +o(1)) (ln n) 1 3 (ln ln n)…”

Section: Introductionmentioning

confidence: 99%

Accelerating the Wheel Factoring Techniques

Zaki¹,

Bakr²,

Alsahangiti³

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…Therefore, solving this problem in an efficient timeframe leads to breaking the RSA. In other side, the difficulty in finding a polynomial time for the factorization leads to difficulty in breaking the RSA cryptosystem [6,7,8,9]. Moreover, the integer factorization problem is important from the point of view of complexity theory.…”

Section: = Modmentioning

confidence: 99%