Abstract
The discrete logarithm is an important crypto primitive for public key cryptography. The main source for suitable groups are divisor class groups of carefully chosen curves over finite fields. Because of index-calculus algorithms one has to avoid curves of genus ≥ 4 and non-hyperelliptic curves of genus 3. An important observation of Smith [17] is that for “many” hyperelliptic curves of genus 3 there is an explicit isogeny of their Jacobian variety to the Jacobian of a non-hyperelliptic curve. Hence divisor class groups of these hyperelliptic curves are mapped in polynomial time to divisor class groups of non-hyperelliptic curves. Behind his construction are results of Donagi, Recillas and Livné using classical algebraic geometry. In this paper we only use the theory of curves to study Hurwitz spaces with monodromy group S 4 and to get correspondences for hyperelliptic curves. For hyperelliptic curves of genus 3 we find Smith’s results now valid for ground fields with odd characteristic, and for fields with characteristic 2 one can apply the methods of this paper to get analogous results at least for curves with ordinary Jacobian.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Cohen, H., Frey, G. (eds.): Handbook of Elliptic and Hyperelliptic Curve Cryptography. CRC (2005)
Diem, C., Gaudry, P., Thomé, E., Thériault, N.: A double large prime variation for small genus hyperelliptic index calculus. Math. Comp. 76, 475–492 (2007)
Diem, C.: An Index Calculus Algorithm for Plane Curves of Small Degree. In: Heß, F., Pauli, S., Pohst, M. (eds.) ANTS 2006. LNCS, vol. 4076, pp. 543–557. Springer, Heidelberg (2006)
Donagi, R., Livné, R.: The arithmetic-geometric mean and isogenies for curves of higher genus. Ann. Scuola Norm. Sup. Pisa Cl. Sci(4) 28(2), 323–339 (1999)
Frey, G.: Relations between Arithmetic Geometry and Public Key Cryptography. Advances in Mathematics of Communications (AMC) 4(2), 281–305 (2010)
Frey, G., Kani, E.: Curves of genus 2 with elliptic differentials and associated Hurwitz spaces. Contemp. Math. 487, 33–81 (2009)
Hess, F.: Computing Riemann-Roch spaces in algebraic function fields and related topics. J. Symbolic Comp. 33(4), 425–445 (2002)
Huppert, B.: Endliche Gruppen I. Springer, Heidelberg (1967)
Kani, E.: On the trigonal construction (in preparation)
Koblitz, N.: Elliptic curve cryptosystems. Mathematics of Computation 48, 203–209 (1987)
Koblitz, N.: Hyperelliptic cryptosystems. Journal of Cryptology 1, 139–150 (1989)
Kraitchik, M.: Théorie des nombres, vol. 1. Gauthier-Villars (1922)
Lange, H.: e-mail to G. Frey (March 24, 2009)
Maurer, U.M., Wolf, S.: Lower bounds on generic algorithms in groups. In: Nyberg, K. (ed.) EUROCRYPT 1998. LNCS, vol. 1403, pp. 72–84. Springer, Heidelberg (1998)
Miller, V.: Short programs for functions on curves (1986), http://crypto.stanford.edu//miller/
Odlyzko, A.M.: Discrete logarithms in finite fields and their cryptographic significance. In: Beth, T., Cot, N., Ingemarsson, I. (eds.) EUROCRYPT 1984. LNCS, vol. 209, pp. 224–314. Springer, Heidelberg (1985)
Smith, B.: Isogenies and the Discrete Logarithm Problem in Jacobians of Genus 3 Hyperelliptic Curves. In: Smart, N.P. (ed.) EUROCRYPT 2008. LNCS, vol. 4965, pp. 163–180. Springer, Heidelberg (2008); Revised version in: J. Cryptology 22, 505–529 (2009)
Stichtenoth, H.: Algebraic function fields and codes. Springer, Berlin (1993)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Frey, G., Kani, E. (2012). Correspondences on Hyperelliptic Curves and Applications to the Discrete Logarithm. In: Bouvry, P., Kłopotek, M.A., Leprévost, F., Marciniak, M., Mykowiecka, A., Rybiński, H. (eds) Security and Intelligent Information Systems. SIIS 2011. Lecture Notes in Computer Science, vol 7053. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25261-7_1
Download citation
DOI: https://doi.org/10.1007/978-3-642-25261-7_1
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-25260-0
Online ISBN: 978-3-642-25261-7
eBook Packages: Computer ScienceComputer Science (R0)