當前位置:首頁 » 密碼管理 » aes加密演算法的c代碼

aes加密演算法的c代碼

發布時間: 2023-05-19 17:34:53

⑴ 用C語言編寫AES加密演算法,遇到問題。

一行行列印語句,問題的核心沒有講出來,大家怎麼幫你呢,我們只能保證這個列印過程是正確的。

⑵ 求AES加密演算法 C代碼

以前編過的,c++可以用的
#include <iostream>
using namespace std;
long gcd(long a, long b)
{
if(b>a) //a中存放較大的數,b中存放較小的數
{
int temp;
temp=a;
a=b;
b=temp;
}
long n;
while((n=a%b)!=0)
{
a=b;
b=n;
}
return b;
}
//---------------------------------------
long cheng_niyuan(long a, long b)
{
for(long i=1; (i*a)%b!=1; i++);
return i;
}
//---------------------------------------
int mi_mo(int a, int b, int n)
{
int K[100];
int top=-1;
while(b)
{
top++;
K[top]=(b%2);
b/=2;
}
int c=0, f=1;
for(; top>=0; top--)
{
c=2*c;
f=(f*f)%n;
if(K[top]==1)
{
c+=1;
f=(f*a)%n;
}
}
return f;
}
//---------------------------------------
int main()
{
int p=5,q=11;

cout<<"p="<<p<<endl;
cout<<"q="<<q<<endl;
long int n=p*q;
cout<<"n="<<n<<endl;
long int fi_n=(p-1)*(q-1);
cout<<"fi_n="<<fi_n<<endl;
int e=3;
cout<<"e="<<e<<endl;
long d=cheng_niyuan(e,fi_n);
int M, C;
cout<<"請輸入明文:"<<endl;
cin>>M;
C=mi_mo(M, e, n);
cout<<"對應的密文為:"<<endl;
cout<<C<<endl;
cout<<"請輸入密文:"<<endl;
cin>>C;
M=mi_mo(C, d, n);
cout<<"對應的明文為:"<<endl;
cout<<M<<endl;
return 0;
}

⑶ 誰會用C語言實現AES演算法,謝謝

1 AES加密、解密演算法原理和AVR實現

AES是分組密鑰,演算法輸入128位數據,密鑰長度也是128位。用Nr表示對一個數據分組加密的輪數(加密輪數與密鑰長度的關系如表1所列)。每一輪都需要一個與輸入分組具有相同長度的擴展密鑰Expandedkey(i)的參與。由於外部輸入的加密密鑰K長度有限,所以在演算法中要用一個密鑰擴展程序(Keyexpansion)把外部密鑰K擴展成更長的比特串,以生成各輪的加密和解密密鑰。

1.1圈變化
AES每一個圈變換由以下三個層組成:
非線性層——進行Subbyte變換;
線行混合層——進行ShiftRow和MixColumn運算;
密鑰加層——進行AddRoundKey運算。

① Subbyte變換是作用在狀態中每個位元組上的一種非線性位元組轉換,可以通過計算出來的S盒進行映射。
Schange:
ldi zh,$01;將指針指向S盒的首地址
mov zl,r2;將要查找的數據作為指針低地址
ldtemp,z+;取出這個對應的數據
mov r2,temp;交換數據完成查表
.
.
.
ret

② ShiftRow是一個位元組換位。它將狀態中的行按照不同的偏移量進行循環移位,而這個偏移量也是根據Nb的不同而選擇的[3]。
shiftrow:;這是一個位元組換位的子程序
mov temp,r3;因為是4×4
mov r3,r7; r2 r6 r10 r14 r2 r6 r10 r14
mov r7,r11; r3 r7 r11 r15---r7 r11 r15 r3
mov r11,r15; r4 r8 r12 r17 r12 r17 r4 r8
mov r15,temp; r5 r9 r13 r18 r18 r5 r9 r13
mov temp,r4
mov temp1,r8
mov r4,r12
mov r8,r17
mov r12,temp
mov r17,temp1
mov temp,r18
mov r18,r13
mov r13,r9
mov r9,r5
mov r5,temp
ret

③ 在MixColumn變換中,把狀態中的每一列看作GF(28)上的多項式a(x)與固定多項式c(x)相乘的結果。b(x)=c(x)*a(x)的系數這樣計算:*運算不是普通的乘法運算,而是特殊的運算,即
b(x)=c(x)·a(x)(mod x4+1)
對於這個運算
b0=02。a0+03。a1+a2+a3
令xtime(a0)=02。a0
其中,符號「。」表示模一個八次不可約多項式的同餘乘法[3]。
mov temp,a0;這是一個mixcolimn子程序
rcall xtime;調用xtime程序
mov a0,temp
mov temp,a1
rcall xtime
eor a0,a1
eor a0,temp
eor a0,a2
eor a0,a3;完成b(x)的計算
.
.
.
xtime:;這是一個子程序
ldi temp1,$1b
lsl temp
brcs next1;如果最高位是1,則轉移
next: ret;否則什麼也不變化
next1:eor temp,temp1
rjmp next

