Open AccessCorrectness problem of the threshold method of modular sharing of secrets with masking transformation
Author(s) -
А. Ф. Чернявский,
А. А. Коляда,
Anton Martinov,
С. Ю. Протасеня
Publication year - 2020
Publication title -
doklady nacionalʹnoj akademii nauk belarusi
Language(s) - English
Resource type - Journals
eISSN - 2524-2431
pISSN - 1561-8323
DOI - 10.29235/1561-8323-2019-63-6-662-671
Subject(s) - correctness , modular design , secret sharing , masking (illustration) , theoretical computer science , computer science , transformation (genetics) , cryptography , class (philosophy) , coding theory , coding (social sciences) , algorithm , mathematics , artificial intelligence , programming language , visual arts , gene , art , biochemistry , chemistry , statistics
The article formulates the principles of constructing threshold cryptographic schemes for secret sharing based on a modular coding and a linear masking function with an additive variational component of pseudo-random type. The main attention is paid to the correctness problem of schemes of the considered class within the limits of the accepted model. The congruent condition in the module of the secret-original ring of the masking function values in full and partial modular number systems is obtained. On the basis of the above-said, the method of correct implementation of the threshold principle of secret information sharing is developed. The proposed approach to solving the problem under study is demonstrated by specific numerical examples.