Handbook of Applied Cryptography
Handbook of Applied Cryptography
A Design Principle for Hash Functions
CRYPTO '89 Proceedings of the 9th Annual International Cryptology Conference on Advances in Cryptology
Recent Developments in the Design of Conventional Cryptographic Algorithms
State of the Art in Applied Cryptography, Course on Computer Security and Industrial Cryptography - Revised Lectures
Proceedings of the International Conference on Cryptography: Policy and Algorithms
A novel key agreement protocol based on chaotic maps
Information Sciences: an International Journal
One-way hash function construction based on 2D coupled map lattices
Information Sciences: an International Journal
Using time-stamp to improve the security of a chaotic maps-based key agreement protocol
Information Sciences: an International Journal
True random number generator based on mouse movement and chaotic hash function
Information Sciences: an International Journal
Compression-unimpaired batch-image encryption combining vector quantization and index compression
Information Sciences: an International Journal
Secure group key agreement protocol based on chaotic Hash
Information Sciences: an International Journal
One-time encryption-key technique for the traditional DL-based encryption scheme with anonymity
Information Sciences: an International Journal
A novel Hash algorithm construction based on chaotic neural network
Neural Computing and Applications
Keyed hash function based on a chaotic map
Information Sciences: an International Journal
Finding SHA-1 characteristics: general results and applications
ASIACRYPT'06 Proceedings of the 12th international conference on Theory and Application of Cryptology and Information Security
Two extensions of the ring signature scheme of Rivest-Shamir-Taumann
Information Sciences: an International Journal
Personalized information encryption using ECG signals with chaotic functions
Information Sciences: an International Journal
Coupled map lattice based hash function with collision resistance in single-iteration computation
Information Sciences: an International Journal
Provably convertible multi-authenticated encryption scheme for generalized group communications
Information Sciences: an International Journal
Generic security-amplifying methods of ordinary digital signatures
Information Sciences: an International Journal
| Hi-index | 0.07 |
In this paper, we present a novel keyed hash function based on a dynamic lookup table of functions. More specifically, we first exploit the piecewise linear chaotic map (PWLCM) with secret keys used for producing four 32-bit initial buffers and then elaborate the lookup table of functions used for selecting composite functions associated with messages. Next, we convert the divided message blocks into ASCII code values, check the equivalent indices and then find the associated composite functions in the lookup table of functions. For each message block, the four buffers are reassigned by the corresponding composite function and then the lookup table of functions is dynamically updated. After all the message blocks are processed, the final 128-bit hash value is obtained by cascading the last reassigned four buffers. Finally, we evaluate our hash function and the results demonstrate that the proposed hash algorithm has good statistical properties, strong collision resistance, high efficiency, and better statistical performance compared with existing chaotic hash functions.