James Cowie, Bruce Dodson, R.-Marije Elkenbracht-Huizing, Arjen K. Lenstra, Peter L. Montgomery, and Joerg Zayer. A world wide number eld sieve factoring record: on to 512 bits. In Kwangjo Kim and Tsutomu Matsumoto, editors, Advances in Cryptology - Asiacrypt '96, volume 1163 of LNCS, pages 382394. Springer Verlag, 1996. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Scheduling Strategies for Master-Slave Tasking on.. - Banino, Beaumont.. (2002) (5 citations) (Correct)
.... a linear programming formulation (which nicely encompasses the situation where there are several masters instead of a single one) The master slave scheduling problem is motivated by problems that are addressed by collaborative computing e orts such as SETI home [23] factoring large numbers [9], the Mersenne prime search [22] and those distributed computing problems organized by companies such as Entropia [10] Several papers [25, 24, 14, 12, 31, 3, 2] have recently revisited the master slave paradigm for processor clusters or grids, and we refer to Section 7 for comparison and ....
James Cowie, Bruce Dodson, R.-Marije Elkenbracht-Huizing, Arjen K. Lenstra, Peter L. Montgomery, and Joerg Zayer. A world wide number eld sieve factoring record: on to 512 bits. In Kwangjo Kim and Tsutomu Matsumoto, editors, Advances in Cryptology - Asiacrypt '96, volume 1163 of LNCS, pages 382394. Springer Verlag, 1996.
How To Find Small Factors Of Integers - Bernstein (2000) (2 citations) (Correct)
.... Pollard s number eld sieve, as generalized by Buhler, Lenstra, and Pomerance, seems to always succeed in time exp( 64=9 o(1) 1=3 (log D) 1=3 (log log D) 2=3 ) See [138] 104] 105] 3] 44] 139] 60] 24] 41] 145] 121] 82] 19] 69] 148] 72] 73] 74] 76] [61], 75] 123] 126] 130] and [127] The algorithm in this paper can again be used to indirectly speed up sieving and reduce the size of n. Coppersmith s number eld sieve variant in [54] seems asymptotically faster, with 64=9 reduced slightly. Coppersmith s method factors many numbers with a ....
James Cowie, Bruce Dodson, R.-Marije Elkenbracht-Huizing, Arjen K. Lenstra, Peter L. Montgomery, Joerg Zayer, A World Wide number eld sieve factoring record: on to 512 bits, in [94] (1996), 382-394.
Recent Progress and Prospects for Integer Factorisation Algorithms - Brent (4 citations) (Correct)
.... feasible to factor larger numbers by MPQS, but for numbers of more than about 110 decimal digits GNFS is faster [22] For example, it is estimated in [16] that to factor RSA129 by MPQS required 5000 Mips years, but to factor the slightly larger number RSA130 by GNFS required only 1000 Mips years [18]. 5 The Special Number Field Sieve (SNFS) The number eld sieve (NFS) algorithm was developed from the special number eld sieve (SNFS) which we describe in this section. The general number eld sieve (GNFS or simply NFS) is described in x6. Most of our numerical examples involve numbers of ....
J. Cowie, B. Dodson, R. M. Elkenbracht-Huizing, A. K. Lenstra, P. L. Montgomery and J. Zayer, A world wide number eld sieve factoring record: on to 512 bits, Advances in Cryptology: Proc. Asiacrypt'96, LNCS 1163, Springer-Verlag, Berlin, 1996, 382-394.
A Survey on the Number Field Sieve - Nakamula (Correct)
....a practical point of view, it will be the most important to gain much more experience through actual implementations and experiments by computers. 5. A World Wide NFS Record Factoring the 130 digits natural number RSA130 in [24] by the GNFS through a World Wide Web sieving project is reported in [4]. The following is extracted from the electoronic mail to the Number Theory List [16] or NTL, by A. K. Lenstra. On April 10, 1996, we found that RSA 130 = 18070820886874048059516561644059055662781025167694013491701270214 50056662540244048387341127590812303371781887966563182013214880557 has ....
J. Cowie, B. Dodson, R. M. Elkenbracht-Huizing, A. K. Lenstra, P. L. Montgomery, J. Zayer, A world wide number eld sieve factoring record: on to 512 bits, in Asiacrypt '96, Lecture Notes in Comput. Sci. 1163, Springer-Verlag, 1996, 382-394.
Scheduling Strategies for Mixed Data and Task Parallelism on .. - Beaumont, Legrand (2002) (Correct)
No context found.
James Cowie, Bruce Dodson, R.-Marije Elkenbracht-Huizing, Arjen K. Lenstra, Peter L. Montgomery, and Joerg Zayer. A world wide number eld sieve factoring record: on to 512 bits. In Kwangjo Kim and Tsutomu Matsumoto, editors, Advances in Cryptology - Asiacrypt '96, volume 1163 of LNCS, pages 382394. Springer Verlag, 1996.
Bandwidth-Centric Allocation of Independent Tasks.. - Beaumont, Carter, .. (2001) (14 citations) (Correct)
No context found.
James Cowie, Bruce Dodson, R.-Marije Elkenbracht-Huizing, Arjen K. Lenstra, Peter L. Montgomery, and Joerg Zayer. A world wide number eld sieve factoring record: on to 512 bits. In Kwangjo Kim and Tsutomu Matsumoto, editors, Advances in Cryptology - Asiacrypt '96, volume 1163 of LNCS, pages 382394. Springer Verlag, 1996.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC