Redundant Trinomials for Finite Fields of Characteristic 2

  • Christophe Doche
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3574)


In this article we introduce redundant trinomials to represent elements of finite fields of characteristic 2. This paper develops applications to cryptography, especially based on elliptic and hyperelliptic curves. After recalling well-known techniques to perform efficient arithmetic in extensions of \(\mathbb{F}_2\), we describe redundant trinomial bases and discuss how to implement them efficiently. They are well suited to build \(\mathbb{F}_{2^n}\) when no irreducible trinomial of degree n exists. Depending on n ∈ [2,10000] tests with NTL show that, in this case, improvements for squaring and exponentiation are respectively up to 45% and 25%. More attention is given to extension degrees relevant for curve-based cryptography. For this range, a scalar multiplication can be sped up by a factor up to 15%.


Finite Field Hyperelliptic Curve Irreducible Polynomial Irreducible Factor Extension Degree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bailey, D.V., Paar, C.: Efficient arithmetic in finite field extensions with application in elliptic curve cryptography. Journal of Cryptology 14(3), 153–176 (2001)zbMATHMathSciNetGoogle Scholar
  2. 2.
    Brent, R., Zimmermann, P.: Algorithms for finding almost irreducible and almost primitive trinomials. Primes and Misdemeanours: Lectures in Honour of the Sixtieth Birthday of Hugh Cowie Williams, The Fields Institute, Toronto, to be published by the American Mathematical Society. See,
  3. 3.
    Brent, R., Zimmermann, P.: Random number generators with period divisible by a mersenne prime. In: Kumar, V., Gavrilova, M.L., Tan, C.J.K., L’Ecuyer, P. (eds.) ICCSA 2003. LNCS, vol. 2667, pp. 1–10. Springer, Heidelberg (2003), See, CrossRefGoogle Scholar
  4. 4.
    Doche, C.: A table of redundant trinomials in characteristic 2 up to the degree 10000. See,
  5. 5.
    Frey, G.: Applications of arithmetical geometry to cryptographic constructions. In: Jungnickel, D., Niederreiter, H. (eds.) Fifth International Conference on Finite Fields and Applications, pp. 128–161. Springer, Berlin (2001)Google Scholar
  6. 6.
    von zur Gathen, J., Gerhard, J.: Arithmetic and factorization of polynomials over F2 (1996)Google Scholar
  7. 7.
    von zur Gathen, J., Nöcker, M.: Polynomial and normal bases for finite fields. To appear Google Scholar
  8. 8.
    Gaudry, P., Hess, F., Smart, N.P.: Constructive and destructive facets of Weil descent on elliptic curves. Journal of Cryptology 15(1), 19–46 (2001), Online publication: August 29 (2001) zbMATHCrossRefMathSciNetGoogle Scholar
  9. 9.
    Jebelean, T.: An algorithm for exact division. J. Symbolic Computation 15(2), 169–180 (1993)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Menezes, A., Qu, M.: Analysis of the Weil descent attack of Gaudry, Hess and Smart. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 308–318. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  11. 11.
    Seroussi, G.: Table of low–weight binary irreducible polynomials. Technical Report HPL–98–135, Hewlett–Packard (August 1998)Google Scholar
  12. 12.
    Shoup, V.: NTL: A Library for doing Number Theory, ver. 5.3.1Google Scholar
  13. 13.
    Wu, H., Hasan, M.A., Blake, I.F., Gao, S.: Finite field multiplier using redundant representation. IEEE Trans. Computers 51(11), 1306–1316 (2002)CrossRefMathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Christophe Doche
    • 1
  1. 1.Division of ICS, Department of ComputingMacquarie UniversityAustralia

Personalised recommendations