#44u61l5f

고전 암호화 방법을 푸는 코드를 작성해 보고 있습니다.
Caesar나 Affin은 비교적 만들기 쉬웠지만,
단문에 대한 Substituiton이나 Vigneere 나 Hill chiper는 아직
공부를 좀 더 해야겠다고 느꼇습니다. ^^;

이건 워드 파일 :

wordlist.txt

Caeasr chiper :

#include "stdafx.h"
#include <windows.h>
#include <conio.h>

#define LIMIT 2

int main(int argc, char* argv[])
{
char tmp1,tmp2;
char alphabet_up[27] = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
char alphabet_lo[27] = "abcdefghijklmnopqrstuvwxyz";
char text_to_decrypt[] = "MAX YTNEM, WXTK UKNMNL, EBXL GHM BG HNK LMTKL UNM BG HNKLXEOXL.";
char tmp_buf[1024] = {0,};
int freq[26] = {0,};
FILE* file;
char buff2[1400] = {0,};
static char wordlist[225][20];
char seps[] = "\n";
char *token;
int cnt;
int result;

printf(":::::::::::: Caeasr Attack 1.0 ::::::::::::::::\n");
printf("::::::::::::::::::::::: Coded by Dual ::::::\n");
printf("::::::::::::::::::::::::::::::::::::::::::::::::\n");

if ((file=fopen("wordlist.txt","rb"))==0) {
printf("[-] Unable to access file.\n");
return 0;
}
fread(buff2,sizeof(char),1400,file);
fclose(file);

cnt = 0;
token = strtok(buff2, seps );
while( token != NULL )
{
strncpy(wordlist[cnt],token,19);
cnt++;
token = strtok( NULL, seps );
}

for(int i = 0; i < 26; i++)
{
tmp1 = alphabet_up[0];
tmp2 = alphabet_lo[0];
for(int j = 0; j < 26; j++)
{
alphabet_up[j] = alphabet_up[j + 1];
alphabet_lo[j] = alphabet_lo[j + 1];
}
alphabet_up[25] = tmp1;
alphabet_lo[25] = tmp2;
for(int k = 0; k < strlen(text_to_decrypt); k++)
{
if(isalpha(text_to_decrypt[k]))
{
if(isupper(text_to_decrypt[k]))
tmp_buf[k] = (alphabet_up[text_to_decrypt[k] - 'A']);
else
tmp_buf[k] = (alphabet_lo[text_to_decrypt[k] - 'a']);
}
else
tmp_buf[k] = (text_to_decrypt[k]);

}
cnt = 0;
for(int l = 0; l < 225; l++)
{
for(int m = 0; m < strlen(tmp_buf); m++)
if(!strnicmp(tmp_buf+m,wordlist[l],strlen(wordlist[l])-1))
cnt++;
}
if(cnt >= LIMIT)
{
printf("---%d point matched---\nresult : \n\n%s\n\n",cnt,tmp_buf);
}
}
return 0;
}

Affin chiper :

#include "stdafx.h"
#include <windows.h>
#include <conio.h>

#define LIMIT 2
#define ABS(a) a<0 ? 26+a : a

int InverseKey(int key)
{
int DecryptionKey[12] = {1, 3, 5, 7, 9, 11, 15, 17, 19, 21, 23, 25};

   for(int i=0;i<12;i++)
   if((key*DecryptionKey[i])%26 == 1)
   return DecryptionKey[i];
}

