Modified sequential normal basis multipliers for type II optimal normal bases

Dong Jin Yang, Chang Han Kim, Youngho Park, Yongtae Kim, Jong In Lim

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

6 Citations (Scopus)

Abstract

The arithmetic in finite field GF(2 m) is important in cryptographic application and coding theory. Especially, the area and time efficient multiplier in GF(2 m) has many applications in cryptographic fields, for example, ECC. In that point optimal normal basis give attractiveness in area efficient implementation. In [2], Reyhani-Masoleh and Hasan suggested an area efficient linear array for multiplication in GF(2 m) with slightly increased critical path delay from Agnew et al's structure. But in [3], S.Kwon et al. suggested an area efficient linear array for multiplication in GF(2 m) without losing time efficiency from Agnew et al's structure. We propose a modification of Reyhani-Masoleh and Hasan's structure with restriction to optimal normal basis type-II. The time and area efficiency of our multiplier is exactly same as that of S.Kwon et al's structure.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science
EditorsO. Gervasi, M.L. Gavrilova, V. Kumar, A. Lagana, H.P. Lee, Y. Mun, D. Taniar, C.J.K. Tan
Pages647-656
Number of pages10
Volume3481
EditionII
Publication statusPublished - 2005
EventInternational Conference on Computational Science and Its Applications - ICCSA 2005 - , Singapore
Duration: 2005 May 92005 May 12

Other

OtherInternational Conference on Computational Science and Its Applications - ICCSA 2005
CountrySingapore
Period05/5/905/5/12

Keywords

  • ECC
  • Finite fields
  • Gaussian Normal Basis
  • Massey-Omura multiplier

ASJC Scopus subject areas

  • Computer Science (miscellaneous)

Cite this

Yang, D. J., Kim, C. H., Park, Y., Kim, Y., & Lim, J. I. (2005). Modified sequential normal basis multipliers for type II optimal normal bases. In O. Gervasi, M. L. Gavrilova, V. Kumar, A. Lagana, H. P. Lee, Y. Mun, D. Taniar, ... C. J. K. Tan (Eds.), Lecture Notes in Computer Science (II ed., Vol. 3481, pp. 647-656)

Modified sequential normal basis multipliers for type II optimal normal bases. / Yang, Dong Jin; Kim, Chang Han; Park, Youngho; Kim, Yongtae; Lim, Jong In.

Lecture Notes in Computer Science. ed. / O. Gervasi; M.L. Gavrilova; V. Kumar; A. Lagana; H.P. Lee; Y. Mun; D. Taniar; C.J.K. Tan. Vol. 3481 II. ed. 2005. p. 647-656.

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

