Visible to the public Efficient Implementation of Cryptography on Points of an Elliptic Curve in Residue Number System

TitleEfficient Implementation of Cryptography on Points of an Elliptic Curve in Residue Number System
Publication TypeConference Paper
Year of Publication2019
AuthorsBabenko, Mikhail, Redvanov, Aziz Salimovich, Deryabin, Maxim, Chervyakov, Nikolay, Nazarov, Anton, Al-Galda, Safwat Chiad, Vashchenko, Irina, Dvoryaninova, Inna, Nepretimova, Elena
Conference Name2019 International Conference on Engineering and Telecommunication (EnT)
Keywordsadding points, arithmetic operations, computational complexity, cryptography, doubling points, elliptic curve, Elliptic curve cryptography, Elliptic curves, Galois fields, Jacobian matrices, Mathematical model, Metrics, Modular Multiplication, pubcrawl, public key cryptography, residue number system, residue number systems, resilience, Resiliency, RNS, Scalability, weighted number system
Abstract

The article explores the question of the effective implementation of arithmetic operations with points of an elliptic curve given over a prime field. Given that the basic arithmetic operations with points of an elliptic curve are the operations of adding points and doubling points, we study the question of implementing the arithmetic operations of adding and doubling points in various coordinate systems using the weighted number system and using the Residue Number System (RNS). We have shown that using the fourmodule RNS allows you to get an average gain for the operation of adding points of the elliptic curve of 8.67% and for the operation of doubling the points of the elliptic curve of 8.32% compared to the implementation using the operation of modular multiplication with special moduli from NIST FIPS 186.

DOI10.1109/EnT47717.2019.9030592
Citation Keybabenko_efficient_2019