Abstract
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%.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
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)
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, http://web.comlab.ox.ac.uk/oucl/work/richard.brent/pd/rpb212.pdf
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, http://web.comlab.ox.ac.uk/oucl/work/richard.brent/pd/rpb211.pdf
Doche, C.: A table of redundant trinomials in characteristic 2 up to the degree 10000. See, http://www.math.u-bordeaux.fr/~cdoche/documents/redundant.gp.gz
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)
von zur Gathen, J., Gerhard, J.: Arithmetic and factorization of polynomials over F2 (1996)
von zur Gathen, J., Nƶcker, M.: Polynomial and normal bases for finite fields. To appear
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)
Jebelean, T.: An algorithm for exact division. J. Symbolic ComputationĀ 15(2), 169ā180 (1993)
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)
Seroussi, G.: Table of lowāweight binary irreducible polynomials. Technical Report HPLā98ā135, HewlettāPackard (August 1998)
Shoup, V.: NTL: A Library for doing Number Theory, ver. 5.3.1
Wu, H., Hasan, M.A., Blake, I.F., Gao, S.: Finite field multiplier using redundant representation. IEEE Trans. ComputersĀ 51(11), 1306ā1316 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
Ā© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Doche, C. (2005). Redundant Trinomials for Finite Fields of Characteristic 2. In: Boyd, C., GonzƔlez Nieto, J.M. (eds) Information Security and Privacy. ACISP 2005. Lecture Notes in Computer Science, vol 3574. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11506157_11
Download citation
DOI: https://doi.org/10.1007/11506157_11
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-26547-4
Online ISBN: 978-3-540-31684-8
eBook Packages: Computer ScienceComputer Science (R0)