| Display title | Modular exponentiation |
| Default sort key | Modular exponentiation |
| Page length (in bytes) | 20,946 |
| Namespace ID | 0 |
| Page ID | 203223 |
| 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 |
| HandWiki item ID | None |
| Edit | Allow all users (infinite) |
| Move | Allow all users (infinite) |
| Page creator | Jworkorg (talk | contribs) |
| Date of page creation | 16:27, 6 February 2024 |
| Latest editor | Jworkorg (talk | contribs) |
| Date of latest edit | 16:27, 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. | Modular exponentiation is exponentiation performed over a modulus. It is useful in computer science, especially in the field of public-key cryptography, where it is used in both Diffie–Hellman key exchange and RSA public/private keys.
Modular exponentiation is the remainder when an integer b (the base... |
