A modified architecture for Optimal Normal Basis multiplication based on pre-computation

In this paper, a newly modified optimal normal basis multiplier based on the Massey-Omura method is proposed. Improvements in both area and critical path delay have been achieved over the next best architecture in the literature, through the use of pre-computation. These improvements allow for the design of small, fast multipliers for the implementation of Elliptic Curve Cryptography.