int main(int argc, char* argv[])
{
int a = 0;
char Buffer[] = "gh sgdqd h vhkk zsszbj sgzs okzbd snmhfgs gz gz gz!!!";
char Decrypt[1024] = {0,};
int tmp;
FILE* file;
char buff2[1400] = {0,};
static char wordlist[225][20];
char seps[] = "\n";
char *token;
int cnt;
int result;

printf(":::::::::::: Affin Attack 1.0 ::::::::::::::::\n");
printf("::::::::::::::::::::::: Coded by Dual ::::::\n");
printf("::::::::::::::::::::::::::::::::::::::::::::::::\n");

if ((file=fopen("wordlist.txt","rb"))==0) {
printf("[-] Unable to access file.\n");
return 0;
}
fread(buff2,sizeof(char),1400,file);
fclose(file);

cnt = 0;
token = strtok(buff2, seps );
while( token != NULL )
{
strncpy(wordlist[cnt],token,19);
cnt++;
token = strtok( NULL, seps );
}

CharLower(Buffer);

for(int i = 0; a < 25; i++)
{
a = (i*2)+1;
for(int b = 0; b < 26; b++)
{
for(int j = 0; j < strlen(Buffer); j++)
{
if(isalpha(Buffer[j]))
{
tmp = ABS((InverseKey(a) * (Buffer[j] - 0x61 - b))%26);
Decrypt[j] = tmp + 0x61;
}
else
Decrypt[j] = Buffer[j];
}

cnt = 0;
for(int l = 0; l < 225; l++)
{
for(int m = 0; m < strlen(Decrypt); m++)
if(!strnicmp(Decrypt+m,wordlist[l],strlen(wordlist[l])-1))
cnt++;
}
if(cnt >= LIMIT)
{
printf("---%d point matched---\nresult : \n\n%s\n\n",cnt,Decrypt);
}
}
}

return 0;
}

XORing :

#include "stdafx.h"
#include <windows.h>
#include <conio.h>

#define LIMIT 1
#define LEN 19

int main(int argc, char* argv[])
{
int a = 0;
char Buffer[LEN] = {0x60,0x5C,0x55,0x51,0x43,0x55,0x10,0x44,0x55,0x5C,0x5C,0x10,0x5D,0x55,0x10,0x49,0x5F,0x45,0x42};
char Decrypt[1024] = {0,};
int tmp;
FILE* file;
char buff2[1400] = {0,};
static char wordlist[225][20];
char seps[] = "\n";
char *token;
int cnt;
int result;

printf(":::::::::::: XORing Attack 1.0 ::::::::::::::::\n");
printf("::::::::::::::::::::::: Coded by Dual ::::::\n");
printf("::::::::::::::::::::::::::::::::::::::::::::::::\n");

if ((file=fopen("wordlist.txt","rb"))==0) {
printf("[-] Unable to access file.\n");
return 0;
}
fread(buff2,sizeof(char),1400,file);
fclose(file);
cnt = 0;
token = strtok(buff2, seps );
while( token != NULL )
{
strncpy(wordlist[cnt],token,19);
cnt++;
token = strtok( NULL, seps );
}

for(char i = 0; i < 127; i++)
{
for(int j = 0; j < LEN; j++)
{
Decrypt[j] = Buffer[j] ^ i;
}
cnt = 0;
for(int l = 0; l < 225; l++)
{
for(int m = 0; m < strlen(Decrypt); m++)
if(!strnicmp(Decrypt+m,wordlist[l],strlen(wordlist[l])-1))
cnt++;
}
if(cnt >= LIMIT)
{
printf("---%d point matched---\nresult : \n\n%s\n\n",cnt,Decrypt);
}

}
return 0;
}

frequency :

#include "stdafx.h"
#include <windows.h>

int main(int argc, char* argv[])
{

char buffer[] = "Dear my friends";
int frequency[26] = {0,};
int sum = 0;
float freq = 0;

CharUpper(buffer);
for(int i = 0; i < strlen(buffer); i++)
{
frequency[buffer[i] - 'A']++;
}

for(int j = 0; j < 26; j++)
{
sum += frequency[j];
}
printf("문자 횟수 확률\n");
for(int k = 0; k < 26; k++)
{
printf(" %c %d %2.4f%%\n",k+'A',frequency[k],(float)((float)(frequency[k]*100)/(float)sum));
}
return 0;
}

(0)

(0)

Posted by Dual

« 2007/04 »
Sun	Mon	Tue	Wed	Thu	Fri	Sat
1	2	3	4	5	6	7
8	9	10	11	12	13	14
15	16	17	18	19	20	21
22	23	24	25	26	27	28
29	30

« 2007/04 »

Sun

Mon

Tue

Wed

Thu

Fri

Sat

Search Results for '2007/04/30'

1 POSTS

Trackbacks List

Comments List

Tag Cloud

Notices