Johannes Buchmann, Damian Weber  Home/Search
Context Related
| informatik.tudarms...TI9812.dl.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 summarize recent developments on the computation of discrete logarithms in general groups as well as in some specialized settings. More specifically, we consider the following abelian groups: the multiplicative group of finite fields, the group of points of an elliptic curve over a finite field, and the class group of quadratic number fields. (Update)
Similar documents based on text: More All
1.0: Discrete Logarithms: Recent Progress - Buchmann, Weber (1998) (Correct)
0.2: Enhancing Classroom Lectures with Digital Sliding.. - Rößling, Trompler.. (2004) (Correct)
0.2: Sieving Methods for Class Group Computation - Buchmann, Jacobson, Jr., Neis, .. (1998) (Correct)
BibTeX entry: (Update)
J. Buchmann and D. Weber, `Discrete logarithms: Recent progress', Proc. International Conference on Coding Theory, Cryptography and Related Areas, Guanajuato, http://citeseer.ist.psu.edu/721159.html More
@misc{ buchmann-discrete,
author = "J. Buchmann and D. Weber",
title = "Discrete logarithms: Recent progress",
text = "J. Buchmann and D. Weber, `Discrete logarithms: Recent progress', Proc.
International Conference on Coding Theory, Cryptography and Related Areas,
Guanajuato,",
url = "citeseer.ist.psu.edu/721159.html" }
Citations (may not include all citations):635 New directions in cryptography - Diffie, Hellman - 1976
257 Elliptic curve cryptosystems (context) - Koblitz - 1987
128 A subexponential algorithm for discrete logarithms over the .. (context) - Adleman, DeMarrais et al. - 1994
124 Lower bounds for discrete logarithms and related problems - Shoup - 1997
78 Hyperelliptic cryptosystems (context) - Koblitz - 1989
63 Monte carlo methods for index computation (context) - Pollard - 1978
56 An improved protocol for demonstrating possession of discret.. (context) - Chaum, Evertse et al. - 1988
52 Parallel collision search with cryptanalytic applications - van Oorschot, Wiener
48 The discrete logarithm problem on elliptic curves of trace o.. - Smart
43 Factoring with two large primes (context) - Lenstra, Manasse - 1994
42 An improved monte carlo factorization algorithm (context) - Brent - 1980
35 Discrete logarithms in GF (context) - Coppersmith, Odlyzko et al. - 1986
35 The discrete logarithm problem (context) - McCurley - 1990
34 using the number field sieve (context) - Gordon, in - 1993
28 Solving large sparse linear systems over finite fields - LaMacchia, Odlyzko - 1990
[Article contains additional citations not shown here]
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