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.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.