On the Efficiency of Pollard’s Rho Method for Discrete Logarithms Shi Bai1 1 2

First Page		Document Content
Date: 2007-10-10 03:07:41 Abstract algebra Algebra Mathematics Group theory Computational hardness assumptions Logarithms Modular arithmetic Finite fields Discrete logarithm Randomized algorithm Pollard's rho algorithm Index calculus algorithm		On the Efficiency of Pollard’s Rho Method for Discrete Logarithms Shi Bai1 1 2 Add to Reading List Source URL: maths-people.anu.edu.au Download Document from Source Website File Size: 234,92 KB Share Document on Facebook

	Introduction The Weil conjectures Threefolds Fourfolds Cubic hypersurfaces over finite fields DocID: 1xV7r - View Document
	Smoothness Testing of Polynomials over Finite Fields Jean-Franc ¸ ois Biasse and Michael J. Jacobson Jr. Department of Computer Science, University of Calgary 2500 University Drive NW DocID: 1xU81 - View Document
	Cryptology Fall 2017 Chloe Martindale TU/e September 28, 2017 These notes are based on notes by Tanja Lange and Ruben Niederhagen. Following on from last weeks lecture on finite fields, we now see how to use DocID: 1vqjO - View Document
	On the existence of dimension zero divisors on curves over finite fields Christophe Ritzenthaler Joint work with Stéphane Ballet and Robert Rolland Institut de Mathématiques de Luminy DocID: 1vhKQ - View Document
	Endomorphism rings of elliptic curves over finite fields by David Kohel B.S. Biochemstry (Texas A&M UniversityB.S. Mathematics (Texas A&M University) 1989 DocID: 1vbHJ - View Document