shift cipher code(이동 암호 코드) Decoding

 

1. shift cipher 복호화 하기(Decoding)

저번에 만들었던 문장을 복호화 해보겠습니다.

Mnxytwd tk Lttlqj

Kwtr Bnpnujinf, ymj kwjj jshdhqtujinf

Ozru yt sfanlfyntsOzru yt xjfwhm

Ymj Lttlqj htrufsd bfx tkknhnfqqd qfzshmji ns 1998 gd Qfwwd Uflj fsi Xjwljd Gwns yt rfwpjy Lttlqj Xjfwhm, bmnhm mfx gjhtrj ymj rtxy bnijqd zxji bjg-gfxji xjfwhm jslnsj. Uflj fsi Gwns, xyzijsyx fy Xyfsktwi Zsnajwxnyd ns Hfqnktwsnf, ijajqtuji f xjfwhm fqltwnymr – fy knwxy pstbs fx "GfhpWzg" – ns 1996. Ymj xjfwhm jslnsj xtts uwtaji xzhhjxxkzq fsi ymj jcufsinsl htrufsd rtaji xjajwfq ynrjx, knsfqqd xjyyqnsl fy Rtzsyfns Anjb ns 2003. Ymnx rfwpji f umfxj tk wfuni lwtbym, bnym ymj htrufsd rfpnsl nyx nsnynfq uzgqnh tkkjwnsl ns 2004 fsi vznhpqd gjhtrnsl tsj tk ymj btwqi'x qfwljxy rjinf htrufsnjx. Ymj htrufsd qfzshmji Lttlqj Sjbx ns 2002, Lrfnq ns 2004, Lttlqj Rfux ns 2005, Lttlqj Hmwtrj ns 2008, fsi ymj xthnfq sjybtwp pstbs fx Lttlqj+ ns 2011, ns fiinynts yt rfsd tymjw uwtizhyx. Ns 2015, Lttlqj gjhfrj ymj rfns xzgxninfwd tk ymj mtqinsl htrufsd Fqumfgjy Nsh.

Ymj xjfwhm jslnsj bjsy ymwtzlm szrjwtzx zuifyjx ns fyyjruyx yt htrgfy xjfwhm jslnsj tuynrnefynts fgzxj, uwtanij idsfrnh zuifynsl tk wjxzqyx, fsi rfpj ymj nsijcnsl xdxyjr wfuni fsi kqjcngqj. Xjfwhm wjxzqyx xyfwyji yt gj ujwxtsfqneji ns 2005, fsi qfyjw Lttlqj Xzlljxy fzythtruqjynts bfx nsywtizhji. Kwtr 2007 Zsnajwxfq Xjfwhm uwtaniji fqq ydujx tk htsyjsy, sty ozxy yjcy htsyjsy, ns xjfwhm wjxzqyx.

Lttlqj mfx jslflji ns ufwysjwxmnux bnym SFXF, FTQ, Xzs Rnhwtxdxyjrx, Sjbx Htwutwfynts, Xpd ZP fsi tymjwx. Ymj htrufsd xjy zu f hmfwnyfgqj tkkxmtty, Lttlqj.twl, ns 2005. Lttlqj bfx nsatqaji ns f 2006 qjlfq inxuzyj ns ymj ZX tajw f htzwy twijw yt inxhqtxj ZWQx fsi xjfwhm xywnslx, fsi mfx gjjs ymj xzgojhy tk yfc fatnifshj nsajxynlfyntsx ns ymj ZP.

Ymj sfrj Lttlqj nx f afwnfsy tk lttltq, hmtxjs yt xzlljxy ajwd qfwlj szrgjwx.

 

1부터 26까지 숫자를 사용해서 복호화를 할 수 있습니다.

History of Google

From Wikipedia, the free encyclopedia

Jump to navigationJump to search

The Google company was officially launched in 1998 by Larry Page and Sergey Brin to market Google Search, which has become the most widely used web-based search engine. Page and Brin, students at Stanford University in California, developed a search algorithm – at first known as "BackRub" – in 1996. The search engine soon proved successful and the expanding company moved several times, finally settling at Mountain View in 2003. This marked a phase of rapid growth, with the company making its initial public offering in 2004 and quickly becoming one of the world's largest media companies. The company launched Google News in 2002, Gmail in 2004, Google Maps in 2005, Google Chrome in 2008, and the social network known as Google+ in 2011, in addition to many other products. In 2015, Google became the main subsidiary of the holding company Alphabet Inc.