對於逆變化,其矩陣C要改變成相應的D,即b(x)=d(x)*a(x)。

④ 密鑰加層運算(addround)是將圈密鑰狀態中的對應位元組按位「異或」。

⑤ 根據線性變化的性質[1],解密運算是加密變化的逆變化。這里不再詳細敘述。

1.2輪變化

對不同的分組長度,其對應的輪變化次數是不同的,如表1所列。

1.3密鑰擴展
AES演算法利用外部輸入密鑰K(密鑰串的字數為Nk),通過密鑰的擴展程序得到共計4(Nr+1)字的擴展密鑰。它涉及如下三個模塊:

① 位置變換(rotword)——把一個4位元組的序列[A,B,C,D]變化成[B,C,D,A];

② S盒變換(subword)——對一個4位元組進行S盒代替;

③ 變換Rcon[i]——Rcon[i]表示32位比特字[xi-1,00,00,00]。這里的x是(02),如
Rcon[1]=[01000000];Rcon[2]=[02000000];Rcon[3]=[04000000]……

擴展密鑰的生成:擴展密鑰的前Nk個字就是外部密鑰K;以後的字W[[i]]等於它前一個字W[[i-1]]與前第Nk個字W[[i-Nk]]的「異或」,即W[[i]]=W[[i-1]]�W[[i- Nk]]。但是若i為Nk的倍數,則W[i]=W[i-Nk]�Subword(Rotword(W[[i-1]]))�Rcon[i/Nk]。

程序執行的時候,主要調用以上幾個子程序,具體實現如下:
Keyexpansion:
rcall rotwoed
rcall subword
rcall Rcon
.
.
.

2 AES加密、解密演算法的優化

由以上演算法的流程中可以清楚地看到,整個演算法中程序耗時最多的就是圈變化部分,因此對於演算法的優化也就在此;而圈變化部分可以優化的也就是列變化。因為列變化是一個模乘同餘規則。由於AES加密和解密是不對稱的,如果不對其進行優化,會使演算法的解密速度遠遠大於加密的速度[1]。

① 加密運算。對列變換(Mixcolumn)可以通過調用xtime子程序進行優化。

另一種有效的優化方法就是離線構造一個表格,即列變化表格。這樣只要通過查表的方式就可以提高加密速度。

② 解密演算法的優化。由於解密的列變換的系數分別是09、0E、0B和0D。在AVR單片機上實現以上的乘法顯然是需要很多的時間,從而導致了解密的性能降低。

優化方法一:對列變化進行分解使倍乘次數降低。

仔細研究解密矩陣的系數,不難發現解密矩陣和加密矩陣有著一定的聯系,即解密矩陣等於加密矩陣和一個矩陣的相乘。通過這樣的聯系,就可以對演算法進行優化:

這樣一來,只用幾個簡單的「異或」就可以實現列變化,使倍乘的次數降低,提高解密的速度。
優化方法二:構造表格。

同加密構造方法一樣,可以構造四個表格T[ea]=e×a; T[9a]=9×a;T[9a]=9×a;T[ba]=b×a。這樣一來,也只需要進行查表和簡單的異或就可以完成解密的任務。雖然這種方法將增加額外的開銷,但是它卻是一種有效的方法。

3 AES加密與解密的實驗模擬

根據以上實驗步驟和優化方法得出表2、3所列實驗結果。

設主密鑰為:(128bit)。
加密明文:。
密文:。
解密密文:。
明文:。

總之,AES密碼是一個非對稱密碼體制,它的解密要比加密復雜和費時。解密優化演算法沒有增加存儲空間的基礎上,以列變化為基礎進行處理,程序比原始的要小,而且節約了時間。解密優化方法速度最快,效率最高,但要增加系統的存儲空間,因此它的程序也是最大的一個
流程圖省略 朋友參考吧

⑷ 求C語言(不是C++)編寫的AES加密程序,能在C-FREE里運行 簡單就好 求能用

char keyMaterial[256];
int cnt = 0;
while(cnt < keylen/8) {
for (j = 0; rawkey[j]; j++) {
idx = j % (keylen/8);
ctmp = rawkey[idx];
if (idx != j)
ctmp = rawkey[idx] ^ rawkey[j];
ctmp += cnt;
mdx = (cnt + idx) % (keylen/8);
keyMaterial[2*mdx] = ((tmp=ctmp/16)>9)? tmp+'A'-10 : tmp+'0';
keyMaterial[2*mdx+1] = ((tmp=ctmp%16)>9)? tmp+'A'-10 : tmp+'0';
}
cnt += j;
}
keyMaterial[keylen/4] = 0;

⑸ aes加密演算法C代碼

完整的!
#include "stdio.h"
#include "memory.h"
#include "time.h"
#include "stdlib.h"

#define PLAIN_FILE_OPEN_ERROR -1
#define KEY_FILE_OPEN_ERROR -2
#define CIPHER_FILE_OPEN_ERROR -3
#define OK 1

typedef char ElemType;

