DES加密演示程序(JAVA版)

最近应用密码学讲到了DES,觉得很有趣,便试着用JAVA实现了一遍全部加密过程,其中涉及到大量的位运算,调试错误也花了不少时间。其间犯了几个错误:

错误一:在用byte存储8位信息并转换成int型时损失了符号位,导致整个加密失败,解决方法有,避免类型间的转化活着用int代替byte,long代替int;或者直接用数组(这种对于文件加密时,时间效率低的问题很明显)。

错误二:移位运算时弄混淆了算术移位和逻辑移位

错误三:数组赋值时,偷懒用了引用,结果原数组数值变换时导致调用引用数组值也跟着发生变化,带来了不可估量的错误。

图形界面加密演示器提供字符串和文件加密功能,并能显示输入密钥的16轮子密钥,对于8字节明文能输出16轮迭代的中间结果。

软件下载地址为:http://download.csdn.net/source/1193090

以下附上DES类的源码。

package DESDEMO;

/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
* S盒函数中有组装byte,4->8
*/

/**
*
* @author jewelknife
*/
public class DES {
/* 置换与S盒表定义 */
    private static byte IP[]={57,49,41,33,25,17,9,1,59,51,43,35,27,19,11,3,61,53,45,37,29,21,13,5,63,55,47,39,31,23,15,7,56,48,40,32,24,16,8,0,58,50,42,34,
                       26,18,10,2,60,52,44,36,28,20,12,4,62,54,46,38,30,22,14,6};   //初始置换IP
    private static byte UNIP[]={39,7,47,15,55,23,63,31,38,6,46,14,54,22,62,30,37,5,45,13,53,21,61,29,36,4,44,12,52,20,60,28,35,3,43,11,51,19,59,27,34,2,42,
                       10,50,18,58,26,33,1,41,9,49,17,57,25,32,0,40,8,48,16,56,24}; //逆初始置换IP
    private static byte[] E={31,0,1,2,3,4,3,4,5,6,7,8,7,8,9,10,11,12,11,12,13,14,15,16,15,16,17,18,19,20,19,20,21,22,23,24,23,24,25,26,27,28,27,28,29,30,31,0};   //扩展变换E
    private static byte[][][] S={
      {{14,4,13,1,2,15,11,8,3,10,6,12,5,9,0,7},{0,15,7,4,14,2,13,1,10,6,12,11,9,5,3,8},{4,1,14,8,13,6,2,11,15,12,9,7,3,10,5,0},{15,12,8,2,4,9,1,7,5,11,3,14,10,0,6,13}},
      {{15,1,8,14,6,11,3,4,9,7,2,13,12,0,5,10},{3,13,4,7,15,2,8,14,12,0,1,10,6,9,11,5},{0,14,7,11,10,4,13,1,5,8,12,6,9,3,2,15},{13,8,10,1,3,15,4,2,11,6,7,12,0,5,14,9}},
      {{10,0,9,14,6,3,15,5,1,13,12,7,11,4,2,8},{13,7,0,9,3,4,6,10,2,8,5,14,12,11,15,1},{13,6,4,9,8,15,3,0,11,1,2,12,5,10,14,7},{1,10,13,0,6,9,8,7,4,15,14,3,11,5,2,12}},
      {{7,13,14,3,0,6,9,10,1,2,8,5,11,12,4,15},{13,8,11,5,6,15,0,3,4,7,2,12,1,10,14,9},{10,6,9,0,12,11,7,13,15,1,3,14,5,2,8,4},{3,15,0,6,10,1,13,8,9,4,5,11,12,7,2,14}},
      {{2,12,4,1,7,10,11,6,8,5,3,15,13,0,14,9},{14,11,2,12,4,7,13,1,5,0,15,10,3,9,8,6},{4,2,1,11,10,13,7,8,15,9,12,5,6,3,0,14},{11,8,12,7,1,14,2,13,6,15,0,9,10,4,5,3}},
      {{12,1,10,15,9,2,6,8,0,13,3,4,14,7,5,11},{10,15,4,2,7,12,9,5,6,1,13,14,0,11,3,8},{9,14,15,5,2,8,12,3,7,0,4,10,1,13,11,6},{4,3,2,12,9,5,15,10,11,14,1,7,6,0,8,13}},
      {{4,11,2,14,15,0,8,13,3,12,9,7,5,10,6,1},{13,0,11,7,4,9,1,10,14,3,5,12,2,15,8,6},{1,4,11,13,12,3,7,14,10,15,6,8,0,5,9,2},{6,11,13,8,1,4,10,7,9,5,0,15,14,2,3,12}},
      {{13,2,8,4,6,15,11,1,10,9,3,14,5,0,12,7},{1,15,13,8,10,3,7,4,12,5,6,11,0,14,9,2},{7,11,4,1,9,12,14,2,0,6,10,13,15,3,5,8},{2,1,14,7,4,10,8,13,15,12,9,0,3,5,6,11}}
        };   //S盒
    private static byte[] P={16,7,20,21,29,12,28,17,1,15,23,26,5,18,31,10,2,8,24,14,32,27,3,9,19,13,30,6,22,11,4,25};   //置换运算P,16轮迭代中的
    /* 生成子密钥,置换选择2 */
    private static byte[] P2={14,17,11,24,1,5,3,28,15,6,21,10,23,19,12,4,26,8,16,7,27,20,13,2,41,52,31,37,47,55,30,40,51,45,33,48,44,49,39,56,34,53,46,42,50,36,29,32};
    private static char[] changeto16={'0','1','2','3','4','5','6','7','8','9','a','b','c','d','e','f'};
/* 固定表定义完毕 */
    private String text;      //存放明文
    private String keytext;   //存放密钥
    private String codetext; //存放密文
    private String decodetext;
    private byte[] tb;        //存放字节明文
    private byte[] ecodebyte; //存放字节密文
    private byte[] fz;         //存放临时64位待加密明文
    private byte[] text2ip;    //明文初始置换IP后
    private byte[] ip2text;    //逆初始置换ip后
    private byte[][] cjleft;     //乘积变换中L
    private byte[][] cjright;    //乘积变换中R
    private byte[][] key;     //存放16个子密钥
    private boolean isEncoding; //加密还是解密的标志
    public DES() {
        init();
    }
    private void init() {
        text="00000000";
        keytext=null;
        codetext=null;
        decodetext=null;
        fz=new byte[8];
        text2ip=new byte[8];
        ip2text=new byte[8];
        cjleft=new byte[18][4];
        cjright=new byte[18][4];
        key=new byte[16][6];
        isEncoding=true;
    }
    public void Encoding(){
        tb=string2byte(text);
        ecodebyte=new byte[tb.length];
        isEncoding=true;
        codetext="";
        MakeKey();
        for(int i=0;i<tb.length;i+=8)
       {
           ChangeIP(i);
           ProductTransform();
          ChangeBackIP(i);
       }
        codetext=byte2hex(ecodebyte);
    }
   
