-
Notifications
You must be signed in to change notification settings - Fork 0
/
rabin.py
126 lines (100 loc) · 2.12 KB
/
rabin.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
from Crypto.PublicKey import RSA
import random
def generate_RSA(bits=1024):
new_key = RSA.generate(bits)
p=new_key.p
q=new_key.q
n=p*q
e= new_key.e
d= new_key.d
public_key = new_key.publickey().exportKey("PEM")
private_key = new_key.exportKey("PEM")
pubKeyObj = RSA.importKey(public_key)
privKeyObj = RSA.importKey(private_key)
return privKeyObj, pubKeyObj, n, e, d, p,q
priv,pub,n,e,d,p,q=generate_RSA()
# p=7
# q=11
# n=77
# e=11
xr = random.randint(1, n-1)
m=2345
me=pub.encrypt(m, 'x')[0]
def modInverse(a, m1):
m0 = m1
y = 0
x = 1
if (m1 == 1):
return 0
while (a > 1):
# q is quotient
q1 = a // m1
t = m1
# m is remainder now, process
# same as Euclid's algo
m1 = a % m1
a = t
t = y
# Update x and y
y = x - q1 * y
x = t
# Make x positive
if (x < 0):
x = x + m0
return x
def gcdExtended(a, b):
# Base Case
if a == 0:
x = 0
y = 1
return b,x,y
# To store results of recursive call
gcd,x1,y1 = gcdExtended(b % a, a)
# Update x and y using results of recursive
# call
x = y1 - (b / a) * x1
y = x1
return gcd,x,y
def send():
rec(n,e,me)
def rec(n,e,me):
x1=pow(xr,2,n)
print(x1)
#print xr
send2(x1)
def send2(x1):
p1=p//4
q1=q//4
mp = pow(x1, p1+1, p)
mp=p-mp
mq = pow(x1, q1+1, q)
gcd, yp,yq=gcdExtended(p, q)
print(gcd,mp,yp,mq,yq)
r=(yp*p*mq+yq*q*mp)%n
r1=n-r
s = (yp * p * mq - yq * q * mp) % n
s1=n-s
ro=[r,r1,s,s1]
ri=random.randint(0,3)
#rec2(ro[ri])
print(r)
#print(r1)
#print(s)
#print(s1)
#print xr
def rec2(r):
if r==xr or r==-1*xr:
print("CBD")
return
xa=abs(r-xr)
p1,a1,a2=gcdExtended(xa,n)
q1=n/p1
ph=(p1-1)*(q1-1)
print(p1)
print(p)
print(q1)
print(q)
d1=modInverse(e,ph)
md=pow(me,d1,n)
print(md)
send()