Pohlig–Hellman algorithm: Difference between revisions

Revision as of 22:40, 4 July 2005

Revision as of 22:51, 4 July 2005

Line 1:

ThisIn mathematics, the '''Pohlig-Hellman algorithm''' is an [[algorithm]] based onfor Chinesethe remaindercomputation problem which can compute theof [[discrete logarithm]]s in a [[multiplicative group]] ofwhose order qis ina [[polynomialsmooth timeinteger]]. ifThe qalgorithm is abased smoothon integerthe [[Chinese remainder theorem]] and runs in [[polynomial time]].

{{math-stub}}

[[Category:Algorithms]]

[[Category:Number theory]]