/*初始置換表IP*/
int IP_Table[64] = { 57,49,41,33,25,17,9,1,
59,51,43,35,27,19,11,3,
61,53,45,37,29,21,13,5,
63,55,47,39,31,23,15,7,
56,48,40,32,24,16,8,0,
58,50,42,34,26,18,10,2,
60,52,44,36,28,20,12,4,
62,54,46,38,30,22,14,6};
/*逆初始置換表IP^-1*/
int IP_1_Table[64] = {39,7,47,15,55,23,63,31,
38,6,46,14,54,22,62,30,
37,5,45,13,53,21,61,29,
36,4,44,12,52,20,60,28,
35,3,43,11,51,19,59,27,
34,2,42,10,50,18,58,26,
33,1,41,9,49,17,57,25,
32,0,40,8,48,16,56,24};

/*擴充置換表E*/
int E_Table[48] = {31, 0, 1, 2, 3, 4,
3, 4, 5, 6, 7, 8,
7, 8,9,10,11,12,
11,12,13,14,15,16,
15,16,17,18,19,20,
19,20,21,22,23,24,
23,24,25,26,27,28,
27,28,29,30,31, 0};

/*置換函數P*/
int P_Table[32] = {15,6,19,20,28,11,27,16,
0,14,22,25,4,17,30,9,
1,7,23,13,31,26,2,8,
18,12,29,5,21,10,3,24};

/*S盒*/
int S[8][4][16] =
/*S1*/
{{{14,4,13,1,2,15,11,8,3,10,6,12,5,9,0,7},
{0,15,7,4,14,2,13,1,10,6,12,11,9,5,3,8},
{4,1,14,8,13,6,2,11,15,12,9,7,3,10,5,0},
{15,12,8,2,4,9,1,7,5,11,3,14,10,0,6,13}},
/*S2*/
{{15,1,8,14,6,11,3,4,9,7,2,13,12,0,5,10},
{3,13,4,7,15,2,8,14,12,0,1,10,6,9,11,5},
{0,14,7,11,10,4,13,1,5,8,12,6,9,3,2,15},
{13,8,10,1,3,15,4,2,11,6,7,12,0,5,14,9}},
/*S3*/
{{10,0,9,14,6,3,15,5,1,13,12,7,11,4,2,8},
{13,7,0,9,3,4,6,10,2,8,5,14,12,11,15,1},
{13,6,4,9,8,15,3,0,11,1,2,12,5,10,14,7},
{1,10,13,0,6,9,8,7,4,15,14,3,11,5,2,12}},
/*S4*/
{{7,13,14,3,0,6,9,10,1,2,8,5,11,12,4,15},
{13,8,11,5,6,15,0,3,4,7,2,12,1,10,14,9},
{10,6,9,0,12,11,7,13,15,1,3,14,5,2,8,4},
{3,15,0,6,10,1,13,8,9,4,5,11,12,7,2,14}},
/*S5*/
{{2,12,4,1,7,10,11,6,8,5,3,15,13,0,14,9},
{14,11,2,12,4,7,13,1,5,0,15,10,3,9,8,6},
{4,2,1,11,10,13,7,8,15,9,12,5,6,3,0,14},
{11,8,12,7,1,14,2,13,6,15,0,9,10,4,5,3}},
/*S6*/
{{12,1,10,15,9,2,6,8,0,13,3,4,14,7,5,11},
{10,15,4,2,7,12,9,5,6,1,13,14,0,11,3,8},
{9,14,15,5,2,8,12,3,7,0,4,10,1,13,11,6},
{4,3,2,12,9,5,15,10,11,14,1,7,6,0,8,13}},
/*S7*/
{{4,11,2,14,15,0,8,13,3,12,9,7,5,10,6,1},
{13,0,11,7,4,9,1,10,14,3,5,12,2,15,8,6},
{1,4,11,13,12,3,7,14,10,15,6,8,0,5,9,2},
{6,11,13,8,1,4,10,7,9,5,0,15,14,2,3,12}},
/*S8*/
{{13,2,8,4,6,15,11,1,10,9,3,14,5,0,12,7},
{1,15,13,8,10,3,7,4,12,5,6,11,0,14,9,2},
{7,11,4,1,9,12,14,2,0,6,10,13,15,3,5,8},
{2,1,14,7,4,10,8,13,15,12,9,0,3,5,6,11}}};
/*置換選擇1*/
int PC_1[56] = {56,48,40,32,24,16,8,
0,57,49,41,33,25,17,
9,1,58,50,42,34,26,
18,10,2,59,51,43,35,
62,54,46,38,30,22,14,
6,61,53,45,37,29,21,
13,5,60,52,44,36,28,
20,12,4,27,19,11,3};

/*置換選擇2*/
int PC_2[48] = {13,16,10,23,0,4,2,27,
14,5,20,9,22,18,11,3,
25,7,15,6,26,19,12,1,
40,51,30,36,46,54,29,39,
50,44,32,46,43,48,38,55,
33,52,45,41,49,35,28,31};

