一些基础密码算法的实现

把以前写过的几个小算法稍整理下子。

1.多表替代密码：

#include<iostream> 
#include<cstdlib>
#include<cstdio>
#include<string>
using namespace std;

int gcd(int a,int b);          //求最大公约数；
void jiam(string words,int* A);//加密；
void jiem(string words,int* A);//解密。
int main()
{
    int A[9],i,tmp;
    string words;
    bool r;
    cout<<"请随意输入一个整数，来改变随机种子：";
    cin>>i;
    srand(i);
    getchar();
    cout<<"系统随机生成一个三阶矩阵："<<endl;
    t:
    for(i=0;i<9;i++)
    {
        A[i]=rand()%26;
    }
    tmp=A[0]*(A[4]*A[8]-A[5]*A[7])-A[1]*(A[3]*A[8]-A[5]*A[6])+A[2]*(A[3]*A[7]-A[4]*A[6]);
    if(gcd(tmp,26)!=1)
    goto t;
    for(i=0;i<9;i++)
    {
        if(i==2||i==5||i==8)
        cout<<A[i]<<";"<<endl;
        else
        cout<<A[i]<<"   ";
    }
    cout<<endl;
    cout<<"请输入明文或密文（大写）：";
    getline(cin,words);
    cout<<"加密（0）？解密（1）？请输入 0 or 1：";
    cin>>r;
    if(r==0)
    jiam(words,A);
    else
    jiem(words,A);
    return 0;
}
void jiam(string words,int* A)
{
    int i;
    for(i=0;i<words.length();i+=3)
    {
        cout<<char((A[0]*(int(words[i])-65)+A[1]*(int(words[i+1])-65)+A[2]*(int(words[i+2])-65))%26+65);
        cout<<char((A[3]*(int(words[i])-65)+A[4]*(int(words[i+1])-65)+A[5]*(int(words[i+2])-65))%26+65);
        cout<<char((A[6]*(int(words[i])-65)+A[7]*(int(words[i+1])-65)+A[8]*(int(words[i+2])-65))%26+65);
    }
    cout<<endl;
}
void jiem(string words,int* A)
{
    int i,x,y,z;
    for(i=0;i<words.length();i+=3)
    {
        for(x=0;x<26;x++)
        for(y=0;y<26;y++)
        for(z=0;z<26;z++)
        {
            if(char((A[0]*x+A[1]*y+A[2]*z)%26+65)==words[i]&&char((A[3]*x+A[4]*y+A[5]*z)%26+65)==words[i+1]&&char((A[6]*x+A[7]*y+A[8]*z)%26+65)==words[i+2])
            goto xx;
        }
        xx:
        cout<<char(x+65)<<char(y+65)<<char(z+65);
    }
    cout<<endl;
}
int gcd(int a,int b)
{
    if(b==0)
       return a;
    else
       return gcd(b,a%b);
}

2.多表替代密码（改进）：

#include<iostream>   
#include<cstdlib>
#include<cstdio>
#include<string>
using namespace std;

