What every computer scientist should know about floating-point arithmetic
ACM Computing Surveys (CSUR)
Predicting a chaotic time series using a fuzzy neural network
Information Sciences: an International Journal
Handbook of Applied Cryptography
Handbook of Applied Cryptography
A novel key agreement protocol based on chaotic maps
Information Sciences: an International Journal
EC2C-PAKA: An efficient client-to-client password-authenticated key agreement
Information Sciences: an International Journal
How to construct secure proxy cryptosystem
Information Sciences: an International Journal
Cryptanalysis of the hash functions MD4 and RIPEMD
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
How to break MD5 and other hash functions
EUROCRYPT'05 Proceedings of the 24th annual international conference on Theory and Applications of Cryptographic Techniques
Information Sciences: an International Journal
True random number generator based on mouse movement and chaotic hash function
Information Sciences: an International Journal
A new chaos-based fast image encryption algorithm
Applied Soft Computing
Algebraic break of image ciphers based on discretized chaotic map lattices
Information Sciences: an International Journal
Keyed hash function based on a chaotic map
Information Sciences: an International Journal
Coupled map lattice based hash function with collision resistance in single-iteration computation
Information Sciences: an International Journal
Keyed hash function based on a dynamic lookup table of functions
Information Sciences: an International Journal
Secure chaotic system with application to chaotic ciphers
Information Sciences: an International Journal
Hi-index | 0.07 |
An algorithm for constructing one-way hash function based on spatiotemporal chaos is proposed. A two-dimensional coupled map lattices (2D CML) with parameters leading to the largest Lyapunov exponent is employed. The state of the 2D CML is dynamically determined by its previous state and the message bit at the corresponding positions. The hash value is obtained by a linear transform on the final state of the 2D CML. Theoretical analysis and computer simulation indicate that our algorithm has good statistical properties, strong collision resistance and high flexibility. It is practical and reliable, with high potential to be adopted as a strong hash function for providing data integrity.