Systolic Gaussian Normal Basis Multiplier Architectures Suitable for High-Performance Applications

Normal basis multiplication in finite fields is vastly utilized in different applications, including error control coding and the like due to its advantageous characteristics and the fact that squaring of elements can be obtained without hardware complexity. In this brief, we present decomposition algorithms to develop novel systolic structures for digit-level Gaussian normal basis multiplication over GF(2m). The proposed architectures are suitable for high-performance applications, which require fast computations in finite fields with high throughputs. We also present the results of our application-specific integrated circuit synthesis using a 65-nm standard-cell library to benchmark the effectiveness of the proposed systolic architectures. The presented architectures for multiplication can result in more efficient and high-performance VLSI systems.

[1]  Soonhak Kwon,et al.  A low complexity and a low latency bit parallel systolic multiplier over GF(2/sup m/) using an optimal normal basis of type II , 2003, Proceedings 2003 16th IEEE Symposium on Computer Arithmetic.

[2]  M. Anwar Hasan,et al.  Improved Three-Way Split Formulas for Binary Polynomial Multiplication , 2011, Selected Areas in Cryptography.

[3]  Reza Azarderakhsh,et al.  Low-Complexity Multiplier Architectures for Single and Hybrid-Double Multiplications in Gaussian Normal Bases , 2013, IEEE Transactions on Computers.

[4]  Chiou-Yng Lee,et al.  Scalable Gaussian Normal Basis Multipliers over GF(2m) Using Hankel Matrix-Vector Representation , 2012, Journal of Signal Processing Systems.

[5]  Vassil S. Dimitrov,et al.  A new algorithm for double scalar multiplication over Koblitz curves , 2011, 2011 IEEE International Symposium of Circuits and Systems (ISCAS).

[6]  Kimmo Järvinen,et al.  On Parallelization of High-Speed Processors for Elliptic Curve Cryptography , 2008, IEEE Trans. Very Large Scale Integr. Syst..

[7]  Tim Güneysu,et al.  Breaking Elliptic Curve Cryptosystems Using Reconfigurable Hardware , 2010, 2010 International Conference on Field Programmable Logic and Applications.

[8]  Vassil S. Dimitrov,et al.  A Fast Hardware Architecture for Integer to \tauNAF Conversion for Koblitz Curves , 2012, IEEE Transactions on Computers.

[9]  Laurent Imbert,et al.  Hybrid Binary-Ternary Number System for Elliptic Curve Cryptosystems , 2011, IEEE Transactions on Computers.

[10]  Pramod Kumar Meher.  Systolic and Non-Systolic Scalable Modular Designs of Finite Field Multipliers for Reed–Solomon Codec , 2009, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[11]  Reza Azarderakhsh,et al.  A Modified Low Complexity Digit-Level Gaussian Normal Basis Multiplier , 2010, WAIFI.

[12]  Reza Azarderakhsh,et al.  Efficient FPGA Implementations of Point Multiplication on Binary Edwards and Generalized Hessian Curves Using Gaussian Normal Basis , 2012, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[13]  Jimson Mathew,et al.  Low Complexity Digit Serial Systolic Montgomery Multipliers for Special Class of ${\rm GF}(2^{m})$ , 2010, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[14]  Kris Gaj,et al.  Efficient Linear Array for Multiplication in GF(2m) Using a Normal Basis for Elliptic Curve Cryptography , 2004, CHES.

[15]  Marc Joye,et al.  Efficient Arithmetic on Hessian Curves , 2010, Public Key Cryptography.

[16]  Kimmo Järvinen,et al.  Fast point multiplication on Koblitz curves: Parallelization method and implementations , 2009, Microprocess. Microsystems.

[17]  Arash Reyhani-Masoleh.  Efficient algorithms and architectures for field multiplication using Gaussian normal bases , 2006, IEEE Transactions on Computers.

[18]  M. Anwar Hasan,et al.  Subquadratic Computational Complexity Schemes for Extended Binary Field Multiplication Using Optimal Normal Bases , 2007, IEEE Transactions on Computers.

[19]  Vassil S. Dimitrov,et al.  Provably Sublinear Point Multiplication on Koblitz Curves and Its Hardware Implementation , 2008, IEEE Transactions on Computers.

[20]  M. Anwar Hasan,et al.  Improved Three-Way Split Formulas for Binary Polynomial and Toeplitz Matrix Vector Products , 2013, IEEE Transactions on Computers.

[21]  José Luis Imaña,et al.  Low Complexity Bit-Parallel Multipliers Based on a Class of Irreducible Pentanomials , 2006, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[22]  Zhen Wang,et al.  Efficient Montgomery-Based Semi-Systolic Multiplier for Even-Type GNB of GF(2^m) , 2012, IEEE Transactions on Computers.

[23]  Arash Reyhani-Masoleh,et al.  Bit-Serial and Bit-Parallel Montgomery Multiplication and Squaring over GF(2^m) , 2009, IEEE Transactions on Computers.