    public void Deconding()
    {
//       for(int i=0;i<ecodebyte.length;i++) tb[i]=ecodebyte[i];        //通过密文字节数组解密明文
       
        tb=hex2byte(codetext);
        ecodebyte=new byte[tb.length];
        isEncoding=false;
        MakeKey();
        for(int i=0;i<tb.length;i+=8)
        {
            ChangeIP(i);
            ProductTransform();
            ChangeBackIP(i);
        }
            decodetext = new String(ecodebyte);
    }

    public void MakeKey()
    {
        byte[] kb=keytext.getBytes();
        int c[]={0,0};
        int movetime;          //偏移次数
        int[][] p={{56,48,40,32,24,16,8,0,57,49,41,33,25,17,9,1,58,50,42,34,26,18,10,2,59,51,43,35},
                   {62,54,46,38,30,22,14,6,61,53,45,37,29,21,13,5,60,52,44,36,28,20,12,4,27,19,11,3}
                  };

        for(int i=0;i<28;i++)                  //置换分成 c 和 d 两部分
        {
            int k=p[0][i];
            if( (kb[k/8]>>(7-k%8)&1)==1 ) c[0] |= 1<<(27-i) ;
            k=p[1][i];
            if( (kb[k/8]>>(7-k%8)&1)==1 ) c[1] |= 1<<(27-i) ;
        }

        for(int i=0;i<16;i++)
        {
            if(i==0 || i==1 || i== 8 || i==15) movetime=1;
            else movetime=2;
            c[0] <<=movetime;
            c[1] <<=movetime;
            if( (c[0]>>28&1)==1 ) c[0] |= 1 ;
            if( (c[1]>>28&1)==1 ) c[1] |= 1 ;
            if(movetime==2)
            {
                if( (c[0]>>29&1)==1 ) c[0] |= 2 ;
                if( (c[1]>>29&1)==1 ) c[1] |= 2 ;
            }

            for(int j=0;j<6;j++) key[i][j]=0;
            for(int j=0;j<48;j++)                         //置换产生子密钥
            {
                if( (c[(P2[j]-1)/28]>>(27-(P2[j]-1)%28)&1)==1 ) key[i][j/8]=(byte)(1<<(7-j%8) | key[i][j/8] ) ;
            }
        }
    }

