pl.java

playfair 加密算法的java实现

package playfire;

import java.util.prefs.*;

/**
 * <p>Title: </p>
 *
 * <p>Description: </p>
 *
 * <p>Copyright: Copyright (c) 2007</p>
 *
 * <p>Company: </p>
 *
 * @author not attributable
 * @version 1.0
 */
class PL {
    public PL() {
    }

    public static void main(String[] args) {
        /*
                 char[][] a={{2,23},{21,7}};
         String code="mwaloliaiwwtgbhjntakqzjkaadawsskqkuayarncsodniiaesoqkjyb";
         int in1=0,in2=0;
         int out1=0,out2=0;
         System.out.println(code.length());
         for(int i1=0;i1<code.length()-1;i1=i1+2){
           in1=code.charAt(i1)-97;
           in2=code.charAt(i1+1)-97;
           out1=(a[0][0]*in1+a[1][0]*in2)%26;
           out2=(a[0][1]*in1+a[1][1]*in2)%26;
           System.out.println("("+i1+"&"+(i1+1)+")\t   ["+(out1)+","+(out2)+"]\t["+(char)(out1+97)+","+(char)(out2+97)+"]");
                }
         */
        /*
                String code="kxjeyurebezwehewrytuheyfskrehegoyflwtttuolksycajpobotelzontxbybntgoneycuzwrgdsonsxbouywrhebaahyuseqd";
                System.out.println(code.length());
                char c1=' ',c2=' ';
                int i1=0,j1=0,i2=0,j2=0;
                int count=0;
                for(int i=0;i<code.length()-1;i=i+2){
           System.out.print((i+1)+" "+(i+2)+" ");
           Loop1: for(i1=0;i1<5;i1++){
                for(j1=0;j1<5;j1++){
                    //System.out.println(a[i1][j1]+" "+code.charAt(i));
                    //System.out.println(code.charAt(i)==a[i1][j1]);
                    if(code.charAt(i)==a[i1][j1]){break Loop1;}
                }
            }
            Loop2: for(i2=0;i2<5;i2++){
                for(j2=0;j2<5;j2++){
                    if(code.charAt(i+1)==a[i2][j2]){break Loop2;}
                }
            }
           //System.out.println(i1+" "+i2+" "+j1+" "+j2);
            if(i1!=i2&&j1!=j2){
                c1=a[i1][j2];
                c2=a[i2][j1];
            }
            else if(j1==j2){
                c1=a[(i1+5-1)%5][j1];
                c2=a[(i2+5-1)%5][j2];
            }
            else if(i1==i2){
                c1=a[i1][(j1+5-1)%5];
                c2=a[i2][(j2+5-1)%5];
            }
            count=count+2;
            System.out.print(c1+" "+c2+"\n");
                }
                System.out.print("\n"+count+" "+code.length());*/
        //Preferences prefsdemo = Preferences.userRoot().node(
        //        "/ADMIN_OF_DgSys/Community");
        /*try {
            prefsdemo.removeNode();
                 } catch (BackingStoreException e) {
            System.out.print("无原始密码");
                 }*/
        //prefsdemo.put("PW", "SB");

        Preferences prefsdemo1 =
                Preferences.userRoot().node("/ADMIN_OF_DgSys/Community");
        System.out.println(prefsdemo1.get("PW", " OK "));
        try {
            prefsdemo1.removeNode();
        } catch (BackingStoreException e) {
        }
        System.out.println(prefsdemo1.get("PW", " OK "));
    }
}