Revision as of 22:08, 2 October 2005 edit Silverfish (talk \| contribs) Extended confirmed users, Pending changes reviewers 6,013 edits m Stub-sorting. You can help! ← Previous edit		Revision as of 22:01, 5 November 2005 edit undo Gaius Cornelius (talk \| contribs) Administrators 169,502 edits m Fix common mistake "a the". See: WP:FCM. Next edit →
Line 1: In mathematics, the '''Pohlig-Hellman algorithm''' is an [[algorithm]] for the computation of [[discrete logarithm]]s in a [[multiplicative group]] whose order is a [[smooth integer]]. The algorithm is based on the [[Chinese remainder theorem]] and runs in [[polynomial time]]. We will explain the algorithm in terms of a the group formed by taking all the elements of Z<sub>p</sub> which are coprime to p, and leave it to the advanced reader to extend the algorithm to other groups. '''Input''' Integers ''p'', ''g'', ''e''.

Pohlig–Hellman algorithm: Difference between revisions