Institutional Repository [SANDBOX]
Technical University of Crete
EN  |  EL

Search

Browse

My Space

Implementing rainbow tables in High-End FPGAs for super-fast password cracking

Papaefstathiou Ioannis, Theocharoulis K. , Manifavas Charalabos

Simple record

URIhttp://purl.tuc.gr/dl/dias/6AB789FE-00B0-4379-811B-D6B017C24D65-
Identifierhttps://doi.org/10.1109/FPL.2010.120-
Languageen-
TitleImplementing rainbow tables in High-End FPGAs for super-fast password crackingen
CreatorPapaefstathiou Ioannisen
CreatorΠαπαευσταθιου Ιωαννηςel
CreatorTheocharoulis K. en
CreatorManifavas Charalabosen
CreatorΜανιφαβας Χαραλαμποςel
PublisherInstitute of Electrical and Electronics Engineersen
Content SummaryOne of the most efficient methods for cracking passwords, which are hashed based on different cryptographic algorithms, is the one based on “Rainbow Tables”. Those lookup tables offer an almost optimal time-memory tradeoff in the process of recovering the plaintext password from a password hash, generated by a cryptographic hash function. In this paper, the first known such generic system is demonstrated. It is implemented in a state-of-the-art reconfigurable device that cracks passwords, which are encrypted with a number of different cryptographic algorithms. The proposed FPGA-based system is up to 1000 times faster than the corresponding software approach. This is achieved by using a highly parallel architecture employing a fine-grained pipeline.en
Type of ItemΠλήρης Δημοσίευση σε Συνέδριοel
Type of ItemConference Full Paperen
Licensehttp://creativecommons.org/licenses/by/4.0/en
Date of Item2015-11-15-
Date of Publication2010-
Bibliographic CitationI. Papaefstathiou, C. Manifavas, K. Theocharoulis, "Implementing Rainbow Tables in High-End FPGAs for Super-Fast Password Cracking," in 2010 International Conference on Field Programmable Logic and Applications, 2010, pp. 145 - 150. doi: 10.1109/FPL.2010.120en

Services

Statistics

 

Copyright © DIAS 2013