An algorithm that computes modular nested exponentiation efficiently
Project description
modular-nested-exponentiation
An algorithm that computes modular nested exponentiation efficiently
| License |  |
Version |  |
| Wheel |  |
Implementation |  |
| Status |  |
Supported versions |  |
| Downloads |  |
Generalised modular exponentiation
We present an algorithm that takes as input an arbitrarily long sequence of positive integers a₁, a₂, a₃, ..., aₙ and a positive integer m and computes a₁^(a₂^(···^aₙ)) mod m efficiently (that is, without computing the value of the nested exponent).
Without this algorithm, this type of computation is unfeasible for modern computers even for short input sequences containing small integers.
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
mod-nest-exp-1.0.2.tar.gz
(4.2 kB
view hashes)
Built Distribution
Close
Hashes for mod_nest_exp-1.0.2-py3-none-any.whl
| Algorithm | Hash digest | |
|---|---|---|
| SHA256 | 646ec629f88d2241af3b4b008b602f81a8f8afe51890027c88010eada918ff7e |
|
| MD5 | fcc6dc3f03932cad00241693584dd7d3 |
|
| BLAKE2b-256 | 3cc62d0aa7aabc25db85cca3a5cc40ce6ef647cf02601d7444c6f20f09d91d58 |
