自制C語(yǔ)言密碼加密代碼-創(chuàng)新互聯(lián)
這是通過(guò)把阿拉伯?dāng)?shù)字進(jìn)行亂序的原理,將其中的所有英文字母替換成為字母表中的后一個(gè)字母,其他字母原樣輸出,符號(hào)不改變
#include
#include
#include
#include
#define MAXN 1000
using namespace std;
void simple(int n);
void middle(int n);
void hard(int n);
void encrypt1();
void encrypt2();
void unencrypt();
void Create();
static char array3[100];
static int num1, count2;
int main() {
?srand(time(NULL));
?int b;
?cout<< "1:輸入加密 enter to encrypt\n2:輸入解密 enter to unencrypt\n3:生成秘鑰 Create a password"<< endl;
?cin >>b;
?if (b >0 && b< 4) {
??? ?switch (b) {
??? ??? ?case 1:
??? ??? ??? ?encrypt1();
??? ??? ??? ?break;
??? ??? ?case 2:
??? ??? ??? ?unencrypt();
??? ??? ??? ?break;
??? ??? ?case 3:
??? ??? ??? ?Create();
??? ??? ??? ?break;
??? ?}
?} else cout<< "輸入錯(cuò)誤\nInput error"<< endl;
}
void simple(int n) {
?int a[n], y, count = 0;
?for (int i = 0; count<= n; i++) {
??? ?y = rand() % 123;
??? ?if (y >= 48 && y<= 57) {
??? ??? ?a[count] = y;
??? ??? ?count++;
??? ?}
?}
?cout<< "生成的密碼是 ";
?for (int i = 0; i<= (n - 1); i++) {
??? ?cout.put(a[i]);
??? ?count2++;
??? ?array3[count2] = a[i];
?}
?cout<< "\n";
}
void middle(int n) {
?int a[n], y, count = 0;
?for (int i = 0; count<= n; i++) {
??? ?y = rand() % 123;
??? ?if ((y >= 48 && y<= 57) || (y >= 65 && y<= 90) || (y >= 97 && y<= 122)) {
??? ??? ?a[count] = y;
??? ??? ?count++;
??? ?}
?}
?cout<< "生成的密碼是 ";
?for (int i = 0; i<= (n - 1); i++) {
??? ?cout.put(a[i]);
??? ?count2++;
??? ?array3[count2] = a[i];
?}
?cout<< "\n";
}
void hard(int n) {
?int a[n], y, count = 0;
?for (int i = 0; count<= n; i++) {
??? ?y = rand() % 123;
??? ?if (y >33 && y< 126 && y != 32) {
??? ??? ?a[count] = y;
??? ??? ?count++;
??? ?}
?}
?cout<< "生成的密碼是 ";
?for (int i = 0; i<= (n - 1); i++) {
??? ?cout.put(a[i]);
??? ?count2++;
??? ?array3[count2] = a[i];
?}
?cout<< "\n";
}
void encrypt1() {
?char array1[MAXN];
?char c;
?scanf("%c", &c);
?cout<< "請(qǐng)輸入需要加密的密碼 please enter you passcode"<< endl;
?int count = 0;
?for (int i = 0; i<= MAXN; i++) {
??? ?array1[i] = getchar();
??? ?if (array1[i] == '\n') {
??? ??? ?break;
??? ?}
??? ?count++;
?}
?for (int i = 0; i<= count; i++) {
??? ?if (array1[i] == '0') {
??? ??? ?array1[i] = '6';
??? ?} else if (array1[i] == '1') {
??? ??? ?array1[i] = '4';
??? ?} else if (array1[i] == '2') {
??? ??? ?array1[i] = '5';
??? ?} else if (array1[i] == '3') {
??? ??? ?array1[i] = '7';
??? ?} else if (array1[i] == '4') {
??? ??? ?array1[i] = '3';
??? ?} else if (array1[i] == '5') {
??? ??? ?array1[i] = '0';
??? ?} else if (array1[i] == '6') {
??? ??? ?array1[i] = '1';
??? ?} else if (array1[i] == '7') {
??? ??? ?array1[i] = '2';
??? ?} else if (array1[i] == '8') {
??? ??? ?array1[i] = '9';
??? ?} else if (array1[i] == '9') {
??? ??? ?array1[i] = '8';
??? ?} else if (array1[i] >= 'a' && array1[i]<= 'y') {
??? ??? ?array1[i] = array1[i] + 1;
??? ?} else if (array1[i] == 'z') {
??? ??? ?array1[i] = 'a';
??? ?} else if (array1[i] >= 'A' && array1[i]<= 'Y') {
??? ??? ?array1[i] = array1[i] + 1;
??? ?} else if (array1[i] == 'Z') {
??? ??? ?array1[i] = 'A';
??? ?} else {
??? ??? ?array1[i] = array1[i];
??? ?}
?}
?for (int i = 0; i<= count; i++) {
??? ?cout.put(array1[i]);
?}
}
void encrypt2() {
?for (int i = 0; i<= count2; i++) {
??? ?if (array3[i] == '0') {
??? ??? ?array3[i] = '6';
??? ?} else if (array3[i] == '1') {
??? ??? ?array3[i] = '4';
??? ?} else if (array3[i] == '2') {
??? ??? ?array3[i] = '5';
??? ?} else if (array3[i] == '3') {
??? ??? ?array3[i] = '7';
??? ?} else if (array3[i] == '4') {
??? ??? ?array3[i] = '3';
??? ?} else if (array3[i] == '5') {
??? ??? ?array3[i] = '0';
??? ?} else if (array3[i] == '6') {
??? ??? ?array3[i] = '1';
??? ?} else if (array3[i] == '7') {
??? ??? ?array3[i] = '2';
??? ?} else if (array3[i] == '8') {
??? ??? ?array3[i] = '9';
??? ?} else if (array3[i] == '9') {
??? ??? ?array3[i] = '8';
??? ?} else if (array3[i] >= 'a' && array3[i]<= 'y') {
??? ??? ?array3[i] = array3[i] + 1;
??? ?} else if (array3[i] == 'z') {
??? ??? ?array3[i] = 'A';
??? ?} else if (array3[i] >= 'A' && array3[i]<= 'Y') {
??? ??? ?array3[i] = array3[i] + 1;
??? ?} else if (array3[i] == 'Z') {
??? ??? ?array3[i] = 'A';
??? ?} else {
??? ??? ?array3[i] = array3[i];
??? ?}
?}
?cout<< "加密后的的密碼是 ";
?for (int i = 0; i<= count2; i++) {
??? ?cout.put(array3[i]);
?}
}
void unencrypt() {
?char array2[MAXN];
?char c;
?scanf("%c", &c);
?cout<< "請(qǐng)輸入需要解密的密碼 please enter you passcode"<< endl;
?int count = 0;
?for (int i = 0; i<= MAXN; i++) {
??? ?array2[i] = getchar();
??? ?if (array2[i] == '\n') {
??? ??? ?break;
??? ?}
??? ?count++;
?}
?for (int i = 0; i<= count; i++) {
??? ?if (array2[i] == '6') {
??? ??? ?array2[i] = '0';
??? ?} else if (array2[i] == '4') {
??? ??? ?array2[i] = '1';
??? ?} else if (array2[i] == '5') {
??? ??? ?array2[i] = '2';
??? ?} else if (array2[i] == '7') {
??? ??? ?array2[i] = '3';
??? ?} else if (array2[i] == '3') {
??? ??? ?array2[i] = '4';
??? ?} else if (array2[i] == '0') {
??? ??? ?array2[i] = '5';
??? ?} else if (array2[i] == '1') {
??? ??? ?array2[i] = '6';
??? ?} else if (array2[i] == '2') {
??? ??? ?array2[i] = '7';
??? ?} else if (array2[i] == '9') {
??? ??? ?array2[i] = '8';
??? ?} else if (array2[i] == '8') {
??? ??? ?array2[i] = '9';
??? ?} else if (array2[i] >= 'b' && array2[i]<= 'z') {
??? ??? ?array2[i] = array2[i] - 1;
??? ?} else if (array2[i] == 'a') {
??? ??? ?array2[i] = 'z';
??? ?} else if (array2[i] >= 'B' && array2[i]<= 'Z') {
??? ??? ?array2[i] = array2[i] - 1;
??? ?} else if (array2[i] == 'A') {
??? ??? ?array2[i] = 'Z';
??? ?} else {
??? ??? ?array2[i] = array2[i];
??? ?}
?}
?cout<< "解密后的的密碼是 ";
?for (int i = 0; i<= count; i++) {
??? ?cout.put(array2[i]);
?}
}
void Create() {
?cout<< "請(qǐng)輸入需要多少位數(shù)的密碼\nHow many digits do you want a passcode?"<< endl;
?cin >>num1;
?if (num1 >0 && num1< MAXN) {
??? ?cout<< "1:安全性弱的密碼\n1:Weaker passwords\n2:安全性較弱的密碼\n2:Strong passwords\n3:安全性強(qiáng)的密碼\n3:Passwords with strong security\n其他:退出\nother:ESC"<< endl;
??? ?int a;
??? ?cin >>a;
??? ?if (a >0 && a< 4) {
??? ??? ?switch (a) {
??? ??? ??? ?case 1:
??? ??? ??? ??? ?simple(num1);
??? ??? ??? ??? ?break;
??? ??? ??? ?case 2:
??? ??? ??? ??? ?middle(num1);
??? ??? ??? ??? ?break;
??? ??? ??? ?case 3:
??? ??? ??? ??? ?hard(num1);
??? ??? ??? ??? ?break;
??? ??? ??? ?default:
??? ??? ??? ??? ?break;
??? ??? ?}
??? ??? ?int y;
??? ??? ?cout<< "1:輸入加密\nenter to encrypt\n2:把生成的秘鑰加密\nEncrypt the generated key"<< endl;
??? ??? ?cin >>y;
??? ??? ?switch (y) {
??? ??? ??? ?case 1:
??? ??? ??? ??? ?encrypt1();
??? ??? ??? ??? ?break;
??? ??? ??? ?case 2:
??? ??? ??? ??? ?encrypt2();
??? ??? ??? ??? ?break;
??? ??? ??? ?default:
??? ??? ??? ??? ?break;
??? ??? ?}
??? ?} else cout<< "輸入錯(cuò)誤\nInput error"<< endl;
?} else cout<< "輸入錯(cuò)誤\nInput error"<< endl;
}
你是否還在尋找穩(wěn)定的海外服務(wù)器提供商？創(chuàng)新互聯(lián)www.cdcxhl.cn海外機(jī)房具備T級(jí)流量清洗系統(tǒng)配攻擊溯源，準(zhǔn)確流量調(diào)度確保服務(wù)器高可用性，企業(yè)級(jí)服務(wù)器適合批量采購(gòu)，新人活動(dòng)首月15元起，快前往官網(wǎng)查看詳情吧
網(wǎng)頁(yè)題目：自制C語(yǔ)言密碼加密代碼-創(chuàng)新互聯(lián)
URL地址：http://www.muchs.cn/article24/djjpce.html
成都網(wǎng)站建設(shè)公司_創(chuàng)新互聯(lián)，為您提供企業(yè)網(wǎng)站制作、定制開(kāi)發(fā)、微信公眾號(hào)、自適應(yīng)網(wǎng)站、域名注冊(cè)、動(dòng)態(tài)網(wǎng)站
聲明：本網(wǎng)站發(fā)布的內(nèi)容（圖片、視頻和文字）以用戶投稿、用戶轉(zhuǎn)載內(nèi)容為主，如果涉及侵權(quán)請(qǐng)盡快告知，我們將會(huì)在第一時(shí)間刪除。文章觀點(diǎn)不代表本網(wǎng)站立場(chǎng)，如需處理請(qǐng)聯(lián)系客服。電話：028-86922220；郵箱：631063699@qq.com。內(nèi)容未經(jīng)允許不得轉(zhuǎn)載，或轉(zhuǎn)載時(shí)需注明來(lái)源： 創(chuàng)新互聯(lián)
猜你還喜歡下面的內(nèi)容
- react中圖片用哪個(gè)標(biāo)簽-創(chuàng)新互聯(lián)
- phpcmsv9無(wú)法上傳縮略圖的解決方法-創(chuàng)新互聯(lián)
- Android監(jiān)聽(tīng)軟鍵盤(pán)彈出與隱藏的兩種方法-創(chuàng)新互聯(lián)
- Kafka安裝與配置-創(chuàng)新互聯(lián)
- PHP7開(kāi)啟Opcode打造強(qiáng)悍性能的方法-創(chuàng)新互聯(lián)
- 有趣的JavaScript和CSS庫(kù)有哪些-創(chuàng)新互聯(lián)
- ZooKeeper鎖服務(wù)-創(chuàng)新互聯(lián)
- 該如何布置網(wǎng)站建設(shè)的面包屑導(dǎo)航 2022-11-11
- 深度解析面包屑導(dǎo)航在網(wǎng)站優(yōu)化中的特殊作用 2020-08-30
- 成都網(wǎng)站建設(shè)：面包屑導(dǎo)航的由來(lái)及其重要性！ 2016-11-03
- 網(wǎng)站建設(shè)過(guò)程中如何使用好面包屑導(dǎo)航？ 2016-11-06
- 面包屑導(dǎo)航優(yōu)化技巧 2016-09-12
- 面包屑導(dǎo)航優(yōu)化 2022-02-14
- 網(wǎng)站制作中的面包屑導(dǎo)航是什么？ 2022-11-02
- 網(wǎng)站建設(shè)中面包屑導(dǎo)航功能的重要性 2022-08-20
- 網(wǎng)站建設(shè)中面包屑導(dǎo)航的作用 2014-07-09
- 成都網(wǎng)站建設(shè)中面包屑導(dǎo)航的作用 2014-10-25
- 面包屑導(dǎo)航的作用及好處 2022-07-29
- 面包屑導(dǎo)航設(shè)計(jì)有哪些好處為何設(shè)計(jì)大神都喜歡用它 2021-05-24