This project was written to crack high bit RSA keys using Pollard Rho's prime factorization and threading. This was completed for Operating Systems (CMPE320) in Spring 2021.
-
Updated
May 25, 2021 - C
This project was written to crack high bit RSA keys using Pollard Rho's prime factorization and threading. This was completed for Operating Systems (CMPE320) in Spring 2021.
EPR: A Factoring and Primality checking library for C++
A rust implementation of pollard rho algorithm using rug (gdm) library
A review of the Chor-Rivest Cryptosystem
A Practical Study and Comparison of Integer Factorization Methods
Integer Factorization Approaches with JavaScript
Cryptographic algorithms
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.
A short code to crack Experimental ElGamal cryptosystem and Rabin’s method.
Pollard Rho attack on ECDLP with GMP
Pollard’s Kangaroo find solutions to the discrete logarithm secp256k1 PRIVATE KEY + NONCES in a known range
Add a description, image, and links to the pollard-rho-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the pollard-rho-algorithm topic, visit your repo's landing page and select "manage topics."