These python scripts implement the plaintext search, to return a list of possible plaintexts that have been encrypted to an RSA public key with exponent e and modulus N, such that e is not relatively prime to phi(N) - where phi denotes Euler's totient function.

These scripts require Python >= 3.4 to run.

This project is released under the MIT License and has adopted the Microsoft Open Source Code of Conduct. For more information see the Code of Conduct FAQ or contact [email protected] with any additional questions or comments.