Recently, we have proposed a fast chaotic cryptographic scheme based on iterating a logistic map with the look-up table updated dynamically. We found that after the whole encryption process, the final look-up table strongly depends on the message and so it can be considered as its hash value or message authentication code. In this Letter, we generalize the chaotic cryptographic scheme so that it can perform both encryption and hashing to produce the cipher text as well as the hash value for a given message. The collision resistance of the proposed hashing approach is also analyzed. (C) 2002 Elsevier Science B.V. All rights reserved. [References: 6]
展开▼
