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

Password Cracking Algorithm Based on Markov Chain

作　　者：安亚巍 罗顺 朱智慧 AN Yawei;LUO Shun;ZHU Zhihui(Shanghai General Recognition Technology Institute,Shanghai 201112,China)

机构地区：[1]上海通用识别技术研究所,上海201112

出　　处：《计算机工程》2018年第11期119-122,共4页Computer Engineering

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

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

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

分 类 号：TP309[自动化与计算机技术—计算机系统结构]