int gcd(int a,int b);// 求最大公约数；
void jiami(string words,int* A,int& b0,int& b1,int& b2);//加密；
void jiemi(string words,int* A,int& b0,int& b1,int& b2);//解密;
void nijz(int* A);//求逆元矩阵；
int niyuan(long m,long n);//求逆元；
int main()
{
    int A[9],i,tmp,b0,b1,b2;
    string words;
    bool r;
    cout<<"请随意输入一个整数，来改变随机种子：";
    cin>>i;
    srand(i);
    getchar();
    cout<<"系统随机生成一个三阶矩阵："<<endl;
    t:
    for(i=0;i<9;i++)
    {
        A[i]=rand()%26;
    }
    tmp=A[0]*(A[4]*A[8]-A[5]*A[7])-A[1]*(A[3]*A[8]-A[5]*A[6])+A[2]*(A[3]*A[7]-A[4]*A[6]);
    if(gcd(tmp,26)!=1)
    goto t;
    for(i=0;i<9;i++)
    {
        if(i==2||i==5||i==8)
        cout<<A[i]<<";"<<endl;
        else
        cout<<A[i]<<"   ";
    }
    cout<<"请输入明文或密文（大写,而且字数是3的倍数哦）：";
    getline(cin,words);
    cout<<"加密（0）？解密（1）？请输入 0 or 1：";
    cin>>r;
    cout<<"请输入密钥B矩阵（三阶）：";
    cin>>b0>>b1>>b2;
    if(r==1)
    {
        nijz(A);
        jiemi(words,A,b0,b1,b2);
    }
    else
    {
        jiami(words,A,b0,b1,b2);
    }
    cout<<endl;
    return 0;
}
void jiami(string words,int* A,int& b0,int& b1,int& b2)
{
    int i,t;
    cout<<"密文是：";
    for(i=0;i<words.length();i+=3)
    {
        t=A[0]*(int(words[i])-65)+A[1]*(int(words[i+1])-65)+A[2]*(int(words[i+2])-65);
        while(t<0)
        {
            t+=26;
        }
        cout<<char((t%26+b0%26)%26+65);
        t=A[3]*(int(words[i])-65)+A[4]*(int(words[i+1])-65)+A[5]*(int(words[i+2])-65);
        while(t<0)
        {
            t+=26;
        }
        cout<<char((t%26+b1%26)%26+65);
        t=A[6]*(int(words[i])-65)+A[7]*(int(words[i+1])-65)+A[8]*(int(words[i+2])-65);
        while(t<0)
        {
            t+=26;
        }
        cout<<char((t%26+b2%26)%26+65);
    }
}
void jiemi(string words,int* A,int& b0,int& b1,int& b2)
{
    int i,t;
    cout<<"明文是：";
    for(i=0;i<words.length();i+=3)
    {
        t=A[0]*(int(words[i])-65-b0)+A[1]*(int(words[i+1])-65-b1)+A[2]*(int(words[i+2])-65-b2);
        while(t<0)
        {
            t+=26;
        }
        cout<<char(t%26+65);
        t=A[3]*(int(words[i])-65-b0)+A[4]*(int(words[i+1])-65-b1)+A[5]*(int(words[i+2])-65-b2);
        while(t<0)
        {
            t+=26;
        }
        cout<<char(t%26+65);
        t=A[6]*(int(words[i])-65-b0)+A[7]*(int(words[i+1])-65-b1)+A[8]*(int(words[i+2])-65-b2);
        while(t<0)
        {
            t+=26;
        }
        cout<<char(t%26+65);
    }
}
int gcd(int a,int b)
{
    if(b==0)
       return a;
    else
       return gcd(b,a%b);
}
void nijz(int* A)
{
    int i,j,k,t;
    long s0[6],s[3][6];
    long r1,r2,r3;
    for(i=0;i<3;i++)
    {
        s[0][i]=A[i];
    }
    for(i=0;i<3;i++)
    {
        s[1][i]=A[i+3];
    }
    for(i=0;i<3;i++)
    {
        s[2][i]=A[i+6];
    }
    s[0][3]=1;
    s[0][4]=0;
    s[0][5]=0;
    s[1][3]=0;
    s[1][4]=1;
    s[1][5]=0;
    s[2][3]=0;
    s[2][4]=0;
    s[2][5]=1;
    i=0;
    while(i<3)
    {
        j=0;
        while(j<3)
        {
            if(j==i)
            {
                goto g;
            }
            for(t=0;t<6;t++)
            {
                s0[t]=s[i][t];
            }
            for(k=0;k<6;k++)
            {
                s0[k]*=s[j][i];
            }
            for(k=0;k<6;k++)
            {
                s[j][k]*=s[i][i];
            }
            for(k=0;k<6;k++)
            {
                s[j][k]-=s0[k];
            }
            g:
            j++;
        }
        i++;
    }
    for(i=0;i<3;i++)
    {
        while(s[i][i]%2==0)
        {
            s[i][i]/=2;
            s[i][3]/=2;
            s[i][4]/=2;
            s[i][5]/=2;
        }
    }
    for(i=0;i<3;i++)
    {
        while(s[i][i]%13==0)
        {
            s[i][i]/=13;
            s[i][3]/=13;
            s[i][4]/=13;
            s[i][5]/=13;
        }
    }
    r1=niyuan(26,s[0][0]);
    r2=niyuan(26,s[1][1]);
    r3=niyuan(26,s[2][2]);
    for(i=0;i<3;i++)
    {
        A[i]=(s[0][i+3]*r1);
        while(A[i]<0)
           A[i]+=26;
        A[i]%=26;
    }
    for(i=0;i<3;i++)
    {
        A[i+3]=(s[1][i+3]*r2);
        while(A[i+3]<0)
           A[i+3]+=26;
        A[i+3]%=26;
    }
    for(i=0;i<3;i++)
    {
        A[i+6]=(s[2][i+3]*r3);A[i+6]%=26;
        while(A[i+6]<0)
           A[i+6]+=26;
        A[i+6]%=26;
    }
}
int niyuan(long m,long n)
{
    int a,b,c,d,t,yu,shang,mod;
    a=m;
    b=n;
    mod=a;
    c=0;
    d=1;
    while(b<0)
    {
        b+=a;
    }
    if(b==1)
        return 1;
    while(b!=1)
    {
        t=a%b;
        shang=a/b;
        a=b;
        b=t;
        yu=c-shang*d;
        c=d;
        d=yu;
    }
    if(yu<0)
       yu+=mod;
    return yu;
}

