-
Notifications
You must be signed in to change notification settings - Fork 0
/
blakley.py
96 lines (79 loc) · 2.98 KB
/
blakley.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
import sys
import copy
import random
from math import ceil
from operator import add
from functools import reduce
from utils import read, read_struct, write, ratio, cleanup
from prime import gen_prime
def solve(mat_orig, d, p):
mat = copy.deepcopy(mat_orig)
d = d[:]
k = len(mat[0])
for i in range(k):
aii = mat[i][i]
for j in range(k):
mat[i][j] = ratio(mat[i][j], aii, p)
d[i] = ratio(d[i], aii, p)
for row in range(len(mat)):
if row != i:
coeff = -mat[row][i] % p
d[row] = (d[row] + d[i] * coeff) % p
for col in range(k):
mat[row][col] = (mat[row][col] + mat[i][col] * coeff) % p
return d
def gen_mat(p, n, m, q):
a = [[0 for _j in range(m + 1)] for _i in range(n)]
# расставить единицы
for i in range(n):
a[i][random.randint(0, m)] = 1
# расставить остальные элементы
for i in range(n):
for j in range(m):
if a[i][j] != 1:
a[i][j] = random.randint(2, p - 1)
a[i][m] = -reduce(add, map(lambda ax: ax[0] * ax[1] % p, zip(a[i][:-1], q))) % p
return a
def gen_parts(p_size, msg, n, k):
if n < k:
print('ОШИБКА: число долей={} больше k={}'.format(n, k))
return
with open(msg, 'rb') as f:
msg = bytearray(f.read())
part_size = ceil(len(msg) / k)
q = [int.from_bytes(msg[i * part_size:(i + 1) * part_size], byteorder='big') for i in range(k)]
p_size_max = max(qi.bit_length() for qi in q) + 1
if p_size_max > p_size:
p_size = p_size_max + 1
print('ЛОГ: длина модуля p изменена на {}'.format(p_size))
p = gen_prime(p_size)
mat = gen_mat(p, n, k, q)
write('p.txt', p)
for idx, part in enumerate(mat):
write('part_{}.txt'.format(idx + 1), part)
def check_secret(p, parts):
mat = [list(part)[:-1] for part in parts]
if len(mat) < len(mat[0]):
print('ОШИБКА: не хватает частей секрета')
return
d = [-part[-1] % p for part in parts]
q = solve(mat, d, p)
x = reduce(add, [qi.to_bytes(length=ceil(qi.bit_length() / 8), byteorder='big') for qi in q])
with open('secret.txt', 'wb') as f:
f.write(x)
def main():
if sys.argv[1] == '-g':
gen_parts(int(sys.argv[2]), sys.argv[3], int(sys.argv[4]), int(sys.argv[5]))
elif sys.argv[1] == '-c':
idx_parts = list(map(lambda idx: int(idx), sys.argv[2:]))
if len(set(idx_parts)) != len(idx_parts):
print('ОШИБКА: дубликаты в массиве индексов')
return
parts = [read_struct('part_{}.txt'.format(idx)) for idx in idx_parts]
check_secret(read('p.txt'), parts)
elif sys.argv[1] == '-clean':
cleanup()
else:
print('ОШИБКА: неверный код операции')
if __name__ == '__main__':
main()