A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Lecture Notes in Computer Science
Currently, RSA is a very popular, widely used and secure public key cryptosystem, but the security of the RSA cryptosystem is based on the difficulty of factoring large integers. The General Number Field Sieve (GNFS) algorithm is the best known method for factoring large integers over 110 digits. Our previous work on the parallel GNFS algorithm, which integrated the Montgomery's block Lanczos algorithm to solve the large and sparse linear systems over GF(2), has one major disadvantage, namelydoi:10.1007/11839569_41 fatcat:u25w54d45bhphocviouuo2zl3e