Number Theory and Cryptography Algorithms

This repository organizes various projects focused on fundamental algorithms in number theory and cryptography.

Projects

• GCD Algorithm
  Standard Greatest Common Divisor algorithm using Python and Rust.

• Extended GCD Algorithm
  Extended Euclidean Algorithm for Bézout coefficients and modular inverses.

• Modular Inverses
  Finding modular inverses using the Extended GCD and implementing in a single character RSA demo.

• RSA Attacks using CRT
  Using the Chinese Remainder Theorem to attack RSA and to optimise decryption.