Tim Gianitsos timgianitsos
timgianitsos
/ rsa.py
Created
October 11, 2020 19:08
— forked from tbenjis/rsa.py
A simple RSA encryption in python using Miller-Rabin primality test. Outputs results in text files
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| # Compute RSA encryption in python | |
| # Author: Tunde | |
| import random | |
| import math | |
| import argparse | |
| import re | |
| KEY_INT = 100 # we define the near max value to get its random number for key | |
| def main(): |