| Display title | Pohlig–Hellman algorithm |
| Default sort key | Pohlig-Hellman algorithm |
| Page length (in bytes) | 6,577 |
| Namespace ID | 0 |
| Page ID | 279400 |
| Page content language | en - English |
| Page content model | wikitext |
| Indexing by robots | Allowed |
| Number of redirects to this page | 0 |
| Counted as a content page | Yes |
| Page image | Error creating thumbnail: Unable to save thumbnail to destination |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | imported>Carolyn |
| Date of page creation | 23:30, 6 February 2024 |
| Latest editor | imported>Carolyn |
| Date of latest edit | 23:30, 6 February 2024 |
| Total number of edits | 1 |
| Recent number of edits (within past 90 days) | 0 |
| Recent number of distinct authors | 0 |
Description | Content |
Article description: (description)
This attribute controls the content of the description and og:description elements. | In group theory, the Pohlig–Hellman algorithm, sometimes credited as the Silver–Pohlig–Hellman algorithm, is a special-purpose algorithm for computing discrete logarithms in a finite abelian group whose order is a smooth integer.
The algorithm was introduced by Roland Silver, but first published by Stephen... |
