IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i5p1203-d1084321.html
   My bibliography  Save this article

Acceleration of Wheel Factoring Techniques

Author

Listed:
  • Alaa M. Zaki

    (Computer Science Department, Faculty of Science, Minia University, Minia 61519, Egypt)

  • M. E. Bakr

    (Department of Statistics and Operations Research, College of Science, King Saud University, P.O. Box 2455, Riyadh 11451, Saudi Arabia)

  • Arwa M. Alsahangiti

    (Department of Statistics and Operations Research, College of Science, King Saud University, P.O. Box 2455, Riyadh 11451, Saudi Arabia)

  • Saima Khan Khosa

    (Department of Mathematics and Statistics, University of Saskatchewan, Saskatoon, SK S7N 5A2, Canada)

  • Khaled A. Fathy

    (Department of Mathematics, Faculty of Science, Al-Azhar University, Nasr City 11884, Egypt)

Abstract

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 % .

Suggested Citation

  • Alaa M. Zaki & M. E. Bakr & Arwa M. Alsahangiti & Saima Khan Khosa & Khaled A. Fathy, 2023. "Acceleration of Wheel Factoring Techniques," Mathematics, MDPI, vol. 11(5), pages 1-11, March.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:5:p:1203-:d:1084321
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/5/1203/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/5/1203/
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:5:p:1203-:d:1084321. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.