Pohlig–Hellman algorithm: Difference between revisions

Revision as of 14:58, 5 June 2005

Revision as of 19:49, 3 July 2005

Line 1:

This is an algorithm based on Chinese remainder problem which can compute the discrete logarithm in a multiplicative group of order q in polynomial time if q is a smooth integer.

{{Stub}}