Low Complexity Digit Serial Systolic Montgomery Multipliers for Special Class of GF(2(m))
Montgomery Algorithm for modular multiplication with a large modulus has been widely used in public key cryptosystems for secured data communication. This paper presents a digit-serial systolic multiplication architecture for all-one polynomials (AOP) over GF(2(m)) for efficient implementation of Montgomery Multiplication (MM) Algorithm suitable for cryptosystem. Analysis shows that the latency and circuit complexity of the proposed architecture are significantly less than those of earlier designs for same classes of polynomials. Since the systolic multiplier has the features of regularity, modularity and unidirectional data flow, this structure is well suited to VLSI implementations. The proposed multipliers have clock cycle latency of (2N - 1), where N = [m/L], m is the word size and is the digit size. No digit serial systolic architecture based on MM algorithm over GF(2(m)) is reported before. The architecture is also compared to two well known digit serial systolic architectures.
multiplication montgomery algorithm digit-serial vlsi finite field systolic array