Přístupnostní navigace
E-přihláška
Vyhledávání Vyhledat Zavřít
Detail publikace
HRANICKÝ, R. ZOBAL, L. RYŠAVÝ, O. KOLÁŘ, D. MIKUŠ, D.
Originální název
Distributed PCFG Password Cracking
Typ
článek ve sborníku ve WoS nebo Scopus
Jazyk
angličtina
Originální abstrakt
In digital forensics, investigators frequently face cryptographic protection that prevents access to potentially significant evidence. Since users prefer passwords that are easy to remember, they often unwittingly follow a series of common password-creation patterns. A probabilistic context-free grammar is a mathematical model that can describe such patterns and provide a smart alternative for traditional brute-force and dictionary password guessing methods. Because more complex tasks require dividing the workload among multiple nodes, in the paper, we propose a technique for distributed cracking with probabilistic grammars.
Klíčová slova
distributed,password,cracking,forensics,grammar
Autoři
HRANICKÝ, R.; ZOBAL, L.; RYŠAVÝ, O.; KOLÁŘ, D.; MIKUŠ, D.
Vydáno
14. 8. 2020
Nakladatel
Springer Nature Switzerland AG
Místo
Guildford
ISBN
978-3-030-58950-9
Kniha
Computer Security - ESORICS 2020
Edice
Lecture notes in Computer Science
Strany od
701
Strany do
719
Strany počet
19
URL
https://link.springer.com/chapter/10.1007/978-3-030-58951-6_34
BibTex
@inproceedings{BUT168120, author="Radek {Hranický} and Lukáš {Zobal} and Ondřej {Ryšavý} and Dušan {Kolář} and Dávid {Mikuš}", title="Distributed PCFG Password Cracking", booktitle="Computer Security - ESORICS 2020", year="2020", series="Lecture notes in Computer Science", pages="701--719", publisher="Springer Nature Switzerland AG", address="Guildford", doi="10.1007/978-3-030-58951-6\{_}34", isbn="978-3-030-58950-9", url="https://link.springer.com/chapter/10.1007/978-3-030-58951-6_34" }