des.java

des算法的java实现

import java.io.*;
import String.*;
import java.util.*;
import java.math.*;
public class Des
{
	 public int[] t1=new int[65];
        public static int K[][]=new int[17][49];
	 public static int R0[]=new int[33];
	 public static int L0[]=new int[33];
        public static String m_MINGWEN,m_MIYAO,m_MEWEN, m_YUANWEN;    
        public   void des(char sh)throws IOException 
             {
                     int s1[][]={{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}};
                      int s2[][]={{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}};
	               int s3[][]={{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}};
	               int s4[][]={{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}};
	               int s5[][]={{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}};
	               int s6[][]={{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}};
	                int s7[][]={{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}};
	                int s8[][]={{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}};

                       int   L[][]=new int[17][33];
                       int R[][]=new int[17][33];
                       int E[]={32,1,2,3,4,5,
	                         4,5,6,7,8,9,
	                         8,9,10,11,12,13,
	                         12,13,14,15,16,17,
	                         16,17,18,19,20,21,
	                         20,21,22,23,24,25,
	                         24,25,26,27,28,29,
	                         28,29,30,31,32,31};
	                 int 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};    
	                  int RE1[]=new int[49];
	                  int i,j,k;
                         int ch;
                         int s11[]=new int[7]; 
                         int s21[]=new int[7]; 
                         int s31[]=new int[7];
                         int s41[]=new int[7];
                         int s51[]=new int[7];
                         int s61[]=new int[7];
                         int s71[]=new int[7];
                         int s81[]=new int[7]; 
            
                         int f[]=new int[33];
            
                         int t2[]=new int[65];
              
	         	    int s[]=new int[9];
                         int frk[]=new int[33];
                         int temp[]=new int[5];
	                  int IP_1[]={40,8,48,16,56,24,64,32,
	                              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};
                          int ip[]={58,50,42,34,26,18,10,2,
	                             60,52,44,36,28,20,12,4,
	                             62,54,46,38,30,22,14,6,
	                             64,56,48,40,32,24,16,8,
	                             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};
          
          //进行迭代
                        if(sh=='E')
                            for(i=0;i<=32;i++) {
                                    R[0][i]=R0[i];
                                    L[0][i]=L0[i];
                             }
                         else if(sh=='D')
                            { for( i=1;i<=64;i++)
            	                      t2[i]=t1[ip[i-1]];
                              for( i=1;i<33;i++)
                                 {
	                             R[0][i]=t2[i];
 	                             L[0][i]=t2[i+32];
                                 }
                             }
                       for(k=0;k<16;k++){
	                           for(i=1;i<=48;i++)//经过E变换扩充，由32位变为48位
	                                  RE1[i]=R[k][E[i-1]];
	                           for(i=1;i<=48;i++)//与Ki按位作不进位加法运算
                                         if(sh=='E')
                                              RE1[i]=RE1[i]+K[k+1][i];
                                         else if(sh=='D')
                                              RE1[i]=RE1[i]+K[16-k][i];
           	                     for(i=1;i<=48;i++) {
		                           if(RE1[i]==2)
                                              RE1[i]=0;
                                   }
	                            for(i=1;i<7;i++)//48位分组
                                         {
		                              s11[i]=RE1[i];
	                                     s21[i]=RE1[i+6];
		                              s31[i]=RE1[i+12];
		                              s41[i]=RE1[i+18];
		                              s51[i]=RE1[i+24];
		                              s61[i]=RE1[i+30];
		                              s71[i]=RE1[i+36];
		                              s81[i]=RE1[i+42];
	                             }//下面经过S盒，得到8个数
	                            s[1]=s1[s11[6]+s11[1]*2][s11[5]+s11[4]*2+s11[3]*4+s11[2]*8];
	                            s[2]=s2[s21[6]+s21[1]*2][s21[5]+s21[4]*2+s21[3]*4+s21[2]*8];
	                            s[3]=s3[s31[6]+s31[1]*2][s31[5]+s31[4]*2+s31[3]*4+s31[2]*8];
	                            s[4]=s4[s41[6]+s41[1]*2][s41[5]+s41[4]*2+s41[3]*4+s41[2]*8];
	                            s[5]=s5[s51[6]+s51[1]*2][s51[5]+s51[4]*2+s51[3]*4+s51[2]*8];
	                            s[6]=s6[s61[6]+s61[1]*2][s61[5]+s61[4]*2+s61[3]*4+s61[2]*8];
	                            s[7]=s7[s71[6]+s71[1]*2][s71[5]+s71[4]*2+s71[3]*4+s71[2]*8];
	                            s[8]=s8[s81[6]+s81[1]*2][s81[5]+s81[4]*2+s81[3]*4+s81[2]*8];
	                            for(i=0;i<8;i++)//8个数变换输出二进制
	                                  {
		                                for(j=1;j<5;j++){
		                                   temp[j]=s[i+1]%2;
		                                   s[i+1]=s[i+1]/2;
		                                }
		                                for(j=1;j<5;j++)
	                                            f[4*i+j]=temp[5-j];
	                                       }

	                                        for(i=1;i<33;i++)//经过P变换
	                                              frk[i]=f[P[i-1]];
	                                        for(i=1;i<33;i++)
                                                   L[k+1][i]=R[k][i];
                                 
	                                        for(i=1;i<33;i++){
		                                         R[k+1][i]=L[k][i]+frk[i];
		                                         if(R[k+1][i]==2)
                                                            R[k+1][i]=0;
                
                                               }
                                        }
                                  int t[]=new int[65];
                                  if(sh=='E')
            	                        for(i=1;i<=32;i++){ 
		                              t[i]=L[16][i];
		                              t[i+32]=R[16][i];
	                               }
                                   else if(sh=='D')
              
                                   for(i=1;i<=32;i++){
	                            	t[i]=R[16][i];
		                            t[i+32]=L[16][i];
	                             }


                                    for(i=1;i<=64;i++)
	        	                 t1[i]=t[IP_1[i-1]];
                                   if(sh=='E')
                                       {    

                                              m_MEWEN=" ";
	                                       for(i=1;i<=m_MINGWEN.length()*8;i++)
	                                          {
		                                        m_MEWEN=m_MEWEN+(char)(48+t1[i]);
		                                        if(i%8==0)