Affiliations: [a] Department of Information Technology, Faculty of Electrical Engineering and Informatics, University of Pardubice, Studentská 95, Pardubice, Czech Republic
| [b] Institute of System Engineering and Informatics, Faculty of Economics and Administration, University of Pardubice, Studentská 95, Pardubice, Czech Republic
| [c] Department of Information Technologies, Faculty of Informatics and Management, University of Hradec Králové, Rokitanského 62, Hradec Králové III, Czech Republic
Correspondence:
[*]
Corresponding author. Josef Horálek, Department of Information Technology, Faculty of Electrical Engineering and Informatics, University of Pardubice, Studentská 95, 532 10 Pardubice, Czech Republic. Tel.: +420 466 036 461; Fax: +420 466 036 361; E-mail: josef.horalek@upce.cz.
Abstract: This paper acquaints with a created application for generating Rainbow Tables and the results of testing Rainbow Tables, according to the length of the chosen chain. The paper presents a specialized application containing its own algorithms for reduction functions, changing the length of chain, generating Rainbow Tables and measuring the effectivity of the password search in detail. Within the executed tests, the dependence of Rainbow Tables size on the password length, the affection of the hash search by the size of the chosen chain and their links to collisions, which arise from the principle of using the reduction function, were observed. The results objectively describe the pros and cons of using Rainbow Tables and show the possibilities and restrictions for their effective usage.
