Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation

@article{Bajard2010SubquadraticSC,
  title={Subquadratic Space Complexity Binary Field Multiplier Using Double Polynomial Representation},
  author={Jean-Claude Bajard and Christophe N{\`e}gre and Thomas Plantard},
  journal={IEEE Transactions on Computers},
  year={2010},
  volume={59},
  pages={1585-1597}
}
This paper deals with binary field multiplication. We use the bivariate representation of binary field called Double Polynomial System (DPS) presented in . This concept generalizes the composite field representation to every finite field. As shown in , the main interest of DPS representation is that it enables to use Lagrange approach for multiplication, and in the best case, Fast Fourier Transform approach, which optimizes Lagrange approach. We use here a different strategy from to perform… CONTINUE READING

Citations

Publications citing this paper.

References

Publications referenced by this paper.
Showing 1-10 of 27 references

VLSI Architectures for Computations in Galois Fields

E. D. Mastrovito
PhD thesis, Dept. of Electrical Eng., Linkoping Univ., 1991. • 1991
View 3 Excerpts
Highly Influenced

Double Polynomial Basis Representation for Binary Field Arithmetic

J.-C. Bajard, C. Negre, T. Plantard
Technical Report 5, Team DALI/Lab. ELIAUS, Univ. of Perpignan, July 2005. • 2005
View 1 Excerpt

Modular Number Systems: Beyong the Mersenne Family

J.-C. Bajard, L. Imbert, T. Plantard
Proc. Int’l Workshop Selected Areas in Cryptography (SAC ’04), pp. 159-169, 2005. • 2005
View 1 Excerpt

Similar Papers

Loading similar papers…