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

Node Classification in Social Network by Distributed Learning Automata

The aim of this article is improving the accuracy of node classification in social network using Distributed Learning Automata (DLA). In the proposed algorithm using a local similarity measure, new relations between node...

Design and Implementation of an Ultra-Wide Band, High Precision, and Low Noise Frequency Synthesizer

This paper presents system-level design and implementation of an ultra-wide tunable, high precision, fast locking, low phase noise, and low power portable fractional-N frequency synthesizer. The output frequency of the p...

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...

Application of Curve Fitting in Hyperspectral Data Classification and Compression

Regarding to the high between-band correlation and large volumes of hyperspectral data, feature reduction (either feature selection or extraction) is an important part of classification process for this data type. A vari...

COGNISON: A Novel Dynamic Community Detection Algorithm in Social Network

The problem of community detection has a long tradition in data mining area and has many challenging facet, especially when it comes to community detection in time-varying context. While recent studies argue the usabilit...

Download PDF file
  • EP ID EP190115
  • DOI 10.7508/jist.2013.02.006
  • Views 137
  • Downloads 0

How To Cite

Abdalhossein Rezai, Parviz Keshavarzi (2013). A New Finite Field Multiplication Algorithm to Improve Elliptic Curve Cryptosystem Implementations. Journal of Information Systems and Telecommunication, 1(2), 119-130. https://europub.co.uk/articles/-A-190115