    public void ChangeIP(int start)
    {
        for(int i=0;i<8;i++)
        {
            fz[i]=0;
            for(int j=0;j<8;j++)
            {
                int k=IP[i*8+j];
                if( (tb[start+k/8]>>(7-k%8)&1)==1 ) fz[i] |= 1<<(7-j);
            }
            text2ip[i]=fz[i];         //存放初始置换IP后的结果
        }
    }

    public void ProductTransform()        //16次迭代,乘积变换
    {
        byte left[]=new byte[4];
        byte right[]=new byte[4];
        byte lastR[]=new byte[4];
        byte ans[]=new byte[4];
        for(int i=0;i<4;i++)
        {
            left[i]=cjleft[0][i]=fz[i];
            right[i]=cjright[0][i]=fz[i+4];
        }

        if(isEncoding==true)           //加密时执行
        {
            for(int i=0;i<16;i++)
            {
                for(int j=0;j<4;j++) lastR[j]=right[j];
                ans=f(right,i);
                for(int j=0;j<4;j++) cjright[i+1][j]=right[j]=(byte)(left[j]^ans[j]);
                for(int j=0;j<4;j++) cjleft[i+1][j]=left[j]=lastR[j];
            }
            //最后一步交换 L 和 R 的位置
            for(int j=0;j<4;j++) lastR[j]=right[j];
            for(int j=0;j<4;j++) cjright[17][j]=right[j]=left[j];
            for(int j=0;j<4;j++) cjleft[17][j]=left[j]=lastR[j];
        }
        else                       //解密时执行
        {
            for(int j=0;j<4;j++) lastR[j]=right[j];
            for(int j=0;j<4;j++) right[j]=left[j];
            for(int j=0;j<4;j++) left[j]=lastR[j];
            for(int i=15;i>=0;i--)
            {
                for(int j=0;j<4;j++) lastR[j]=right[j];
                for(int j=0;j<4;j++) right[j]=left[j];
                ans=f(left,i);
                for(int j=0;j<4;j++) left[j]=(byte)(lastR[j]^ans[j]);
            }
        }
        for(int i=0;i<4;i++)                //将16轮迭代后的结果用8个的字节数组存储
        {
            fz[i]=left[i];
            fz[i+4]=right[i];
        }
    }

    private byte[] f(byte a[],int index)    //迭代F函数
    {
        byte[]b=new byte[6];
        byte[]ans=new byte[4];

/* 将4字节数组扩展写入6个字节数组 */
        for(int i=0;i<6;i++)
        {
            b[i]=0;
            for(int j=0;j<8;j++)
            {
                int k=E[i*8+j];
                if( (a[k/8]>>(7-k%8)&1)==1 ) b[i]= (byte)( 1<<(7-j) | b[i] );
            }
        }
/* 32->48 扩展完成 */

        for(int i=0;i<6;i++)          //与子密钥异或
        {
            b[i]^=key[index][i];
        }

       ans=CompressAndChangeP(b);        //压缩s盒 和 置换运算P

        return ans;
    }

