Edlyn Teske  Home/Search
Context Related
| informatik.tudarm...1.pollard_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: In Pollard's rho method, an iterating function f is used to define a sequence (y i ) by y i+1 = f(y i ) for i = 0; 1; 2; : : :, with some starting value y0 . In this paper, we define and discuss new iterating functions for computing discrete logarithms with the rho method. We compare their performances in experiments with elliptic curve groups. Our experiments show that one of our newly defined functions is expected to reduce the number of steps by a factor of approximately 0:8, in... (Update)
Similar documents based on text: More All
1.0: Speeding up Pollard's Rho Method for Computing Discrete Logarithms - Teske (1998) (Correct)
0.6: Speeding Up Pollard's Rho Method For Computing Discrete Logarithms - Teske (1998) (Correct)
0.5: On Random Walks For Pollard's Rho Method - Teske (2000) (Correct)
BibTeX entry: (Update)
E. Teske, "Speeding up Pollard's rho method for computing discrete logarithms, " Technical Report No. TI-1/98, Technische Hochschule Darmstadt, Darmstadt, Germany, (1998). http://citeseer.ist.psu.edu/teske98speeding.html More
@article{ teske98speeding,
author = "Edlyn Teske",
title = "Speeding Up {Pollard}'s Rho Method for Computing Discrete Logarithms",
journal = "Lecture Notes in Computer Science",
volume = "1423",
pages = "541--554",
year = "1998",
url = "citeseer.ist.psu.edu/teske98speeding.html" }
Citations (may not include all citations):257 Elliptic curve cryptosystems (context) - Koblitz - 1987
249 Volume 3: Sorting and searching (context) - Knuth, of - 1973
237 The arithmetic of elliptic curves (context) - Silverman - 1986
228 Uses of elliptic curves in cryptography (context) - Miller - 1986
168 An improved algorithm for computing logarithms over GF (context) - Pohlig, Hellman - 1978
77 A Course in Number Theory and Cryptography (context) - Koblitz - 1987
63 Monte Carlo methods for index computation (context) - Pollard - 1978
52 The number of points on an elliptic curve modulo a prime (context) - Atkin
52 Parallel collision search with cryptanalytic applications - van Oorschot, Wiener
42 An improved Monte Carlo factorization algorithm (context) - Brent - 1980
24 a theory of factorization and genera (context) - Shanks - 1971
13 A Monte Carlo factoring algorithm with linear storage (context) - Schnorr, Lenstra - 1984
8 Random walks on groups with subgroup invariance properties (context) - Greenhalgh - 1989
7 New algorithms for finite abelian groups (context) - Teske - 1998
6 A space efficient algorithm for group structure computation - Teske - 1998
[Article contains additional citations not shown here]
The graph only includes citing articles where the year of publication is known.
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