Skip to main content

CTM-sp: A Family of Cryptographic Hash Functions from Chaotic Tent Maps

  • Conference paper
  • First Online:
Information Security and Privacy (ACISP 2016)

Part of the book series: Lecture Notes in Computer Science ((LNSC,volume 9722))

Included in the following conference series:

  • 1668 Accesses

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. Akhavan, A., Samsudin, A., Akhshani, A.: Hash function based on piecewise nonlinear chaotic map. Chaos Solitons Fract. 42(2), 1046–1053 (2009)

    Article  Google Scholar 

  2. Alvarez, G., Montoya, F., Romera, M., Pastor, G.: Cryptanalysis of dynamic look-up table based chaotic cryptosystems. Phys. Lett. A 326, 211–218 (2004)

    Article  MathSciNet  Google Scholar 

  3. Amin, M., Faragallah, O., El-Latif, A.: Chaos-based hash function (CBHF) for cryptographic applications. Chaos Solitons Fract. 42, 767–772 (2009)

    Article  Google Scholar 

  4. Baptista, M.S.: Cryptography with chaos. Phys. Lett. A 240(1/2), 50–54 (1998)

    Article  MathSciNet  Google Scholar 

  5. Bertoni, G., Daemen, J., Peeters, M., Assche, G.V.: The Keccak sponge function family. http://keccak.noekeon.org/

  6. Bertoni, G., Daemen, J., Peeters, M., Assche, G.V., Keer, R.V.: Implementation overview version 3.2. http://keccak.noekeon.org/Keccak-implementation-3.2.pdf

  7. Guo, W., Wang, X., He, D., Cao, Y.: Cryptanalysis on a parallel keyed hash function based on chaotic maps. Phys. Lett. A 373, 2306–3201 (2009)

    Article  MathSciNet  Google Scholar 

  8. Guo, X., Huang, S, Nazhandali, L., Schaumont, P.: Fair and comprehensive performance evaluation of 14 second round sha-3 ASIC implementations. In: NIST 2nd SHA-3 Candidate Conference (2010)

    Google Scholar 

  9. Kanso, A., Ghebleh, M.: A fast and efficient chaos-based keyed hash function. Commun. Nonlinear Sci. Numer. Simul. 18(1), 109–123 (2013)

    Article  MathSciNet  Google Scholar 

  10. NIST Special Publication 800-22 rev1, A statistical test suite for the validation of random number generators and pseudo random number generators for cryptographic applications (2008)

    Google Scholar 

  11. NIST selects winner of secure hash algorithm (SHA-3) competition. http://www.nist.gov/itl/csd/sha-100212.cfm

  12. Ren, H., Wang, Y., Xie, Q., Yang, H.: A novel method for one-way hash function construction based on spatio temporal chaos. Chaos Solitons Fract. 42(4), 2014–2022 (2009)

    Article  Google Scholar 

  13. Stojanovski, T., Kocarev, L.: Chaos-based random number generators - part I: analysis. IEEE Trans. Circu. Syst. I Fundam. Theor. Appl. 48(3), 281–288 (2001)

    Article  Google Scholar 

  14. Wong, K.W.: A combined chaotic cryptographic and hashing scheme. Phys. Lett. A 307, 292–298 (2003)

    Article  MathSciNet  Google Scholar 

  15. Xiao, D., Liao, X., Deng, S.: Parallel keyed hash function construction based on chaotic maps. Phys. Lett. A 372, 4682–4688 (2008)

    Article  MathSciNet  Google Scholar 

  16. Xiao, D., Peng, W., Liao, X., Xiang, T.: Collision analysis of one kind of chaos-based hash function. Phys. Lett. A 374, 1228–1231 (2010)

    Article  Google Scholar 

  17. Yi, X.: Hash function based on chaotic tent maps. IEEE Trans. Circ. Syst. II Express Brief 52(6), 354–357 (2005)

    Article  Google Scholar 

  18. Zhang, J., Wang, X., Zhang, W.: Chaotic keyed hash function based on feedforward-feedback nonlinear digital filter. Phys. Lett. A 362, 439–448 (2007)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Xun Yi .

Editor information

Editors and Affiliations

Appendix

Appendix

Fig. 13.
figure 13

NIST statistical tests

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

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: Liu, J., Steinfeld, R. (eds) Information Security and Privacy. ACISP 2016. Lecture Notes in Computer Science(), vol 9722. Springer, Cham. https://doi.org/10.1007/978-3-319-40253-6_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-40253-6_20

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-40252-9

  • Online ISBN: 978-3-319-40253-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics