Fun-RSA/main.py at master · ThoolooExpress/Fun-RSA · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
import argparse
# import math
from includes.euclidean import xgcd, gcd
from includes.prime import rp
from includes.inverse import inverse
import includes.rsa as rsa

parser = argparse.ArgumentParser(description="Oh wow, somebody actually bothered to generate this man page, good job!")

def euclidean(args):
    g, x, y = xgcd(args.nums[0], args.nums[1])
    print("GCD: {}, c1: {}, c2: {}".format(g, x, y))

def modular(args):
    dividend = args.dividend[0]
    divisor = args.divisor[0]
    res = abs(dividend % divisor)
    print("{} % {} = {}".format(dividend, divisor, res))

def relativelyPrime(args):
    print("{} is relatively prime with {}".format(rp(args.num[0]), args.num[0]))


def inv(args):
    a, m = args.nums[0], args.nums[1]
    if gcd(a, m) == 1:
        print("Inverse modulus is: {}".format(inverse(a, m)))
    else:
        print("The two numbers are not relatively prime")

def rsaTest(args):
    a, b = args.primes[0], args.primes[1]
    e, d, n = rsa.keyTuple(a, b)
    p = args.testData[0]
    if p >= n:
        print("Error: Plaintext is too large compared to modulus (n).  Use a smaller payload, or bigger primes.")
        return
    print("Key set generated: e={}, d={}, n={}".format(e,d,n))
    print("Testing with plaintext: {}".format(p))
    c = rsa.rsaEncrypt(p,e,n)
    print("Cyphertext: {}".format(c))
    dp = rsa.rsaDecrypt(c,d,n)
    print("Decrypted Plaintext: {}".format(dp))
    if dp == p:
        print("Success!")
    else:
        print("Error!")


subparsers = parser.add_subparsers() # Ugh... this is really complicated...

e_parser = subparsers.add_parser("euclidean", help="Run question 1: Implement Euclidean Algorithm for calculating greatest common divisor")
e_parser.set_defaults(func=euclidean)
m_parser = subparsers.add_parser("modular", help="Run question 2: Modulus function")
m_parser.set_defaults(func=modular)
p_parser = subparsers.add_parser("RP", help="Run question 3: Find Relatively Prime")
p_parser.set_defaults(func=relativelyPrime)
i_parser = subparsers.add_parser("inverse", help="Run question 4: Find Inverse")
i_parser.set_defaults(func=inv)
r_parser = subparsers.add_parser("rsa", help="Run question 5: Practice with RSA algorithm")
# No default for r_parser, it has its own subparser

# e_parser

e_parser.add_argument("nums", metavar="N", type=int, nargs=2, help="The two numbers for which to find the greatest common divisor")

# m_parser
m_parser.add_argument("dividend", metavar="A", type=int, nargs=1, help="The dividend for the modulus function")
m_parser.add_argument("divisor", metavar="B", type=int, nargs=1, help="The divisor for the modulus function")

# p_parser
p_parser.add_argument("num", metavar="N", nargs=1, type=int, help="The number for which to find a relatively prime number")

# i_parser
i_parser.add_argument("nums", metavar="N",type=int, nargs=2, help="The two numbers for which to find the inverse modulo")

# r_parser

r_subparsers = r_parser.add_subparsers()

r_test_parser = r_subparsers.add_parser("test", help="Run Automated Test of RSA")
r_test_parser.add_argument("primes", metavar="P", type=int, nargs=2, help="The two primes from which to generate the keypair")
r_test_parser.add_argument("testData", metavar="D", type=int, nargs=1, help="The payload to test encryption for.")
r_test_parser.set_defaults(func=rsaTest)


args = parser.parse_args()

args.func(args)