Abstract
The aim of this article is to describe a new hash algorithm using polynomials over finite fields. In software, it runs at speeds comparable to SHA-384. Hardware implementation of a slightly modified version of the algorithm presented here runs at significantly faster speeds, namely at 2 Gbits/sec on an FPGA Virtex V of frequency 300 MHz. Modelling suggests that this speed can be increased to 3.4 Gbits/sec. Unlike most other existing hash algorithms, our construction does not follow the Damgard-Merkle philosophy. The hash has several attractive features in terms of its flexibility. In particular, the length of the hash is a parameter that can be set at the outset. Moreover, the estimated degree of collision resistance is measured in terms of another parameter whose value can be varied.
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
Bourgain, J.: New bounds on exponential sums related to the Diffie-Hellman distributions. C. R. Acad. Sci. Paris Ser. I 338, 825–830 (2004)
Damgard, I.: A design principle for hash functions. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 416–427. Springer, Heidelberg (1990)
Joux, A.: Multicollisions in iterated hash functions. In: Franklin, M. (ed.) CRYPTO 2004. LNCS, vol. 3152, pp. 306–316. Springer, Heidelberg (2004)
Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1997)
Merkle, R.: One way hash functions and DES. In: Brassard, G. (ed.) CRYPTO 1989. LNCS, vol. 435, pp. 428–446. Springer, Heidelberg (1990)
Kumar Murty, V., Volkovs, N.: A polynomial based hashing algorithm. In: SECRYPT 2008, pp. 103–106 (2008)
Preneel, B.: Analysis and Design of Cryptographic Hash Functions, Ph. D. Thesis (2003)
Aiello, W., Haber, S., Venkatesan, R.: New constructions for secure hash functions (extended abstract). In: Vaudenay, S. (ed.) FSE 1998. LNCS, vol. 1372, pp. 150–167. Springer, Heidelberg (1998)
Wang, X.: How to break MD5 and other hash function. In: Cramer, R. (ed.) EUROCRYPT 2005. LNCS, vol. 3494, pp. 19–35. Springer, Heidelberg (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Murty, V.K., Volkovs, N. (2009). ERINDALE: A Polynomial Based Hashing Algorithm. In: Chee, Y.M., Li, C., Ling, S., Wang, H., Xing, C. (eds) Coding and Cryptology. IWCC 2009. Lecture Notes in Computer Science, vol 5557. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-01877-0_14
Download citation
DOI: https://doi.org/10.1007/978-3-642-01877-0_14
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-01813-8
Online ISBN: 978-3-642-01877-0
eBook Packages: Computer ScienceComputer Science (R0)