Is there any secure cryptographic hash function based on the logistic map?
A brief description of such functions can be found in chapter 9.3 of the paper “Cryptographic Hash Functions: Recent Design Trends and Security Notions” (eprint.iacr.org/2011/565). The following excerpt is taken from page 29 of the paper:
Hash functions based on chaos theory use chaotic maps, which are functions that exhibit particular chaotic behaviours; examples of these maps include: logistic map [source #75], tent map [source #120], and cat map [source #42]. Unfortunately, most chaos-based hash functions suffer from poor efficiency due to their inherent complex structure, which makes them unattractive as a practical approach for building hash functions.