Scalable Karatsuba Multiplier Over Finite Field GF (2m)

A scalable architecture for efficient multiplication in finite fields GF (2 m ) was proposed. The proposed design had symmetric form with 64 × 64-bit inputs, supporting with any finite fields GF (2 m ), where m 320, through tiny change of control logic and register file. The analysis result showed it may improve the operation performance by 50 % over the NIST recommended curve of GF (2283) comparing with another original method.