Abstract: This article explores the attack on the MD5 hash function using pre-calculated hash chains, as well as the rainbow table method. The content of the article includes: the operation of the MD5 hash function, the determination of the calculated hash chains, the attack on the MD5 hash function by the method of the calculated hash chains, as well as the definition and study of rainbow tables. A hash function is a function that converts an array of input data of arbitrary length to an output bit sequence of fixed length, and is performed using a specific algorithm. The main vector of attack on hash functions is the search for collisions. A collision is the equality of two output values of hash functions for different input data. in this article, two methods are used to investigate the attack on hash functions: the method of pre-calculated hash chains and the method of rainbow tables. it is concluded that the rainbow table method helps to eliminate all the disadvantages that exist in the pre-calculated hash chains. where a single collision causes the rest of the chain to be corrupted. Thus, the longer the chain, the more damage is obtained from collisions. In rainbow tables, these situations are almost reduced to 0.
Publication Year: 2020
Publication Date: 2020-04-16
Language: en
Type: article
Access and Citation
AI Researcher Chatbot
Get quick answers to your questions about the article from our AI researcher chatbot