A parallel line sieve for the GNFS Algorithm

Abstract

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.

Authors and Affiliations

Sameh Daoud, Ibrahim Gad

Keywords

Related Articles

A Sleep Monitoring System with Sleep-Promoting Functions in Noise Detection and Sound Generation

Recently, there has been a growing demand and interest in developing sleep-promoting systems for improving sleep condition. Because sleep environments are various, and sensitivity to noise differs individually, it is dif...

Goal Model Integration for Tailoring Product Line Development Processes

Many companies rely on the promised benefits of product lines, targeting systems between fully custom made software and mass products. Such customized mass products account for a large number of applications automaticall...

Devising a Secure Architecture of Internet of Everything (IoE) to Avoid the Data Exploitation in Cross Culture Communications

The communication infrastructure among various interconnected devices has revolutionized the process of collecting and sharing information. This evolutionary paradigm of collecting, storing and analyzing data streams is...

Camera Calibration for 3D Leaf-Image Reconstruction using Singular Value Decomposition

Features of leaves can be more precisely captured using 3D imaging. A 3D leaf image is reconstructed using two 2D images taken using stereo cameras. Reconstructing 3D from 2D images is not straightforward. One of the imp...

A Linear Array for Short Range Radio Location and Application Systems

Patch array antennas have primarily been good candidates for higher performance results in communication systems. This paper comprises of linear 1x4 patch antenna array study constructed on 1.575mm thick Roggers 5880 sub...

Download PDF file
  • EP ID EP152605
  • DOI 10.14569/IJACSA.2014.050727
  • Views 89
  • Downloads 0

How To Cite

Sameh Daoud, Ibrahim Gad (2014). A parallel line sieve for the GNFS Algorithm. International Journal of Advanced Computer Science & Applications, 5(7), 178-185. https://europub.co.uk/articles/-A-152605