class des
{
int key[]=new int[]{
0,0,0,1,0,0,1,1,
0,0,1,1,0,1,0,0,
0,1,0,1,0,1,1,1,
0,1,1,1,1,0,0,1,
1,0,0,1,1,0,1,1,
1,0,1,1,1,1,0,0,
1,1,0,1,1,1,1,1,
1,1,1,1,0,0,0,1
};
int keyi[][]=new int[16][48],
total[]=new int[64],
left[]=new int[32],
right[]=new int[32],
ck[]=new int[28],
dk[]=new int[28],
expansion[]=new int[48],
z[]=new int[48],
xor1[]=new int[48],
sub[]=new int[32],
p[]=new int[32],
xor2[]=new int[32],
temp[]=new int[64],
pc1[]=new int[56],
ip[]=new int[64],
inv[][]=new int[8][8];
//---------------------------------------------------------------------------------
des(){}//Default Constructor
//---------------------------------------------------------------------------------
void IP()
{
int k=58,i;
for(i=0;i<32;i++)
{
ip[i]=total[k-1];
if(k-8>0)
k=k-8;
else
k=k+58;
}
k=57;
for( i=32;i<64;i++)
{
ip[i]=total[k-1];
if(k-8>0)
k=k-8;
else
k=k+58;
}
}
//---------------------------------------------------------------------------------
void PermChoice1()
{
int k=57,i;
for(i=0;i<28;i++)
{
pc1[i]=key[k-1];
if(k-8>0)
k=k-8;
else
k=k+57;
}
k=63;
for( i=28;i<52;i++)
{
pc1[i]=key[k-1];
if(k-8>0)
k=k-8;
else
k=k+55;
}
k=28;
for(i=52;i<56;i++)
{
pc1[i]=key[k-1];
k=k-8;
}
}
//---------------------------------------------------------------------------------
void Expansion()
{
int exp[][]=new int[8][6],i,j,k=0; //8,6
for( i=0;i<8;i++)
{
for( j=0;j<6;j++)
{
if((j!=0)||(j!=5))
{
k=4*i+j;
if(k!=0 && k<32) exp[i][j]=right[k-1];
}
if(j==0)
{
k=4*i;
if(k!=0 && k<32) exp[i][j]=right[k-1];
}
if(j==5)
{
k=4*i+j;
if(k!=0 && k<32) exp[i][j]=right[k-1];
}
}
}
exp[0][0]=right[31];
exp[7][5]=right[0];
k=0;
for(i=0;i<8;i++)
for(j=0;j<6;j++)
expansion[k++]=exp[i][j];
}
//---------------------------------------------------------------------------------
void PermChoice2()
{
int per[]=new int[56],i;
for(i=0;i<28;i++)
per[i]=ck[i];
int k=0;
for(i=28;i<56;i++)
per[i]=dk[k++];
z[0]=per[13];z[1]=per[16];z[2]=per[10];z[3]=per[23];z[4]=per[0];z[5]=per[4];z[6]=per[2];z[7]=per[27];
z[8]=per[14];z[9]=per[5];z[10]=per[20];z[11]=per[9];z[12]=per[22];z[13]=per[18];z[14]=per[11];z[15]=per[3];
z[16]=per[25];z[17]=per[7];z[18]=per[15];z[19]=per[6];z[20]=per[26];z[21]=per[19];z[22]=per[12];z[23]=per[1];
z[24]=per[40];z[25]=per[51];z[26]=per[30];z[27]=per[36];z[28]=per[46];z[29]=per[54];z[30]=per[29];z[31]=per[39];
z[32]=per[50];z[33]=per[46];z[34]=per[32];z[35]=per[47];z[36]=per[43];z[37]=per[48];z[38]=per[38];z[39]=per[55];
z[40]=per[33];z[41]=per[52];z[42]=per[45];z[43]=per[41];z[44]=per[49];z[45]=per[35];z[46]=per[28];z[47]=per[31];
}
//---------------------------------------------------------------------------------
void xor_oneE(int round) //for Encrypt
{
int i;
for(i=0;i<48;i++)
xor1[i]=expansion[i]^keyi[round-1][i];
}
//---------------------------------------------------------------------------------
void xor_oneD(int round) //for Decrypt
{
int i;
for(i=0;i<48;i++)
xor1[i]=expansion[i]^keyi[16-round][i];
}
//---------------------------------------------------------------------------------
void substitution()
{
int s1[][]=new int[][]{
{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[][]=new int[][]{
{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[][]=new int[][]{
{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[][]=new int[][]{
{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[][]=new int[][]{
{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[][]=new int[][]{
{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[][]=new int[][]{
{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[][]=new int[][]{
{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 a[][]=new int[8][6];int k=0,i,j;
for(i=0;i<8;i++)
{
for(j=0;j<6;j++)
{
a[i][j]=xor1[k++];
}
}
int p,q,count=0,g=0,i1;
for( i=0;i<8;i++)
{
p=1;q=0;
k=(a[i][0]*2)+(a[i][5]*1);
j=4;
while(j>0)
{
q=q+(a[i][j]*p);
p=p*2;
j--;
}
count=i+1;int v=0;
switch(count)
{
case 1: v=s1[k][q]; break;
case 2: v=s2[k][q]; break;
case 3: v=s3[k][q]; break;
case 4: v=s4[k][q]; break;
case 5: v=s5[k][q]; break;
case 6: v=s6[k][q]; break;
case 7: v=s7[k][q]; break;
case 8: v=s8[k][q]; break;
}
int d,a1[]=new int[4];
i1=3;
while(v>0)
{
d=v%2;
a1[i1--]=d;
v=v/2;
}
while(i1>=0)
{
a1[i1--]=0;
}
for(i1=0;i1<4;i1++)
sub[g++]=a1[i1];
}
}
//---------------------------------------------------------------------------------
void permutation()
{
p[0]=sub[15];p[1]=sub[6];p[2]=sub[19];p[3]=sub[20];p[4]=sub[28];p[5]=sub[11];p[6]=sub[27];p[7]=sub[16];
p[8]=sub[0];p[9]=sub[14];p[10]=sub[22];p[11]=sub[25];p[12]=sub[4];p[13]=sub[17];p[14]=sub[30];p[15]=sub[9];
p[16]=sub[1];p[17]=sub[7];p[18]=sub[23];p[19]=sub[13];p[20]=sub[31];p[21]=sub[26];p[22]=sub[2];p[23]=sub[8];
p[24]=sub[18];p[25]=sub[12];p[26]=sub[29];p[27]=sub[5];p[28]=sub[21];p[29]=sub[10];p[30]=sub[3];p[31]=sub[24];
}
//---------------------------------------------------------------------------------
void xor_two()
{
int i;
for(i=0;i<32;i++)
{
xor2[i]=left[i]^p[i];
}
}
//---------------------------------------------------------------------------------
void swap32bit()
{
int i;
for(i=0;i<32;i++)
temp[i]=right[i];
for(i=32;i<64;i++)
temp[i]=left[i-32];
}
//---------------------------------------------------------------------------------
void inverse()
{
int p=40,q=8,k1,k2,i,j;
for(i=0;i<8;i++)
{
k1=p;k2=q;
for(j=0;j<8;j++)
{
if(j%2==0)
{
inv[i][j]=temp[k1-1];
k1=k1+8;
}
else if(j%2==1)
{
inv[i][j]=temp[k2-1];
k2=k2+8;
}
}
p=p-1;q=q-1;
}
}
//---------------------------------------------------------------------------------
void keygen()
{
PermChoice1();
int i,j,k=0;
for(i=0;i<28;i++)
{
ck[i]=pc1[i];
}
for(i=28;i<56;i++)
{
dk[k]=pc1[i];
k++;
}
int noshift=0,round;
for(round=1;round<=16;round++)
{
if(round==1||round==2||round==9||round==16)
noshift=1;
else
noshift=2;
while(noshift>0)
{
int t;
t=ck[0];
for(i=0;i<27;i++)
ck[i]=ck[i+1];
ck[27]=t;
t=dk[0];
for(i=0;i<27;i++)
dk[i]=dk[i+1];
dk[27]=t;
noshift--;
}
PermChoice2();
for(i=
