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

Early Detection of Pediatric Heart Disease by Automated Spectral Analysis of Phonocardiogram

Early recognition of heart disease is an important goal in pediatrics. Developing countries have a large population of children living with undiagnosed heart murmurs. As a result of an accompanying skills shortage, most...

A New Robust Digital Image Watermarking Algorithm Based on LWT-SVD and Fractal Images

This paper presents a robust copyright protection scheme based on Lifting Wavelet Transform (LWT) and Singular Value Decomposition (SVD). We have used fractal decoding to make a very compact representation of watermark i...

Acoustic Noise Cancellation Using an Adaptive Algorithm Based on Correntropy Criterion and Zero Norm Regularization

The least mean square (LMS) adaptive algorithm is widely used in acoustic noise cancellation (ANC) scenario. In a noise cancellation scenario, speech signals usually have high amplitude and sudden variations that are mod...

Automatic Construction of Domain Ontology Using Wikipedia and Enhancing it by Google Search Engine

The foundation of the Semantic Web are ontologies. Ontologies play the main role in the exchange of information and development of the Lexical Web to the Semantic Web. Manual construction of ontologies is time-consuming,...

A Semantic Approach to Person Profile Extraction from Farsi Web Documents

Entity profiling (EP) as an important task of Web mining and information extraction (IE) is the process of extracting entities in question and their related information from given text resources. From computational viewp...

Download PDF file
  • EP ID EP190115
  • DOI 10.7508/jist.2013.02.006
  • Views 132
  • 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