GUI based primality tester using the Miller Rabin algorithm

Implementation of the Miller-Rabin primality test algorithm

🔐 Implementation of encryption algorithms such as AES, Miller-Rabin and Elliptic Curve ElGamal.

Component sınıfıyla MillerRabinPrimalityTest algoritması

Code samples that demonstrate the algorithms learnt during the course. Used as a preparation (not only ;)) for the exam.

Designed and built a basic TCP oriented Secure File Transfer Protocol (SFTP) with Diffie-Hellmann key exchange protocol, modified Caesar Cipher for encryption, DSS signature scheme and SHA1 for password hashing.

Modern rewrite of miller-rabin

Very long integer class and some methods for it

Implemented various encryption/decryption, number theory and cryptographic applications made using Python

This is a short project on generating large prime numbers. The main idea of this project is to use probabilistic primality test such as Miller-Rabin Algorithm to check if a number is prime. This algorithm can generate a prime number up to 617 digits long.

TypeScript implementation of the Diffie-Hellman key exchange algorithm.

This project was the final course project for the Applied Cryptography course offered by Indraprastha Institute of Information Technology, Delhi during the winter semester of 2022.

Data Analysis and Algorithms (Python)

Miller-Rabin probabilistic primality test.

Rust code to generate 1024-bit primes

popular algorithm here

EPR: A Factoring and Primality checking library for C++

A Rust implementation of the Miller-Rabin primality test algorithm.