A fast hardware implementation of multiplicative inversion in GF(2m)
- Resource Type
- Conference
- Authors
- Deng, Qiucheng; Bai, Xuefei; Guo, Li; Wang, Yao
- Source
- 2009 Asia Pacific Conference on Postgraduate Research in Microelectronics & Electronics (PrimeAsia) Microelectronics & Electronics, 2009. PrimeAsia 2009. Asia Pacific Conference on Postgraduate Research in. :472-475 Nov, 2009
- Subject
- Components, Circuits, Devices and Systems
Computing and Processing
Engineered Materials, Dielectrics and Plasmas
Hardware
Iterative algorithms
Galois fields
Elliptic curve cryptography
Clocks
Reed-Solomon codes
Arithmetic
Computer architecture
Books
Very large scale integration
Optimal normal basis
finite field
multiplicative inversion
elliptic curve cryptography
- Language
- ISSN
- 2159-2144
2159-2160
In this paper, a fast hardware implementation of multiplicative inversion in GF(2 m ) using the optimal normal basis of type II is presented. The approach followed is based on the Sunar-Koç multiplier and the Itoh-Tsujii algorithm. Our design is able to compute multiplicative inversion in GF(2 233 ) using only 26 clock cycles.