Bit-Sliced Binary Normal Basis Multiplication

The performance of many cryptographic primitives is reliant on efficient algorithms and implementation techniques for arithmetic in binary fields. While dedicated hardware support for said arithmetic is an emerging trend, the study of software-only implementation techniques remains important for legacy or non-equipped processors. One such technique is that of software-based bit-slicing. In the context of binary fields, this is an interesting option since there is extensive previous work on bit-oriented designs for arithmetic in hardware, such designs are intuitively well suited to bit-slicing in software. In this paper we harness previous work, using it to investigate bit-sliced, software-only implementation arithmetic for binary fields, over a range of practical field sizes and using a normal basis representation. We apply our results to demonstrate significant performance improvements for a stream cipher, and over the frequently employed Ning-Yin approach to normal basis implementation in software.

[1]  A. Reyhani-Masoleh,et al.  Low Complexity Sequential Normal Basis Multipliers over � , 2022 .

[2]  A. Reyhani-Masoleh,et al.  Low complexity sequential normal basis multipliers over GF(2/sup m/) , 2003, Proceedings 2003 16th IEEE Symposium on Computer Arithmetic.

[3]  Pil Joong Lee,et al.  Fast Scalar Multiplication Method Using Change-of-Basis Matrix to Prevent Power Analysis Attacks on Koblitz Curves , 2003, WISA.

[4]  Eli Biham,et al.  A Fast New DES Implementation in Software , 1997, FSE.

[5]  Ricardo Dahab,et al.  Fast Multiplication on Elliptic Curves over GF(2m) without Precomputation , 1999, CHES.

[6]  Guang Gong,et al.  The WG Stream Cipher , 2005 .

[7]  Chester Rebeiro,et al.  Bitslice Implementation of AES , 2006, CANS.

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

[9]  Peng Ning,et al.  Efficient Software Implementation for Finite Field Multiplication in Normal Basis , 2001, ICICS.

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

[11]  P. L. Montgomery.  Speeding the Pollard and elliptic curve methods of factorization , 1987 .

[12]  Daniel J. Bernstein,et al.  Batch Binary Edwards , 2009, CRYPTO.

[13]  Seokhie Hong,et al.  TinyECCK: Efficient Elliptic Curve Cryptography Implementation over GF(2m) on 8-Bit Micaz Mote , 2008, IEICE Trans. Inf. Syst..

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

[15]  Robert Könighofer,et al.  A Fast and Cache-Timing Resistant Implementation of the AES , 2008, CT-RSA.

[16]  Peter Schwabe,et al.  Faster and Timing-Attack Resistant AES-GCM , 2009, CHES.

[17]  Mitsuru Matsui,et al.  On the Power of Bitslice Implementation on Intel Core2 Processor , 2007, CHES.

[18]  Pierrick Gaudry,et al.  The mpFq library and implementing curve-based key exchanges , 2007 .