Time-efficient computation of digit serial Montgomery multiplication

In this paper, we have proposed a most-significant-digit (MSD) first digit-serial Montgomery multiplication (MM) in a special class of binary field GF (2^m). The field is generated by irreducible pentanomials satisfying predefined conditions as listed in the paper. The value of R(x) is different from the existing reported work: R(x) = x^m or R(x) = x^m-1. We proved that implementation of MM in such special class of binary fields which can be further improved in terms of critical path delay by a maximum of 63%. Comparison results also show that the gate count of the proposed architecture has been reduced compared to the former works.