Data Information Security Algorithm Based on Chaos and Hash Function

Chaotic systems are characterized by unidirectional, diffusive and initial value sensitivity of hash. Academia can use it to optimize algorithms for mathematical and computer encryption keys. This paper focuses on a hash function mixed chaotic system with a key. Then the state value and chaotic mapping relationship of the chaotic system are modified, and hash conclusions are obtained. Then the optimal design of messy technology with key hash is introduced briefly. A chaotic dynamic model with improved dynamic parameters is proposed to prevent chaos from affecting the speed and security of the algorithm. The results show that this method can effectively resist the attack of forging and peer keys. Moreover, the computation required by this algorithm is almost negligible.