HILL加密程序.docVIP

c程序 #include stdio.h #include stdlib.h #include string.h #define NUM 20 #define NUM2 1000 int main() {int i,j,k=0,n,p[NUM]; printf(阶数: ); scanf(%d,n); printf(\n密钥: ); int q[NUM][NUM]; for(i=0;in*n;i++) { scanf(%d,p[i]); } for(i=0;in;i++) { for(j=0;jn;j++) { q[i][j]=p[j+k]; //printf(%d ,q[i][j]); if((j+1)%n==0) { k+=n; // printf(\n); } } } char word[NUM2]; int length,word2[NUM2][1]; printf(明文: ); scanf(%s,word); length=strlen(word); for(i=0;ilength;i++) { //printf(word: %c,word[i]); word2[i][0]=word[i]-97; //printf(word2:%d,word2[i][0]); } i=0,j=0,k=0; int count=0,temp[NUM2][1],temp2[NUM2][1]; for(i=0;iNUM2;i++) { for(j=0;j1;j++) { temp[i][j]=0; temp2[i][j]=0; } } k=strlen(word); //printf(K: %d\n,k); int z=0; j=0; printf(密文: ); while(zk/n) { temp[j][0]=word2[j+count][0]; //printf(temp:%d\n,temp[j][0]); j+=1; if(j%n==0) { //printf(dffsf); int i,s; for(i=0;in;i++) { for(int u=0;u1;u++) { for(s=0;sn;s++) { temp2[i][0]+=q[i][s]*temp[s][0]; temp2[i][0]=(temp2[i][0])%26; } printf(%c,temp2[i][0]+65); } } for(i=0;in;i++) { temp2[i][0]=0; } count+=n; z+=1; } if(j%n==0) j=0; //printf(%d \n,z); } printf(\n); system(pause); } prune_size = 0; end global max_depth; max_depth = depth; %initialize random number generator rand(seed,r_seed); load(data_file); l = length(data_file); l = l-4; stripped_file = data_file(1:l); data = eval(stripped_file); [n_examples,features] = size(data); %scramble data rando = rand(1,n_examples); [q,dex] = sort(rando); for i = 1:n_examples new_data(i,:) = data(dex(i),:); end data = new_data; n_training = ceil(n_examples * (train_size / 100)); train_set = data(1:n_training,:); n_test = ceil(n_examples * (test_size / 100)); if (n_test 0); test_set = data(n_training+1:n_training+n_test,:); end ; n_prune = cei