一种基于gan的密码猜测方法

Bao Ngoc Vi, Nguyen Ngoc Tran, Trung Giap Vu The
{"title":"一种基于gan的密码猜测方法","authors":"Bao Ngoc Vi, Nguyen Ngoc Tran, Trung Giap Vu The","doi":"10.1109/RIVF51545.2021.9642098","DOIUrl":null,"url":null,"abstract":"Password is the most widely used authenticate method. Individuals ordinarily have numerous passwords for their documents or devices, and, in some cases, they need to recover them with password guessing tools. Most popular guessing tools require a dictionary of common passwords to check with password hashes. Thus, generative adversarial networks (GANs) are suitable choices to automatically create a high-quality dictionary without any additional information from experts or password structures. One of the successful GAN-based models is the PassGAN. However, existing GAN-based models suffer from the discrete nature of passwords. Therefore, we proposed and evaluated two improvement of the PassGAN model to tackle this problem: the GS-PassGAN model using Gumbel-Softmax relaxation and the S-PassGAN using a smooth representation of a real password obtained by an additional Auto-Encoder. Experiment results on three different popular datasets show that the proposed method is better than the PassGAN both in the standalone and combining cases. Moreover, the matching rate of the proposed method can be increased by more than 5%.","PeriodicalId":6860,"journal":{"name":"2021 RIVF International Conference on Computing and Communication Technologies (RIVF)","volume":"16 1","pages":"1-5"},"PeriodicalIF":0.0000,"publicationDate":"2021-08-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A GAN-based approach for password guessing\",\"authors\":\"Bao Ngoc Vi, Nguyen Ngoc Tran, Trung Giap Vu The\",\"doi\":\"10.1109/RIVF51545.2021.9642098\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Password is the most widely used authenticate method. Individuals ordinarily have numerous passwords for their documents or devices, and, in some cases, they need to recover them with password guessing tools. Most popular guessing tools require a dictionary of common passwords to check with password hashes. Thus, generative adversarial networks (GANs) are suitable choices to automatically create a high-quality dictionary without any additional information from experts or password structures. One of the successful GAN-based models is the PassGAN. However, existing GAN-based models suffer from the discrete nature of passwords. Therefore, we proposed and evaluated two improvement of the PassGAN model to tackle this problem: the GS-PassGAN model using Gumbel-Softmax relaxation and the S-PassGAN using a smooth representation of a real password obtained by an additional Auto-Encoder. Experiment results on three different popular datasets show that the proposed method is better than the PassGAN both in the standalone and combining cases. Moreover, the matching rate of the proposed method can be increased by more than 5%.\",\"PeriodicalId\":6860,\"journal\":{\"name\":\"2021 RIVF International Conference on Computing and Communication Technologies (RIVF)\",\"volume\":\"16 1\",\"pages\":\"1-5\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-08-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2021 RIVF International Conference on Computing and Communication Technologies (RIVF)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/RIVF51545.2021.9642098\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2021 RIVF International Conference on Computing and Communication Technologies (RIVF)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/RIVF51545.2021.9642098","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

密码是使用最广泛的认证方法。个人的文档或设备通常有很多密码,在某些情况下,他们需要使用密码猜测工具来恢复密码。大多数流行的猜测工具需要一个常用密码字典来检查密码哈希值。因此,生成对抗网络(GANs)是自动创建高质量字典的合适选择,无需任何来自专家或密码结构的额外信息。其中一个成功的基于gan的模型是PassGAN。然而,现有的基于gan的模型受到密码离散性的影响。因此,我们提出并评估了两种PassGAN模型的改进来解决这个问题:使用Gumbel-Softmax松弛的GS-PassGAN模型和使用由额外的Auto-Encoder获得的真实密码的平滑表示的S-PassGAN模型。在三种不同的流行数据集上的实验结果表明,该方法在单独和组合情况下都优于PassGAN。此外,该方法的匹配率可提高5%以上。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A GAN-based approach for password guessing
Password is the most widely used authenticate method. Individuals ordinarily have numerous passwords for their documents or devices, and, in some cases, they need to recover them with password guessing tools. Most popular guessing tools require a dictionary of common passwords to check with password hashes. Thus, generative adversarial networks (GANs) are suitable choices to automatically create a high-quality dictionary without any additional information from experts or password structures. One of the successful GAN-based models is the PassGAN. However, existing GAN-based models suffer from the discrete nature of passwords. Therefore, we proposed and evaluated two improvement of the PassGAN model to tackle this problem: the GS-PassGAN model using Gumbel-Softmax relaxation and the S-PassGAN using a smooth representation of a real password obtained by an additional Auto-Encoder. Experiment results on three different popular datasets show that the proposed method is better than the PassGAN both in the standalone and combining cases. Moreover, the matching rate of the proposed method can be increased by more than 5%.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信