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

Output Feedback Controller Synthesis for Discrete-Time Nonlinear Systems

This paper presents a computational approach for solving optimal control problem for a class of nonlinear discrete-time systems. We focus on problem in which a pre-specified N local subsystems are given to describe the s...

Associative Classification using Automata with Structure based Merging

Associative Classification, a combination of two important and different fields (classification and association rule mining), aims at building accurate and interpretable classifiers by means of association rules. The pro...

HAMSA: Highly Accelerated Multiple Sequence Aligner

For biologists, the existence of an efficient tool for multiple sequence alignment is essential. This work presents a new parallel aligner called HAMSA. HAMSA is a bioinformatics application designed for highly accelerat...

Debranding in Fantasy Realms: Perceived Marketing Opportunities within the Virtual World

This paper discusses the application of the concept of debranding within immersive virtual environments. In particular the issue of the media richness and vividness of experience is considered in these experience realms...

EMCC: Enhancement of Motion Chain Code for Arabic Sign Language Recognition

In this paper, an algorithm for Arabic sign language recognition is proposed. The proposed algorithm facilitates the communication between deaf and non-deaf people. A possible way to achieve this goal is to enable comput...

Download PDF file
  • EP ID EP152605
  • DOI 10.14569/IJACSA.2014.050727
  • Views 118
  • 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