Naslov
Stochastic Approach on Hash Cracking

Autori
Martinovic, Goran ; Horvat, Luka ; Balen, Josip

Vrsta, podvrsta i kategorija rada
Radovi u zbornicima skupova, cjeloviti rad (in extenso), znanstveni

Izvornik
Proceedings of MIPRO 2012, 35th International Convention on Computers in Technical Systems (CTS) / Nikola Bogunović - Opatija : Hrvatska udruga za informacijsku i komunikacijsku tehnologiju, elektroniku i mikroelektroniku - MIPRO, 2012, 1028-1032

ISBN
978-953-233-069-4

Skup
MIPRO 2012, 35th International Convention on Computers in Technical Systems (CTS)

Mjesto i datum
Opatija, Hrvatska, 21.05.2012. - 25.05.2012

Vrsta sudjelovanja
Predavanje

Vrsta recenzije
Međunarodna recenzija

Ključne riječi
dictionary attack; hash cracking; randomization; stochastic approach

Sažetak
Hash functions are used everywhere today, from wireless communications to password storage. Some of them are proven to be mathematically insecure, but still the only way to crack most of them is a brute-force or dictionary attack. Brute-force is usually discarded as an option since it consumes huge amounts of time. Dictionary attack is a regular approach on hash cracking. The attack is performed by selecting words from a dictionary and comparing their hashed value to the obtained value. Word selection is usually done sequentially, which indicates a very long execution time if the searched word is located at the end of the dictionary. This paper introduces a stochastic approach on word selection in a dictionary attack and shows that the approach is desirable if the searched word is found in the second half of the wordlist.

Izvorni jezik
Engleski

Znanstvena područja
Računarstvo

POVEZANOST RADA