See this document in CiteSeerX!

Factoring Hard Integers On a Parallel Machine (1997)  (Make Corrections)  
René Peralta, Eiji Okamoto
TIEICE: IEICE Transactions on Communications/Electronics/Information and Systems



  Home/Search   Context   Related

 
View or download:
uwm.edu/faculty/peralta...hypersieve.ps
Cached:  PS.gz  PS  PDF   Image  Update  Help

From:  uwm.edu/faculty/peralta/papers (more)
(Enter author homepages)

Rate this article: (best)
  Comment on this article  
(Enter summary)

Abstract: this paper we describe the results obtained from a refinement to MPQS known as the Hypercube variation (HMPQS). HMPQS was developed independently by the first author [7] and by Pomerance and Alford [1]. We implemented HMPQS on a Parsytec GC with 128 processors (at 80 Mhz) at the Japan Advanced Institute of Science and Technology (JAIST). We used our pro- Manuscript received , 1996. (Update)

Similar documents (at the sentence level):
48.6%:   Implementation of the Hypercube Multiple Polynomial Quadratic Sieve - Peralta   (Correct)
32.8%:   Implementation of the Hypercube Variation of the Multiple.. - Peralta (1995)   (Correct)

Active bibliography (related documents):   More   All
0.2:   How To Find Small Factors Of Integers - Bernstein (2000)   (Correct)
0.2:   Factoring Integers Above 100 Digits Using Hypercube MPQS - Damm, Heider, Wambach (1994)   (Correct)
0.2:   MIMD-Factorisation on Hypercubes - Damm, Heider, Wambach (1994)   (Correct)

Similar documents based on text:   More   All
0.7:   The Number Field Sieve - Lenstra, Lenstra, Jr., Manasse.. (1990)   (Correct)
0.2:   Quantum Boolean Summation with Repetitions in the.. - Heinrich, Kwas..   (Correct)
0.1:   The Multiple-Lattice Number Field Sieve - Bernstein   (Correct)

BibTeX entry:   (Update)

@article{ peralta97factoring,
    author = "Peralta and Mambo and Okamoto",
    title = "Factoring Hard Integers on a Parallel Machine",
    journal = "TIEICE: IEICE Transactions on Communications/Electronics/Information and Systems",
    year = "1997",
    url = "citeseer.ist.psu.edu/peralta97factoring.html" }
Citations (may not include all citations):
43   Factoring with two large primes (context) - Lenstra, Manasse - 1991
39   The quadratic sieve factoring algorithm (context) - Pomerance - 1985
37   Analysis and comparison of some integer factoring algorithms (context) - Pomerance - 1982
25   up to high powers (context) - Brillhart, Lehmer et al. - 1988
23   Asymptotic semi-smoothness probabilities - Bach, Peralta - 1996
14   A simple and fast probabilistic algorithm for computing squa.. (context) - Peralta - 1986
10   Th'eorie des Nombres (context) - Kraitchik - 1926
5   A quadratic sieve on the n-dimensional cube (context) - Peralta - 1993
2   Implementing the self initialization quadratic sieve on a di.. (context) - Alford, Pomerance - 1995

Documents on the same site (http://cs.uwm.edu/faculty/peralta/papers.html):
On the Distribution of Quadratic Residues and Nonresidues Modulo.. - Peralta (1992)   (Correct)

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