Pohlig–Hellman algorithm: Difference between revisions

Revision as of 04:20, 4 July 2005

Revision as of 22:40, 4 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.

{{math-stub}}