A unified radix-4 partial product generator for integers and binary polynomials

Modified Booth recoding is generally employed in sequential and parallel multipliers as it reduces the number of partial products by roughly one half. In this paper we introduce a unified radix-4 partial product generator (PPG) which can be used for two different types of operands: integers and binary polynomials. The generation of partial products in integer-mode is performed according to the modified Booth recoding technique. In polynomial-mode, on the other hand, the partial products are generated in the same way as this is done by a digit-serial polynomial-multiplier with a digit-size of d = 2. As a result we show that the unified radix-4 PPG uses essentially the same hardware for both types of operands. The proposed PPG allows one to design unified radix-4 multiplier architectures for finite fields GF(p) and GF(2/sup m/).

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

[2]  Andrew D. Booth,et al.  A SIGNED BINARY MULTIPLICATION TECHNIQUE , 1951 .

[3]  O. L. Macsorley.  High-Speed Arithmetic in Binary Computers , 1961, Proceedings of the IRE.

[4]  G. Fettweis,et al.  VLSI architectures for multiplication in GF(2/sup m/) for application tailored digital signal processors , 1996, VLSI Signal Processing, IX.

[5]  Igor E. Shparlinski,et al.  Finite Fields: Theory and Computation: The Meeting Point of Number Theory, Computer Science, Coding Theory and Cryptography , 1999 .

[6]  Keshab K. Parhi,et al.  Efficient finite field serial/parallel multiplication , 1996, Proceedings of International Conference on Application Specific Systems, Architectures and Processors: ASAP '96.

[7]  M. K. Ibrahim,et al.  Novel Radix Finite Field Multiplier for GF(2m) , 1997, J. VLSI Signal Process..

[8]  Anantha Chandrakasan,et al.  An Energy Efficient Reconfigurable Public-Key Cryptograhpy Processor Architecture , 2000, CHES.

[9]  Kamran Eshraghian,et al.  Principles of CMOS VLSI Design: A Systems Perspective , 1985 .

[10]  P. L. Montgomery.  Modular multiplication without trial division , 1985 .

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

[12]  Gerhard Fettweis,et al.  VLSI architecture for datapath integration of arithmetic over GF(2/sup m/) on digital signal processors , 1997, 1997 IEEE International Conference on Acoustics, Speech, and Signal Processing.

[13]  ÇETIN K. KOÇ,et al.  Montgomery Multiplication in GF(2k) , 1998, Des. Codes Cryptogr..