Abstract
We discuss a family of irreducible polynomials that can be used to speed up square root extraction in fields of characteristic two. They generalize trinomials discussed by Fong et al. [20]. We call such polynomials square root friendly.
The main application is to point halving methods for elliptic curves (and to a lesser extent also divisor halving methods for hyperelliptic curves and pairing computations).
We note the existence of square root friendly trinomials of a given degree when we already know that an irreducible trinomial of the same degree exists, and formulate a conjecture on the degrees of the terms of square root friendly polynomials. Following similar results by Bluher, we also give a partial result that goes in the direction of the conjecture.
We also discuss how to improve the speed of solving quadratic equations. The increase in the time required to perform modular reduction is marginal and does not affect performance adversely. Estimates confirm that the new polynomials mantain their promises. Point halving gets a speed-up of 20% and scalar multiplication is improved by at least 11%.
Chapter PDF
Similar content being viewed by others
Keywords
References
Ahmadi, O., Hankerson, D., Menezes, A.: Formulas for cube roots in \(\mathbb{F}_{3^m}\). Discrete Applied Math. 155(3), 260–270 (2007)
Ahmadi, O., Menezes, A.: On the number of trace-one elements in polynomial bases for \(\mathbb{F}_{2^n}\). Designs, Codes and Cryptography 37, 493–507 (2005)
Ahmadi, O., Menezes, A.: Irreducible polynomials of maximum weight. Utilitas Mathematica 72, 111–123 (2007)
Ash, D.W., Blake, I.F., Vanstone, S.: Low complexity normal bases. Discrete Applied Math. 25, 191–210 (1989)
Avanzi, R.M.: Delaying and Merging Operations in Scalar Multiplication: Applications to Curve-Based Cryptosystems. In: Proceedings of SAC 2006 (to appear)
Avanzi, R.M., Cesena, E.: Trace Zero Varieties over Fields of Characteristic 2: Cryptographic Applications. In: SAGA 2007. The first Symposium on Algebraic Geometry and its Applications, May 7-11, 2007,Tahiti (2007)
Avanzi, R.M., Ciet, M., Sica, F.: Faster Scalar Multiplication on Koblitz Curves combining Point Halving with the Frobenius Endomorphism. In: Bao, F., Deng, R., Zhou, J. (eds.) PKC 2004. LNCS, vol. 2947, pp. 28–40. Springer, Heidelberg (2004)
Avanzi, R., Cohen, H., Doche, C., Frey, G., Lange, T., Nguyen, K., Vercauteren, F.: The Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC Press, Boca Raton, USA (2005)
Avanzi, R.M., Heuberger, C., Prodinger, H.: Scalar Multiplication on Koblitz Curves Using the Frobenius Endomorphism and its Combination with Point Halving: Extensions and Mathematical Analysis. Algorithmica 46, 249–270 (2006)
Avanzi, R.M., Heuberger, C., Prodinger, H.: On Redundant τ-adic Expansions and Non-Adjacent Digit Sets. In: Biham, E., Youssef, A.M. (eds.) SAC 2006. LNCS, vol. 4356, Springer, Heidelberg (2006)
Avanzi, R.M., Thériault, N.: Effects of Optimizations for Software Implementations of Small Binary Field Arithmetic. In: Proceedings of WAIFI 2007. International Workshop on the Arithmetic of Finite Fields, June 21-22, 2007, Madrid, Spain, p. 18 (2007)
Avanzi, R.M., Thériault, N., Wang, Z.: Rethinking Low Genus Hyperelliptic Jacobian Arithmetic over Binary Fields: Interplay of Field Arithmetic and Explicit Formulæ. CACR Technical Report 2006-07
Barreto, P.S.L.M., Galbraith, S., OhEigeartaigh, C., Scott, M.: Efficient pairing computation on supersingular abelian varieties. Designs, Codes and Cryptography 42, 239–271 (2007), http://eprint.iacr.org/2004/375
Birkner, P.: Efficient Divisor Class Halving on Genus Two Curves. In: Proceedings of Selected Areas in Cryptography – SAC 2006. LNCS, Springer, Heidelberg (to appear)
Birkner, P., Thériault, N.: Efficient Divisor Class Doubling and Halving on Genus Three Curves (in preparation)
Bluher, A.W.: A Swan-like Theorem. Finite Fields and Their Applications 12, 128–138 (2006)
Bosma, W., Cannon, J., Playoust, C.: The Magma Algebra System I: The User Language. J. Symbolic Comput. 24, 235–265 (1997)
Cesena, E.: Varietá a Traccia Zero su Campi Binari: Applicazioni Crittografiche (Trace Zero Varieties over Binary Fields: Cryptographic Applications.) Master’s Thesis. Universitá degli Studi di Milano (in Italian) (2005)
Coron, J.-S., M’Raïhi, D., Tymen, C.: Fast generation of pairs (k, [k]P) for Koblitz elliptic curves. In: Vaudenay, S., Youssef, A.M. (eds.) SAC 2001. LNCS, vol. 2259, pp. 151–164. Springer, Heidelberg (2001)
Fong, K., Hankerson, D., López, J., Menezes, A.: Field Inversion and Point Halving Revisited. IEEE Trans. Computers 53(8), 1047–1059 (2004)
Hankerson, D., Menezes, A.J., Vanstone, S.A.: Guide to elliptic curve cryptography. Springer, Heidelberg (2003)
Knudsen, E.W.: Elliptic Scalar Multiplication Using Point Halving. In: Lam, K.-Y., Okamoto, E., Xing, C. (eds.) ASIACRYPT 1999. LNCS, vol. 1716, pp. 135–149. Springer, Heidelberg (1999)
Koblitz, N.: CM-curves with good cryptographic properties. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 279–287. Springer, Heidelberg (1992)
Lange, T., Stevens, M.: Efficient doubling for genus two curves over binary fields. In: Handschuh, H., Hasan, M.A. (eds.) SAC 2004. LNCS, vol. 3357, pp. 170–181. Springer, Heidelberg (2004)
National Institute of Standards and Technology. Recommended Elliptic Curves for Federal Government Use. NIST Special Publication (July 1999), available from: http://csrc.nist.gov/csrc/fedstandards.html
Schroeppel, R.: Point halving wins big. In: (i) Midwest Arithmetical Geometry in Cryptography Workshop, November 17–19, 2000, University of Illinois at Urbana-Champaign (2000), ECC 2001 Workshop, October 29–31, 2001, University of Waterloo, Ontario, Canada (2001)
Schroeppel, R.: Elliptic curve point ambiguity resolution apparatus and method. International Application Number PCT/US00/31014, filed (November 9, 2000)
Scott, M.: Optimal Irreducible Polynomials for GF(2m) Arithmetic. IACR ePrint 2007/192. http://eprint.iacr.org/2007/192
Swan, R.G.: Factorization of Polynomials over Finite Fields. Pac. J. Math. 19, 1099–1106 (1962)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Avanzi, R.M. (2007). Another Look at Square Roots (and Other Less Common Operations) in Fields of Even Characteristic. In: Adams, C., Miri, A., Wiener, M. (eds) Selected Areas in Cryptography. SAC 2007. Lecture Notes in Computer Science, vol 4876. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-77360-3_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-77360-3_10
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-77359-7
Online ISBN: 978-3-540-77360-3
eBook Packages: Computer ScienceComputer Science (R0)