/*對左移次數的規定*/
int MOVE_TIMES[16] = {1,1,2,2,2,2,2,2,1,2,2,2,2,2,2,1};

int ByteToBit(ElemType ch,ElemType bit[8]);
int BitToByte(ElemType bit[8],ElemType *ch);
int Char8ToBit64(ElemType ch[8],ElemType bit[64]);
int Bit64ToChar8(ElemType bit[64],ElemType ch[8]);
int DES_MakeSubKeys(ElemType key[64],ElemType subKeys[16][48]);
int DES_PC1_Transform(ElemType key[64], ElemType tempbts[56]);
int DES_PC2_Transform(ElemType key[56], ElemType tempbts[48]);
int DES_ROL(ElemType data[56], int time);
int DES_IP_Transform(ElemType data[64]);
int DES_IP_1_Transform(ElemType data[64]);
int DES_E_Transform(ElemType data[48]);
int DES_P_Transform(ElemType data[32]);
int DES_SBOX(ElemType data[48]);
int DES_XOR(ElemType R[48], ElemType L[48],int count);
int DES_Swap(ElemType left[32],ElemType right[32]);
int DES_EncryptBlock(ElemType plainBlock[8], ElemType subKeys[16][48], ElemType cipherBlock[8]);
int DES_DecryptBlock(ElemType cipherBlock[8], ElemType subKeys[16][48], ElemType plainBlock[8]);
int DES_Encrypt(char *plainFile, char *keyStr,char *cipherFile);
int DES_Decrypt(char *cipherFile, char *keyStr,char *plainFile);

/*位元組轉換成二進制*/
int ByteToBit(ElemType ch, ElemType bit[8]){
int cnt;
for(cnt = 0;cnt < 8; cnt++){
*(bit+cnt) = (ch>>cnt)&1;
}
return 0;
}

/*二進制轉換成位元組*/
int BitToByte(ElemType bit[8],ElemType *ch){
int cnt;
for(cnt = 0;cnt < 8; cnt++){
*ch |= *(bit + cnt)<<cnt;
}
return 0;
}

/*將長度為8的字元串轉為二進制位串*/
int Char8ToBit64(ElemType ch[8],ElemType bit[64]){
int cnt;
for(cnt = 0; cnt < 8; cnt++){
ByteToBit(*(ch+cnt),bit+(cnt<<3));
}
return 0;
}

/*將二進制位串轉為長度為8的字元串*/
int Bit64ToChar8(ElemType bit[64],ElemType ch[8]){
int cnt;
memset(ch,0,8);
for(cnt = 0; cnt < 8; cnt++){
BitToByte(bit+(cnt<<3),ch+cnt);
}
return 0;
}

/*生成子密鑰*/
int DES_MakeSubKeys(ElemType key[64],ElemType subKeys[16][48]){
ElemType temp[56];
int cnt;
DES_PC1_Transform(key,temp);/*PC1置換*/
for(cnt = 0; cnt < 16; cnt++){/*16輪跌代,產生16個子密鑰*/
DES_ROL(temp,MOVE_TIMES[cnt]);/*循環左移*/
DES_PC2_Transform(temp,subKeys[cnt]);/*PC2置換,產生子密鑰*/
}
return 0;
}

/*密鑰置換1*/
int DES_PC1_Transform(ElemType key[64], ElemType tempbts[56]){
int cnt;
for(cnt = 0; cnt < 56; cnt++){
tempbts[cnt] = key[PC_1[cnt]];
}
return 0;
}

/*密鑰置換2*/
int DES_PC2_Transform(ElemType key[56], ElemType tempbts[48]){
int cnt;
for(cnt = 0; cnt < 48; cnt++){
tempbts[cnt] = key[PC_2[cnt]];
}
return 0;
}

/*循環左移*/
int DES_ROL(ElemType data[56], int time){
ElemType temp[56];

/*保存將要循環移動到右邊的位*/
memcpy(temp,data,time);
memcpy(temp+time,data+28,time);

/*前28位移動*/
memcpy(data,data+time,28-time);
memcpy(data+28-time,temp,time);

/*後28位移動*/
memcpy(data+28,data+28+time,28-time);
memcpy(data+56-time,temp+time,time);

return 0;
}

/*IP置換*/
int DES_IP_Transform(ElemType data[64]){
int cnt;
ElemType temp[64];
for(cnt = 0; cnt < 64; cnt++){
temp[cnt] = data[IP_Table[cnt]];
}
memcpy(data,temp,64);
return 0;
}

/*IP逆置換*/
int DES_IP_1_Transform(ElemType data[64]){
int cnt;
ElemType temp[64];
for(cnt = 0; cnt < 64; cnt++){
temp[cnt] = data[IP_1_Table[cnt]];
}
memcpy(data,temp,64);
return 0;
}

/*擴展置換*/
int DES_E_Transform(ElemType data[48]){
int cnt;
ElemType temp[48];
for(cnt = 0; cnt < 48; cnt++){
temp[cnt] = data[E_Table[cnt]];
}
memcpy(data,temp,48);
return 0;
}

