2010/12/05 by René Ndoundam, Rene Ndoundam, Ndoundam, Rene +5
Computer Science · #Chaos-based Image/Signal Encryption #Coding theory and cryptography #Cryptographic Implementations and Security #Cryptography and Security (cs.CR) #FOS: Computer and information sciences #cs.CR
paper · pdf · doi:10.48550/arxiv.1012.0993
This paper has been withdrawn by the authors due to the fact that the implementation of the ideas of the paper need a PKI
openalex publication_date 2010/12/05 · arxiv created 2011/09/21 · arxiv updated 2015/03/17 · openalex created_date 2025/10/10 · openalex updated_date 2026/07/28
We propose a hash function based on arithmetic coding and public-key cryptography. The resistance of the hash function to second preimage attack, collision and differential cryptanalysis is based on the properties of arithmetic coding as a non-linear dynamical system. The resistance of the hash function to first preimage attack is based on the public-key cryptography. The new hash function uses the strength of HMAC with the difference that it didn't need a secret key for calculating the hash (in this step, it uses one, two or three public -keys) and in the classical attack, an adversary need to break the public key algorithm or to have all the secret keys to perform his attack.