### 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 language | English |
---|---|

Title of host publication | Lecture Notes in Computer Science |

Editors | O. Gervasi, M.L. Gavrilova, V. Kumar, A. Lagana, H.P. Lee, Y. Mun, D. Taniar, C.J.K. Tan |

Pages | 647-656 |

Number of pages | 10 |

Volume | 3481 |

Edition | II |

Publication status | Published - 2005 |

Event | International Conference on Computational Science and Its Applications - ICCSA 2005 - , Singapore Duration: 2005 May 9 → 2005 May 12 |

### Other

Other | International Conference on Computational Science and Its Applications - ICCSA 2005 |
---|---|

Country | Singapore |

Period | 05/5/9 → 05/5/12 |

### Keywords

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

### ASJC Scopus subject areas

- Computer Science (miscellaneous)

### Cite this

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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

}

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 -