Other formats:
BibTeX
LaTeX
RIS
@inproceedings{1652882, author = {Gillela, Maruthi and Přenosil, Václav and Reddy, G. Venkat}, address = {New York}, booktitle = {32nd International Conference on VLSI Design, VLSID 2019}, doi = {http://dx.doi.org/10.1109/VLSID.2019.00034}, editor = {IEEE}, keywords = {LUT; HDL; GPU; IP core}, howpublished = {tištěná verze "print"}, language = {eng}, location = {New York}, isbn = {978-1-7281-0409-6}, pages = {88-93}, publisher = {IEEE}, title = {Parallelization of brute-force attack on MD5 hash algorithm on FPGA}, url = {http://dx.doi.org/10.1109/VLSID.2019.00034}, year = {2019} }
TY - JOUR ID - 1652882 AU - Gillela, Maruthi - Přenosil, Václav - Reddy, G. Venkat PY - 2019 TI - Parallelization of brute-force attack on MD5 hash algorithm on FPGA PB - IEEE CY - New York SN - 9781728104096 KW - LUT KW - HDL KW - GPU KW - IP core UR - http://dx.doi.org/10.1109/VLSID.2019.00034 L2 - http://dx.doi.org/10.1109/VLSID.2019.00034 N2 - FPGA implementation of MD5 hash algorithm is faster than its software counterpart, but a pre-image brute-force attack on MD5 hash still needs 2 power 128 iterations theoretically. This work attempts to improve the speed of the brute-force attack on the MD5 algorithm using hardware implementation. A full 64-stage pipelining is done for MD5 hash generation and three architectures are presented for guess password generation. A 32/34/26-instance parallelization of MD5 hash generator and password generator pair is done to search for a password that was hashed using the MD5 algorithm. The total performance of about 6G trials/second has been achieved using a single Virtex-7 FPGA device. ER -
GILLELA, Maruthi, Václav PŘENOSIL and G. Venkat REDDY. Parallelization of brute-force attack on MD5 hash algorithm on FPGA. In IEEE. \textit{32nd International Conference on VLSI Design, VLSID 2019}. New York: IEEE, 2019, p.~88-93. ISBN~978-1-7281-0409-6. Available from: https://dx.doi.org/10.1109/VLSID.2019.00034.
|