Skip to main content
SpringerLink
Log in

Speeding up wheel factoring method

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

The security of many public key cryptosystems that are used today depends on the difficulty of factoring an integer into its prime factors. Although there is a polynomial time quantum-based algorithm for integer factorization, there is no polynomial time algorithm on a classical computer. In this paper, we study how to improve the wheel factoring method using two approaches. The first approach is introducing two sequential modifications on the wheel factoring method. The second approach is parallelizing the modified algorithms on a parallel system. The experimental studies on composite integers n that are a product of two primes of equal size show the following results. (1) The percentages of improvements for the two modified sequential methods compared to the wheel factoring method are almost \(47\%\) and \(90\%\). (2) The percentage of improvement for the two proposed parallel methods compared to the two modified sequential algorithms is \(90\%\) on the average. (3) The maximum speedup achieved by the best parallel proposed algorithm using 24 threads is almost 336 times the wheel factoring method.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Akchiche O, Khadir O (2018) Factoring rsa moduli with primes sharing bits in the middle. Appl Algebra Eng. Commun. Comput. 29(3):245–259

    Article  MathSciNet  Google Scholar 

  2. Atanassov E, Georgiev D, Manev N (2014) Number theory algorithms on gpu clusters. 2:131–138

  3. Bahig HM, Nassr DI, Bhery A (2017) Factoring rsa modulus with primes not necessarily sharing least significant bits. Appl Math Inform Sci 11:243–249

    Article  Google Scholar 

  4. Bahig HM, Nassr DI, Bhery A, Nitaj A (2020) A unified method for private exponent attacks on rsa using lattices. Int J Found Comput Sci 31(2):207–231

    Article  MathSciNet  Google Scholar 

  5. Bahig HM, Mohammed A, Khaled A, AlGhadhban A, Bahig HM (2020) Performance analysis of fermat factorization algorithms. Int J Adv Comput Sci Appl 11(12):340–350

    Google Scholar 

  6. Bahig HM, Bahig HM, Kotb Y (2020) Fermat factorization using a multi-core system. Int J Adv Comput Sci Appl 11(4)

  7. Brent RP (1999) Some parallel algorithms for integer factorisation. In: Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), volume 1685 LNCS, pages 1–22

  8. Durmuş O, Çabuk UC, Dalkiliç F(2020) A study on the performance of base-m polynomial selection algorithm using gpu

  9. Fathy K, Bahig H, Farag M (2018) Speeding up multi- exponentiation algorithm on a multicore system. J Egypt Math Soc 26

  10. Fathy KA, Bahig HM, Ragab AA (2018) A fast parallel modular exponentiation algorithm. Arab J Sci Eng 43

  11. Fujioka A, Suzuki K, Xagawa K, Yoneyama K (2015) Strongly secure authenticated key exchange from factoring, codes, and lattices. Design Codes Cryptogr 76:469–504

    Article  MathSciNet  Google Scholar 

  12. GMP. library, gnu multiple precision arithmetic library. https://gmplib.org/

  13. Gulida KR, Ultanov IR (2017) Comparative analysis of integer factorization algorithms using cpu and gpu. MANAS J Eng 5:53–63

    Google Scholar 

  14. Varadharajan S, Raddum H (2019) Factorization using binary decision diagrams. Cryptogr Commun 11:443–460

    Article  MathSciNet  Google Scholar 

  15. Koundinya AK, Harish G, Srinath NK, Raghavendra GE, Pramod YV, Sandeep R, Punith KG (2013) Performance analysis of parallel pollard’s rho factoring algorithm. Int J Comput Sci Inform Technol 5

  16. Lenstra AK (2000) Integer factoring. Designs Codes Cryptogr 19:101–128

    Article  MathSciNet  Google Scholar 

  17. Menezes AJ, Katz J, van Oorschot PC, Vanstone SA (1996) Handbook of Applied Cryptography. CRC Press

  18. Montgomery PL (1994) A survey of modern integer factorization algorithms. CWI Quart 7:337–366

    MathSciNet  MATH  Google Scholar 

  19. Nassr DI, Bahig HM, Bhery A, Daoud SS (2008) A new rsa vulnerability using continued fractions. In AICCSA 08 - 6th IEEE/ACS International Conference on Computer Systems and Applications, pages 694–701

  20. Nimbalkar AB (2018) The digital signature schemes based on two hard problems: factorization and discrete logarithm. In: In: Bokhari M, Agrawal N, Saini D (eds) Cyber Security, volume 729 of Advances in Intelligent Systems and Computing, pages 493–498

  21. OpenMP. https://www.openmp.org/

  22. Peng WC, Wang BN, Hu F, Wang YJ, Fang XJ, Chen XY, Wang C (2019) Factoring larger integers with fewer qubits via quantum annealing with optimized parameters. Sci China Phys Mech Astron 62:60311

    Article  Google Scholar 

  23. Poulakis D (2009) A public key encryption scheme based on factoring and discrete logarithm. J Discrete Math Sci Cryptogr 12:745–752

    Article  MathSciNet  Google Scholar 

  24. Pritchard P (1982) Explaining the wheel sieve. Acta Inform 17:477–485

    Article  MathSciNet  Google Scholar 

  25. Rivest RL, Shamir A, Adleman LM (1978) A method for obtaining digital signatures and public key cryptosystems. Commun ACM, pp 120–126

  26. Rubinstein-Salzedo S (2018) Clever factorization algorithms and primality testing

  27. Shor PW (1997) Polynomial-time algorithms for prime factorization and discrete logarithms on a quantum computer. SIAM J Comput 26:1484–1509

    Article  MathSciNet  Google Scholar 

  28. Valenta L, Cohney S, Liao A, Fried J, Bodduluri S, Heninger N (2017) Factoring as a service. In: In: Grossklags J, Preneel B (eds) Financial cryptography and data security. FC 2016., volume LNCS 9603 of Lecture Notes in Computer Science, pp 321–338

  29. Liangshun W, Cai HJ, Gong Z (2019) The integer factorization algorithm with pisano period. IEEE Access 7:167250–167259

    Article  Google Scholar 

  30. Yan SY (2009) Primality testing and integer factorization in public-key cryptography, volume 11 of advances in information security. Springer

  31. Yan SY (2019) Factoring Based Cryptography, pages 217–286

  32. Yan SY, James G (2006) Can integer factorization be in p? In: 2006 International Conference on Computational Inteligence for Modelling Control and Automation and International Conference on Intelligent Agents Web Technologies and International Commerce (CIMCA’06), pp 266–266

