This Repository is all about the Various Concepts about the Number Theory related Algorithm. There is also some Solution to the Problem of Various Online Judges According to Topic.
Finds the GCD using the euclidean algorithm or finds a linear combination of the GCD using the extended euclidean algorithm with all steps/work done shown
Implementation of the RSA algorithm in Java between three parties using Java's BigInteger library. Two of them are the communicating parties and the third acts as an attacker whose purpose is to eavesdrop on the conversation between the previous two. The implementation follows the main rules of RSA and starts by generating two random prime numbers that are then used to set the whole scene of communication going forward.
Implementation of Diffie-Hellman Key-exchange, RSA algorithm, DSS(Digital Signature Signing and Verification), Extended Euclidean Algo., Fermat's Little Theorem, Fast Modular Exponentiation
A Java Swing GUI Tool which is used in order to calculate the Modular Multiplicative Inverse Value of a set of two user-specified numbers of significant size. Allows the user to calculate the solution using either the Extended Euclidean Algorithm or the Naive Approach.