SHA1 테스트 코드

이만영 교수님의 Internet security 책을 참고하여 C로 작성한 코드

  #include <stdio.h> #include <stdlib.h> typedef unsigned long uint32_t; uint32_t H0 = 0x67452301; uint32_t H1 = 0xefcdab89; uint32_t H2 = 0x98badcfe; uint32_t H3 = 0x10325476; uint32_t H4 = 0xc3d2e1f0; uint32_t K0_19 = 0x5a827999; uint32_t K20_39 = 0x6ed9eba1; uint32_t K40_59 = 0x8f1bbcdc; uint32_t K60_79 = 0xca62c1d6; uint32_t M[16]; uint32_t W[80]; uint32_t A, B, C, D, E; uint32_t f0_19(uint32_t B, uint32_t C, uint32_t D) { return (B&C) | (~B & D); } uint32_t f20_39(uint32_t B, uint32_t C, uint32_t D) { return (B^C^D); } uint32_t f40_59(uint32_t B, uint32_t C, uint32_t D) { return (B&C) | (B&D) | (C&D); } uint32_t f60_79(uint32_t B, uint32_t C, uint32_t D) { return (B^C^D); } uint32_t S(uint32_t t, uint32_t n) { uint32_t i; for(i=0; i < n; i++) { if(t & 0x80000000) { t = t <<1; t = t | 1; } else { t = t <<1; } } return t; } void generate_message_digest(void) { int t = 0; uint32_t TEMP; A = H0; B = H1; C = H2; D = H3; E = H4; for(t=0; t < 80; t++) { if(t >= 0 && t < 16) { W[t] = M[t]; } else { W[t] = S(W[t-16] ^ W[t-14] ^ W[t-8] ^ W[t-3],1); } } printf(" t A B C D E\n"); printf("---------------------------------------------------------\n"); for(t=0; t < 80; t++) { if(t >= 0 && t < 20) { TEMP = S(A,5) + f0_19(B,C,D) + E + W[t] + K0_19; } else if(t >= 20 && t < 40) { TEMP = S(A,5) + f20_39(B,C,D) + E + W[t] + K20_39; } else if(t >= 40 && t < 60) { TEMP = S(A,5) + f40_59(B,C,D) + E + W[t] + K40_59; } else if(t >= 60 && t < 80) { TEMP = S(A,5) + f60_79(B,C,D) + E + W[t] + K60_79; } E=D; D=C; C=S(B,30); B=A; A=TEMP; printf(" %2u %08X %08X %08X %08X %08X\n", t, A,B,C,D,E); } printf("---------------------------------------------------------\n"); H0 += A; H1 += B; H2 += C; H3 += D; H4 += E; } void padding(uint32_t data[16], uint32_t bits) { int n = (bits / 32)+1; int r = bits % 32; int t, j; for(t=0; t < 14; t++) { if(t < (n-1)) M[t] = data[t]; else if(t == (n-1)) { for(j=0; j < r; j++) { M[t] |= (((data[t] >> (31 - j)) & 0x1) << (31 - j)); } M[t] |= (1 << (31-j)); } else { M[t] = 0; } } M[14] = 0; M[15] = bits; } uint32_t PlainText[16] = {0}; int main(int argc, char *argv[]) { int i = 0; uint32_t PlainTextLen = 0; uint32_t temp_msg[16+1] = {0}; if(argc == 1) { /* Use sample data */ printf("Usage: %s Plaintexts Plaintext_length\n" "Example:\n" "%s 0x135af247 0xc613e815 64\n" "<CAUTION!!>\n" "Each Plaintext data is in 64 bits.\n" "If your data is shorter than 64 bits, please pad 0 to that like:\n" " data: 0x33 input_data: 0x33000000\n" , argv[0], argv[0]); return 0; } else { for(i=1; i < argc && i < 17; i++) { if(i == (argc - 1)) { PlainTextLen = (uint32_t)strtoul(argv[i], NULL, 10); } else { temp_msg[i-1] = (uint32_t)strtoul(argv[i], NULL, 16); } } for(i=0; i < 16; i++) { if(0 == temp_msg[i]) break; PlainText[i] = temp_msg[i]; } } for(i=0; i < 16; i++) M[i] = 0; for(i=0; i < 80; i++) W[i] = 0; printf("---------------------------------------------------------\n"); printf("PlainText Message: (Message Length=%u)\n", PlainTextLen); printf("---------------------------------------------------------\n"); for(i=0; i < 16; i++) { if(0 != PlainText[i]) printf("%08X ", PlainText[i]); else break; } printf("\n\n---------------------------------------------------------\n"); printf("Now Start Padding data...\n"); padding(PlainText, PlainTextLen); printf("Padding is done\n"); printf("---------------------------------------------------------\n"); for(i=0; i<16; i++) { if(i%4 == 0 && i != 0) { printf("\n"); } printf("%08X ", M[i]); } printf("\n\n"); printf("---------------------------------------------------------\n"); generate_message_digest(); printf("\n"); printf("H0=%08X H1=%08X H2=%08X H3=%08X H4=%08X\n",H0,H1,H2,H3,H4); printf("\n"); printf("Message Digest = %08X%08X%08X%08X%08X\n", H0,H1,H2,H3,H4); return 0; }