Abstract
We analyze all the cases and propose the corresponding explicit formulae for computing 2D 1 + D 2 in one step from given divisor classes D 1 and D 2 on genus 2 hyperelliptic curves defined over prime fields. Compared with naive method, the improved formula can save two field multiplications and one field squaring each time when the arithmetic is performed in the most frequent case. Furthermore, we present a variant which trades one field inversion for fourteen field multiplications and two field squarings by using Montgomery’s trick to combine the two inversions. Experimental results show that our algorithms can save up to 13% of the time to perform a scalar multiplication on a general genus 2 hyperelliptic curve over a prime field, when compared with the best known general methods.
Chapter PDF
Similar content being viewed by others
Keywords
References
Avanzi, R.M.: Aspects of Hyperelliptic Curves over Large Prime Fields in Software Implementations. In: Joye, M., Quisquater, J.-J. (eds.) CHES 2004. LNCS, vol. 3156, pp. 148–162. Springer, Heidelberg (2004)
Avanzi, R.M.: The Complexity of Certain Multi-Exponentiation Techniques in Cryptography. Journal of Cryptology 18(4), 357–373 (2005)
Avanzi, R.M., Cohen, H., Doche, C., Frey, G., Lange, T., Nguyen, K., Vercauteren, F.: Handbook of Elliptic and Hyperelliptic Curve Cryptography. Chapman & Hall/CRC, Boca Raton, Florida, USA (2006)
Avanzi, R.M., Thériault, N., Wang, Z.: Rethinking Low Genus Hyperelliptic Jacobian Arithmetic over Binary Fields: Interplay of Field Arithmetic and Explicit Formulae, Centre for Applied Cryptographic Research (CACR) Technical Reports, CACR 2006-07, available at http://www.cacr.math.uwaterloo.ca/
Bailey, D.V., Paar, C.: Optimal Extension Fields for Fast Arithmetic in Public-Key Algorithms. In: Krawczyk, H. (ed.) CRYPTO 1998. LNCS, vol. 1462, pp. 472–485. Springer, Heidelberg (1998)
Cantor, D.: Computing in Jacobian of a Hyperelliptic Curve. Mathematics of Computation 48(177), 95–101 (1987)
Ciet, M., Joye, M., Lauter, K., Montgomery, L.: Trading Inversions for Multiplications in Elliptic Curve Cryptography. Design, Codes and Cryptography 39, 189–206 (2006)
Cohen, H.: A Course in Computational Algebraic Number Theory. Graduate Texts in Math., vol. 138. Springer, Berlin (1993) (fourth corrected printing, 2000)
Hankerson, D., Menezes, A., Vanstone, S.: Guide to Elliptic Curve Cryptography. Springer, New York (2004)
Eisenträger, K., Lauter, K., Montgomery, P.L.: Fast Elliptic Arithmetic and Improved Weil Pairing Evaluation. In: Joye, M. (ed.) CT-RSA 2003. LNCS, vol. 2612, pp. 343–354. Springer, Heidelberg (2003)
Gaudry, P., Harley, R.: Counting Points on Hyperelliptic Curves over Finite Fields. In: Bosma, W. (ed.) Algorithmic Number Theory. LNCS, vol. 1838, pp. 297–312. Springer, Heidelberg (2000)
Gonda, M., Matsuo, K., Aoki, K., Chao, J., Tsujii, S.: Improvements of Addition Algorithm on Genus 3 Hyperelliptic Curves and Their Implementation. IEICE Transactions on Fundamentals of Electronics, Communications and Computer Science E88-A(1), 89–96 (2005)
Gordon, D.M.: A Survey of Fast Exponentiation Methods. Journal of Algorithms 27(1), 129–146 (1998)
Koblitz, N.: A Family of Jacobian Suitable for Discrete Log Cryptosystems. In: Goldwasser, S. (ed.) CRYPTO 1988. LNCS, vol. 403, pp. 94–99. Springer, Heidelberg (1990)
Koblitz, N.: Hyperelliptic Cryptosystems. Journal of Cryptology 1(3), 129–150 (1989)
Lange, T.: Formulae for Arithmetic on Genus 2 Hyperelliptic Curves. Applicable Algebra in Engineering, Communication and Computing 15(5), 295–328 (2005)
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)
Menezes, A., Wu, Y., Zuccherato, R.: An Elementary Introduction to Hyperelliptic Curve, Centre for Applied Cryptographic Research (CACR) Technical Reports, CORR 1996-19, available at http://www.cacr.math.uwaterloo.ca/
Mumford, D.: Tata Lectures on Theta II. Prog. Math. 43, Birkhäuser (1984)
Nagao, K.: Improving Group Law Algorithms for Jacobians of Hyperelliptic Curves. In: Bosma, W. (ed.) Algorithmic Number Theory. LNCS, vol. 1838, pp. 439–448. Springer, Heidelberg (2000)
Wollinger, T.: Software and Harware Implementation of Hyperelliptic Curve Cryptosystems, PhD. thesis, Department of Electrical Engineering and Information Sciences, Ruhr-Universitäet Bochum, Bochum, Germany (2004)
Wollinger, T., Pelzl, J., Paar, C.: Cantor versus Harley: Optimization and Analysis of Explicit Formulae for Hyperelliptic Curve Cryptosystems. IEEE Transactions on Computers 54(7), 861–872 (2005)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fan, X., Gong, G. (2007). Efficient Explicit Formulae for Genus 2 Hyperelliptic Curves over Prime Fields and Their Implementations. 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_11
Download citation
DOI: https://doi.org/10.1007/978-3-540-77360-3_11
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)