Welcome to the resource topic for 2014/003
Title:
GF(2^n) Bit-Parallel Squarer Using Generalized Polynomial Basis For a New Class of Irreducible Pentanomials
Authors: Xi Xiong, Haining Fan
Abstract:We present explicit formulae and complexities of bit-parallel GF(2^{n}) squarers for a new class of irreducible pentanomials x^{n}+x^{n-1}+x^{k}+x+1, where n is odd and 1<k<(n-1)/2. The squarer is based on the generalized polynomial basis of GF(2^{n}). Its gate delay matches the best results, while its XOR gate complexity is n+1, which is only about 2/3 of the current best results.
ePrint: https://eprint.iacr.org/2014/003
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 .