Construction of Data Dependent Chaotic Permutation Hashes to Ensure Communications Integrity

摘要

Cryptographic hash functions and message digests are essential in secure communications because they aid in detecting incidental transmission errors caused by unreliable equipment and noisy environments, but also ensure message integrity in presence of intruders deliberately mounting cryptanalytic attacks. It is the purpose of this contribution to introduce a novel approach for generating cryptographic hashes computed from input data dependent pseudo-random permutations. Essentially, input messages are processed sequentially using bytes of input data as keys to discrete chaotic Kolmogorov systems which permute an initial message digest in a cryptographically strong manner heavily depending on the input stream. As will be shown this principle can lead to very efficient and strong message digests.