The 15th IEEE International Conference on Electron Devices and Solid-State Circuits (EDSSC)

516 / 2019-03-04 20:43:01

Towards Low Space Complexity Design of Gaussian Normal Basis Multiplication

Gaussian Normal Basis, low-area design, binary finite field

Plenary track > Digital Circuits

Normal basis is hardware-friendly to perform squaring operations over binary fields. It is very attractive in some applications, like elliptic curve cryptography over Koblitz curves. In this paper, a new algorithm is proposed to reduce the space complexity of Gaussian Normal Basis (GNB) multiplier over GF(2163) and GF(2409). As far as we know, by applying this method, the number of XOR gates needed for a bit-level SIPO GNB multiplier over GF(2163) and GF(2409) can be minimized. Also, it is a general methodology suitable for all binary fields that involve type-4 Gaussian Normal Basis.