Skip to main navigation Skip to search Skip to main content

A parallel GNFS algorithm with the improved Linbox montgomery block Lanczos method for integer factorization

  • Saint Francis Xavier University

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

RSA algorithm is a very popular public key cryptosystem which has been widely used in industries. Its security relies on the dijficulty of factoring large integers. The general number field sieve (GNFS) is so far the best known algorithm for factoring large integers over 110 digits. The Montgomery's block Lanczos method from. Linbox [9] is for solving large and sparse linear systems over finite fields and it can be integrated into GNFS algorithm. This paper introduces an improved Montgomery block Lanczos method, based on the version developed in Linbox. integrated with our previously developed parallel GNFS algorithm. This method has a better performance comparing with the original one, can find more solutions or dependencies than the original one with less time complexities. Implementation details and experimental results will be provided as well in the paper as well.

Original languageEnglish
Title of host publicationProceedings of the 2nd International Conference on Information Security and Assurance, ISA 2008
Pages403-409
Number of pages7
DOIs
StatePublished - 2008
Event2nd International Conference on Information Security and Assurance, ISA 2008 - Busan, Korea, Republic of
Duration: 24 Apr 200826 Apr 2008

Publication series

NameProceedings of the 2nd International Conference on Information Security and Assurance, ISA 2008

Conference

Conference2nd International Conference on Information Security and Assurance, ISA 2008
Country/TerritoryKorea, Republic of
CityBusan
Period24/04/0826/04/08

Fingerprint

Dive into the research topics of 'A parallel GNFS algorithm with the improved Linbox montgomery block Lanczos method for integer factorization'. Together they form a unique fingerprint.

Cite this