loading...
A Parallel GNFS Integrated with the Block Wiedemann?s Algorithm for Integer Factorization
Indiana University-Purdue University, Indianapolis, USA September 29-October 01
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/DASC.2006.92nd IEEE International Symposium on D ...
 This Article 
 
Buy PURCHASE ARTICLE: $19
PDF
HTML
Buy IEEE Xplore Subscribers
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
ASCII Text
x 
 
Na Guo, Laurence T. Yang, Man Lin, John P. Quinn, "A Parallel GNFS Integrated with the Block Wiedemann?s Algorithm for Integer Factorization," Dependable, Autonomic and Secure Computing, IEEE International Symposium on, pp. 45-50, 2nd IEEE International Symposium on Dependable, Autonomic and Secure Computing (DASC'06), 2006.
 
 
BibTex
x
 
@article{ 10.1109/DASC.2006.9,
author = {Na Guo and Laurence T. Yang and Man Lin and John P. Quinn},
title = {A Parallel GNFS Integrated with the Block Wiedemann?s Algorithm for Integer Factorization},
journal ={Dependable, Autonomic and Secure Computing, IEEE International Symposium on},
volume = {0},
year = {2006},
isbn = {0-7695-2539-3},
pages = {45-50},
doi = {http://doi.ieeecomputersociety.org/10.1109/DASC.2006.9},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Dependable, Autonomic and Secure Computing, IEEE International Symposium on
TI - A Parallel GNFS Integrated with the Block Wiedemann?s Algorithm for Integer Factorization
SN - 0-7695-2539-3
SP45
EP50
A1 - Na Guo,
A1 - Laurence T. Yang,
A1 - Man Lin,
A1 - John P. Quinn,
PY - 2006
KW - null
VL - 0
JA - Dependable, Autonomic and Secure Computing, IEEE International Symposium on
ER -
 
Na Guo, St. Francis Xavier University, Canada
Laurence T. Yang, St. Francis Xavier University, Canada
Man Lin, St. Francis Xavier University, Canada
John P. Quinn, St. Francis Xavier University, Canada
RSA is a very popular public-key based cryptosystem. The security of RSA is relied on the difficulty of large integer factorization. The General Number Field Sieve (GNFS) is an algorithm for factoring very large numbers, especially for integers over 110 digits. It is the asymptotically fastest known factoring algorithm.

In this paper, we have successfully implemented the parallel General Number Field Sieve (GNFS) algorithm and integrated with a new method called Block Wiedemann?s algorithm to solve the large and sparse linear system over GF(2) generated by the GNFS algorithm. The detailed parallel experimental results on a SUN cluster will be presented as well.

Citation:
Na Guo, Laurence T. Yang, Man Lin, John P. Quinn, "A Parallel GNFS Integrated with the Block Wiedemann?s Algorithm for Integer Factorization," dasc, pp.45-50, 2nd IEEE International Symposium on Dependable, Autonomic and Secure Computing (DASC'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.