Article
Version 1
Preserved in Portico This version is not peer-reviewed
Accelerating the Wheel Factoring Techniques
Version 1
: Received: 3 February 2023 / Approved: 10 February 2023 / Online: 10 February 2023 (07:43:56 CET)
A peer-reviewed article of this Preprint also exists.
Zaki, A.M.; Bakr, M.E.; Alsahangiti, A.M.; Khosa, S.K.; Fathy, K.A. Acceleration of Wheel Factoring Techniques. Mathematics 2023, 11, 1203. Zaki, A.M.; Bakr, M.E.; Alsahangiti, A.M.; Khosa, S.K.; Fathy, K.A. Acceleration of Wheel Factoring Techniques. Mathematics 2023, 11, 1203.
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%
Keywords
Integer factorization; Wheel factorization; Cryptography
Subject
Computer Science and Mathematics, Computational Mathematics
Copyright: This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Comments (0)
We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.
Leave a public commentSend a private comment to the author(s)
* All users must log in before leaving a comment
