CONSTRUCTING AND IMPLEMENTING SOME PERFECT VERIFIABLE SECRET SHARING SCHEMES
2021 ◽
Vol 2
(64)
◽
pp. 13-17
Keyword(s):
Most of the existing public key cryptosystems are potentially vulnerable to cryptographic attacks as they rely on the problems of discrete logarithm and factorization of integers. There is now a need for algorithms that will resist attacks on quantum computers. The article describes the implementation of Shamir’s post-quantum secret sharing scheme using long arithmetic that can be applied in modern cryptographic modules. The implementation of the Pedersen – Shamir scheme is described, which allows preserving the property of the perfection of the Shamir scheme by introducing testability. The article presents graphs reflecting the influence of the verifiability property in the Shamir secret sharing scheme on the speed of its operation.
2020 ◽
Vol 15
(6)
◽
2021 ◽
Vol 2096
(1)
◽
pp. 012008
2020 ◽
Vol 7
(2)
◽
pp. 018-022
2006 ◽
pp. 103-117
◽