-
Notifications
You must be signed in to change notification settings - Fork 1
/
RsaPublicKeyDist.py
75 lines (57 loc) · 1.2 KB
/
RsaPublicKeyDist.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
#!/usr/bin/python
import math
import random as rm
def isEven(num):
if num & 1 == 0:
return True
return False
# function for finding out wheather number is prime or not
def isPrime(num):
if isEven(num):
return False
for i in range(2 , int(math.sqrt(num))+1):
if num % i == 0:
return False
else:
return True
def GCD(small , big):
for i in range(small , 0 , -1):
if big % i == 0 and small % i == 0:
return i
else:
return 1
def nmGenerator(p,q):
return p*q , (p-1)*(q-1)
# function to generate PUBLIC KEY
def eGenerator(m):
eArr = []
for i in range(1,10):
if GCD(i,m)==1:
eArr.append(i)
while True:
e = rm.choice(eArr)
if e > 1 and e < m:
return e
# function to generate PRIVATE KEY
def dGenerator(e,m):
ee = e % m
for i in range(m):
if (ee * i )% m== 1:
return i
def main():
PrimeList = [x for x in range(10,200) if isPrime(x)]
while True:
p = rm.choice(PrimeList)
q = rm.choice(PrimeList)
if p != q:
break
if isPrime(p) and isPrime(q):
n,m = nmGenerator(p,q)
e = eGenerator(m)
fd = open("Repository.txt","w")
fd.write(str(n)+"\n"+str(e))
fd.close()
d = dGenerator(e,m)
print("private key is : ",d)
if __name__ == '__main__':
main()