z-logo
open-access-imgOpen Access
Timestamp Injected Cryptographic Hash Function to Reduce Fabrication of Hash Collisions
Author(s) -
Zulfany Erlisa Rasjid,
Gunawan Witjaksono,
Benfano Soewito,
Edi Abdurahman
Publication year - 2019
Publication title -
international journal of recent technology and engineering
Language(s) - English
Resource type - Journals
ISSN - 2277-3878
DOI - 10.35940/ijrte.b2169.118419
Subject(s) - hash function , md5 , computer science , cryptographic hash function , timestamp , collision , collision resistance , double hashing , digital signature , cryptography , prefix , theoretical computer science , algorithm , computer security , linguistics , philosophy
Cryptographic hash functions are used in many applications. One important application is to ensure data integrity. Although there are many different types of hashing algorithms, MD5 is widely used to ensure data integrity in digital evidence. However, a weakness, where collisions can occur, has been found in the MD5 algorithm. With regards to digital evidence, this is a big issue. The integrity of the digital evidence becomes questionable due to collisions and hence it is not admissible in court. Many methods were used to find collisions, such as the Chosen-Prefix Collision and researchers have been improving collision finding algorithms. This paper concentrates on reducing the chances of collision by chopping the last 16 bits of the MD5 algorithm and injecting timestamp into the chopped parts. Experiments are performed to test this algorithm and the results show that the time taken to find collisions is longer using the MD5 with an injected timestamp. The chopping construction and the timestamp disrupt the iterative property of the hash function thus when dealing with digital evidence, there are less chances of hash collision and therefore the probability of the admissibility of the digital evidence in court is higher

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here