Open AccessCONSTRUCTING AND IMPLEMENTING SOME PERFECT VERIFIABLE SECRET SHARING SCHEMES
Author(s) -
Mariya A. Gusarova
Publication year - 2021
Publication title -
avtomatizaciâ processov upravleniâ
Language(s) - English
Resource type - Journals
ISSN - 1991-2927
DOI - 10.35752/1991-2927-2021-2-64-13-17
Subject(s) - verifiable secret sharing , secret sharing , discrete logarithm , cryptography , cryptosystem , shamir's secret sharing , computer science , scheme (mathematics) , homomorphic secret sharing , theoretical computer science , integer factorization , property (philosophy) , secure multi party computation , arithmetic , public key cryptography , mathematics , computer security , encryption , mathematical analysis , philosophy , set (abstract data type) , epistemology , programming language
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.