Cryptology ePrint Archive: Report 2017/889

On Fast Multiplication in Binary Finite Fields and Optimal Primitive Polynomials over GF(2)

Alexander Maximov and Helena Sjoberg

Abstract: In this paper we present a number of algorithms and optimization techniques to speedup computations in binary extension fields over GF(2). Particularly, we consider multiplication and modular reduction solutions. Additionally, we provide the table of optimal binary primitive polynomials over GF(2) of degree $2\le d<2048$, and the class of functions for optimal modular reduction algorithms for each of the listed polynomials. We give implementation examples targeting Intel CPU architectures, but generic results can be applied on other platforms as well.

Category / Keywords: implementation / implementation, multiplication, modular reduction, finite field, primitive polynomial

Date: received 13 Sep 2017

Contact author: alexander maximov at ericsson com

Available format(s): PDF | BibTeX Citation

Version: 20170917:162347 (All versions of this report)

Short URL: ia.cr/2017/889

Discussion forum: Show discussion | Start new discussion


[ Cryptology ePrint archive ]