作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2018, Vol. 44 ›› Issue (11): 119-122. doi: 10.19678/j.issn.1000-3428.0048649

• 安全技术 • 上一篇    下一篇

基于马尔可夫链的口令破解算法

安亚巍,罗顺,朱智慧   

  1. 上海通用识别技术研究所,上海 201112
  • 收稿日期:2017-09-14 出版日期:2018-11-15 发布日期:2018-11-15
  • 作者简介:安亚巍(1978—),男,工程师、硕士,主研方向为信息安全、数据分析处理、知识工程;罗顺、朱智慧,工程师
  • 基金资助:

    国家科技支撑计划项目(2014BAH41B03)

Password Cracking Algorithm Based on Markov Chain

AN Yawei,LUO Shun,ZHU Zhihui   

  1. Shanghai General Recognition Technology Institute,Shanghai 201112,China
  • Received:2017-09-14 Online:2018-11-15 Published:2018-11-15

摘要:

口令破解是电子取证的关键技术之一,为克服口令破解中“长度防火墙”问题,在马尔可夫链模型基础上提出一种口令破解算法。通过统计方法对口令空间进行截断,动态给出对口令字符一步状态转移概率矩阵的估计,模拟口令字符设置的潜在规律,并以此得到下一位口令字符的遍历空间。实验结果表明,与普通暴力破解方式相比,该算法的破解效果得到显著提升。

关键词: 马尔可夫链, 口令破解, 口令空间截断, 状态转移概率矩阵, 概率估计

Abstract: Password cracking is one of the key techniques of electronic forensics.In order to overcome the problem of “length firewall” in password cracking,based on Markov chain,a password cracking algorithm is proposed.The password space is truncated by statistical method,the estimation of one-step state transition probability matrix of password character is given dynamically to simulate the potential law of password character setting,and the traversal space of the next password character is obtained.Experimental results show that,compared with the common violent cracking method,the effect of this algorithm is improved significantly.

Key words: Markov chain, password cracking, password space truncation, state transition probability matrix, probability estimation

中图分类号: