scispace - formally typeset
Open Access

On the design of projective binary Edwards elliptic curves over GF (p) benefitting from mapping elliptic curves computation to variable degree of parallel design

TLDR
A variety of design choices are proposed by varying the degree of parallelism to tune-up several factors that affect ECC in order to investigate possible enhancements.
Abstract
Finding multiplicative inverse (Modular Inversion) operation is the most time-consuming operation in Elliptic Curve Crypto-system (ECC) operations which affects the performance of ECC. Moreover, several factors that affect the design of ECC have not been intensively investigated in the majority of researches related to ECC, Such as system utilization, area, resources-consuming and area*time cost factors, which play significant role in designing efficient ECC for different applications. This work applies Binary Edwards ECC point doubling operation over GF(p) using projective coordinates instead of affine coordinates due to its ability to remove the long time inversion operation by converting it to a number of multiplication operations. We also utilize the inherent parallelism in ECC operations by mapping its computations to parallel hardware design, in order to improve the performance of ECC. Our results show that the shortest time delay is achieved using 7-Parallel Multipliers (PM) design with projection (X/Z, Y/Z), which overcomes both serial design and the design with affine coordinates. Furthermore, this research proposes a variety of design choices by varying the degree of parallelism to tune-up several factors that affect ECC in order to investigate possible enhancements. It is shown by our experiments that the hardware utilization can be improved by 55%, with less area, and acceptable timeconsuming level compared to other designs in the same projection. In other words, we compromise th performance to enhance system utilization degree, and AT cost, and to reduce area and resourceconsuming. This trade-off between factors is useful to determine the efficient design to be used for different ECC applications based on their requirements and available resources. Especially, when the time-consuming is not the main priority.

read more

Citations
More filters
Journal Article

A high-performance reconfigurable elliptic curve processor for GF(2m)

TL;DR: In this article, a processor architecture for elliptic curves cryptosystems over fields GF(2 m ) is proposed, which is a scalable architecture in terms of area and speed that exploits the abilities of reconfigurable hardware to deliver optimized circuitry for different elliptic curve and finite fields.
Journal Article

Projective coordinates leak

TL;DR: It is shown that allowing an adversary access to the projective representation of P, obtained using a particular double and add method, may result in information being revealed about k, hence casting potential doubt on the appropriateness of blindly modelling elliptic-curves as generic groups.
Journal ArticleDOI

High-Speed and Secure Elliptic Curve Cryptosystem for Multimedia Applications

TL;DR: The proposed ECC improves the performance of data encryption process by accelerating the scaler multiplication operation, while strengthening the immunity of the cryptosystem against side channel attacks, and achieves higher performance level compared to previous ECC implementations.
Journal ArticleDOI

3 Introducing Primality Testing Algorithm with an Implementation on 64 bits RSA Encryption Using Verilog

TL;DR: An efficient fast Primality testing algorithm is proposed to meet the requirement for generating the key in RSA algorithm by using right-to-left-binary method for the exponent calculation and reduces the number of cycles enhancing the performance of the system and reducing the area usage of the FPGA.
Journal Article

Some Algorithms of Various Projective Coordinate Systems for ECC Using Ancient Indian Vedic Mathematics Sutras

TL;DR: The results proved that the Vedic Mathematics based schemes show better performance compared to the conventional method and the total delay in computation is reduced by Vedic mathematics Sutras with the help of MATLAB software.
References
More filters
Book

Handbook of Applied Cryptography

TL;DR: A valuable reference for the novice as well as for the expert who needs a wider scope of coverage within the area of cryptography, this book provides easy and rapid access of information and includes more than 200 algorithms and protocols.
Journal ArticleDOI

Elliptic curve cryptosystems

TL;DR: The question of primitive points on an elliptic curve modulo p is discussed, and a theorem on nonsmoothness of the order of the cyclic subgroup generated by a global point is given.
Book ChapterDOI

Use of Elliptic Curves in Cryptography

TL;DR: In this paper, an analogue of the Diffie-Hellmann key exchange protocol was proposed, which appears to be immune from attacks of the style of Western, Miller, and Adleman.
Book

Cryptography: Theory and Practice

TL;DR: The object of the book is to produce a general, comprehensive textbook that treats all the essential core areas of cryptography.
Book

Guide to Elliptic Curve Cryptography

TL;DR: This guide explains the basic mathematics, describes state-of-the-art implementation methods, and presents standardized protocols for public-key encryption, digital signatures, and key establishment, as well as side-channel attacks and countermeasures.
Related Papers (5)