Formal Design of Arithmetic Circuits over Galois Fields Based on Normal Basis Representations

Access this Article

Author(s)

Abstract

This paper presents a graph-based approach to designing arithmetic circuits over Galois fields (GFs) using normal basis representations. The proposed method is based on a graph-based circuit description called <i>Galois-field Arithmetic Circuit Graph</i> (<i>GF-ACG</i>). First, we extend GF-ACG representation to describe GFs defined by normal basis in addition to polynomial basis. We then apply the extended design method to Massey-Omura parallel multipliers which are well known as typical multipliers based on normal basis. We present the formal description of the multipliers in a hierarchical manner and show that the verification time can be greatly reduced in comparison with those of the conventional techniques. In addition, we design GF exponentiation circuits consisting of the Massey-Omura parallel multipliers and an inversion circuit over composite field <i>GF</i>(((2<sup>2</sup>)<sup>2</sup>)<sup>2</sup>) in order to demonstrate the advantages of normal-basis circuits over polynomial-basis ones.

Journal

  • IEICE Transactions on Information and Systems

    IEICE Transactions on Information and Systems E97.D(9), 2270-2277, 2014

    The Institute of Electronics, Information and Communication Engineers

Codes

Page Top