Download references

Acknowledgements

This research has been funded by Scientific Research Deanship at University of Ha’il - Saudi Arabia through project number RG-21 124.

Author information

Authors and Affiliations

  1. Information and Computer Science Department, College of Computer Science and Engineering, University of Ha’il, Hail, Kingdom of Saudi Arabia

    Hazem M. Bahig, Mohammed A. Mahdi & Mohamed A. G. Hazber

  2. Computer Science Division, Mathematics Department, Faculty of Science, Ain Shams University, Cairo, Egypt

    Hazem M. Bahig, Dieaa I. Nassr & Hatem M. Bahig

  3. Computer Engineering Department, College of Computer Science and Engineering, University of Ha’il, Hail, Kingdom of Saudi Arabia

    Khaled Al-Utaibi

Authors
  1. Hazem M. Bahig
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Dieaa I. Nassr
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mohammed A. Mahdi
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Mohamed A. G. Hazber
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Khaled Al-Utaibi
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Hatem M. Bahig
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hazem M. Bahig.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Bahig, H.M., Nassr, D.I., Mahdi, M.A. et al. Speeding up wheel factoring method. J Supercomput 78, 15730–15748 (2022). https://doi.org/10.1007/s11227-022-04470-y

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-022-04470-y

Keywords

Search

Navigation