main| new issue| archive| editorial board| for the authors| publishing house|
Main page
New issue
Archive of articles
Editorial board
For the authors
Publishing house



No. 9. Vol. 25. 2019

DOI: 10.17587/it.25.553-561

. . Kolyada, Doctor of Physical and Mathematical Sciences, Associate Professor, e-mail:, P. V. Kuchynski, Doctor of Physical and Mathematical Sciences, Associate Professor, E-mail:, Research establishment "Institute of Applied Physics Problems of . N. Sevchenko" Belarusian State University, N. I. Chervyakov, Doctor of Technical Sciences, Professor, e-mail:,, Federal State Autonomous Educational Institution of Higher Professional Education "North-Caucasus Federal University"

The Threshold Method of Secret's Division Based on Redundant Modular Computing Structures

The article describes the formalization of the threshold method of modular separation of secret using minimally redundant coding. In particular, the conditions were determined to ensure the possibility of using minimum redundant modular arithmetic (MRMA) as the computer-arithmetic basis for the use in threshold cryptographic schemes of secret separation. In comparison with no redundant analogues, the MRMA allows to minimize the complexity of the operation of restoration of the secret-original on the basis of the share secrets belonging to groups of subscribers.
The conditions for the correctness of the threshold principle in the framework of modular coding are also obtained, and on this basis a method has been developed for neutralizing critical situations with ensuring an adequate level of cryptographic resistance.
Keywords: separation of the secret, minimally redundant modular arithmetic, horny scheme of modular separation of the secret, pseudo-random masking function, distributed computing


To the contents