Montgomery multiplication in number bases that are a power of 2, like binary, hexadecimal, byte-wise etc.
-
Updated
May 11, 2023 - Python
Montgomery multiplication in number bases that are a power of 2, like binary, hexadecimal, byte-wise etc.
An algorithm that computes modular nested exponentiation efficiently.
|| Безопасность вычислительных систем (gui)
Applying extended-euclidean-algorithm on negative powered number to find their inverses
Solution to HackerRank "primitive-problem" problem in mathematics/Number Theory section
Solution to HackerRank "eulers-criterion" problem in mathematics/Number Theory section
Long string of RSA encrypted ASCII text is decrypted using several mathematical algorithms on Python to reveal the mystery text.
Solution to HackerRank "littlepandapower" problem in mathematics/Number Theory section
Add a description, image, and links to the modular-exponentiation topic page so that developers can more easily learn about it.
To associate your repository with the modular-exponentiation topic, visit your repo's landing page and select "manage topics."