Informative Overview of Rainbow Hashes

Abstract

This article gives an overview for rainbow tables and the results of testing rainbow tables according to the length of the chosen chain. The article presents a password cracking process that contains its own algorithms for reduction functions, changes the length of the chain and generates tables accordingly. These are measured to seethe effectivity of the password search in detail. Within the executed tests it was noticed that there is a dependence of rainbow tables size in relation to the password length, the affection of the hash search by the size of the chosen chain and their links to collisions. After completing the testing with different passwords and tables the cause of this arises from the principle of using the reduction function. These results objectively describe the pros and cons of using rainbow tables and finally the article ends talking about what are some effective use cases for this password cracking method.