2018
DOI: 10.1007/978-3-319-75307-2_11
|View full text |Cite
|
Sign up to set email alerts
|

New Technologies in Password Cracking Techniques

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
5
0

Year Published

2019
2019
2024
2024

Publication Types

Select...
5
3

Relationship

0
8

Authors

Journals

citations
Cited by 12 publications
(6 citation statements)
references
References 9 publications
0
5
0
Order By: Relevance
“…In our program, we limited the generation of passcodes to numeric ones, while its extension to cover alphanumeric passcodes is straightforward. However, we would like to note that finding alphanumeric passcodes becomes more efficient when combined with dictionary attacks or other password-search techniques as described in [AHW18], which are out of the scope of this work.…”
Section: Highly Parallelized Passcode Recovery Utilizing Gpusmentioning
confidence: 99%
“…In our program, we limited the generation of passcodes to numeric ones, while its extension to cover alphanumeric passcodes is straightforward. However, we would like to note that finding alphanumeric passcodes becomes more efficient when combined with dictionary attacks or other password-search techniques as described in [AHW18], which are out of the scope of this work.…”
Section: Highly Parallelized Passcode Recovery Utilizing Gpusmentioning
confidence: 99%
“…However, password generation based on real user passwords is shown to perform better. The most popular techniques are: Rulebased dictionary attacks, probabilistic context free grammars (PCFGs), Markov models, and machine learning techniques [32], [33]. The likelihood of each password can be calculated if we assign a probability to each production rule.…”
Section: Related Literaturementioning
confidence: 99%
“…It is different from assessing word-list quality [34], [35], or individual password strength [36], [37], [38], [39], as both are a separate line of research. As Aggarwal et al shows [32], PCFG parse trees are usually ambiguous which means, there can be multiple ways to produce a single word. Furthermore, if a capable adversary aims to determine the probability distribution of such data sets but doesn't know the original creation mechanism, they can get a completely different ranking order if for example a Markov model is used to rank a data set created by PCFG.…”
Section: Related Literaturementioning
confidence: 99%
“…To understand password security, people have gone through several stages, from some heuristic methods that lack theoretical foundations to those algorithms that conform to strict probability models [2]. Since the emergence of Markov-based [3,4] and probabilistic context-free grammar-(PCFG-) based [5,6] password guessing algorithms, trawling password guessing has been intensively studied [7][8][9][10]. Recently, several large-scale personal information database leakage events have caused widespread concern in the security community [11][12][13][14].…”
Section: Introductionmentioning
confidence: 99%