/*P置換*/
int DES_P_Transform(ElemType data[32]){
int cnt;
ElemType temp[32];
for(cnt = 0; cnt < 32; cnt++){
temp[cnt] = data[P_Table[cnt]];
}
memcpy(data,temp,32);
return 0;
}

/*異或*/
int DES_XOR(ElemType R[48], ElemType L[48] ,int count){
int cnt;
for(cnt = 0; cnt < count; cnt++){
R[cnt] ^= L[cnt];
}
return 0;
}

/*S盒置換*/
int DES_SBOX(ElemType data[48]){
int cnt;
int line,row,output;
int cur1,cur2;
for(cnt = 0; cnt < 8; cnt++){
cur1 = cnt*6;
cur2 = cnt<<2;

/*計算在S盒中的行與列*/
line = (data[cur1]<<1) + data[cur1+5];
row = (data[cur1+1]<<3) + (data[cur1+2]<<2)
+ (data[cur1+3]<<1) + data[cur1+4];
output = S[cnt][line][row];

/*化為2進制*/
data[cur2] = (output&0X08)>>3;
data[cur2+1] = (output&0X04)>>2;
data[cur2+2] = (output&0X02)>>1;
data[cur2+3] = output&0x01;
}
return 0;
}

/*交換*/
int DES_Swap(ElemType left[32], ElemType right[32]){
ElemType temp[32];
memcpy(temp,left,32);
memcpy(left,right,32);
memcpy(right,temp,32);
return 0;
}

/*加密單個分組*/
int DES_EncryptBlock(ElemType plainBlock[8], ElemType subKeys[16][48], ElemType cipherBlock[8]){
ElemType plainBits[64];
ElemType Right[48];
int cnt;

Char8ToBit64(plainBlock,plainBits);
/*初始置換(IP置換)*/
DES_IP_Transform(plainBits);

/*16輪迭代*/
for(cnt = 0; cnt < 16; cnt++){
memcpy(Right,plainBits+32,32);
/*將右半部分進行擴展置換,從32位擴展到48位*/
DES_E_Transform(Right);
/*將右半部分與子密鑰進行異或操作*/
DES_XOR(Right,subKeys[cnt],48);
/*異或結果進入S盒,輸出32位結果*/
DES_SBOX(Right);
/*P置換*/
DES_P_Transform(Right);
/*將明文左半部分與右半部分進行異或*/
DES_XOR(plainBits,Right,32);
if(cnt != 15){
/*最終完成左右部的交換*/
DES_Swap(plainBits,plainBits+32);
}
}
/*逆初始置換(IP^1置換)*/
DES_IP_1_Transform(plainBits);
Bit64ToChar8(plainBits,cipherBlock);
return 0;
}

/*解密單個分組*/
int DES_DecryptBlock(ElemType cipherBlock[8], ElemType subKeys[16][48],ElemType plainBlock[8]){
ElemType cipherBits[64];
ElemType Right[48];
int cnt;

Char8ToBit64(cipherBlock,cipherBits);
/*初始置換(IP置換)*/
DES_IP_Transform(cipherBits);

/*16輪迭代*/
for(cnt = 15; cnt >= 0; cnt--){
memcpy(Right,cipherBits+32,32);
/*將右半部分進行擴展置換,從32位擴展到48位*/
DES_E_Transform(Right);
/*將右半部分與子密鑰進行異或操作*/
DES_XOR(Right,subKeys[cnt],48);
/*異或結果進入S盒,輸出32位結果*/
DES_SBOX(Right);
/*P置換*/
DES_P_Transform(Right);
/*將明文左半部分與右半部分進行異或*/
DES_XOR(cipherBits,Right,32);
if(cnt != 0){
/*最終完成左右部的交換*/
DES_Swap(cipherBits,cipherBits+32);
}
}
/*逆初始置換(IP^1置換)*/
DES_IP_1_Transform(cipherBits);
Bit64ToChar8(cipherBits,plainBlock);
return 0;
}

/*加密文件*/
int DES_Encrypt(char *plainFile, char *keyStr,char *cipherFile){
FILE *plain,*cipher;
int count;
ElemType plainBlock[8],cipherBlock[8],keyBlock[8];
ElemType bKey[64];
ElemType subKeys[16][48];
if((plain = fopen(plainFile,"rb")) == NULL){
return PLAIN_FILE_OPEN_ERROR;
}
if((cipher = fopen(cipherFile,"wb")) == NULL){
return CIPHER_FILE_OPEN_ERROR;
}
/*設置密鑰*/
memcpy(keyBlock,keyStr,8);
/*將密鑰轉換為二進制流*/
Char8ToBit64(keyBlock,bKey);
/*生成子密鑰*/
DES_MakeSubKeys(bKey,subKeys);

while(!feof(plain)){
/*每次讀8個位元組,並返回成功讀取的位元組數*/
if((count = fread(plainBlock,sizeof(char),8,plain)) == 8){
DES_EncryptBlock(plainBlock,subKeys,cipherBlock);
fwrite(cipherBlock,sizeof(char),8,cipher);
}
}
if(count){
/*填充*/
memset(plainBlock + count,'\0',7 - count);
/*最後一個字元保存包括最後一個字元在內的所填充的字元數量*/
plainBlock[7] = 8 - count;
DES_EncryptBlock(plainBlock,subKeys,cipherBlock);
fwrite(cipherBlock,sizeof(char),8,cipher);
}
fclose(plain);
fclose(cipher);
return OK;
}

