Name
Abstract | ||
|---|---|---|
The RSA cryptosystem is one of the widely used public key systems. The security of it is based on the intractability of factoring a large composite integer into two component primes, which is referred to as the RSA assumption. So far, the Quadratic Sieve (QS) is the fastest and general-purpose method for factoring composite numbers having less than about 110 digits. In this paper, we present our study on a variant of the QS, i.e., the Multiple Polynomial Quadratic Sieve (MPQS) for simulating the parallel RSA factorization. The parameters of our enhanced methods (such as the size of the factor base and the length of the sieving interval) are benefit to reduce the overall running time and the computation complexity is actually lower. The experimental result shows that it only takes 6.6 days for factoring larger numbers of 100 digits using the enhanced MPQS by 32 workstations. |
Year | DOI | Venue |
|---|---|---|
2009 | 10.4304/jcp.4.2.112-118 | JOURNAL OF COMPUTERS |
Keywords | Field | DocType |
RSA, factorization, cryptosystem, Multiple Polynomial Quadratic Sieve | Integer,Discrete mathematics,Factor base,Polynomial,Arithmetic,Cryptosystem,Factorization,Public-key cryptography,Mathematics,Quadratic sieve,Integer factorization | Journal |
Volume | Issue | ISSN |
4 | 2 | 1796-203X |
Citations | PageRank | References |
1 | 0.35 | 4 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Yi-shiung Yeh | 1 | 94 | 13.96 |
| Ting-Yu Huang | 2 | 38 | 4.06 |
| Han-Yu Lin | 3 | 232 | 24.62 |
| Yu-Hao Chang | 4 | 47 | 7.71 |