Implementation of integer factorization algorithm with pisano period

Title

Implementation of integer factorization algorithm with pisano period

Creator

Tom T.; Tamang A.; Garia A.S.; Shaji A.; Sahu D.

Description

The problem of factorization of large integers into the prime factors has always been of mathematical interest for centuries. In this paper, starting with a historical overview of integer factorization algorithms, the study is extended to some recent developments in the prime factorization with Pisano period. To reduce the computational complexity of Fibonacci number modulo operation, the fast Fibonacci modulo algorithm has been used. To find the Pisano periods of large integers, a stochastic algorithm is adopted. The Pisano period factorization method has been proved slightly better than the recently developed algorithms such as quadratic sieve method and the elliptic curve method. This paper ideates new insights in the area of integer factorization problems. The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2021.

Source

Lecture Notes in Networks and Systems, Vol-132, pp. 313-319.

Date

2021-01-01

Publisher

Springer

Subject

Cryptography; Integer factorization algorithm; Network security; Pisano period

Coverage

Tom T., CHRIST (Deemed to be University), Bengaluru, India; Tamang A., CHRIST (Deemed to be University), Bengaluru, India; Garia A.S., CHRIST (Deemed to be University), Bengaluru, India; Shaji A., CHRIST (Deemed to be University), Bengaluru, India; Sahu D., CHRIST (Deemed to be University), Bengaluru, India

Rights

Restricted Access

Relation

ISSN: 23673370

Format

Online

Language

English

Type

Book chapter

Identifier

https://doi.org/10.1007/978-981-15-5309-7_34

https://www.scopus.com/inward/record.uri?eid=2-s2.0-85090374024&doi=10.1007%2f978-981-15-5309-7_34&partnerID=40&md5=e1a664c33af20dd29ccd9ba717b82180