New cryptosystems on elliptic curve points based on the package knapsacks difficulty

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

In the paper we develop a cryptosystem on the points of an elliptic curve, based on the package knapsacks difficulty. To construct a cryptosystem uses the pairing operation of the elliptic curve defined over a finite ring. All arithmetic operations are performed in the residue number system.

Cryptosystem on the elliptic curve points, residue number system, pairing of the elliptic curve points

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

IDR: 140191587

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