Yang, DJ, Kim, CH, Park, Y, Kim, Y & Lim, JI 2005, Modified sequential normal basis multipliers for type II optimal normal bases. in O Gervasi, ML Gavrilova, V Kumar, A Lagana, HP Lee, Y Mun, D Taniar & CJK Tan (eds), Lecture Notes in Computer Science. II edn, vol. 3481, pp. 647-656, International Conference on Computational Science and Its Applications - ICCSA 2005, Singapore, 05/5/9.
Yang DJ, Kim CH, Park Y, Kim Y, Lim JI. Modified sequential normal basis multipliers for type II optimal normal bases. In Gervasi O, Gavrilova ML, Kumar V, Lagana A, Lee HP, Mun Y, Taniar D, Tan CJK, editors, Lecture Notes in Computer Science. II ed. Vol. 3481. 2005. p. 647-656
Yang, Dong Jin ; Kim, Chang Han ; Park, Youngho ; Kim, Yongtae ; Lim, Jong In. / Modified sequential normal basis multipliers for type II optimal normal bases. Lecture Notes in Computer Science. editor / O. Gervasi ; M.L. Gavrilova ; V. Kumar ; A. Lagana ; H.P. Lee ; Y. Mun ; D. Taniar ; C.J.K. Tan. Vol. 3481 II. ed. 2005. pp. 647-656
@inproceedings{d1690de620aa438aba09c82aa73bf1b3,
title = "Modified sequential normal basis multipliers for type II optimal normal bases",
abstract = "The arithmetic in finite field GF(2 m) is important in cryptographic application and coding theory. Especially, the area and time efficient multiplier in GF(2 m) has many applications in cryptographic fields, for example, ECC. In that point optimal normal basis give attractiveness in area efficient implementation. In [2], Reyhani-Masoleh and Hasan suggested an area efficient linear array for multiplication in GF(2 m) with slightly increased critical path delay from Agnew et al's structure. But in [3], S.Kwon et al. suggested an area efficient linear array for multiplication in GF(2 m) without losing time efficiency from Agnew et al's structure. We propose a modification of Reyhani-Masoleh and Hasan's structure with restriction to optimal normal basis type-II. The time and area efficiency of our multiplier is exactly same as that of S.Kwon et al's structure.",
keywords = "ECC, Finite fields, Gaussian Normal Basis, Massey-Omura multiplier",
author = "Yang, {Dong Jin} and Kim, {Chang Han} and Youngho Park and Yongtae Kim and Lim, {Jong In}",
year = "2005",
language = "English",
volume = "3481",
pages = "647--656",
editor = "O. Gervasi and M.L. Gavrilova and V. Kumar and A. Lagana and H.P. Lee and Y. Mun and D. Taniar and C.J.K. Tan",
booktitle = "Lecture Notes in Computer Science",
edition = "II",

}

TY - GEN

T1 - Modified sequential normal basis multipliers for type II optimal normal bases

AU - Yang, Dong Jin

AU - Kim, Chang Han

AU - Park, Youngho

AU - Kim, Yongtae

AU - Lim, Jong In

PY - 2005

Y1 - 2005

N2 - The arithmetic in finite field GF(2 m) is important in cryptographic application and coding theory. Especially, the area and time efficient multiplier in GF(2 m) has many applications in cryptographic fields, for example, ECC. In that point optimal normal basis give attractiveness in area efficient implementation. In [2], Reyhani-Masoleh and Hasan suggested an area efficient linear array for multiplication in GF(2 m) with slightly increased critical path delay from Agnew et al's structure. But in [3], S.Kwon et al. suggested an area efficient linear array for multiplication in GF(2 m) without losing time efficiency from Agnew et al's structure. We propose a modification of Reyhani-Masoleh and Hasan's structure with restriction to optimal normal basis type-II. The time and area efficiency of our multiplier is exactly same as that of S.Kwon et al's structure.

AB - The arithmetic in finite field GF(2 m) is important in cryptographic application and coding theory. Especially, the area and time efficient multiplier in GF(2 m) has many applications in cryptographic fields, for example, ECC. In that point optimal normal basis give attractiveness in area efficient implementation. In [2], Reyhani-Masoleh and Hasan suggested an area efficient linear array for multiplication in GF(2 m) with slightly increased critical path delay from Agnew et al's structure. But in [3], S.Kwon et al. suggested an area efficient linear array for multiplication in GF(2 m) without losing time efficiency from Agnew et al's structure. We propose a modification of Reyhani-Masoleh and Hasan's structure with restriction to optimal normal basis type-II. The time and area efficiency of our multiplier is exactly same as that of S.Kwon et al's structure.

KW - ECC

KW - Finite fields

KW - Gaussian Normal Basis

KW - Massey-Omura multiplier

UR - http://www.scopus.com/inward/record.url?scp=24944495556&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=24944495556&partnerID=8YFLogxK

M3 - Conference contribution

VL - 3481

SP - 647

EP - 656

BT - Lecture Notes in Computer Science

A2 - Gervasi, O.

A2 - Gavrilova, M.L.

A2 - Kumar, V.

A2 - Lagana, A.

A2 - Lee, H.P.

A2 - Mun, Y.

A2 - Taniar, D.

A2 - Tan, C.J.K.

ER -