背包密码

/************************
背包向量A={a1,a2,....,an}是超递增的，B为公开钥，t、k为私钥

每个明文用一个5位的二进制表示00000-11010
每组包含两个明文

s为背包容积，若是s>=an,则说明xn=1，
若s<a，则说明xn=0

c=B*m(mod k)=t*A*m(mod k)
m为二进制代码，c为整数

A*m=c*t^(-1)(mod k)
************************/

#include<bits/stdc++.h>
using namespace std;

//找到素数，返回素数个数
int GetPrime(int number,int *prime)
{
	int *isprime=(int *)malloc(sizeof(int)*(number+1));
	if(!isprime) return -1;
	//memset(isprime,1,number+1);

	int i,j,temp;
	for(i=0;i<number+1;++i)
        isprime[i]=1;

	int countprime=0;
	for(i=2; i<=number; ++i){
		if(isprime[i]){
			prime[countprime++]=i;
			for (j=2; (temp=i*j)<=number; ++j)
				isprime[temp]=0;
		}
	}

	return countprime;
}

//素因子提取，返回数组大小
int Decompose(int number,int *factor,int *prime,int countprime)
{
	int temp=(int)sqrt(number*1.0);
	int i,countfactor=0;
	for(i=0; i<countprime&&prime[i]<=temp; ++i){
		if(number%prime[i]==0){
			factor[countfactor++]=prime[i];
			while(number%prime[i]==0)
				number/=prime[i];
		}
	}
	if(number>1)
		factor[countfactor++]=number;
	return countfactor;
}

//欧拉函数求解
int SolveEuler(int number)
{
	int *prime=(int *)malloc(sizeof(int)*(number));
	if(!prime)return 0;
	int countprime=GetPrime(number,prime);
	if(countprime==-1)return 0;
	int *factor=(int *)malloc(sizeof(int)*countprime);
	if(!factor)return 0;
	int countfactor=Decompose(number,factor,prime,countprime);
	int i,result=number;
	for(i=0; i<countfactor; ++i){
		result=result/factor[i]*(factor[i]-1);
	}
	return result;
}

//模重复平方运算
int qe2(int x,int y,int m)
{
	int a=1,b=x,n=y;
	while(n){
		if(n&1)
			a=(a*b)%m;
		b=(b*b)%m;
		n>>=1;
	}
	return a;
}

int Inverse(int number, int m)
{
	int eresult, fresult;
	eresult = SolveEuler(m);
	if(eresult == 0){
		return -1;
	}
	fresult = qe2(number, eresult-1, m);
	return fresult;
}

string SwitchtoBin(char c)
{
	switch(c){
		case ' ':return "00000";
		case 'A':return "00001";
		case 'B':return "00010";
		case 'C':return "00011";
		case 'D':return "00100";
		case 'E':return "00101";
		case 'F':return "00110";
		case 'G':return "00111";
		case 'H':return "01000";
		case 'I':return "01001";
		case 'J':return "01010";
		case 'K':return "01011";
		case 'L':return "01100";
		case 'M':return "01101";
		case 'N':return "01110";
		case 'O':return "01111";
		case 'P':return "10000";
		case 'Q':return "10001";
		case 'R':return "10010";
		case 'S':return "10011";
		case 'T':return "10100";
		case 'U':return "10101";
		case 'V':return "10110";
		case 'W':return "10111";
		case 'X':return "11000";
		case 'Y':return "11001";
		case 'Z':return "11010";
		default :return "11111";
	}
}

int* Encryption(string m, int* b)
{
	int len = m.length();
	if(len%2 != 0){
		string temp = m;
		m = temp + " ";
		++len;
	}
	int *c = new int[len/2];
	int index = 0;
	for(int i=0; i<len; i=i+2){
		string str = SwitchtoBin(m[i]) + SwitchtoBin(m[i+1]);
        //cout << str;
        c[index] = 0;
        for(int j=0; j<10; ++j)
            c[index] = c[index] + (str[j]-'0')*b[j];
        ++index;
	}
	return c;
}

char* Decryption(int* c, int* a, int invert, int k, int n)
{
    for(int i=0; i<n; ++i)
        c[i] = (c[i]*invert)%k;
    for(int i=0; i<n; ++i)
        cout << c[i] << " ";
    cout << endl;
	char *m = new char[2*n+1];
	for(int i=0; i<n; ++i){
		int s = c[i];
		int x[10];
		for(int j=0; j<10; ++j){
			if(s >= a[9-j]){
				x[9-j] = 1;
				s -= a[9-j];
			}
			else
				x[9-j] = 0;
		}
		int z = 0;
		for(int j=0; j<5; ++j){
			z = z+x[j]*(int)(pow(2, 4-j));
		}
		if(z == 0)
			m[2*i] = ' ';
		else
			m[2*i] = (char)(z-1+'A');

        z = 0;
        for(int j=5; j<10; ++j){
			z = z+x[j]*(int)(pow(2, 9-j));
		}
		if(z == 0)
			m[2*i+1] = ' ';
		else
			m[2*i+1] = (char)(z-1+'A');
	}
	m[2*n] = '\0';
	return m;
}

int main()
{
	//初始化公开钥，密钥
	int a[10] = {1,3,5,11,21,44,87,175,349,701};
	int t, k;
	t = 43, k=1590;
	int b[10];
	for(int i=0; i<10; ++i)
		b[i]=(a[i]*t)%k;

	int judge;
	while(cin >> judge){
		if(judge == 1){
			//加密
			string m;
			m="SAUNA AND HEALTH";
			int cn = (m.length()+1)/2;//密文数组大小
			int* c = new int[cn];
			c = Encryption(m, b);
			for(int i=0; i<cn; ++i)
		        cout << c[i] << " ";
		    cout << endl;
		    delete[] c;
		}
		else if(judge == 2){
			//解密
			int cn = 8;//密文数组大小
			int c[] = {2942,3584,903,3326,215,2817,2629,819};
			char* m = new char[2*cn+1];
			int invert = Inverse(t, k);
			m = Decryption(c, a, invert, k, cn);
			cout << m << endl;
			delete[] m;
		}
	}
	return 0;
}