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...
Uloženo v:
| Vydáno v: | IEEE access Ročník 7; s. 167250 - 167259 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Piscataway
IEEE
2019
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Témata: | |
| 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!
|
| Abstract | 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. |
|---|---|
| AbstractList | 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. |
| Author | Cai, H. J. Gong, Zexi Wu, Liangshun |
| Author_xml | – sequence: 1 givenname: Liangshun orcidid: 0000-0001-6183-4680 surname: Wu fullname: Wu, Liangshun organization: School of Computer Science, Wuhan University, Wuhan, China – sequence: 2 givenname: H. J. orcidid: 0000-0002-3477-8334 surname: Cai fullname: Cai, H. J. email: hjcai@whu.edu.cn organization: School of Computer Science, Wuhan University, Wuhan, China – sequence: 3 givenname: Zexi surname: Gong fullname: Gong, Zexi organization: Zall Smart Commerce Research Institute, Wuhan, China |
| BookMark | eNp9kE9PAjEQxRuDiYh8Ai6beF7s9s92eyQElIREEzAem7bbhZJli91y0E9vYdEYD86hM5289zL53YJe4xoDwCiD4yyD_GEync5WqzGCGR8jTjGj9Ar0UZbzFFOc937NN2DYtjsYq4gryvogX29NsmiC2RifzKUOzttPGaxrkkm9iZ-w3Sdv8U1ebCsbl7wYb115B64rWbdmeOkD8DqfradP6fL5cTGdLFNNYBHSjGS64rqAmvGqRNgwpiqmtIG0JEghqnGFiC4hZhhToiiixUkOpTZ5qSAegEWXWzq5Ewdv99J_CCetOC-c3wjpg9W1EVSZIteKYFjBGMml0qVWPJcQKcI4i1n3XdbBu_ejaYPYuaNv4vkCEUpzQiLCqOKdSnvXtt5UQttwBhK8tLXIoDhRFx11caIuLtSjF__xfl_8v2vUuawx5sdR8KhhDH8B_QiOxw |
| CODEN | IAECCG |
| CitedBy_id | crossref_primary_10_1007_s11227_022_04470_y crossref_primary_10_3390_jcp4010003 crossref_primary_10_3390_jcp1040033 crossref_primary_10_3390_s21144714 crossref_primary_10_1007_s11128_021_03257_z crossref_primary_10_3390_math11051203 |
| Cites_doi | 10.1038/srep03023 10.1007/3-540-39757-4_17 10.1017/S0305004100049252 10.1016/j.ajmsc.2017.06.002 10.1080/00029890.1960.11989541 10.1007/s11433-017-9181-9 10.1038/s41598-018-36058-z 10.1007/s11433-018-9307-1 10.1007/978-1-4612-4476-9_3 10.1007/BFb0091534 10.2307/1971363 10.1109/SFCS.1994.365700 10.1126/science.359.6374.381 10.3724/SP.J.1087.2010.01026 10.1145/3207677.3278049 |
| ContentType | Journal Article |
| Copyright | Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019 |
| Copyright_xml | – notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2019 |
| DBID | 97E ESBDL RIA RIE AAYXX CITATION 7SC 7SP 7SR 8BQ 8FD JG9 JQ2 L7M L~C L~D DOA |
| DOI | 10.1109/ACCESS.2019.2953755 |
| DatabaseName | IEEE Xplore (IEEE) IEEE Xplore Open Access (Activated by CARLI) IEEE All-Society Periodicals Package (ASPP) 1998–Present IEEE Electronic Library (IEL) CrossRef Computer and Information Systems Abstracts Electronics & Communications Abstracts Engineered Materials Abstracts METADEX Technology Research Database Materials Research Database ProQuest Computer Science Collection Advanced Technologies Database with Aerospace Computer and Information Systems Abstracts Academic Computer and Information Systems Abstracts Professional DOAJ Directory of Open Access Journals |
| DatabaseTitle | CrossRef Materials Research Database Engineered Materials Abstracts Technology Research Database Computer and Information Systems Abstracts – Academic Electronics & Communications Abstracts ProQuest Computer Science Collection Computer and Information Systems Abstracts Advanced Technologies Database with Aerospace METADEX Computer and Information Systems Abstracts Professional |
| DatabaseTitleList | Materials Research Database |
| Database_xml | – sequence: 1 dbid: DOA name: DOAJ Directory of Open Access Journals url: https://www.doaj.org/ sourceTypes: Open Website – sequence: 2 dbid: RIE name: IEEE Xplore Digital Libary (IEL) url: https://ieeexplore.ieee.org/ sourceTypes: Publisher |
| DeliveryMethod | fulltext_linktorsrc |
| Discipline | Engineering |
| EISSN | 2169-3536 |
| EndPage | 167259 |
| ExternalDocumentID | oai_doaj_org_article_5be86cb430f04cd9abcdcb96a02b4797 10_1109_ACCESS_2019_2953755 8901977 |
| Genre | orig-research |
| GrantInformation_xml | – fundername: National Natural Science Foundation of China grantid: 61832014 funderid: 10.13039/501100001809 |
| GroupedDBID | 0R~ 4.4 5VS 6IK 97E AAJGR ABAZT ABVLG ACGFS ADBBV AGSQL ALMA_UNASSIGNED_HOLDINGS BCNDV BEFXN BFFAM BGNUA BKEBE BPEOZ EBS EJD ESBDL GROUPED_DOAJ IPLJI JAVBF KQ8 M43 M~E O9- OCL OK1 RIA RIE RNS AAYXX CITATION 7SC 7SP 7SR 8BQ 8FD JG9 JQ2 L7M L~C L~D RIG |
| ID | FETCH-LOGICAL-c408t-141cf9c80c79fd23e77bf7bce05d42b25c3f24cd0373354b52589c800ace6db03 |
| IEDL.DBID | RIE |
| ISICitedReferencesCount | 7 |
| ISICitedReferencesURI | http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000509585900088&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| ISSN | 2169-3536 |
| IngestDate | Tue Oct 14 18:58:40 EDT 2025 Mon Jun 30 07:00:34 EDT 2025 Tue Nov 18 22:15:43 EST 2025 Sat Nov 29 02:41:33 EST 2025 Wed Aug 27 02:44:45 EDT 2025 |
| IsDoiOpenAccess | true |
| IsOpenAccess | true |
| IsPeerReviewed | true |
| IsScholarly | true |
| Language | English |
| License | https://creativecommons.org/licenses/by/4.0/legalcode |
| LinkModel | DirectLink |
| MergedId | FETCHMERGED-LOGICAL-c408t-141cf9c80c79fd23e77bf7bce05d42b25c3f24cd0373354b52589c800ace6db03 |
| Notes | ObjectType-Article-1 SourceType-Scholarly Journals-1 ObjectType-Feature-2 content type line 14 |
| ORCID | 0000-0002-3477-8334 0000-0001-6183-4680 |
| OpenAccessLink | https://ieeexplore.ieee.org/document/8901977 |
| PQID | 2455644201 |
| PQPubID | 4845423 |
| PageCount | 10 |
| ParticipantIDs | doaj_primary_oai_doaj_org_article_5be86cb430f04cd9abcdcb96a02b4797 proquest_journals_2455644201 crossref_citationtrail_10_1109_ACCESS_2019_2953755 ieee_primary_8901977 crossref_primary_10_1109_ACCESS_2019_2953755 |
| PublicationCentury | 2000 |
| PublicationDate | 20190000 2019-00-00 20190101 2019-01-01 |
| PublicationDateYYYYMMDD | 2019-01-01 |
| PublicationDate_xml | – year: 2019 text: 20190000 |
| PublicationDecade | 2010 |
| PublicationPlace | Piscataway |
| PublicationPlace_xml | – name: Piscataway |
| PublicationTitle | IEEE access |
| PublicationTitleAbbrev | Access |
| PublicationYear | 2019 |
| Publisher | IEEE The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Publisher_xml | – name: IEEE – name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| References | ref13 yuan (ref17) 2007; 3 ref15 gidney (ref11) 2018 ref14 zhou (ref19) 2016 wang (ref1) 2016; 43 ref10 wei (ref9) 2018 burges (ref12) 2002 ref16 pei (ref24) 2015 ref23 koblitz (ref3) 2009 ref20 ref22 ref21 chen (ref25) 1993 zhu (ref18) 1989; 23 pomerance (ref4) 1984; 209 ref8 ref7 ref6 ref5 guo (ref2) 2009; 17 |
| References_xml | – ident: ref10 doi: 10.1038/srep03023 – volume: 209 start-page: 169 year: 1984 ident: ref4 article-title: The quadratic sieve factoring algorithm publication-title: Advances Cryptology doi: 10.1007/3-540-39757-4_17 – ident: ref5 doi: 10.1017/S0305004100049252 – start-page: 123 year: 1993 ident: ref25 publication-title: Linear Networks and Systems – ident: ref20 doi: 10.1016/j.ajmsc.2017.06.002 – start-page: 227 year: 2016 ident: ref19 publication-title: Fibonacci-Lucas Sequences Its Application – ident: ref16 doi: 10.1080/00029890.1960.11989541 – year: 2009 ident: ref3 publication-title: A Course in Number Theory and Cryptography – year: 2018 ident: ref9 article-title: Efficient universal quantum channel simulation in IBM's cloud quantum computer publication-title: Science China Physics Mechanics & Astronomy doi: 10.1007/s11433-017-9181-9 – ident: ref13 doi: 10.1038/s41598-018-36058-z – ident: ref14 doi: 10.1007/s11433-018-9307-1 – ident: ref23 doi: 10.1007/978-1-4612-4476-9_3 – ident: ref7 doi: 10.1007/BFb0091534 – year: 2018 ident: ref11 article-title: Factoring with n+2 clean qubits and n-1 dirty qubits publication-title: arXiv 1706 07884 – volume: 17 start-page: 29 year: 2009 ident: ref2 article-title: RSA algorithm and its challenges publication-title: Journal of Henan College of Electrical and Mechanical – ident: ref6 doi: 10.2307/1971363 – volume: 43 start-page: 24 year: 2016 ident: ref1 article-title: New quantum algorithm for breaking RSA publication-title: Comput Sci – ident: ref8 doi: 10.1109/SFCS.1994.365700 – ident: ref15 doi: 10.1126/science.359.6374.381 – ident: ref21 doi: 10.3724/SP.J.1087.2010.01026 – ident: ref22 doi: 10.1145/3207677.3278049 – volume: 23 start-page: 327 year: 1989 ident: ref18 article-title: Fibonacci numbers and $GL(2,F _{p})$ publication-title: Journal of Central China Normal University (Nat Sci ) – year: 2015 ident: ref24 publication-title: Algorithmic Number Theory – year: 2002 ident: ref12 article-title: Factoring as optimization – volume: 3 start-page: 119 year: 2007 ident: ref17 article-title: The Periodicity of Fibonacci modulus sequence publication-title: Math Pract Theory |
| SSID | ssj0000816957 |
| Score | 2.1778655 |
| Snippet | 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... |
| SourceID | doaj proquest crossref ieee |
| SourceType | Open Website Aggregation Database Enrichment Source Index Database Publisher |
| StartPage | 167250 |
| SubjectTerms | 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 |
| SummonAdditionalLinks | – databaseName: DOAJ Directory of Open Access Journals dbid: DOA link: http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwrV07b9swECYCo0MyBG3SImrdQkPGqKH4EMnRNWpkCAwPSZqN4DMN4MiF7fb390gxhoEAzdJFgISjRH4n8u4I3ncInUdlOiy8bbjEAgIUExopuW-8TeXjwGS3-ZTv3bWYz-X9vVrslfpKZ8IGeuABuEtug-ycZRRHzJxXxjrvrOoMJpYJlfPIsVB7wVReg2XbKS4KzVCL1eVkOoURpbNc6itRnIqU3LdnijJjfymx8mJdzsZm9hYdFy-xngy9e4cOQn-Cjva4A09RBwqu037eQ1jXs1w1p6RU1pPlA9xsfz7VP-BaLx43pl_VC2i48u_R7ez7zfSqKUUQGsew3DYta11UTmInVPSEBiFsFNYFzD0jlnBHIwFgMBWUcmY54TKJY-NC5y2mH9CoX_XhDNUQrDhjLXVgoJih0ZgYYTpTAEMYZ7oKkWc8tCsM4alQxVLnSAErPYCoE4i6gFihi12jXwNBxr_FvyWgd6KJ3To_AJ3ronP9ms4rdJrUtHuJBKcG_NgKjZ_VpstM3GjCOAefD_rw8X98-hM6TMMZNmHGaLRd_w6f0Rv3Z_u4WX_JP-FfI-_dkQ priority: 102 providerName: Directory of Open Access Journals |
| Title | The Integer Factorization Algorithm With Pisano Period |
| URI | https://ieeexplore.ieee.org/document/8901977 https://www.proquest.com/docview/2455644201 https://doaj.org/article/5be86cb430f04cd9abcdcb96a02b4797 |
| Volume | 7 |
| WOSCitedRecordID | wos000509585900088&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D |
| hasFullText | 1 |
| inHoldings | 1 |
| isFullTextHit | |
| isPrint | |
| journalDatabaseRights | – providerCode: PRVAON databaseName: DOAJ Directory of Open Access Journals customDbUrl: eissn: 2169-3536 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000816957 issn: 2169-3536 databaseCode: DOA dateStart: 20130101 isFulltext: true titleUrlDefault: https://www.doaj.org/ providerName: Directory of Open Access Journals – providerCode: PRVHPJ databaseName: ROAD: Directory of Open Access Scholarly Resources customDbUrl: eissn: 2169-3536 dateEnd: 99991231 omitProxy: false ssIdentifier: ssj0000816957 issn: 2169-3536 databaseCode: M~E dateStart: 20130101 isFulltext: true titleUrlDefault: https://road.issn.org providerName: ISSN International Centre |
| link | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT9wwEB4B6qE99EWrLlCUQ48EvH7E9nG7YtVDi_bQBzfLT4oEu9Xu0iO_nbFjIqSiSlysJLKj8YydecQzH8CnpG1HZHCtUESig2Jjq5QIbXAZPg5V9ric8v35VZ6dqfNzPd-CoyEXJsZYDp_F43xZ_uWHpb_JobIThcoL7ZVt2Jay63O1hnhKBpDQQtbCQmOiTybTKc4hn97Sx1QLJnM63wPlU2r0V1CVf77ERb3MXj2NsNfwspqRzaSX-xvYiou38OJBccFd6HAFNDngdxFXzazA6tScy2ZydYE3m9_XzS9sm_nl2i6WzRwHLsM7-DE7_T790laUhNZzojbtmI990l4RL3UKlEUpXZLORyICp44KzxLlPhAmGRPcCSpU7k6sj11whL2HncVyET9Ag96Mt84xjxqMW5asTQn3O0PeSettNwJ6zz7jawnxjGRxZYorQbTpeW4yz03l-QiOhkF_-goa_-_-Octl6JrLX5cHyHBTd5MRLqrOO85IIjg1bZ0P3unOEuq41HIEu1lIw0uqfEZwcC9lU7fq2lAuBBqFSMPe46P24XkmsI-7HMDOZnUTP8Iz_3dzuV4dFice22-3p4dlRd4BPu3btg |
| linkProvider | IEEE |
| linkToHtml | http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlR1NTxQx9AXRRDwoCoRV1Dl4ZKDTj2l7XDduMK6bPYBya_oJJLBLdhd-P22nTEg0Jl4mM5PXSfs-5vW9vg-AL0HqFnFnaiYQjwaK9rUQzNXOpPZxUWU3Ocr314RPp-L8XM424LDPhfHe5-Azf5Ru81m-W9i75Co7FlF5xf3KM3jOKMWoy9bqPSqphYRkvJQWapA8Ho5GcRUpfkseYckITwl9T9RPrtJf2qr88S_OCmb85v-mtg2vy0ayGnaUfwsbfv4OXj0pL7gDbeSBKrn8LvyyGufGOiXrshpeX8SH9eVN9Tteq9nVSs8X1SwOXLhdOBt_Ox2d1KVPQm0pEuu6oY0N0gpkuQwOE8-5CdxYj5ij2GBmScDUOkQ4IYwahplI4Ehb3zqDyB5szhdzvw9VtGesNobYqMOoJkHrEKLEk4g7rq1uB4Af0adsKSKeellcq2xMIKk6nKuEc1VwPoDDftBtV0Pj3-BfE1160FQAO7-ICFdFnhQzXrTWUIICikuT2lhnjWw1woZyyQewk4jUf6TQZwAHj1RWRVhXClPG2sRQzfu_j_oML09Of07U5Pv0xwfYSpPtvDAHsLle3vmP8MLer69Wy0-ZIx8Advvc1w |
| openUrl | ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=The+Integer+Factorization+Algorithm+With+Pisano+Period&rft.jtitle=IEEE+access&rft.au=Wu%2C+Liangshun&rft.au=Cai%2C+H.+J.&rft.au=Gong%2C+Zexi&rft.date=2019&rft.pub=IEEE&rft.eissn=2169-3536&rft.volume=7&rft.spage=167250&rft.epage=167259&rft_id=info:doi/10.1109%2FACCESS.2019.2953755&rft.externalDocID=8901977 |
| thumbnail_l | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2169-3536&client=summon |
| thumbnail_m | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2169-3536&client=summon |
| thumbnail_s | http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2169-3536&client=summon |