Unified radix-4 multiplier for GF(p) and GF(2^n)

We describe a scalable unified architecture for Montgomery multiplication over either of the finite fields GF(p) and GF(2n). This architecture has the advantage of possessing a new redundant binary adder that supports carry-save additions under either of the Galois fields without the need for an external control signal to specify which field is to be used. Its main advantage over previously reported dual field multiplier is that a control signal which is broadcast to all cells to suppress carries under GF(2n is not needed. Consequently, larger multipliers can be synthesised whose pipelined speed is independent of the buffering required for the control signal.

[1]  A. Avizeinis,et al.  Signed Digit Number Representations for Fast Parallel Arithmetic , 1961 .

[2]  Johann Großschädl,et al.  A Bit-Serial Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m) , 2001, CHES.

[3]  N. Burgess,et al.  A (4:2) adder for unified GF (p) and GF (2n) Galois field multipliers , 2002, Conference Record of the Thirty-Sixth Asilomar Conference on Signals, Systems and Computers, 2002..

[4]  Mark Horowitz,et al.  SPIM: a pipelined 64*64-bit iterative multiplier , 1989 .

[5]  Hiroto Yasuura,et al.  High-Speed VLSI Multiplication Algorithm with a Redundant Binary Addition Tree , 1985, IEEE Transactions on Computers.

[6]  A. P. Chandrakasan,et al.  An energy-efficient reconfigurable public-key cryptography processor , 2001, IEEE J. Solid State Circuits.

[7]  Algirdas Avizienis,et al.  Signed-Digit Numbe Representations for Fast Parallel Arithmetic , 1961, IRE Trans. Electron. Comput..

[8]  Erkay Savas,et al.  A Scalable and Unified Multiplier Architecture for Finite Fields GF(p) and GF(2m) , 2000, CHES.

[9]  J. Grossschadl.  A unified radix-4 partial product generator for integers and binary polynomials , 2002, 2002 IEEE International Symposium on Circuits and Systems. Proceedings (Cat. No.02CH37353).

[10]  Johann Großschädl.  A unified radix-4 partial product generator for integers and binary polynomials , 2002, ISCAS.

[11]  Johannes Wolkerstorfer,et al.  Dual-Field Arithmetic Unit for GF(p) and GF(2m) , 2002, CHES.