A New Finite Field Multiplication Algorithm to Improve Elliptic Curve Cryptosystem Implementations
Journal Title: Journal of Information Systems and Telecommunication - Year 2013, Vol 1, Issue 2
Abstract
This paper presents a new and efficient implementation approach for the elliptic curve cryptosystem (ECC) based on a novel finite field multiplication in GF(2m) and an efficient scalar multiplication algorithm. This new finite field multiplication algorithm performs zero chain multiplication and required additions in only one clock cycle instead of several clock cycles. Using modified (limited number of shifts) Barrel shifter; the partial result is also shifted in one clock cycle instead of several clock cycles. Both the canonical recoding technique and the sliding window method are applied to the multiplier to reduce the average number of required clock cycles. In the scalar multiplication algorithm of the proposed implementation approach, the point addition and point doubling operations are computed in parallel. The sliding window method and the signed-digit representation are also used to reduce the average number of point operations. Based on our analysis, the computation cost (the average number of required clock cycles) is effectively reduced in both the proposed finite field multiplication algorithm and the proposed implementation approach of ECC in comparison with other ECC finite field multiplication algorithms and implementation approaches.
Authors and Affiliations
Abdalhossein Rezai, Parviz Keshavarzi
Keywords
Related Articles
- EP ID EP190115
- DOI 10.7508/jist.2013.02.006
- Views 126
- Downloads 0
Unsupervised Segmentation of Retinal Blood Vessels Using the Human Visual System Line Detection Model
Retinal image assessment has been employed by the medical community for diagnosing vascular and non-vascular pathology. Computer based analysis of blood vessels in retinal images will help ophthalmologists monitor larger...
Improving Accuracy, Area and Speed of Approximate Floating-Point Multiplication Using Carry Prediction
The arithmetic units are the most essential in digital circuits’ construct, and the enhancement of their operation would optimize the whole digital system. Among them, multipliers are the most important operational units...
A New Switched-beam Setup for Adaptive Antenna Array Beamforming
In this paper, a new spatio-temporal based approach is proposed which improves the speed and performance of temporal-based algorithms, conventional Least Mean Square (LMS), Normalized LMS (NLMS) and Variable Step-size LM...
Coreference Resolution Using Verbs Knowledge
Coreference resolution is the problem of determining which mention in a text refer to the same entities, and is a crucial and difficult step in every natural language processing task. Despite the efforts that have been m...
A Low-Jitter 20-110MHz DLL Based on a Simple PD and Common-Mode Voltage Level Corrected Differential Delay Elements
In this paper, a 16-phases 20MHz to 110MHz low jitter delay locked loop, DLL, is proposed in a 0.35µm CMOS process. A sensitive open loop phase detector, PD, is introduced based on a novel idea to simply detect small pha...