This C# program efficiently calculates "a^b mod n" using fast modular exponentiation algorithm. Ideal for cryptography and large number computations.
-
Updated
Jul 2, 2024 - C#
This C# program efficiently calculates "a^b mod n" using fast modular exponentiation algorithm. Ideal for cryptography and large number computations.
A lightweight library for secure multi-party computation (MPC) based on the GMW protocol, fully written in C#.
Add a description, image, and links to the cryptographic-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the cryptographic-algorithms topic, visit your repo's landing page and select "manage topics."