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

	The Schur algebra is not spectral in B(`2). Romain Tessera∗ July 31, 2009 Abstract We give an example of an infinite matrix whose rows and columns DocID: 1xVrQ - View Document
	THE EXT ALGEBRA OF A QUANTIZED CYCLE DAMIEN CALAQUE AND JULIEN GRIVAUX Abstract. Given a quantized analytic cycle (X, σ) in Y, we give a categorical Lie-theoretic interpretation of a geometric condition, discovered by S DocID: 1xV3t - View Document
	Left inverses of matrices with polynomial decay. Romain Tessera∗ July 21, 2010 Abstract It is known that the algebra of Schur operators on `2 (namely operators DocID: 1xTkK - View Document
	THE CALKIN ALGEBRA IS NOT COUNTABLY HOMOGENEOUS ILIJAS FARAH AND ILAN HIRSHBERG Abstract. We show that the Calkin algebra is not countably homogeneous, in the sense of continuous model theory. We furthermore show that th DocID: 1vnHK - View Document
	ADDENDUM TO “ALL AUTOMORPHISMS OF THE CALKIN ALGEBRA ARE INNER” ILIJAS FARAH Abstract. The proof of my recent result that all automorphisms of the Calkin algebra are inner can be simplified by using a simple observat DocID: 1vlGI - View Document