Welcome to the resource topic for 2017/889
Title:
On Fast Multiplication in Binary Finite Fields and Optimal Primitive Polynomials over GF(2)
Authors: Alexander Maximov, 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.
ePrint: https://eprint.iacr.org/2017/889
See all topics related to this paper.
Feel free to post resources that are related to this paper below.
Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.
For more information, see the rules for Resource Topics .