-
Notifications
You must be signed in to change notification settings - Fork 0
/
protocol.py
141 lines (92 loc) · 2.85 KB
/
protocol.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
from random import randint
import csv
import time
import subprocess
import sys
import multiprocessing
def rsa_encrypt_decrypt(M, key):
c = pow(M, key[0]) % key[1]
return c
def is_prime(num):
if num <= 1:
return False
for i in range(2, int(num ** 0.5) + 1):
if num % i == 0:
return False
return True
def run_protocol(I, J, r1, r2, e, n, d):
start = time.perf_counter()
bobPubKey = [e, n]
bobPrivKey = [d, n]
N = n.bit_length()
X = randint(0, n)
c = rsa_encrypt_decrypt(X, bobPubKey)
c = c - I
scope = r2 + r1
n = [0] * (scope + 1)
for i in range(1, len(n)):
n[i] = rsa_encrypt_decrypt(c + i, bobPrivKey)
m = n[1:]
N = max(m).bit_length()
prime_list = [i for i in range(2, 2 ** (N - 1)) if is_prime(i)]
Z = [0] * (scope)
prime = prime_list.pop()
for i in range(0, len(m)):
Z[i] = m[i] % prime
bool = False
while not bool:
prime_found = True
for i in range(len(m)):
for j in range(i + 1, len(m)):
if abs(Z[i] - Z[j]) < 2 or not (0 < Z[i] < prime - 1):
prime_found = False
break
if not prime_found:
break
if prime_found:
bool = True
elif prime_list:
prime = prime_list.pop()
Z = [val % prime for val in m]
else:
break
for i in range(J, len(Z)):
Z[i] = (Z[i] + 1) % prime
if X % prime == Z[I - 1]:
output = False
else:
output = True
correct = output == (I > J)
compute_time = time.perf_counter() - start
return I, J, output, correct, compute_time
def process_iteration(args):
I, J, r1, r2, e, n, d = args
result = run_protocol(I, J, r1, r2, e, n, d)
return result
if __name__ == '__main__':
start = time.perf_counter()
e = 17
n = 3233
d = 413
num_iterations = 20
rand = randint(0, 999999)
csv_file = f"protocol_results~{str(rand)}.csv"
pool = multiprocessing.Pool()
with open(csv_file, mode="w", newline="") as file:
writer = csv.writer(file)
writer.writerow(["I", "J", "Output", "Correct", "Compute Time"])
iteration_args = []
for i in range(num_iterations):
I = randint(1, 100000)
J = randint(1, 100000)
r1 = min(I, J)
r2 = max(I, J)
iteration_args.append((I, J, r1, r2, e, n, d))
results = pool.map(process_iteration, iteration_args)
for result in results:
writer.writerow(result)
pool.close()
pool.join()
time_elapsed = time.perf_counter()-start
print(f"\tProtocol results recorded in 'protocol_results~{rand}.csv'")
subprocess.run([sys.executable, "analyze.py", str(rand), str(time_elapsed)])