GNPassGAN: Improved Generative Adversarial Networks For Trawling Offline Password Guessing
Not on the map. Why?
Abstract (arXiv)
The security of passwords depends on a thorough understanding of the strategies used by attackers. Unfortunately, real-world adversaries use pragmatic guessing tactics like dictionary attacks, which are difficult to simulate in password security research. Dictionary attacks must be carefully configured and modified to represent an actual threat. This approach, however, needs domain-specific knowledge and expertise that are difficult to duplicate. This paper reviews various deep learning-based password guessing approaches that do not require domain knowledge or assumptions about users' password structures and combinations. It also introduces GNPassGAN, a password guessing tool built on generative adversarial networks for trawling offline attacks. In comparison to the state-of-the-art PassGAN model, GNPassGAN is capable of guessing 88.03% more passwords and generating 31.69% fewer duplicates.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). Builds on 10 of its 34 references that are in the map. First posted on arXiv 14 Aug 2022.
Builds on
10 of 34 references.
References · 10
- 2017Attention Is All You Needcited by 60,361
- 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
- 2016Improved Techniques for Training GANscited by 2,970
- 2018Deep contextualized word representationscited by 2,290
- 2017Improved Training of Wasserstein GANscited by 2,235
- 2014How transferable are features in deep neural networks?cited by 1,225
- 2017PassGAN: A Deep Learning Approach for Password Guessingcited by 25
- 2021Gradient Normalization for Generative Adversarial Networkscited by 25
- 2019Improving Password Guessing via Representation Learningcited by 14
- 2020Reducing Bias in Modeling Real-world Password Strength via Deep Learning and Dynamic Dictionariescited by 4
Built on by
Citing papers per year: 2022: 1; 2023: 0; 2024: 1; 2025: 0; 2026: 1.
3 papers.