Abstract
In this paper, we show that the L-functions attached to Elliptic curves are good candidates to construct a hash function which can be used as a MAC for cryptographic purpose. This is actually due to the fact that they present a one way computation of the coefficients a L . In this work, we present some cryptographic preliminaries and we propose a new protocol for hashing using L-functions of elliptic curves. We also study the security of this protocol and its resistance to collision.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Preneel, B.: Analysis and Design of Cryptographic Hash Functions. Ph.D. Thesis, Katholieke University Leuven (1993)
Damgård, I.B.: A Design Principle for Hash Functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 416–427. Springer, Heidelberg (1990)
Merkle, R.C.: One Way Hash Functions and DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 428–446. Springer, Heidelberg (1990)
Schoof, R.: Elliptic curves over finite fields and the computation of square root mod p. Math. Comp. 44, 483–494 (1985)
Anshel, M., Goldfeld, D.: Zeta functions, one-way functions, and pseudorandom number generators. Duke Math. J. 88, 371–390 (1997)
Omar, S., Ouni, R., Mazhouda, K.: On the zeros of Dirichlet L-functions. LMS Journal of Computation and Mathematics 14, 140–154 (2011)
Omar, S., Ouni, R., Mazhouda, K.: On the Li coefficients for the Hecke L-functions (preprint, 2012)
Menezes, A.J., van Oorschot, P.C., Vanstone, S.A.: Handbook of Applied Cryptography. CRC Press (2001)
Brown, D.R.L., Antipa, A., Campagna, M., Struik, R.: ECOH: the Elliptic Curve Only Hash, Tech. rep., Certicom Corp. First Round NIST SHA-3 Candidate (2008)
Semaev, I.: Summation polynomials and the discrete logarithm problem on elliptic curves. IACR Cryptology ePrint Archive 2004: 31 (2004)
Wagner, D.: A Generalized Birthday Problem. In: Yung, M. (ed.) CRYPTO 2002. LNCS, vol. 2442, pp. 288–303. Springer, Heidelberg (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Omar, S., Ouni, R., Bouanani, S. (2012). Hashing with Elliptic Curve L-Functions. In: Özbudak, F., Rodríguez-Henríquez, F. (eds) Arithmetic of Finite Fields. WAIFI 2012. Lecture Notes in Computer Science, vol 7369. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31662-3_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-31662-3_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31661-6
Online ISBN: 978-3-642-31662-3
eBook Packages: Computer ScienceComputer Science (R0)