Johannes Buchmann, Sachar Paulus  Home/Search
Context Related
| informatik.tudarmsta...finite_ab.ps.gz Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: informatik.tud...DME.year.author (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We study the complexity of the basic computational problems in a finite abelian group; i.e. we prove upper bounds for the number of operations necessary to compute the order of an element, discrete logarithms, the order of the group, the structure of the group, roots of an element. (Update)
Similar documents based on text: More All
0.5: Algorithms for Finite Abelian Groups - Buchmann, Paulus (1993) (Correct)
0.3: A One Way Function Based on Ideal Arithmetic in Number Fields - Buchmann, Paulus (1997) (Correct)
0.3: On Some Computational Problems in Finite Abelian Groups - Buchmann, Jacobson, Teske (1997) (Correct)
BibTeX entry: (Update)
J. Buchmann, S. Paulus, Algorithms for finite abelian groups, in preparation. http://citeseer.ist.psu.edu/buchmann93algorithms.html More
@misc{ buchmann-algorithms,
author = "J. Buchmann and S. Paulus",
title = "Algorithms for finite abelian groups",
text = "J. Buchmann, S. Paulus, Algorithms for finite abelian groups, in preparation.",
url = "citeseer.ist.psu.edu/buchmann93algorithms.html" }
Citations (may not include all citations):40 Hermite Normal Form Computation using Modulo Determinant Ari.. (context) - Domich, Kannan et al. - 1987
24 A Theory of Factorization and Genera (context) - Shanks, Number - 1970
16 Handbook of theoretical computer science (context) - Lenstra, Lenstra et al. - 1990
2 Algorithmen fuer endliche abelsche Gruppen (context) - Paulus - 1992
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