3.放射密码以及频率分析：

#include<iostream>     //j=k0+ik1(mod n)
#include<string>
using namespace std;

const int n=26;
struct f
{
    char x;
    float y;
    float z;
};
void jiami(string words,const int& k0,const int& k1);//加密；
void jiemi(string words,const int& k0,const int& k1);//解密;
int niyuan(long m,long n);//求逆元；
int gcd(int a,int b);//求最大公约数；
int main()
{
    string words;
    char r;
    int i,j;
    struct f pinlv[26];
    for(i=0;i<26;i++)
    {
        pinlv[i].x='A'+i;
    }
    pinlv[0].y=0.0856;
    pinlv[1].y=0.0139;
    pinlv[2].y=0.0297;
    pinlv[3].y=0.0678;
    pinlv[4].y=0.1304;
    pinlv[5].y=0.0289;
    pinlv[6].y=0.0199;
    pinlv[7].y=0.0528;
    pinlv[8].y=0.0627;
    pinlv[9].y=0.0013;
    pinlv[10].y=0.0042;
    pinlv[11].y=0.0339;
    pinlv[12].y=0.0249;
    pinlv[13].y=0.0707;
    pinlv[14].y=0.0797;
    pinlv[15].y=0.0199;
    pinlv[16].y=0.0012;
    pinlv[17].y=0.0677;
    pinlv[18].y=0.0607;
    pinlv[19].y=0.1045;
    pinlv[20].y=0.0249;
    pinlv[21].y=0.0092;
    pinlv[22].y=0.0149;
    pinlv[23].y=0.0017;
    pinlv[24].y=0.0199;
    pinlv[25].y=0.0008;
    int k0,k1;
    cout<<"请输入明文或密文（大写）：";
    getline(cin,words);
    cout<<"加密（0）？解密（1）？请输入 0 or 1：";
    cin>>r;
    t:
    cout<<"请输入两个密钥：k0 k1(k1与26互素):";
    cin>>k0>>k1;
    if(gcd(k1,26)!=1)
    {
        cout<<"请注意要求！"<<endl;
        goto t;
    }
    switch(r)
    {
        case '0':
        jiami(words,k0,k1);
        break;
        case '1':
        jiemi(words,k0,k1);
    }
    for(i=0;i<26;i++)
    {
        j=(int('A'+i)*k1+k0)%n;
        pinlv[j].z=pinlv[i].y;
    }
    for(i=0;i<26;i++)
    {
        cout<<pinlv[i].x<<"的频率为"<<pinlv[i].z<<"    ";
    }
    return 0;
}
void jiami(string words,const int& k0,const int& k1)
{
    cout<<"密文为：";
    int i;
    char t;
    for(i=0;i<words.length();i++)
    {
        t=char(((words[i]*k1)%n+k0)%26+65);
        cout<<t;
    }
    cout<<endl;
}
void jiemi(string words,const int& k0,const int& k1)
{
    cout<<"明文为：";
    int i;
    int k=niyuan(n,k1);
    for(i=0;i<words.length();i++)
    {
        cout<<char(((words[i]-k0)*k)%n+65);
    }
    cout<<endl;
}
int niyuan(long m,long n)
{
    int a,b,c,d,t,yu,shang,mod;
    a=m;
    b=n;
    mod=a;
    c=0;
    d=1;
    while(b<0)
    {
        b+=a;
    }
    if(b==1)
        return 1;
    while(b!=1)
    {
        t=a%b;
        shang=a/b;
        a=b;
        b=t;
        yu=c-shang*d;
        c=d;
        d=yu;
    }
    if(yu<0)
       yu+=mod;
    return yu;
}
int gcd(int a,int b)
{
    if(b==0)
       return a;
    else
       return gcd(b,a%b);
}

