Compare commits
3 Commits
db6c6bef23
...
6c1fefd9d3
Author | SHA1 | Date | |
---|---|---|---|
6c1fefd9d3 | |||
c8975a104b | |||
e4ce861ec7 |
11
src/tpre.py
11
src/tpre.py
@ -271,10 +271,18 @@ def hash6(triple_G: Tuple[point, point, point]) -> int:
|
|||||||
|
|
||||||
|
|
||||||
def f(x: int, f_modulus: list, T: int) -> int:
|
def f(x: int, f_modulus: list, T: int) -> int:
|
||||||
""" """
|
'''
|
||||||
|
功能: 通过多项式插值来实现信息的分散和重构
|
||||||
|
例如: 随机生成一个多项式f(x)=4x+5,质数P=11,其中f(0)=5,将多项式的系数分别分配给两个人,例如第一个人得到(1, 9),第二个人得到(2, 2).如果两个人都收集到了这两个点,那么可以使用拉格朗日插值法恢复原始的多项式,进而得到秘密信息"5"
|
||||||
|
param:
|
||||||
|
x, f_modulus(多项式系数列表), T(门限)
|
||||||
|
return:
|
||||||
|
res
|
||||||
|
'''
|
||||||
res = 0
|
res = 0
|
||||||
for i in range(T):
|
for i in range(T):
|
||||||
res += f_modulus[i] * pow(x, i)
|
res += f_modulus[i] * pow(x, i)
|
||||||
|
res = res % sm2p256v1.P
|
||||||
return res
|
return res
|
||||||
|
|
||||||
|
|
||||||
@ -324,6 +332,7 @@ def Encapsulate(pk_A: point) -> Tuple[int, capsule]:
|
|||||||
E = multiply(g, r)
|
E = multiply(g, r)
|
||||||
V = multiply(g, u)
|
V = multiply(g, u)
|
||||||
s = u + r * hash2((E, V))
|
s = u + r * hash2((E, V))
|
||||||
|
s = s % sm2p256v1.P
|
||||||
pk_A_ru = multiply(pk_A, r + u)
|
pk_A_ru = multiply(pk_A, r + u)
|
||||||
K = KDF(pk_A_ru)
|
K = KDF(pk_A_ru)
|
||||||
capsule = (E, V, s)
|
capsule = (E, V, s)
|
||||||
|
Loading…
x
Reference in New Issue
Block a user