The security of the scheme is set up on the intricate nature of the elliptic curve discrete logarithm problem and the knapsack problem. 方案的安全性建立在橢圓曲線(xiàn)離散對數問(wèn)題和變形的背包問(wèn)題的難解性上。
To solve these two problems, a new multi-secret sharing scheme based on the intractability of the discrete logarithm was presented. 針對這兩個(gè)問(wèn)題，基于離散對數求解的困難性提出了一個(gè)新的門(mén)限多秘密共享方案。
