Abstract
In this paper, we give a new way to represent certain finite fields GF(2n). This representation is based on Charlier polynomials. We show that multiplication in Charlier polynomial representation can be performed with subquadratic space complexity. One can obtain binomial or trinomial irreducible polynomials in Charlier polynomial representation which allows us faster modular reduction over binary fields when there is no desirable such low weight irreducible polynomial in other representations. This representation is very interesting for NIST recommended binary field GF(2283) since there is no ONB for the corresponding extension. We also note that recommended NIST and SEC binary fields can be constructed with low weight Charlier polynomials.
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
Brown, M., Hankerson, D., Lopez, J., Menezes, A.: Software Implementation of the NIST Elliptic Curves over Prime Fields. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 250–265. Springer, Heidelberg (2001)
Godsil, C.D.: Algebraic Combinatorics. Chapman Hall/CRC Mathematics Series, Boca Raton (1993)
Fan, H., Hasan, M.A.: A New Approach to Subquadratic Space Complexity Parallel Multipliers for Extended Binary Fields. IEEE Trans. on Computers 56-2, 224–233 (2007)
Hasan, M.A., Negre, C.: Subquadratic Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation. In: von zur Gathen, J., Imaña, J.L., Koç, Ç.K. (eds.) WAIFI 2008. LNCS, vol. 5130, pp. 88–102. Springer, Heidelberg (2008)
Hasan, M.A., Negre, C.: Low Space Complexity Multiplication over Binary Fields with Dickson Polynomial Representation. IEEE Trans. on Computers (2010) (to appear) doi: 10.1109/TC.2010.132
Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, Heidelberg (2004)
Lidl, R., Niederreiter, H.: Introduction to Finite Fields and Their Applications. Cambridge University, Cambridge (1997)
Menezes, A., Blake, I., Gao, X., Mullen, R., Vanstone, S., Yaghobian, T.: Applications of Finite Fields. Kluwer Academic, Boston (1993)
Mullen, G., Mummert, C.: Finite Fields and Applications. American Mathematical Society, Providence (2007)
National Institute of Standards and Technology, Recommended Elliptic curves for Federal Government Use (1999)
Sage: Open Source Mathematics Software, The Sage Group, http://www.sagemath.org
Standards for Efficient Cryptography Group (SECG), SEC 2: Recommended Elliptic Curve Domain Parameters (2010)
Weimerskirch, A., Paar, C.: Generalizations of the Karatsuba Algorithm for Efficient Implementations (2006), http://eprint.iacr.org/2006/224
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Akleylek, S., Cenk, M., Özbudak, F. (2010). Polynomial Multiplication over Binary Fields Using Charlier Polynomial Representation with Low Space Complexity. In: Gong, G., Gupta, K.C. (eds) Progress in Cryptology - INDOCRYPT 2010. INDOCRYPT 2010. Lecture Notes in Computer Science, vol 6498. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-17401-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-642-17401-8_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-17400-1
Online ISBN: 978-3-642-17401-8
eBook Packages: Computer ScienceComputer Science (R0)