Versatile multiplier architectures in [formula omitted] fields using the Montgomery multiplication algorithm

Abstract

Many sequential multipliers for polynomial basis GF ( 2 k ) fields have been proposed using the LSbit and MSbit multiplication algorithm. However, all those designs are defined over fixed size GF ( 2 k ) fields and sometimes over fixed special form irreducible polynomials (AOL, trinomials, pentanomials). When such architectures are redesigned for arbitrary GF ( 2 k ) fields and generic irreducible polynomials, therefore made versatile, they result in high space complexity (gate–latch number), low frequency (high critical path) and high latency designs. In this paper a Montgomery multiplication element (MME) architecture specially designed for arbitrary GF ( 2 k ) fields defined over general irreducible polynomials, is proposed, based on an optimized version of the Montgomery multiplication (MM) algorithm for GF ( 2 k ) fields. To evaluate the proposed MME and prove the efficiency of the MM algorithm in versatile designing, three distinct versatile Montgomery multiplier architectures are presented using this proposed MME. They achieve small gate–latch number and high clock frequency compared to other sequential versatile designs.