    private byte[] CompressAndChangeP(byte b[])   //压缩和P置换,F函数中压缩后置换
    {
        byte a[]=new byte[8];
        byte ans[]=new byte[4];
        for(int i=0;i<4;i++) ans[i]=0;
        byte c[]=new byte[48];
        for(int i=0,k=0;i<6;i++)
        {
            for(int j=0;j<8;j++)
            {
                if( (b[i]>>(7-j)&1)==1 ) c[k++]=1;
                else c[k++]=0;
            }
        }
        for(int i=0;i<48;i+=6)
        {
            byte row=(byte)( (c[i]<<1)+c[i+5]);
            byte col=(byte)( (c[i+1]<<3) + (c[i+2]<<2) + (c[i+3]<<1) + c[i+4]);
            a[i/6]=S[i/6][row][col];           //每2个4位数转化为1个8位
        }
        for(int i=0;i<8;i+=2)
        {
            ans[i/2]=(byte)((a[i]<<4)+ans[i/2]+a[i+1]);
        }
        return ans;
    }

    public void ChangeBackIP(int start)
    {
        for(int i=0;i<8;i++)
        {
            ecodebyte[start+i]=0;
            for(int j=0;j<8;j++)
            {
                int k=UNIP[i*8+j];
                if( (fz[k/8]>>(7-k%8)&1)==1 ) ecodebyte[start+i] = (byte)( 1<<(7-j) | ecodebyte[start+i] );
            }
            ip2text[i]=ecodebyte[start+i];
        }
    }

    public void setText(String text) {
        this.text=text;
    }
    public void setKeytext(String keytext) {
        this.keytext=keytext;
    }
    public void setCodetext(String codetext){
        this.codetext=codetext;
    }
    public String getCodetext() {
        return codetext;
    }
    public String getDecodetext(){
        return decodetext;
    }
    public String[] getKeystring(){
        String ans[]=new String[16];
        for(int i=0;i<16;i++)
        {
            ans[i]="    "+byte2hex(key[i]);
        }
        return ans;
    }
    public String getText2Ip(){
        return byte2hex(text2ip);
    }
    public String getIP2text(){
        return byte2hex(ip2text);
    }
    public String[] getCjLeft(){
        String ans[]=new String[18];
        for(int i=0;i<18;i++) ans[i]=byte2hex(cjleft[i]);
        return ans;
    }
    public String[] getCjRight(){
        String ans[]=new String[18];
        for(int i=0;i<18;i++) ans[i]=byte2hex(cjright[i]);
        return ans;
    }
    private String byte2hex(byte[]a){
        String s="";
        for(int i=0;i<a.length;i++)
       {
           int k=0;
           for(int j=0;j<4;j++) k+=(a[i]>>(7-j)&1)<<(3-j);
           s+=changeto16[k];
           s+=changeto16[a[i]&15];
       }
        return s;
    }
    private byte[] hex2byte(String s){
        int len=s.length()/2;
        byte[]a;
        if(len%8==0) a=new byte[len];
        else
        {
            int k=8-len%8;
            a=new byte[len+k];
            for(int i=0;i<k;i++) a[len+i]=0;
        }
        for(int i=0;i<len*2;i+=2)
        {
            char c=s.charAt(i);
            if(c>='0'&&c<='9') a[i/2]=(byte)((c-'0')<<4);
            else a[i/2]=(byte)((c-'a'+10)<<4);
            c=s.charAt(i+1);
            if(c>='0'&&c<='9') a[i/2]+=(byte)(c-'0');
            else a[i/2]+=(byte)(c-'a'+10);
        }
        return a;
    }
    private byte[] string2byte(String s){
        byte[]a=s.getBytes();
        byte[]b;
        int bytelen=a.length;
        if(bytelen%8!=0)
        {
            int k=8-bytelen%8;
            b=new byte[bytelen+k];
            for(int i=0;i<bytelen;i++) b[i]=a[i];
            for(int i=0;i<k;i++) b[bytelen+i]=0;
        }
        else
        {
            b=new byte[bytelen];
            for(int i=0;i<bytelen;i++) b[i]=a[i];
        }
        return b;
    }
}

  • 0
    点赞
  • 3
    收藏
    觉得还不错? 一键收藏
  • 1
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论 1
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值