zoukankan      html  css  js  c++  java
  • 用dhtml做了一个密码管理器

    <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.0 Transitional//EN">
    <HTML>
    <HEAD>
    <TITLE> EMU'S PASSWORD MANAGER </TITLE>
    <META NAME="Generator" CONTENT="EditPlus">
    <META NAME="Author" CONTENT="emu(ston)">
    <META NAME="Keywords" CONTENT="password">
    <META NAME="Description" CONTENT="An hyper text application which can help you manage your passwords">
    <SCRIPT LANGUAGE="JavaScript">
    <!--
    /*--------------------------------- md5 function ----------------------------------*/

    function array(n) {
      for(i=0;i<n;i++) this[i]=0;
      this.length=n;
    }

    function integer(n) { return n%(0xffffffff+1); }

    function shr(a,b) {
      a=integer(a);
      b=integer(b);
      if (a-0x80000000>=0) {
        a=a%0x80000000;
        a>>=b;
        a+=0x40000000>>(b-1);
      } else
        a>>=b;
      return a;
    }

    function shl1(a) {
      a=a%0x80000000;
      if (a&0x40000000==0x40000000)
      {
        a-=0x40000000; 
        a*=2;
        a+=0x80000000;
      } else
        a*=2;
      return a;
    }

    function shl(a,b) {
      a=integer(a);
      b=integer(b);
      for (var i=0;i<b;i++) a=shl1(a);
      return a;
    }

    function and(a,b) {
      a=integer(a);
      b=integer(b);
      var t1=(a-0x80000000);
      var t2=(b-0x80000000);
      if (t1>=0)
        if (t2>=0)
          return ((t1&t2)+0x80000000);
        else
          return (t1&b);
      else
        if (t2>=0)
          return (a&t2);
        else
          return (a&b); 
    }

    function or(a,b) {
      a=integer(a);
      b=integer(b);
      var t1=(a-0x80000000);
      var t2=(b-0x80000000);
      if (t1>=0)
        if (t2>=0)
          return ((t1|t2)+0x80000000);
        else
          return ((t1|b)+0x80000000);
      else
        if (t2>=0)
          return ((a|t2)+0x80000000);
        else
          return (a|b); 
    }

    function xor(a,b) {
      a=integer(a);
      b=integer(b);
      var t1=(a-0x80000000);
      var t2=(b-0x80000000);
      if (t1>=0)
        if (t2>=0)
          return (t1^t2);
        else
          return ((t1^b)+0x80000000);
      else
        if (t2>=0)
          return ((a^t2)+0x80000000);
        else
          return (a^b); 
    }

    function not(a) {
      a=integer(a);
      return (0xffffffff-a);
    }

        var state = new array(4);
        var count = new array(2);
     count[0] = 0;
     count[1] = 0;                    
        var buffer = new array(64);
        var transformBuffer = new array(16);
        var digestBits = new array(16);

        var S11 = 7;
        var S12 = 12;
        var S13 = 17;
        var S14 = 22;
        var S21 = 5;
        var S22 = 9;
        var S23 = 14;
        var S24 = 20;
        var S31 = 4;
        var S32 = 11;
        var S33 = 16;
        var S34 = 23;
        var S41 = 6;
        var S42 = 10;
        var S43 = 15;
        var S44 = 21;

        function F(x,y,z) {
     return or(and(x,y),and(not(x),z));
        }

        function G(x,y,z) {
     return or(and(x,z),and(y,not(z)));
        }

        function H(x,y,z) {
     return xor(xor(x,y),z);
        }

        function I(x,y,z) {
     return xor(y ,or(x , not(z)));
        }

        function rotateLeft(a,n) {
     return or(shl(a, n),(shr(a,(32 - n))));
        }

        function FF(a,b,c,d,x,s,ac) {
            a = a+F(b, c, d) + x + ac;
     a = rotateLeft(a, s);
     a = a+b;
     return a;
        }

        function GG(a,b,c,d,x,s,ac) {
     a = a+G(b, c, d) +x + ac;
     a = rotateLeft(a, s);
     a = a+b;
     return a;
        }

        function HH(a,b,c,d,x,s,ac) {
     a = a+H(b, c, d) + x + ac;
     a = rotateLeft(a, s);
     a = a+b;
     return a;
        }

        function II(a,b,c,d,x,s,ac) {
     a = a+I(b, c, d) + x + ac;
     a = rotateLeft(a, s);
     a = a+b;
     return a;
        }

        function transform(buf,offset) {
     var a=0, b=0, c=0, d=0;
     var x = transformBuffer;
     
     a = state[0];
     b = state[1];
     c = state[2];
     d = state[3];
     
     for (i = 0; i < 16; i++) {
         x[i] = and(buf[i*4+offset],0xff);
         for (j = 1; j < 4; j++) {
      x[i]+=shl(and(buf[i*4+j+offset] ,0xff), j * 8);
         }
     }

     /* Round 1 */
     a = FF ( a, b, c, d, x[ 0], S11, 0xd76aa478); /* 1 */
     d = FF ( d, a, b, c, x[ 1], S12, 0xe8c7b756); /* 2 */
     c = FF ( c, d, a, b, x[ 2], S13, 0x242070db); /* 3 */
     b = FF ( b, c, d, a, x[ 3], S14, 0xc1bdceee); /* 4 */
     a = FF ( a, b, c, d, x[ 4], S11, 0xf57c0faf); /* 5 */
     d = FF ( d, a, b, c, x[ 5], S12, 0x4787c62a); /* 6 */
     c = FF ( c, d, a, b, x[ 6], S13, 0xa8304613); /* 7 */
     b = FF ( b, c, d, a, x[ 7], S14, 0xfd469501); /* 8 */
     a = FF ( a, b, c, d, x[ 8], S11, 0x698098d8); /* 9 */
     d = FF ( d, a, b, c, x[ 9], S12, 0x8b44f7af); /* 10 */
     c = FF ( c, d, a, b, x[10], S13, 0xffff5bb1); /* 11 */
     b = FF ( b, c, d, a, x[11], S14, 0x895cd7be); /* 12 */
     a = FF ( a, b, c, d, x[12], S11, 0x6b901122); /* 13 */
     d = FF ( d, a, b, c, x[13], S12, 0xfd987193); /* 14 */
     c = FF ( c, d, a, b, x[14], S13, 0xa679438e); /* 15 */
     b = FF ( b, c, d, a, x[15], S14, 0x49b40821); /* 16 */

     /* Round 2 */
     a = GG ( a, b, c, d, x[ 1], S21, 0xf61e2562); /* 17 */
     d = GG ( d, a, b, c, x[ 6], S22, 0xc040b340); /* 18 */
     c = GG ( c, d, a, b, x[11], S23, 0x265e5a51); /* 19 */
     b = GG ( b, c, d, a, x[ 0], S24, 0xe9b6c7aa); /* 20 */
     a = GG ( a, b, c, d, x[ 5], S21, 0xd62f105d); /* 21 */
     d = GG ( d, a, b, c, x[10], S22,  0x2441453); /* 22 */
     c = GG ( c, d, a, b, x[15], S23, 0xd8a1e681); /* 23 */
     b = GG ( b, c, d, a, x[ 4], S24, 0xe7d3fbc8); /* 24 */
     a = GG ( a, b, c, d, x[ 9], S21, 0x21e1cde6); /* 25 */
     d = GG ( d, a, b, c, x[14], S22, 0xc33707d6); /* 26 */
     c = GG ( c, d, a, b, x[ 3], S23, 0xf4d50d87); /* 27 */
     b = GG ( b, c, d, a, x[ 8], S24, 0x455a14ed); /* 28 */
     a = GG ( a, b, c, d, x[13], S21, 0xa9e3e905); /* 29 */
     d = GG ( d, a, b, c, x[ 2], S22, 0xfcefa3f8); /* 30 */
     c = GG ( c, d, a, b, x[ 7], S23, 0x676f02d9); /* 31 */
     b = GG ( b, c, d, a, x[12], S24, 0x8d2a4c8a); /* 32 */

     /* Round 3 */
     a = HH ( a, b, c, d, x[ 5], S31, 0xfffa3942); /* 33 */
     d = HH ( d, a, b, c, x[ 8], S32, 0x8771f681); /* 34 */
     c = HH ( c, d, a, b, x[11], S33, 0x6d9d6122); /* 35 */
     b = HH ( b, c, d, a, x[14], S34, 0xfde5380c); /* 36 */
     a = HH ( a, b, c, d, x[ 1], S31, 0xa4beea44); /* 37 */
     d = HH ( d, a, b, c, x[ 4], S32, 0x4bdecfa9); /* 38 */
     c = HH ( c, d, a, b, x[ 7], S33, 0xf6bb4b60); /* 39 */
     b = HH ( b, c, d, a, x[10], S34, 0xbebfbc70); /* 40 */
     a = HH ( a, b, c, d, x[13], S31, 0x289b7ec6); /* 41 */
     d = HH ( d, a, b, c, x[ 0], S32, 0xeaa127fa); /* 42 */
     c = HH ( c, d, a, b, x[ 3], S33, 0xd4ef3085); /* 43 */
     b = HH ( b, c, d, a, x[ 6], S34,  0x4881d05); /* 44 */
     a = HH ( a, b, c, d, x[ 9], S31, 0xd9d4d039); /* 45 */
     d = HH ( d, a, b, c, x[12], S32, 0xe6db99e5); /* 46 */
     c = HH ( c, d, a, b, x[15], S33, 0x1fa27cf8); /* 47 */
     b = HH ( b, c, d, a, x[ 2], S34, 0xc4ac5665); /* 48 */

     /* Round 4 */
     a = II ( a, b, c, d, x[ 0], S41, 0xf4292244); /* 49 */
     d = II ( d, a, b, c, x[ 7], S42, 0x432aff97); /* 50 */
     c = II ( c, d, a, b, x[14], S43, 0xab9423a7); /* 51 */
     b = II ( b, c, d, a, x[ 5], S44, 0xfc93a039); /* 52 */
     a = II ( a, b, c, d, x[12], S41, 0x655b59c3); /* 53 */
     d = II ( d, a, b, c, x[ 3], S42, 0x8f0ccc92); /* 54 */
     c = II ( c, d, a, b, x[10], S43, 0xffeff47d); /* 55 */
     b = II ( b, c, d, a, x[ 1], S44, 0x85845dd1); /* 56 */
     a = II ( a, b, c, d, x[ 8], S41, 0x6fa87e4f); /* 57 */
     d = II ( d, a, b, c, x[15], S42, 0xfe2ce6e0); /* 58 */
     c = II ( c, d, a, b, x[ 6], S43, 0xa3014314); /* 59 */
     b = II ( b, c, d, a, x[13], S44, 0x4e0811a1); /* 60 */
     a = II ( a, b, c, d, x[ 4], S41, 0xf7537e82); /* 61 */
     d = II ( d, a, b, c, x[11], S42, 0xbd3af235); /* 62 */
     c = II ( c, d, a, b, x[ 2], S43, 0x2ad7d2bb); /* 63 */
     b = II ( b, c, d, a, x[ 9], S44, 0xeb86d391); /* 64 */

     state[0] +=a;
     state[1] +=b;
     state[2] +=c;
     state[3] +=d;

        }


        function init() {
     count[0]=count[1] = 0;
     state[0] = 0x67452301;
     state[1] = 0xefcdab89;
     state[2] = 0x98badcfe;
     state[3] = 0x10325476;
     for (i = 0; i < digestBits.length; i++)
         digestBits[i] = 0;
        }

        function update(b) {
     var index,i;
     
     index = and(shr(count[0],3) , 0x3f);
     if (count[0]<0xffffffff-7)
       count[0] += 8;
            else {
       count[1]++;
       count[0]-=0xffffffff+1;
              count[0]+=8;
            }
     buffer[index] = and(b,0xff);
     if (index  >= 63) {
         transform(buffer, 0);
     }
        }

        function finish() {
     var bits = new array(8);
     var padding;
     var i=0, index=0, padLen=0;

     for (i = 0; i < 4; i++) {
         bits[i] = and(shr(count[0],(i * 8)), 0xff);
     }
            for (i = 0; i < 4; i++) {
         bits[i+4]=and(shr(count[1],(i * 8)), 0xff);
     }
     index = and(shr(count[0], 3) ,0x3f);
     padLen = (index < 56) ? (56 - index) : (120 - index);
     padding = new array(64);
     padding[0] = 0x80;
            for (i=0;i<padLen;i++)
       update(padding[i]);
            for (i=0;i<8;i++)
       update(bits[i]);

     for (i = 0; i < 4; i++) {
         for (j = 0; j < 4; j++) {
      digestBits[i*4+j] = and(shr(state[i], (j * 8)) , 0xff);
         }
     }
        }

    /* End of the MD5 algorithm */

    function hexa(n) {
     var hexa_h = "0123456789abcdef";
     var hexa_c="";
     var hexa_m=n;
     for (hexa_i=0;hexa_i<8;hexa_i++) {
       hexa_c=hexa_h.charAt(Math.abs(hexa_m)%16)+hexa_c;
       hexa_m=Math.floor(hexa_m/16);
     }
     return hexa_c;
    }


    var ascii="01234567890123456789012345678901" +
              " !/"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ"+
              "[//]^_`abcdefghijklmnopqrstuvwxyz{|}~";

    function MD5(entree)
    {
     var l,s,k,ka,kb,kc,kd;

     init();
     for (k=0;k<entree.length;k++) {
       l=entree.charAt(k);
       update(ascii.lastIndexOf(l));
     }
     finish();
     ka=kb=kc=kd=0;
     for (i=0;i<4;i++) ka+=shl(digestBits[15-i], (i*8));
     for (i=4;i<8;i++) kb+=shl(digestBits[15-i], ((i-4)*8));
     for (i=8;i<12;i++) kc+=shl(digestBits[15-i], ((i-8)*8));
     for (i=12;i<16;i++) kd+=shl(digestBits[15-i], ((i-12)*8));
     s=hexa(kd)+hexa(kc)+hexa(kb)+hexa(ka);
     return s;
    }

    /*--------------------------------- end of md5 function ----------------------------------*/

    /*------------------------------- encrypt/decrypt function -------------------------------*/
    String.prototype.xor = function (key){
     if (key==null) key=window.key;
    for (var i=0,result="";i<this.length;i++)
     result += String.fromCharCode(this.charCodeAt(i)^key.charCodeAt(i%key.length));
    return result;
    }
    /*--------------------------- end of encrypt/decrypt function ----------------------------*/


    var pwd=0,key=0,pwds = new Object(),fso = new ActiveXObject("Scripting.FileSystemObject"),data="",data_md5="",question1="",question2="",question3="";
    var key_md5 = "de1b3bc4b324d43d8f730c7ce5884bf2",answerMD5="ba7cbf39b32eab9f5584e59952e16e3d",reminder = unescape("%u39DF%uA7BF%uF672%u87EE%uBAB4%u7920%uC826%u7432%u86CA%uEC92%u5791%u9637%uAB38%uA295%uFA63%u0593%u8D3A%u33A2%u445D%uB6A8%u101B%u4514%uBF19%u651B%u779C%u66DF%u475B%u1923%u33AC%uF171%uDB1F%u22C5");

    window.onload=function(){
     pwd = prompt("Please enter your access password","");var i=0;
     while (pwd != null && MD5(escape(generateKeyByPwd(pwd)))!=key_md5 &&  i++<3)
      pwd = prompt("Password uncorrect , please enter your access password again","");

     if (pwd == null || MD5(escape(generateKeyByPwd(pwd)))!=key_md5) {
      if (confirm("Do you want to get back your password?")){
       var a1 = prompt("Please answer folowing question:"+question1,"");
       var a2 = prompt("Please answer folowing question:"+question2,"");
       var a3 = prompt("Please answer folowing question:"+question3,"");
       if (answerMD5 != MD5("answers:"+escape(a1+a2+a3))){
        alert("Uncorrect answers. Sorry, you cannot access this password file.");
        return;
       }else{
        key =  reminder.xor(generateKeyByPwd("answer1:"+a1)).xor(generateKeyByPwd("answer2:"+a2)).xor(generateKeyByPwd("answer3:"+a3));
       }
      }else{
       return;
      }
     }else{
      key = generateKeyByPwd(pwd);
     }

     if (data != ""){
      if (MD5(data)==data_md5){
       try{
        execScript(unescape(data).xor());
       }catch(e){
        alert("Data error! Password file maybe destoried!");
       }
      }else{
       alert("Password file maybe destoried!");
      }
     }

     showPwds();

     var btns = document.getElementsByTagName("BUTTON");
     for(var i=0;i<btns.length;i++)btns[i].disabled=false;
    }

    function showPwds(){
     var table = ["<table align=center width=700 bgcolor=black cellspacing=1 style=font-size:15><tr bgcolor=#CCCCFF><th>Title</th><th>Password</th><th>&nbsp;</th></tr><tbody bgcolor=#FFFFCC align=center>"];
     for (var i in pwds)
      if (pwds[i]){
       table[table.length] = "<tr><td ondblclick='modifyTitle(this)'>"
       table[table.length] = unescape(i).xor()
       table[table.length] = "</td><td ondblclick='modifyPwd(this)'>"
       table[table.length] = unescape(pwds[i]).xor();
       table[table.length] = "</td><td><button onclick=removePwd('";
       table[table.length] = i;
       table[table.length] = "')><FONT COLOR=red>Delete</FONT></button> &nbsp; <button onclick=clipboardData.setData('Text','";
       table[table.length] = unescape(pwds[i]).xor();
       table[table.length] = "');><FONT COLOR=green>Copy</FONT></button></td></tr>";
      }
     table[table.length] = "</tbody></table>"
     content.innerHTML = table.join("");
    }

    function addPwd(){
     var title = prompt("Please enter new password title","");
     if (!title) return;
     if (pwds[escape(title.xor())]!= null)
     if (!confirm("Title already exist. Do you really want to over write it? ")) return;
     var newPwd = prompt("Please enter new password","");
     pwds[escape(title.xor())] = escape(newPwd.xor());
     storePwds();
     showPwds();
    }

    function storePwds(){
     var st = [];
     for (var i in pwds)
      if (pwds[i])
       st[st.length] = 'pwds["'+i+'"]="'+pwds[i]+'";';
     st = st.join("");
     st = escape(st.xor());
     var s = fso.OpentextFile("passwordFile.js",2,true);
     s.write("data=/""+st+"/";");
     s.write("data_md5=/""+MD5(st)+"/";");
     s.write('key_md5 = "'+MD5(escape(key))+'";');
     s.write('answerMD5 = "'+answerMD5+'";');
     s.write('reminder = unescape("'+escape(reminder)+'");');
     s.write('question1 = unescape("'+escape(question1)+'");');
     s.write('question2 = unescape("'+escape(question2)+'");');
     s.write('question3 = unescape("'+escape(question3)+'");');
     s.Close();
    }


    function changeAccessPwd(){
     var newPwd = prompt("Please enter new access password","");
     if (!newPwd || newPwd=="") return;
     var newKey = generateKeyByPwd(newPwd);

     var newPwds = new Object();
     for (var i in pwds)
     if (pwds[i])
     newPwds[escape(unescape(i).xor().xor(newKey))] = escape(unescape(pwds[i]).xor().xor(newKey));
     reminder=reminder.xor().xor(newKey);
     key = newKey;
     pwds = newPwds;
     storePwds();
    }

    function changeAccessPwdRemander(){
     var q1,q2,q3,a1,a2,a3;
     if ((q1 = prompt("Please enter first new question:",question1))!=null
      && (a1 = prompt("Please enter answer of first question:",""))!=null
      && (q2 = prompt("Please enter second new question:",question2))!=null
      && (a2 = prompt("Please enter answer of second question:",""))!=null
      && (q3 = prompt("Please enter third new question:",question3))!=null
      && (a3 = prompt("Please enter answer of third question:",""))!=null)
     question1 = q1;
     question2 = q2;
     question3 = q3;
     reminder = key.xor(generateKeyByPwd("answer1:"+a1)).xor(generateKeyByPwd("answer2:"+a2)).xor(generateKeyByPwd("answer3:"+a3));
     answerMD5 = MD5("answers:"+escape(a1+a2+a3));
     storePwds();
    }


    function modifyTitle(e){
     var oldTitle = e.innerText;
     var sPwd = e.nextSibling.innerText;
     var newTitle = prompt("Please enter new password title",oldTitle);
     if (!newTitle) return;
     pwds[escape(oldTitle.xor())]=null;
     pwds[escape(newTitle.xor())]=escape(sPwd.xor());
     storePwds();
     showPwds();
    }
    function modifyPwd(e){
     var sTitle = e.previousSibling.innerText;
     var oldPwd = e.innerText
     var newPwd = prompt("Please enter new password",oldPwd);
     if (!newPwd) return;
     pwds[escape(sTitle.xor())]=escape(newPwd.xor());
     storePwds();
     showPwds();
    }

    function removePwd(k){
     pwds[k]=null;
     storePwds();
     showPwds();
    }
    function createPwd(){
     var charSet = "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789";
     var result = "";
     var st = MD5((new Date()-Math.random()).toString())+MD5((new Date()+Math.random()).toString());
     for (var i=0;i<st.length;i+=2)
      result += charSet.charAt(parseInt(st.substr(i,2),16)%charSet.length)
     clipboardData.setData('Text',result);
     alert("Generated password /""+result+"/" was copied into clipboard.");
    }

    function generateKeyByPwd(p){
     return unescape((MD5(p)+MD5(p+" ")+MD5(p+"+")+MD5(p+"-")).replace(/(....)/g,"%u$1"))
    }
    //-->
    </SCRIPT>
    </HEAD>
    <BODY>
     <div id=content></div>
     <br>
     <center>
      <button onclick="addPwd()" disabled>Add new<br>password item</button> &nbsp;
      <button onclick="changeAccessPwd()" disabled>Change access<br>password</button> &nbsp;
      <button onclick="changeAccessPwdRemander()" disabled>Change access<br>password remander</button> &nbsp;
      <button onclick="createPwd()" disabled>Create a new<br>random password</button> &nbsp;
     </center>
    </BODY>
    </HTML>
    <script src="passwordFile.js"></script>

  • 相关阅读:
    高阶函数与匿名函数
    A task in a suit and a tie:paraphrase generation with semantic augmentation解读
    利用tensorboard将数据可视化(tf1.x 和 tf2.x)
    IplImage, CvMat, Mat 的关系
    剑指OFFER之合并两个排序的链表
    整数与字符串的互相转化
    二分查找法
    集成算法
    003-决策树案例
    002-决策树构造实例
  • 原文地址:https://www.cnblogs.com/stonehuang/p/6603259.html
Copyright © 2011-2022 走看看