A fast inversion algorithm and low-complexity architecture over GF(2 m)

Sosun Kim, Nam Su Chang, Chang Han Kim, Young Ho Park, Jongin Lim

Research output: Chapter in Book/Report/Conference proceedingConference contribution

3 Citations (Scopus)

Abstract

The performance of public-key cryptosystems is mainly appointed by the underlying finite field arithmetic. Among the basic arithmetic operations over finite field, the multiplicative inversion is the most time consuming operation. In this paper, a fast inversion algorithm over GF(2m) with the polynomial basis representation is proposed, The proposed algorithm executes in about 27.5% or 45.6% less iterations than the extended binary gcd algorithm (EBGA) or the montgomery inverse algorithm (MIA) over GF(2163), respectively. In addition, we propose a new hardware architecture to apply for low-complexity systems. The proposed architecture takes approximately 48.3% or 24.0% less the number of reduction operations than [4] or [8] over GF(2 239), respectively. Furthermore, it executes in about 21.8% less the number of addition operations than [8] over GF(2163).

Original languageEnglish
Title of host publicationComputational Intelligence and Security - International Conference, CIS 2005, Proceedings
PublisherSpringer Verlag
Pages1-8
Number of pages8
ISBN (Print)3540308199, 9783540308195
DOIs
Publication statusPublished - 2005
EventInternational Conference on Computational Intelligence and Security, CIS 2005 - Xi'an, China
Duration: 2005 Dec 152005 Dec 19

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3802 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Other

OtherInternational Conference on Computational Intelligence and Security, CIS 2005
CountryChina
CityXi'an
Period05/12/1505/12/19

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'A fast inversion algorithm and low-complexity architecture over GF(2 <sup>m</sup>)'. Together they form a unique fingerprint.

  • Cite this

    Kim, S., Chang, N. S., Kim, C. H., Park, Y. H., & Lim, J. (2005). A fast inversion algorithm and low-complexity architecture over GF(2 m). In Computational Intelligence and Security - International Conference, CIS 2005, Proceedings (pp. 1-8). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3802 LNAI). Springer Verlag. https://doi.org/10.1007/11596981_1