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
	Process algebra and Markov processes The nature of synchronisation Equivalence relations Case study: active badges Summary From Markov to Milner and back: Stochastic process algebras Jane Hillston School of Informatics DocID: 1xVg5 - 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
	Evaluation of RSVP and Mobility-aware RSVP Using Performance Evaluation Process Algebra Hao Wang and David I. Laurenson Jane Hillston DocID: 1xUMp - View Document
	Polynomial Time Interactive Proofs for Linear Algebra with Exponential Matrix Dimensions and Scalars Given by Polynomial Time Circuits In memory of Wen-tsun Wu–Jean-Guillaume Dumas DocID: 1xUE0 - View Document