4.enigma密码机：

#include <iostream>
#include <cstdlib>
#include <string>
using namespace std;

void hl(int* x);//混合字母顺序-以数字代替字母
void result(string s,int* x1,int* x2,int* x3);//加解密
int main()
{
    int x1[26],x2[26],x3[26];
    hl(x1);
    hl(x2);
    hl(x3);
    string s;
    cin>>s;
    result(s,x1,x2,x3);
    return 0;
}
void hl(int* x)
{
    int i,m,y[26];
    for(i=0;i<26;i++)
    {
        y[i]=i;
    }
    for(i=0;i<26;)
    {
        m=rand()%26;
        if(y[m]==-1)
        {
            continue;
        }
        else
        {
            x[i]=m;
            y[m]=-1;
            i++;
        }
    }
}
void result(string s,int* x1,int* x2,int* x3)
{
    int m0=rand()%26,m1=rand()%26,m2=rand()%26,m3=rand()%26,i,j,tmp;
    for(i=0;i<s.length();i++)
    {
        tmp=25-x3[(x2[(x1[(int(s[i]-65)+m0+m1)%26]+m2)%26]+m3)%26];
        for(j=0;j<26;j++)
        {
            if(x3[(j+m3)%26]==tmp)
            {
                tmp=j;
                break;
            }
        }
        for(j=0;j<26;j++)
        {
            if(x2[(j+m2)%26]==tmp)
            {
                tmp=j;
                break;
            }
        }
        for(j=0;j<26;j++)
        {
            if(x1[(j+m0+m1)%26]==tmp)
            {
                tmp=j;
                break;
            }
        }
        cout<<char(tmp+65);
        while(tmp<0)
        {
            tmp+=26;
        }
        m1++;
        if(m1==26)
        {
            m1=0;
            m2++;
        }
        if(m2==26)
        {
            m2=0;
            m3=(++m3)%26;
        }
    }
}

5.DES加解密以及雪崩效应验证：

#include <iostream>
#include <string>

using namespace std;

const 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};
const int FP[]={
       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};
