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

Full description

Saved in:

Bibliographic Details
Published in:	IEEE access Vol. 7; pp. 167250 - 167259
Main Authors:	Wu, Liangshun, Cai, H. J., Gong, Zexi
Format:	Journal Article
Language:	English
Published:	Piscataway IEEE 2019 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	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
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!