from functions import *

#choose 2 primes (both 2^n bites long)
p = input("Choose prime 1: ")
q = input("Choose prime 2: ")
#print ("size of p: " + str(len("{0:b}".format(p))) + " size of q: " + str(len("{0:b}".format(q)))) #from stackoverflow: formats binary number

n = p * q #will be 2^(n+1) bites long

phin = (p-1)*(q-1)
m = input("Message smaller than " + str(n) + ": ")

e = 3 #cant be two because phin will always be even
while (phin/float(e)).is_integer() == 1: #needs improvement
	e += 2

k = 1
d = ((k*phin)+1)/e #
while (((k*phin)+1)/float(e)).is_integer() != 1: #
	d = ((k*phin)+1)/e #
	k += 1

print ("e: " + str(e))
print ("k: " + str(k))

c = mod((m ** e), n)
print c

newm = mod(((mod(c, n)) ** d), n)
print m