The Integer Factorization Algorithm With Pisano Period

Large integer factorization is one of the basic issues in number theory and is the subject of this paper. Our research shows that the Pisano period of the product of two prime numbers (or an integer multiple of it) can be derived from the two prime numbers themselves and their product, and we can th...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE access Ročník 7; s. 167250 - 167259
Hlavní autoři: Wu, Liangshun, Cai, H. J., Gong, Zexi
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway IEEE 2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Algorithms
Complexity
Cryptography
Curves
Elliptic curves
Factorization
Fibonacci
Fibonacci numbers
Fourier transforms
integer factorization
Integers
Nuclear magnetic resonance
Number theory
Pisano periods
Prime numbers
Qubit
RSA
ISSN:2169-3536, 2169-3536
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:Large integer factorization is one of the basic issues in number theory and is the subject of this paper. Our research shows that the Pisano period of the product of two prime numbers (or an integer multiple of it) can be derived from the two prime numbers themselves and their product, and we can therefore decompose the two prime numbers by means of the Pisano period of their product. We reduce the computational complexity of modulo operation through the "fast Fibonacci modulo algorithm" and design a stochastic algorithm for finding the Pisano periods of large integers. The Pisano period factorization method, which is proved to be slightly better than the quadratic sieve method and the elliptic curve method, consumes as much time as Fermat's method, the continued fractional factorization method and the Pollard p-1 method on small integer factorization cases. When factoring super-large integers, the Pisano period factorization method has shown as strong performance as subexponential complexity methods; thus, this method demonstrates a certain practicability. We suggest that this paper may provide a completely new idea in the area of integer factorization problems.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2169-3536
2169-3536
DOI:10.1109/ACCESS.2019.2953755