Pollard's rho algorithm for logarithms: Difference between revisions

Revision as of 08:28, 30 January 2008

Revision as of 15:06, 19 April 2008

Line 53:

Consider, for example, the group generated by 2 modulo <math>N=1019</math> (the order of the group is <math>n=1018</math>, 2

generates the group of units modulo 1019). The algorithm is implemented by the following [[C (programming language)|C]] program:

#include <stdio.h>

Line 108:

* Alfred J. Menezes, Paul C. van Oorschot, and Scott A. Vanstone, [http://www.cacr.math.uwaterloo.ca/hac/about/chap3.pdf Handbook of Applied Cryptography, Chapter 3], 2001.

[[categoryCategory:logarithms]]

[[ru:Ρ-метод Полларда дискретного логарифмирования]]