Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF(2/sup m/)
Issue No. 08 - August (1992 vol. 41)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.156539
<p>Structures for parallel multipliers of a class of fields GF(2/sup m/) based on irreducible all one polynomials (AOP) and equally spaced polynomials (ESP) are presented. The structures are simple and modular, which is important for hardware realization. Relationships between an irreducible AOP and the corresponding irreducible ESPs have been exploited to construct ESP-based multipliers of large fields by a regular expansion of the basic modules of the AOP-based multiplier of a small field. Some features of the structures also enable a fast implementation of squaring and multiplication algorithms and therefore make fast exponentiation and inversion possible. It is shown that, if for a certain degree, an irreducible AOP as well as an irreducible ESP exist, then from the complexity point of view, it is advantageous to use the ESP-based parallel multiplier.</p>
squaring algorithms; parallel multipliers; finite fields; irreducible all one polynomials; equally spaced polynomials; multiplication algorithms; exponentiation; inversion; complexity; computational complexity; digital arithmetic; multiplying circuits; number theory.
M.A. Hasan, M. Wang, V.K. Bhargava, "Modular Construction of Low Complexity Parallel Multipliers for a Class of Finite Fields GF(2/sup m/)", IEEE Transactions on Computers, vol. 41, no. , pp. 962-971, August 1992, doi:10.1109/12.156539