Parallelization of prime number generation using message passing interface

In this research, we proposed a parallel processing algorithm that runs on cluster architecture suitable for prime number generation. The proposed approach is meant to decrease computational cost and accelerate the prime number generation process. Several experimental results are shown to demonstrate the viability of our work.

[1]  T. Austin,et al.  Architectural support for fast symmetric-key cryptography , 2000, ASPLOS IX.

[2]  U. Maurer.  Fast generation of prime numbers and secure public-key cryptographic parameters , 1995, Journal of Cryptology.

[3]  Wayne Luk,et al.  A scalable hardware architecture for prime number validation , 2004, Proceedings. 2004 IEEE International Conference on Field- Programmable Technology (IEEE Cat. No.04EX921).

[4]  David M. Bressoud.  Factorization and Primality Testing , 1989 .

[5]  Philip M. Papadopoulos,et al.  Configuring Large High-Performance Clusters at Lightspeed: A Case Study , 2004, Int. J. High Perform. Comput. Appl..

[6]  T. N. Vijaykumar,et al.  Accelerating private-key cryptography via multithreading on symmetric multiprocessors , 2003, 2003 IEEE International Symposium on Performance Analysis of Systems and Software. ISPASS 2003..

[7]  Selim G. Akl,et al.  Improving A Solution's Quality Through Parallel Processing , 2004, The Journal of Supercomputing.

[8]  Martin K. Purvis,et al.  Performance Comparison between VOPP and MPI , 2005, Sixth International Conference on Parallel and Distributed Computing Applications and Technologies (PDCAT'05).

[9]  Rajkumar Buyya,et al.  GridCrypt: High Performance Symmetric Key Cryptography Using Enterprise Grids , 2004, PDCAT.

[10]  J. Dongarra.  Performance of various computers using standard linear equations software , 1990, CARN.

[11]  William Gropp,et al.  Why Are PVM and MPI So Different? , 1997, PVM/MPI.

[12]  Marc Joye,et al.  Efficient Generation of Prime Numbers , 2000, CHES.

[13]  Ivan Damgård,et al.  Speeding up Prime Number Generation , 1991, ASIACRYPT.

[14]  Shuichi Ichikawa,et al.  An execution-time estimation model for heterogeneous clusters , 2004, 18th International Parallel and Distributed Processing Symposium, 2004. Proceedings..

[15]  J. A. Rod Blais,et al.  PLFG: A Highly Scalable Parallel Pseudo-random Number Generator for Monte Carlo Simulations , 2000, HPCN Europe.

[16]  C. Pomerance,et al.  Prime Numbers: A Computational Perspective , 2002 .