A parallel line sieve for the GNFS Algorithm

RSA is one of the most important public key cryptosystems for information security. The security of RSA depends on Integer factorization problem, it relies on the difficulty of factoring large integers. Much research has gone into problem of factoring a large number. Due to advances in factoring algorithms and advances in computing hardware the size of the number that can be factorized increases exponentially year by year. The General Number Field Sieve algorithm (GNFS) is currently the best known method for factoring large numbers over than 110 digits. In this paper, a parallel GNFS implementation on a BA-cluster is presented. This study begins with a discussion of the serial algorithm in general and covers the five steps of the algorithm. Moreover, this approach discusses the parallel algorithm for the sieving step. The experimental results have shown that the algorithm has achieved a good speedup and can be used for factoring a large integers.

@article{Daoud2014,
  title     = {A parallel line sieve for the GNFS Algorithm},
  journal   = {International Journal of Advanced Computer Science and Applications},
  volume    = {5},
  number    = {7},
  year      = {2014},
  publisher = {The Science and Information Organization},
  author    = {Sameh Daoud and Ibrahim Gad},
  doi       = {10.14569/IJACSA.2014.050727},
  url       = {https://doi.org/10.14569/IJACSA.2014.050727}
}