This repository contains foundational mathematical concepts and implementations relevant to Web3 and cryptography. The project aims to provide a comprehensive resource for understanding the mathematical underpinnings of blockchain technology and cryptographic systems, with complementary implementations in Rust.
- Euclidean Algorithm
- Eulers Totient
- Extended Euclidean Algorithm
- Fast Powering Algorithm
- Binary of a Number
- Modular Arithmetic
- Modular Inverse
- Prime Factorization
- Subgroups of Multiplicative Group Elements
- Fully Homomorphic Encryption
- Sum of Two Polynomials
- Polynomial Arithmetic Over a Range
To use this repository
- Clone the Repository
git clone https://github.com/anthonykimani/math4web3.git- Navigate through the directories to find relevant mathematical concepts and their implementations.
- For Rust implementations, ensure you have Rust installed on your system. You can find installation instructions at https://www.rust-lang.org/tools/install.
Contributions to this repository are welcome. Please feel free to submit pull requests or open issues for any improvements or additions you'd like to suggest.
This project is licensed under the MIT License.
For any queries or suggestions, please open an issue in the GitHub repository.