Correctness problem of the threshold method of modular sharing of secrets with masking transformation
https://doi.org/10.29235/1561-8323-2019-63-6-662-671
Abstract
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.
About the Authors
A. F. Chernyavsky
Institute of Applied Physical Problems named after A. N. Sevchenko of the Belarusian State University
Belarus
Belarus
Chernyavsky Alexander Fedorovich – Academician, D. Sc. (Engineering), Professor, Head of the Laboratory.
7, kurchatov Str., 220045, Minsk
A. A. Kolyada
Institute of Applied Physical Problems named after A. N. Sevchenko of the Belarusian State University
Belarus
Belarus
Kolyada Andrey Alexeyevich – D. Sc. (Physics and Mathematics), Associate professor, Chief researcher.
7, kurchatov Str., 220045, Minsk
A. O. Martinov
Institute of Applied Physical Problems named after A. N. Sevchenko of the Belarusian State University
Belarus
Belarus
Martinov Anton Olegovich – Researcher.
7, kurchatov Str., 220045, Minsk
S. Yu. Protasenya
Institute of Applied Physical Problems named after A. N. Sevchenko of the Belarusian State University
Belarus
Belarus
Protasenya Stella Yuryevna – Junior researcher.
7, kurchatov Str., 220045, Minsk
References
1. Kharin Yu. S., Agievich S. V., Vasiliev D. V., Matveev G. V. Cryptology. Minsk, Belarusian State University, 2013. 512 p. (in Russian).
2. Chervyakov N. I., Evdokimov A. A., Galushkin A. I., Lavrinenko I. N., Lavrinenko A. V. The Use of Artificial Neural Networks and the Residual Class System in Cryptography. Moscow, Fizmatlit Publ., 2012. 280 p. (in Russian).
3. Chervyakov N. I., Kolyada A. A., Lyahov P. A., Babenko M. G., Lavrinenko I. N., Lavrinenko A. V. Modular Arithmetic and its Applications in Infocommunication Technologies. Moscow, Fizmatlit Publ., 2017. 400 p. (in Russian).
4. Bahramian Mojtaba, Eslami Khadijeh. An efficient threshold verifiable multisecret sharing scheme using generalized jacobian of elliptic curves. Algebraic Structures and their Applications, 2017, vol. 4, no. 2, pp. 45–55. https://doi.org/10.29252/asta.4.2.45
5. Xingxing Jia, Daoshun Wang, Daxin Nie, Xiangyang Luo, Jonathan Zheng Sun. A new threshold changeable secret sharing scheme based on the Chinese remainder theorem. Information Sciences, 2019, vol. 473, pp. 13–30. https://doi.org/10.1016/j.ins.2018.09.024
6. Ananda Mohan P. V. Residue number systems: Theory and applications. Basel, 2016. 351 p. https://doi.org/10.1007/978-1-4615-0997-4
7. Vinogradov I. M. Fundamentals of number theory. Saint Petersburg, Lan' Publ., 2009. 176 p. (in Russian).
Review
Views: 719
Email this article 