Talk:Pohlig–Hellman algorithm

The printable version is no longer supported and may have rendering errors. Please update your browser bookmarks and please use the default browser print function instead.

Polynomial time in what? Watson Ladd 23:38, 9 March 2006 (UTC)[reply]

Good point. Quuxplusone's remark at the end of Smooth number looks a bit more accurate. However, if you apply his comment to a sequence of groups with order 3, 9, 27,... then the time taken by Pohlig-Hellman should have a maximum, which is clearly not the case. Perhaps it should be O(B^1/2 log_B|G|) ? -- Nic Roets 19:36, 7 April 2006 (UTC)[reply]

This whole page is pretty cryptic; there are a few conceptual gaps that are left to the reader to have already known. —Preceding unsigned comment added by 70.145.39.28 (talk) 22:41, 20 October 2007 (UTC)[reply]

This algorithm is really awfully explained

Algorithm has steps in integers, and integers modulo various different things ( $p$ , $q$ , $q^{c}$ ), and the article doesn't indicate anywhere which is which, making it basically useless as reference.

Different sections even use $p$ to refer to a different thing. Please give it some proper attention. Taw (talk) 14:31, 16 September 2018 (UTC)[reply]