实验一-古典密码-Vigernere算法.docVIP

实验一 古典密码-Vigenere算法 班级： 学号： 姓名： 一、实验目的 1、理解简单加密算法的原理； 2、掌握Vigenere密码的原理，完成Vigenere密码加解密程序的编写； 3、通过实验，加深对古典密码体制的了解，掌握对字符进行灵活处理的方法。 二，实验要求 根据Vigenere密码的原理编写程序，对输入的符号串能够根据设置的密钥分别正确实现Vigenere加密和解密功能。 三，实验过程及内容 源程序 #include stdio.h #include string.h #define BUF_MAX 100 static int square[27][27]; //密钥统一转换为大写字母 void UpperKey(char key[]) { int key_length = strlen(key); for(int i = 0; i key_length; i++) { if (key[i] = a key[i] = z) { key[i] -= 32; } } } //Vigenere加密 void VigenereEncrypt(char word[], char key[]) { char text[BUF_MAX]; int key_length = strlen(key); int word_length = strlen(word); int i, j, k; for(i = 0; i word_length; i++) { j = i % key_length; if (word[i] = a word[i] = z) { k = word[i] - a; k = (k + key[j] - A) % 26; text[i] = k + a; } else if (word[i] = A word[i] = Z) { k = word[i] - A; k = (k + key[j] - A) % 26; text[i] = k + A; } else { text[i] = word[i]; } } text[i] = \0; printf(Encrypt string:); puts(text); } //Vigenere解密 void VigenereDecript(char en_word[], char key[]) { char word[BUF_MAX]; int key_length = strlen(key); int word_length = strlen(en_word); int i, j, k; for(i = 0; i word_length; i++) { j = i % key_length; if (en_word[i] = a en_word[i] = z) { k = en_word[i] - a; k = (k - (key[j] - A) + 26) % 26; word[i] = k + a; } else if (en_word[i] = A en_word[i] = Z) { k = en_word[i] - A; k = (k - (key[j] - A) + 26) % 26; word[i] = k + A; } else { word[i] = en_word[i]; } } word[i]=\0; printf(Decrypt string:); puts(word); } int main(void) { char key[BUF_MAX], ch; char str[BUF_MAX] = {\0}; int i, j; //初始化Vigenere方阵 for(i = 1; i 27; i++) { for(j = 1; j 27; j++) { square[i][j]= 63 + i + j; if(square[i][j] 90) { square[i][j] = square[i][j] - 26; } } } printf(\nVigenere Code); printf(\n1:Encryption); printf(\n2:Decryption); printf(\nPlease i