/*解密文件*/
int DES_Decrypt(char *cipherFile, char *keyStr,char *plainFile){
FILE *plain, *cipher;
int count,times = 0;
long fileLen;
ElemType plainBlock[8],cipherBlock[8],keyBlock[8];
ElemType bKey[64];
ElemType subKeys[16][48];
if((cipher = fopen(cipherFile,"rb")) == NULL){
return CIPHER_FILE_OPEN_ERROR;
}
if((plain = fopen(plainFile,"wb")) == NULL){
return PLAIN_FILE_OPEN_ERROR;
}

/*設置密鑰*/
memcpy(keyBlock,keyStr,8);
/*將密鑰轉換為二進制流*/
Char8ToBit64(keyBlock,bKey);
/*生成子密鑰*/
DES_MakeSubKeys(bKey,subKeys);

/*取文件長度 */
fseek(cipher,0,SEEK_END);/*將文件指針置尾*/
fileLen = ftell(cipher); /*取文件指針當前位置*/
rewind(cipher); /*將文件指針重指向文件頭*/
while(1){
/*密文的位元組數一定是8的整數倍*/
fread(cipherBlock,sizeof(char),8,cipher);
DES_DecryptBlock(cipherBlock,subKeys,plainBlock);
times += 8;
if(times < fileLen){
fwrite(plainBlock,sizeof(char),8,plain);
}
else{
break;
}
}
/*判斷末尾是否被填充*/
if(plainBlock[7] < 8){
for(count = 8 - plainBlock[7]; count < 7; count++){
if(plainBlock[count] != '\0'){
break;
}
}
}
if(count == 7){/*有填充*/
fwrite(plainBlock,sizeof(char),8 - plainBlock[7],plain);
}
else{/*無填充*/
fwrite(plainBlock,sizeof(char),8,plain);
}

fclose(plain);
fclose(cipher);
return OK;
}

int main()
{
clock_t a,b;
a = clock();
DES_Encrypt("1.txt","key.txt","2.txt");
b = clock();
printf("加密消耗%d毫秒\n",b-a);

system("pause");
a = clock();
DES_Decrypt("2.txt","key.txt","3.txt");
b = clock();
printf("解密消耗%d毫秒\n",b-a);
getchar();
return 0;
}

⑹ AES加密演算法對」文件「進行加密。。要求用C++實現

