CTM-sp: A family of cryptographic hash functions from chaotic tent maps

0Citations
Citations of this article
20Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Hash functions are commonly used in checksums, check digits, fingerprints, randomization functions, error-correcting codes, and ciphers. In this paper, we give a family of hash functions on the basis of chaotic tent maps and the sponge construction, where input is absorbed into the hash state at a given rate, then an output hash is squeezed from it at the same rate. The family include four types of hash functions, which are designed to facilitate the implementation on 8-bit, 16-bit, 32- bit and 64-bit processors, respectively. Our experiments have shown that the family meet security criteria for design of hash functions and the performance of our hash functions is comparable to SHA-3.

Cite

CITATION STYLE

APA

Yi, X., Yang, X., Feng, Y., Han, F., & van Schyndel, R. (2016). CTM-sp: A family of cryptographic hash functions from chaotic tent maps. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9722, pp. 329–342). Springer Verlag. https://doi.org/10.1007/978-3-319-40253-6_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free