Numerical method of the threshold secret sharing over a group of the elliptic curve

Бесплатный доступ

This paper presents a method of secret sharing based on imperfect threshold circuit Mignotte and key distribution scheme Massey-Omura. Threshold and elliptical cryptography has the advantage of parallel processing part of the secret, renewal, verification, change the number of users and the entropy of the secrets than the existing counterparts. The proposed scheme can be used to build secure systems, transmission, storage, processing and presentation of data in computer networks.

Cryptosystem on the elliptic curve points, residue number system, secret sharing schemes

Короткий адрес: https://sciup.org/140191607

IDR: 140191607

Статья научная