1.加密,是以某種特殊的演算法改變原有的信息數據,使得未授權的用戶即使獲得了已加密的信息,但因不知解密的方法,仍然無法了解信息的內容。例如對稱演算法亦或加密。
2.什麼是異或演算法
異或的特點是原始值經過兩次異或某一個數後會變成原來的值,所以有時利用這個特性來進行加密,加密端把數據與一個密鑰進行異或操作,生成密文。接收方收到密文後利用加密方提供的密鑰進行再次異或操作就能得到明文。
3.常式:
/*以DWORD為單位對文件進行加密,將每個DWORD與0xfcba0000(密鑰)做異或,寫入另一個文件*/
#include
<stdio.h>
#include
<stdlib.h>
#define
DWORD
unsigned
long
#define
BYTE
unsigned
char
#define
false
0
#define
true
1
int
main(int
argc,
char
*argv[])
{
FILE
*hSource;
FILE
*hDestination;
DWORD
dwKey=0xfcba0000;
char*
pbBuffer;
DWORD
dwBufferLen=sizeof(DWORD);
DWORD
dwCount;
DWORD
dwData;
if(argv[1]==0||argv[2]==0)
{
printf("missing
argument!\n");
return
false;
}
char*
szSource=argv[1];
char*
szDestination=argv[2];
hSource
=
fopen(szSource,"rb");//
打開源文件.
hDestination
=
fopen(szDestination,"wb");
//打開目標文件
if
(hSource==NULL)
{printf("open
Source
File
error
!");
return
false
;}
if
(hDestination==NULL){
printf("open
Destination
File
error
!");
return
false
;}
//分配緩沖區
pbBuffer=(char*
)malloc(dwBufferLen);
do
{
//
從源文件中讀出dwBlockLen個位元組
dwCount
=
fread(pbBuffer,
1,
dwBufferLen,
hSource);
//加密數據
dwData
=
*(DWORD*)pbBuffer;
//char*
TO
dword
dwData^=dwKey;
//xor
operation
pbBuffer
=
(char
*)
&dwData;
//
將加密過的數據寫入目標文件
fwrite(pbBuffer,
1,
dwCount,
hDestination);
}
while(!feof(hSource));
//關閉文件、釋放內存
fclose(hSource);
fclose(hDestination);
printf("%s
is
encrypted
to
%s\n",szSource,szDestination);
return
0;
}

⑺ 使用C/C++語言,將DES/AES加密演算法,用代碼實現

哎,學校大作業吧。核心是des和aes的演算法唄,自己一點點寫代碼量不很少呢。沒時間給你寫了。
不過有個很好的偷懶辦法:建議lz你去找一下OpenSSL的源碼。裡面有AES,DES的原生C實現。現成函數。lz你直接從裡面摳出來復制到你工程里就行了。。

⑻ ASE加密演算法,C語言實現

Rijdeal的AES演算法吧?

實現:
#include"stdio.h"
typedef unsigned char word8;
typedef unsigned int word32;

word8 Logtable[256] =
{
0,0,25,1,50,2,26,198,75,199,27,104,51,238,223,3,100,4,
224,14,52,141,129,239,76,113,8,200,248,105,28,193,125,194,29,
181,249,185,39,106,77,228,166,114,154,201,9,120,101,47,138,
5,33,15,225,36,18,240,130,69,53,147,218,142,150,143,219,189,
54,208,206,148,19,92,210,241,64,70,131,56,102,221,253,48,
191,6,139,98,179,37,226,152,34,136,145,16,126,110,72,195,163,
182,30,66,58,107,40,84,250,133,61,186,43,121,10,21,155,159,
94,202,78,212,172,229,243,115,167,87,175,88,168,80,244,234,
214,116,79,174,233,213,231,230,173,232,44,215,117,122,235,
22,11,245,89,203,95,176,156,169,81,160,127,12,246,111,23,196,
73,236,216,67,31,45,164,118,123,183,204,187,62,90,251,96,
177,134,59,82,161,108,170,85,41,157,151,178,135,144,97,190,
220,252,188,149,207,205,55,63,91,209,83,57,132,60,65,162,109,
71,20,42,158,93,86,242,211,171,68,17,146,217,35,32,46,137,
180,124,184,38,119,153,227,165,103,74,237,222,197,49,254,
24,13,99,140,128,192,247,112,7,

};

word8 Alogtable[256]=
{
1,3,5,15,17,51,85,255,26,46,114,150,161,248,19,53,95,225,
56,72,216,115,149,164,247,2,6,10,30,34,102,170,229,52,92,
228,55,89,235,38,106,190,217,112,144,171,230,49,83,245,4,12,
20,60,68,204,79,209,104,184,211,110,178,205,76,212,103,169,
224,59,77,215,98,166,241,8,24,40,120,136,131,158,185,208,107,
189,220,127,129,152,179,206,73,219,118,154,181,196,87,249,
16,48,80,240,11,29,39,105,187,214,97,163,254,25,43,125,135,
146,173,236,47,113,147,174,233,32,96,160,251,22,58,78,210,
109,183,194,93,231,50,86,250,21,63,65,195,94,226,61,71,201,
64,192,91,237,44,116,156,191,218,117,159,186,213,100,172,239,
42,126,130,157,188,223,122,142,137,128,155,182,193,88,232,
35,101,175,234,37,111,177,200,67,197,84,252,31,33,99,165,
244,7,9,27,45,119,153,176,203,70,202,69,207,74,222,121,139,
134,145,168,227,62,66,198,81,243,14,18,54,90,238,41,123,141,
140,143,138,133,148,167,242,13,23,57,75,221,124,132,151,162,
253,28,36,108,199,82,246,1,
};

word8 S[256]=
{
99,124,119,123,242,107,111,197,48,1,103,43,254,215,171,
118,202,130,201,125,250,89,71,240,173,212,162,175,156,164,
114,192,183,253,147,38,54,63,247,204,52,165,229,241,113,216,
49,21,4,199,35,195,24,150,5,154,7,18,128,226,235,39,178,117,
9,131,44,26,27,110,90,160,82,59,214,179,41,227,47,132,83,209,
0,237,32,252,177,91,106,203,190,57,74,76,88,207,208,239,
170,251,67,77,51,133,69,249,2,127,80,60,159,168,81,163,64,143,
146,157,56,245,188,182,218,33,16,255,243,210,205,12,19,236,
95,151,68,23,196,167,126,61,100,93,25,115,96,129,79,220,
34,42,144,136,70,238,184,20,222,94,11,219,224,50,58,10,73,6,
36,92,194,211,172,98,145,149,228,121,231,200,55,109,141,213,
78,169,108,86,244,234,101,122,174,8,186,120,37,46,28,166,
180,198,232,221,116,31,75,189,139,138,112,62,181,102,72,3,246,
14,97,53,87,185,134,193,29,158,225,248,152,17,105,217,142,
148,155,30,135,233,206,85,40,223,140,161,137,13,191,230,66,
104,65,153,45,15,176,84,187,22,
};

word8 Si[256]=
{
82,9,106,213,48,54,165,56,191,64,163,158,129,243,215,251,
124,227,57,130,155,47,255,135,52,142,67,68,196,222,233,203,
84,123,148,50,166,194,35,61,238,76,149,11,66,250,195,78,8,
46,161,102,40,217,36,178,118,91,162,73,109,139,209,37,114,
248,246,100,134,104,152,22,212,164,92,204,93,101,182,146,108,
112,72,80,253,237,185,218,94,21,70,87,167,141,157,132,144,
216,171,0,140,188,211,10,247,228,88,5,184,179,69,6,208,44,
30,143,202,63,15,2,193,175,189,3,1,19,138,107,58,145,17,65,
79,103,220,234,151,242,207,206,240,180,230,115,150,172,116,
34,231,173,53,133,226,249,55,232,28,117,223,110,71,241,26,
113,29,41,197,137,111,183,98,14,170,24,190,27,252,86,62,75,
198,210,121,32,154,219,192,254,120,205,90,244,31,221,168,51,
136,7,199,49,177,18,16,89,39,128,236,95,96,81,127,169,25,181,
74,13,45,229,122,159,147,201,156,239,160,224,59,77,174,42,
245,176,200,235,187,60,131,83,153,97,23,43,4,126,186,119,
214,38,225,105,20,99,85,33,12,125,
};

word32 Rc[30]=
{
0x00,0x01,0x02,0x04,0x08,0x10,0x20,0x40,0x80,0x1B,0x36,
0x6C,0xD8,0xAB,0x4D,0x9A,0x2F,0x5E,0xBC,0x63,0x97,0x35,
0x6A,0xD4,0xB3,0x7D,0xFA,0xEF,0xC5
};

#define MAXBC 8
#define MAXKC 8
#define MAXROUNDS 14

static word8 shifts[5][4]={
0,1,2,3,
0,1,2,3,
0,1,2,3,
0,1,2,4,
0,1,3,4,};

static int numrounds[5][5]={
10,11,12,13,14,
11,11,12,13,14,
12,12,12,13,14,
13,13,13,13,14,
14,14,14,14,14,};

int BC,KC,ROUNDS;

word8 mul(word8 a, word8 b){
//multiply two elements of GF(256)
//required for MixColumns and InvMixColumns
if (a&&b) return Alogtable[(Logtable[a]+Logtable[b])%255];
else return 0;
}

void AddRoundKey(word8 a[4][MAXBC],word8 rk[4][MAXBC])
{
//XOR corresponding text input and round key input bytes
int i,j;
for(i=0;i<4;i++)
for(j=0;j<BC;j++)
a[i][j]^=rk[i][j];
}

void SubBytes(word8 a[4][MAXBC],word8 box[256]){
//replace every byte if the input by the byte at that place
//in the non-linear S-box
int i,j;
for(i=0;i<4;i++)
for(j=0;i<BC;j++)
a[i][j]=box[a[i][j]];
}

void ShiftRows(word8 a[4][MAXBC],word8 d){
//row 0 remains unchanged
//the other three rows are shifted a variable amount
word8 tmp[MAXBC];
int i,j;
if(d==0){
for(i=0;i<4;i++){
for(j=0;j<BC;j++)
tmp[j]=a[i][(j+shifts[BC-4][i])%BC];
for(j=0;j<BC;j++) a[i][j]=tmp[j];
}
}
else {
for (i=0;i<4;i++){
for(j=0;j<BC;j++)
tmp[j]=a[i][(BC+j-shifts[BC-4][i])%BC];
for(j=0;j<BC;j++)
a[i][j]=tmp[j];
}
}
}

int main()
{
return 0;
}

密碼製作者Joan Daemen和Vincent Rijmen的書上看到的,版權歸出版商和作者,轉載請註明出處

⑼ 初學者,求高手給一個完整的AES加密解密演算法的程序(C/C++) 希望能滿足如下要求

/*128bits密鑰長度及分組長度AES加解密代碼
*作者:Jeffrey.zhu
*/

⑽ 誰知道哪裡有AES演算法加密,解密c++/C語言代碼

推薦用java,因為有現成的class給你用。。。如果用C++有好多東西需要自己寫。可能java裡面20行能搞定加密和解密的所有步驟,如果C++自己把所有演算法加上各種數據類型轉換之類的,無法估計多多少倍的代碼了。前提還是你已經會寫如果做密鑰。

熱點內容
怎樣用windows伺服器搭建網站 發布:2025-02-08 12:27:38 瀏覽:530
android獲取音樂 發布:2025-02-08 12:26:05 瀏覽:961
存儲的數據可以復制嗎 發布:2025-02-08 12:20:22 瀏覽:852
scraino編程 發布:2025-02-08 11:59:41 瀏覽:265
我的世界伺服器進不去該怎麼辦 發布:2025-02-08 11:47:41 瀏覽:236
linux的telnet 發布:2025-02-08 11:47:36 瀏覽:288
壓縮袋打折 發布:2025-02-08 11:46:02 瀏覽:259
c語言結構體題目 發布:2025-02-08 11:46:01 瀏覽:339
如何svn限制一些外網不能訪問 發布:2025-02-08 11:46:00 瀏覽:992
伺服器外網ip咋配置 發布:2025-02-08 11:42:19 瀏覽:643