移位密码and仿射密码and维吉利亚密码and置换密码.doc

#include stdio.h #include conio.h #include string.h #include cctype #include malloc.h #include iostream using namespace std; void Shift() /*移位密码*/ { char c[100]; int length, i=0, key=0; system(cls); printf(********Shift Cipher(移位密码)********\nPlease input primal sentence(请输入最初的明文--一组英文字母): ); gets(c); length=strlen(c); printf(Input the key(0~26): ); scanf(%d, key); getchar(); if(key0) { printf(The value of key is error!\nPress any key to return...); getch(); return; } for(i=0; ilength; i++) { if(c[i]96c[i]123) c[i] = (c[i]+key-97)%26+65; else if(c[i]64c[i]91) c[i] = (c[i]+key-65)%26+65; } printf(Result is: %s\n, c); for(i=0; ilength; i++) { if(c[i]64c[i]91) c[i] = (c[i]-key-65+26)%26+97; } printf(\nAfter translated the sentence,we can see the primal sentence as follow:\n%s\n, c); printf(Press any key to return(按任何键返回)...); getch(); } int gcd(int a, int b) /*辗转相除法求a,b的最大公因数*/ { int k = 0; do { k = a%b; a = b; b = k; }while(k!=0); return a; } int Ni(int a, int b) /*求a相对于b的逆*/ { int i = 0; while(a*(++i)%b!=1); return i; } void Affine() /*仿射密码*/ { char c[100]; int length, i=0, ka=0, kb=0, tmp; system(cls); printf(********Affine Cipher(仿射密码)********\nPlease input primal sentence(请输入最初的明文): ); gets(c); length = strlen(c); printf(Input the key(2 numbers): ); scanf(%d%d, ka, kb); getchar(); if(gcd(ka,26)!=1) { printf(The value of the key is error!\nPress any key to return...); return; } for(i=0; ilength; i++) { if(c[i]96c[i]123) c[i] = (ka*(c[i]-97)+kb)%26+65; else if(c[i]64c[i]91) c[i] = (ka*(c[i]-65)+kb)%26+65; } printf(Result is: %s\n, c); for(i=0; ilength; i++) {