The search engine went through numerous updates in attempts to combat search engine optimization abuse, provide dynamic updating of results, and make the indexing system rapid and flexible. Search results started to be personalized in 2005, and later Google Suggest autocompletion was introduced. From 2007 Universal Search provided all types of content, not just text content, in search results.

Google has engaged in partnerships with NASA, AOL, Sun Microsystems, News Corporation, Sky UK and others. The company set up a charitable offshoot, Google.org, in 2005. Google was involved in a 2006 legal dispute in the US over a court order to disclose URLs and search strings, and has been the subject of tax avoidance investigations in the UK.

The name Google is a variant of googol, chosen to suggest very large numbers.

key값을 5를 사용해서 복호화한 결과입니다.

 

2. 이동 암호 코드(shift cipher code) decoder

비주얼스튜디오 2017에서 C언어로 구현했습니다. 

#include<stdio.h>

int decoder_key(int key); 

int main()

{

char s[1024]; // 파일의 문장을 담을 문자열

int as;         // 아스키 값을 담을 변수

char c;         // 아스키 값을 문자로

int input_key;

int de_key;

// 1~26까지 대입해서 값 추출

printf("복호화할 키 값 입력(1~26):");

scanf("%d", &input_key);

// 디코딩 키 값을 추출하는 함수

de_key = decoder_key(input_key);

FILE *fp1, *fp2;

// ./ <- 현재 디렉토리위치

fp1 = fopen("./\\Encrypted_Test_file.txt", "r");

fp2 = fopen("./\\Decoder_Test_file.txt", "w");

while(1)

{

// 파일의 값이 마지막 위치라면 반복문 종료

// 종료를 안하면 무한으로 줄바꿈 현상

if (feof(fp1))

{

break;

}

// 메모장의 문자열을 한문장씩 읽어서 s문자열에 저장

fgets(s, sizeof(s), fp1);

// 가져온 문자열로 디코딩 하기

for (int i = 0; i < sizeof(s); i++)

{

// s[i]가 소문자 알파벳일때

if (s[i] >= 'a' && s[i] <= 'z')

{

as = s[i];

as = as - 97 + de_key;

as = as % 26;

as = as + 97;

c = as;

s[i] = c;

}

// s[i]가 대문자 알파벳일때

else if (s[i] >= 'A' && s[i] <= 'Z')

{

as = s[i];

as = as - 65 + de_key;

as = as % 26;

as = as + 65;

c = as;

s[i] = c;

}

}

printf("%s", s);

fputs(s , fp2);

}

fclose(fp1, fp2);

return 0;

}

int decoder_key(int key)

{

// 디코딩은 키 값이 왼쪽으로 이동하기 때문에

// 오른쪽으로 이동해서 한바퀴를 돌 수 있는 값을 넣었습니다.

switch (key)

{

case 1:  key = key + 24; break;

case 2:  key = key + 22; break;

case 3:  key = key + 20; break;

case 4:  key = key + 18; break;

case 5:  key = key + 16; break;

case 6:  key = key + 14; break;

case 7:  key = key + 12; break;

case 8:  key = key + 10; break;

case 9:  key = key + 8; break;

case 10: key = key + 6; break;

case 11: key = key + 4; break;

case 12: key = key + 2; break;

case 13: key = key + 0; break;

case 14: key = key - 2; break;

case 15: key = key - 4; break;

case 16: key = key - 6; break;

case 17: key = key - 8; break;

case 18: key = key - 10; break;

case 19: key = key - 12; break;

case 20: key = key - 14; break;

case 21: key = key - 16; break;

case 22: key = key - 18; break;

case 23: key = key - 20; break;

case 24: key = key - 22; break;

case 25: key = key - 24; break;

case 26: key = key - 26; break;

}

return key;

}

Encrypted_Test_file.txt

Decoder_Test_file.txt

 여러분의 공감과 댓글은 제게 큰 힘이 됩니다.