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

	Probabilistic Modeling and Model Checking Erika Ábrahám RWTH Aachen University, Germany SFM’14 Tutorial June 17, 2014 DocID: 1rrqu - View Document
	Spheres of Influence for More Effective Viral Marketing Yasir Mehmood Francesco Bonchi David García-Soriano DocID: 1riqm - View Document
	Competitive Online Algorithms Susanne Albers Overview arrive one by one and must be scheduled immediately DocID: 1ri9G - View Document
	Computing the Width of a Point Set in 3-Spa e Thomas Herrmann Institute for Theoreti al Computer S ien e Institute for Operations Resear h DocID: 1rhdY - View Document
	Master thesis ANALYSIS OF A SIMPLE METHOD TO APPROXIMATE THE EXPECTED STATE OF A MARKOV CHAIN By DocID: 1rdMz - View Document