Publication Details

Distributed PCFG Password Cracking

HRANICKÝ, R.; ZOBAL, L.; RYŠAVÝ, O.; KOLÁŘ, D.; MIKUŠ, D. Distributed PCFG Password Cracking. In Computer Security - ESORICS 2020. Lecture notes in Computer Science. Guildford: Springer Nature Switzerland AG, 2020. p. 701-719. ISBN: 978-3-030-58950-9.
Czech title
Distribuované lámání hesel pomocí PCFG
Type
conference paper
Language
English
Authors
Hranický Radek, Ing., Ph.D. (DIFS)
Zobal Lukáš, Ing. (FIT)
Ryšavý Ondřej, doc. Ing., Ph.D. (DIFS)
Kolář Dušan, doc. Dr. Ing. (DIFS)
Mikuš Dávid, Ing.
URL
Keywords

distributed,password,cracking,forensics,grammar

Abstract

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.

Published
2020
Pages
701–719
Proceedings
Computer Security - ESORICS 2020
Series
Lecture notes in Computer Science
ISBN
978-3-030-58950-9
Publisher
Springer Nature Switzerland AG
Place
Guildford
DOI
10.1007/978-3-030-58951-6_34
EID Scopus
2-s2.0-85091574024
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"
}
Back to top