-
Notifications
You must be signed in to change notification settings - Fork 0
/
RSA_Encryption.py
256 lines (210 loc) · 8.97 KB
/
RSA_Encryption.py
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
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
import random
import sys
import time
# importing the required module
import matplotlib.pyplot as plt
class RSACryptoSystem:
def __init__(self):
self.nBits = 5 # the max prime number limit ( 512 bits - 1024 bits etc)
self.privateKey = None
self.publicKey = None
def modular_exponent(self, a, c, n):
"""required task is (a^c)mod n"""
r = 1 # remainder after each iteration of modular exponentiation
b = (bin(c))[2:] # binary respresentation of b
for i in b:
r = r * r % n
if int(i) == 1:
r = r * a % n
return r
def generateRandomInt(self, n):
"""returns a random integer a such that 1 <= a <= n-1 """
return random.randint(1, (n - 1))
def gcd(self, a, b):
"""returns greater common divisor of a and b."""
if b == 0:
return a
return self.gcd(b, a % b)
def generate_odd_int(self):
"""returns an odd integer with a bit size of nBits"""
# Select odd numbers only in the range of 2^(n-1) to (2^n) -1
x = random.randrange((2 << (self.nBits - 2)) + 1, 2 << (self.nBits - 1), 2)
return x
def generatePrimes(self):
"""generate p, and q prime number"""
p, q = 0, 0
num_random_tested=0
for i in range(1, 3):
x = self.generate_odd_int()
num_random_tested+=1
value = self.miller_rabin_primeTest(x)
while not (value == "prime" and x != p):
x = self.generate_odd_int()
num_random_tested+=1
value = self.miller_rabin_primeTest(x)
if i == 1:
p = x
else:
q = x
return p, q,num_random_tested
def miller_rabin_primeTest(self, n):
"""Miller - Rabin Primality testing Algs.
Returns Composite(for sure) or prime with low probable error.
"""
# write n-1 = 2^t * u
n_1 = n - 1
t = 0
while n_1 % 2 == 0:
t += 1
n_1 = n_1 >> 1 # divide n-1 by 2^1
u = (n - 1) >> t # divide n-1 by 2^t, faster
s = 20 # 100 rounds/trials are performed
for i in range(s): # Witness loop perform s trials
a = self.generateRandomInt(n)
x = [self.modular_exponent(a, u, n)] # x0
for j in range(1, t + 1): # it should iterate t - 1 times
x.append(x[j - 1] ** 2 % n)
if x[j] == 1 and x[j - 1] != 1 and x[j - 1] != (n - 1):
return "composite"
if x[t] != 1:
return "composite" # n is definitely composite
return "prime"
def etx_gcd(self, a, b):
""" extended euclid Alg."""
if b == 0:
return a, 1, 0
gcd, x, y = self.etx_gcd(b, a % b)
gcd, x, y = gcd, y, x - a // b * y
return gcd, x, y
def moduloInverse(self, e, rP):
""" return integer d such that d = m^-1 mod n = gcd(m*d, rP) == 1 """
gcd, x, y = self.etx_gcd(e, rP)
return x % rP
def generateKeyPairs(self, p, q):
"""get a small e which is a relative prime to rp = (p-1)*(q-1).
Then, generate private and public keys.
"""
rP = (p - 1) * (q - 1) # get the relative co-prime, Q(n)
possiblePublicKeys = [] # for big nBits, huge memory
for e in range(3, rP): # O(n)
if self.gcd(e, rP) == 1:
possiblePublicKeys.append(e)
if len(possiblePublicKeys) == 100:
break
# pick random e from possible public keys
e = random.choice(possiblePublicKeys)
d = self.moduloInverse(e, rP)
while not d: # if the picked e has no inverse
e = random.choice(possiblePublicKeys)
d = self.moduloInverse(e, rP)
n = p * q
self.privateKey = (d, n)
self.publicKey = (e, n)
return self.privateKey, self.publicKey
def encryptMessage(self, M, e, n):
"""compute exponentiation M**e mod n efficienly. Binary implementation """
encryptedMessage = self.modular_exponent(M, e, n) # M ** e % n
return encryptedMessage
def decryptMessage(self, C, d, n):
"""decrypts a ciphered/encrypted message C.
compute mod exponentiation M**e mod n
"""
decryptedMessage = self.modular_exponent(C, d, n) # C ** d % n
return decryptedMessage
def get_bitSize(self):
"""returns if input N is an integer"""
bit_size = int(input("Enter the bit size:")) # N bits integers or N = 512 bits
self.nBits = bit_size
def set_bitSize(self,bsize):
"""returns if input N is an integer"""
self.nBits = bsize
def graph_nbit_time(g): # if g=1 N_bits vs randomly tested numbers for primality else if g=0 N_bits vs Time
rsa_graph = RSACryptoSystem()
bit_size_tested=[32,64,128,256,512,768,1024,1200,1512,2024]
time_taken_only=[]
time_nbit=[]
random_primality_nbit=[] # number of bits and number of randomly tested values for primality
keys_arranged=[]
num_of_random=[] #number of random numbers tested_
for i in bit_size_tested:
start = time.time()
temp_key_list=[]
time_nbit_temp=[]
random_primality_nbit_temp=[]
# get bit_size input
rsa_graph.set_bitSize(i)
p, q, random_num_tested = rsa_graph.generatePrimes()
#print(f"p {p},q = {q}")
num_of_random.append(random_num_tested)
privateKey, publicKey = rsa_graph.generateKeyPairs(p, q)
temp_key_list.append(privateKey)
temp_key_list.append(publicKey)
print(f"////////////////////////////////// ---Bit_size {i}----///////////////////")
print(f"private key : {privateKey}, \n public key : {publicKey}")
end = time.time()
elapsed= end-start
temp_key_list.append(elapsed)
# key arranged has public,private and time elapsed
keys_arranged.append(temp_key_list)
# time_nbit_temp a list of one iteration that contains bit_size and time elapsed
time_nbit_temp.append(i)
time_nbit_temp.append(elapsed)
# time_nbit contains bit size and time elapsed of all iterations
time_nbit.append(time_nbit_temp)
# Saves only time taken at each bit entry
time_taken_only.append(elapsed)
#N bits and number of Primality tested integers
random_primality_nbit_temp.append(i)
random_primality_nbit_temp.append(random_num_tested)
random_primality_nbit.append(random_primality_nbit_temp)
# Plot N_bits vs time
if(g==0):
print("N_bits vs Time to find prime numbers",time_nbit)
#plot bit_size vs time taken
plt.plot(bit_size_tested,time_taken_only)
plt.xlabel('Bit_size')
plt.ylabel('Time(secs)')
plt.title('Bit_size vs Time')
plt.show()
else:
# Plot N_bits Vs Tested random int number (how many times did it chnage selected random value to find p and q)
print("N_bits vs randomly tested numbers for primality",random_primality_nbit)
#plot bit_size vs time taken
plt.plot(bit_size_tested,num_of_random)
plt.xlabel('Bit_size')
plt.ylabel('NO. of Primality Tested Integers')
plt.title('Bit_size vs No. Of Primality Tested Integers')
plt.show()
def main():
# get bit size of the prime numbers
rsa = RSACryptoSystem() # create RSA object
choice = input(
"Enter 'e' for encryption,'d' for decryption or 'g' to generate keys , graph-to generate graph:"
)
if choice == "e":
message, e, n = input("Enter message, e, and n:").split(" ")
message, e, n = int(message), int(e), int(n)
encyptedMessage = rsa.encryptMessage(message, e, n)
print(f" Encrypted Message: = {encyptedMessage}")
elif choice == "d":
message, d, n = input("Enter Message, d, and n:").split(" ")
message, d, n = int(message), int(d), int(n)
decryptedMessage = rsa.decryptMessage(message, d, n)
print(f" Encrypted Message = {decryptedMessage}")
elif choice == "g":
# get bit_size input
rsa.get_bitSize()
p, q, random_num_tested= rsa.generatePrimes()
print(f"p {p},q = {q}")
privateKey, publicKey = rsa.generateKeyPairs(p, q)
print(f"private key : {privateKey}, public key : {publicKey}")
elif choice == "graph": # generates random keys of differenent size to compare time
#if g-> input=1 N_bits vs randomly tested values for primality else if g=0 N_bits vs Time
graph_nbit_time(0)
elif choice == "x":
sys.exit()
else:
print("Enter correct choice.")
if __name__ == "__main__":
while True:
main()