const 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,  1};
const 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};//0001 0101 1001 0101 0011 1101 0111 1000 1101 0000 1000 1011 1001 0001 1000 1110
const int S[8][64]={
       /* 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,

       /* 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,

       /* 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,

       /* 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,

       /* 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,

       /* 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,

       /* 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,

       /* 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};
const int PC_1[]={
       57, 49, 41, 33, 25, 17,  9,
        1, 58, 50, 42, 34, 26, 18,
       10,  2, 59, 51, 43, 35, 27,
       19, 11,  3, 60, 52, 44, 36,

       63, 55, 47, 39, 31, 23, 15,
        7, 62, 54, 46, 38, 30, 22,
       14,  6, 61, 53, 45, 37, 29,
       21, 13,  5, 28, 20, 12,  4};
const int PC_2[]={
       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};
struct w
{
    unsigned int a:1;
    unsigned int b:1;
    unsigned int c:1;
    unsigned int d:1;
    unsigned int e:1;
    unsigned int f:1;
    unsigned int g:1;
    unsigned int h:1;
};
union data
{
    char rr;
    w rw;
};
string DES(string s,string key);
string Key1(string s);
string Key2(string s);
int main()
{
    string words0,words,key0,key,tmp;
    bool mi;
    int i,bit,counts;
    cout<<"加密（0）  or  解密（1）：";
    cin>>mi;
    cout<<"请输入密钥（8个字符）：";
    cin>>key0;
    if(mi==false)
    {
        cout<<"请输入明文（二进制数串：个数为64的倍数）：";
        cin>>words0;
        key=Key1(key0);
        words=DES(words0,key);
    }
    else
    {
        cout<<"请输入密文（二进制数串：个数为64的倍数）：";
        cin>>words0;
        key=Key2(key0);
        words=DES(words0,key);
    }
    cout<<"你想要的结果是："<<words<<endl;
    cout<<"退出0 or 继续测试1 ：";
    cin>>mi;
    if(!mi)
       return 0;
    cout<<"雪崩效应测试："<<endl;
    cout<<"你想关注密文的第几个bit位：";
    cin>>bit;
    bit--;
    counts=0;
    for(i=0;i<words.length();i++)
    {
        tmp=words;
        if(words[i]=='0')
           tmp[i]='1';
        else
           tmp[i]='0';
        tmp=DES(tmp,key0);
        if(tmp[bit]=='0')
           counts++;
    }
    cout<<"经测试，你关注的那个bit位，有"<<counts<<"次为0，有"<<words.length()-counts<<"次为1。"<<endl;
    return 0;
}
string DES(string s,string key)
{
    string ss=s;
    string ts1,ts2;
    int i,j,k,l,tmp1,tmp2;
    bool t[8][8],tt[8][8],tmp;
    s="";
    for(i=0;i<ss.length();i+=64)
    {
        for(j=0;j<64;j++)
        {
            if(ss[j]=='0')
            {
                *(*t+j)=false;
            }
            else
            {
                *(*t+j)=true;
            }
        }
        for(j=0;j<64;j++)
        {
            *(*tt+j)=*(*t+IP[j]-1);
        }
        for(k=0;k<16;k++)
        {
            ts1="";
            for(j=32;j<64;j++)
            {
                if(*(*tt+j)==true)
                   ts1+="1";
                else
                   ts1+="0";
            }
            for(j=0;j<48;j++)
            {
                *(*t+j)=*(*tt+E[j]+31);
            }
            ts2="";
            for(j=0;j<48;j++)
            {
                if((*(*t+j)==true&&key[k*48+j]==1)||(*(*t+j)==false&&key[k*48+j]==0))
                   ts2+="0";
                else
                   ts2+="1";
            }
            for(j=0;j<8;j++)
            {
                tmp1=(ts2[j*6]-'0')*2+(ts2[j*6+5]-'0');
                tmp2=(ts2[j*6+1]-'0')*8+(ts2[j*6+2]-'0')*4+(ts2[j*6+3]-'0')*2+(ts2[j*6+4]-'0');
                tmp1=S[j][tmp1*16+tmp2];
                *(*t+j*4+3)=tmp1&1;
                tmp1>>=1;
                *(*t+j*4+2)=tmp1&1;
                tmp1>>=1;
                *(*t+j*4+1)=tmp1&1;
                tmp1>>=1;
                *(*t+j*4)=tmp1;
            }
            for(j=32;j<64;j++)
            {
                *(*tt+j)=(*(*t+P[j-32]-1))^(*(*tt+j-32));
            }
            for(j=0;j<32;j++)
            {
                if(ts1[j]=='0')
                   *(*tt+j)=false;
                else
                   *(*tt+j)=true;
            }
        }
        for(j=0;j<32;j++)
        {
            tmp=*(*tt+j);
            *(*tt+j)=*(*tt+j+32);
            *(*tt+j+32)=tmp;
        }
        for(j=0;j<64;j++)
        {
            *(*t+j)=*(*tt+FP[j]-1);
        }
        for(j=0;j<8;j++)
        {
            for(l=0;l<8;l++)
            {
                if(t[j][l]==true)
                   s+="1";
                else
                   s+="0";
            }
        }
    }
    return s;
}
string Key1(string s)
{
    string ss=s;
    int i,j,k;
    data d[8];
    bool tmp0,tmp1,tmp2,tmp3;
    bool t[8][8],tt[8][8];
    for(j=0;j<8;j++)
    {
        d[j].rr=ss[j];
        t[j][6]=d[j].rw.b;
        t[j][5]=d[j].rw.c;
        t[j][4]=d[j].rw.d;
        t[j][3]=d[j].rw.e;
        t[j][2]=d[j].rw.f;
        t[j][1]=d[j].rw.g;
        t[j][0]=d[j].rw.h;
    }
    for(j=0;j<56;j++)
    {
        *(*tt+j)=*(*t+PC_1[j]-1);
    }
    tmp0=*(*tt);
    tmp1=*(*tt+28);
    tmp2=*(*tt+1);
    tmp3=*(*tt+29);
    ss="";
    for(i=0;i<16;i++)
    {
        if(i==1||i==2||i==9||i==16)
        {
            for(j=0;j<55;j++)
            {
                if(j!=27)
                {
                    *(*tt+j)=*(*tt+j+1);
                }
                else
                {
                    *(*tt+j)=tmp0;
                }
            }
            *(*tt+55)=tmp1;
        }
        else
        {
            for(j=0;j<54;j++)
            {
                if(j!=27)
                {
                    *(*tt+j)=*(*tt+j+2);

                }
                else
                {
                    *(*tt+j-1)=tmp0;
                    *(*tt+j)=tmp2;
                }
            }
            *(*tt+55)=tmp3;
            *(*tt+54)=tmp1;
        }
        for(j=0;j<48;j++)
        {
            if(*(*tt+PC_2[j]-1)==true)
               ss+="1";
            else
               ss+="0";
        }
    }
    return ss;
}
string Key2(string s)
{
    string ss=s;
    int i,j,k;
    data d[8];
    bool tmp0,tmp1,tmp2,tmp3;
    bool t[8][8],tt[8][8];
    for(j=0;j<8;j++)
    {
        d[j].rr=ss[j];
        t[j][6]=d[j].rw.b;
        t[j][5]=d[j].rw.c;
        t[j][4]=d[j].rw.d;
        t[j][3]=d[j].rw.e;
        t[j][2]=d[j].rw.f;
        t[j][1]=d[j].rw.g;
        t[j][0]=d[j].rw.h;
    }
    for(j=0;j<56;j++)
    {
        *(*tt+j)=*(*t+PC_1[j]-1);
    }
    tmp0=*(*tt+27);
    tmp1=*(*tt+55);
    tmp2=*(*tt+26);
    tmp3=*(*tt+54);
    ss="";
    for(i=0;i<16;i++)
    {
        if(i==1||i==2||i==9||i==16)
        {
            for(j=55;j>0;j--)
            {
                if(j!=28)
                {
                    *(*tt+j)=*(*tt+j-1);
                }
                else
                {
                    *(*tt+j)=tmp1;
                }
            }
            *(*tt)=tmp0;
        }
        else
        {
            for(j=55;j>1;j--)
            {
                if(j!=28)
                {
                    *(*tt+j)=*(*tt+j-2);

                }
                else
                {
                    *(*tt+j+1)=tmp1;
                    *(*tt+j)=tmp3;
                }
            }
            *(*tt)=tmp2;
            *(*tt+1)=tmp0;
        }
        for(j=0;j<48;j++)
        {
            if(*(*tt+PC_2[j]-1)==true)
               ss+="1";
            else
               ss+="0";
        }
    }
    s=ss;
        for(j=0;j<16;j++)
        {
            for(k=0;k<48;k++)
            {
                ss[j*48+k]=s[(15-j)*48+k];
            }
        }
    return ss;
}