(Enter summary)
Abstract: We present an improved sequential and a parallel version of the algorithm of
Hafner and McCurley for the computation of the class group of imaginary quadratic
fields. We describe the implementation of this algorithm on a network of UNIXworkstations
using the system LIPS. (Update)
Similar documents based on text: More All
0.6: Distributed Class Group Computation - Buchmann, Düllmann (1991)
(Correct)
0.4: On the Complexity and Efficiency of a New Key Exchange.. - Buchmann, Düllmann.. (1993)
(Correct)
0.4: On the computation of discrete logarithms in class groups.. - Buchmann, Düllmann (1993)
(Correct)
Related documents from co-citation: More All
3: The multiple polynomial quadratic sieve (context) - Silverman - 1987
2: Asymptotically fast triangularization of matrices over rings (context) - Hafner, McCurley - 1991
2: Applying sieving to the computation of quadratic class groups
- Jacobson - 1999
BibTeX entry: (Update)
J. Buchmann and S. D ullmann. Distributed class group computation. In J. Buchmann, H. Ganzinger, and W.J. Paul, editors, Informatik -- Festschrift aus Anlaß des sechzigsten Geburtstages von Herrn Prof. Dr. G. Hotz, volume 1 of Teubner--Texte zur Informatik, pages 68--81. B. G. Teubner, 1991. http://citeseer.ist.psu.edu/article/buchmann91distributed.html More
@misc{ buchmann91distributed,
author = "J. Buchmann and S. ullmann",
title = "Distributed class group computation",
text = "J. Buchmann and S. D ullmann. Distributed class group computation. In J.
Buchmann, H. Ganzinger, and W.J. Paul, editors, Informatik -- Festschrift
aus Anlaß des sechzigsten Geburtstages von Herrn Prof. Dr. G. Hotz, volume
1 of Teubner--Texte zur Informatik, pages 68--81. B. G. Teubner, 1991.",
year = "1991",
url = "citeseer.ist.psu.edu/article/buchmann91distributed.html" }
Citations (may not include all citations):
40
Computation of discrete Logarithms in Prime Fields
- LaMacchia, Odlyzko
40
Hermite normal form computation using modulo determinant ari.. (context) - Domich, Kannan et al. - 1987
37
Analysis and Comparison of some Integer Factoring Algorithms (context) - Pomerance - 1982
31
A rigorous subexponential algorithm for computation of class.. (context) - Hafner, McCurley
16
A Probabilistic Factorization algorithm with quadratic Forms.. (context) - Seysen - 1987
14
the complexity and efficiency of a new key exchange system
- Buchmann, Dullmann et al.
13
Kluwer Academic Publishers (context) - Shanks, Gauss et al. - 1989
9
the computation of the class number of an algebraic number f.. (context) - Buchmann, Williams - 1989
8
A probabilistic class group and regulator algorithm and its .. (context) - Buchmann, Dullmann - 1989
8
Computational Methods in Number Theory (context) - Schoof, fields - 1982
4
What to do until the witness comes (context) - Bach - 1988
2
LIPS - a system for distributed applications
- Buchmann, Diehl et al.
1
Institute on number theory (context) - Shanks, number et al. - 1971
Documents on the same site (http://www.informatik.tu-darmstadt.de/TI/Veroeffentlichung/reports/README.year.author.html): More
On the Security of a Modified Paillier Public-Key Primitive - Sakurai, Takagi (2002)
(Correct)
On Some Computational Problems in Finite Abelian Groups - Buchmann, Jacobson, Jr..
(Correct)
Efficient Undeniable Signature Schemes Based on Ideal.. - Biehl, Paulus, Takagi (1999)
(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