js暴力破解密码演示程序-kswapd-ChinaUnix博客

文章分类

文章存档

我的朋友

最近访客

推荐博文

js暴力破解密码演示程序

分类： JavaScript

2014-01-19 21:19:57

代码如下，复制另存为.html文件即可运行。

点击(此处)折叠或打开

<html>
<script>
function EnumCheckPwd()
{
var checkNext = true;
var pos = maxPwdNum - 1;
while(pos >= 0)
{
guessPwdPos[pos] ++;
if(guessPwdPos[pos] >= dictNum)
{
guessPwdPos[pos] = 0;
pos --;
}else{
break;
}
}
for(var i in guessPwdPos)
{
guessPwd[i] = dict[guessPwdPos[i]];
}
if(guessPwd.toString() == pwd.toString())
{
//show.value = guessPwd.join("");
alert("Get pwd:" + guessPwd.join(""));
clearInterval(dispTimer);
return;
}else{
count ++;
setTimeout(EnumCheckPwd, 0);
}
}
function CheckPwd()
{
dict = new Array('a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t',
'u','v','w','x','y','z');
dictNum = 26;
maxPwdNum = 4;
count = 0;
pwd = new Array('a','b','a','a');
temp = new Array();
guessPwdPos = new Array();
for(var i = 0; i < maxPwdNum; i ++){
guessPwdPos[i] = 0;
}
guessPwdPos[maxPwdNum-1] = -1;
guessPwd = new Array();
var maxPwd = Math.pow(dictNum, maxPwdNum);
setTimeout(function(){EnumCheckPwd();}, 10);
dispTimer = setInterval(function(){show.value= count + ":" + parseFloat(count/maxPwd*100).toFixed(2)+ "%" + ":"+ guessPwd.join("");}, 1000);
}
</script>
<input type="button" value="StartCrack" onclick = "CheckPwd()"/>
<input type="textarea" id = "show"/>
</html>

本代码演示了用js暴力破解密码的简单使用，函数EnumCheckPwd循环枚举字典中的所有排列，并与真实密码对比，如对比成功则认为破解成功。显示区每隔1000ms，显示当前破解状态，运行看出，js每秒破解的数量级在10^3次每秒左右，效率还是蛮低的。

阅读(4146) | 评论(0) | 转发(0) |

下一篇：没有了

给主人留下些什么吧！~~

感谢所有关心和支持过ChinaUnix的朋友们