1 // 根据网上一位也应用到JSP项目里的密码加密方法
 2 public class PwdTranslator {
 3     private String pwd;
 4     PwdTranslator(String passwd)
 5     {
 6         pwd = passwd;
 7     }
 8     // @原始密码 pwd
 9     public String PwdToSecret()
10     {
11         char[] c_pwdArr = new char[20];            // 偏移后的密码
12         c_pwdArr = pwd.toCharArray();
13
14         int[] nc_pwdArr = new int[20];
15         int len = pwd.length();
16         for (int i=0; i<len; i++)
17             nc_pwdArr[i] = transform(c_pwdArr[i]);     // 获得密文钥匙
18
19         String cryp;        // 存放密文
20         cryp = TransformFunc(nc_pwdArr, len);
21         return cryp;
22     }
23     // 加偏移量
24     private static int transform(char c_ori) {
25         if (c_ori>='0' && c_ori<='9')
26             return c_ori+1;
27         else if (c_ori>='a' && c_ori<='z')
28             return c_ori+2;
29         else if (c_ori>='A' && c_ori<='Z')
30             return c_ori+3;
31         return c_ori;
32     }
33     public String TransformFunc(int[] n, int len)
34     {
35         String end_pwd = "";
36         int numc=0;             //数组ch[]中元素的实际最大元素个数
37         int modnumber=0;
38         char[] ch=new char[len*3];
39         for (int pos=0; pos<len; pos++){    // 处理的第pos个位置
40             for (int i=0; i<len; i++)
41                 modnumber += n[(len-(pos-i))%len];
42             int rightn=0;
43             if(modnumber%2 == 0)
44             {
45                 rightn=modnumber+(n[pos]>>>4);
46                 ch[numc++]=(char)(rightn%25+97);
47                 rightn=rightn/10;
48                 ch[numc++]=(char)(rightn%25+97);
49                 ch[numc++]=(char)(modnumber%25+97);
50             }
51             else{
52                 rightn=modnumber+(n[pos]>>>4);
53                 ch[numc++]=(char)(rightn%9+48);
54                 rightn=rightn/10;
55                 ch[numc++]=(char)(rightn%9+48);
56                 ch[numc++]=(char)(modnumber%9+48);
57             }
58         }
59         for(int pos=0; pos<numc; pos++){
60             end_pwd=end_pwd+ch[pos];
61         }
62
63         return end_pwd;
64     }
65 }