Abstract
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$(2^{163})$ and GF$(2^{40}9)$. As far as we know, by applying this method, the number of XOR gates needed for a bit-level SIPO GNB multiplier over GF$(2^{163})$ and GF$(2^{409})$ can be minimized. Also, it is a general methodology suitable for all binary fields that involve type -4 Gaussian Normal Basis.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
