KASUMI 알고리즘

KASUMI encryption 코드를 C로 구현한 것.

이만영 교수님의 Mobile communication System and Security 예제 5.4의 내용을 C로 구현한 것임.

gcc에서 컴파일 및 테스트 수행.

 

#include <stdio.h> #include <string.h> #include <stdlib.h> typedef unsigned long long uint64_t; typedef long long int64_t; typedef unsigned int uint32_t; typedef int int32_t; typedef unsigned short int uint16_t; typedef short int int16_t; typedef unsigned char uint8_t; #define ROL16(x, y) ((((x)<<(y)) | ((x)>>(16-(y)))) & 0xFFFF) #define ZE(x) (x) #define TR(x) (x & 0x7f) static const uint16_t S7[128] = { 54, 50, 62, 56, 22, 34, 94, 96, 38, 6, 63, 93, 2, 18,123, 33, 55,113, 39,114, 21, 67, 65, 12, 47, 73, 46, 27, 25,111,124, 81, 53, 9,121, 79, 52, 60, 58, 48,101,127, 40,120,104, 70, 71, 43, 20,122, 72, 61, 23,109, 13,100, 77, 1, 16, 7, 82, 10,105, 98, 117,116, 76, 11, 89,106, 0,125,118, 99, 86, 69, 30, 57,126, 87, 112, 51, 17, 5, 95, 14, 90, 84, 91, 8, 35,103, 32, 97, 28, 66, 102, 31, 26, 45, 75, 4, 85, 92, 37, 74, 80, 49, 68, 29,115, 44, 64,107,108, 24,110, 83, 36, 78, 42, 19, 15, 41, 88,119, 59, 3 }; static const uint16_t S9[512] = { 167,239,161,379,391,334, 9,338, 38,226, 48,358,452,385, 90,397, 183,253,147,331,415,340, 51,362,306,500,262, 82,216,159,356,177, 175,241,489, 37,206, 17, 0,333, 44,254,378, 58,143,220, 81,400, 95, 3,315,245, 54,235,218,405,472,264,172,494,371,290,399, 76, 165,197,395,121,257,480,423,212,240, 28,462,176,406,507,288,223, 501,407,249,265, 89,186,221,428,164, 74,440,196,458,421,350,163, 232,158,134,354, 13,250,491,142,191, 69,193,425,152,227,366,135, 344,300,276,242,437,320,113,278, 11,243, 87,317, 36, 93,496, 27, 487,446,482, 41, 68,156,457,131,326,403,339, 20, 39,115,442,124, 475,384,508, 53,112,170,479,151,126,169, 73,268,279,321,168,364, 363,292, 46,499,393,327,324, 24,456,267,157,460,488,426,309,229, 439,506,208,271,349,401,434,236, 16,209,359, 52, 56,120,199,277, 465,416,252,287,246, 6, 83,305,420,345,153,502, 65, 61,244,282, 173,222,418, 67,386,368,261,101,476,291,195,430, 49, 79,166,330, 280,383,373,128,382,408,155,495,367,388,274,107,459,417, 62,454, 132,225,203,316,234, 14,301, 91,503,286,424,211,347,307,140,374, 35,103,125,427, 19,214,453,146,498,314,444,230,256,329,198,285, 50,116, 78,410, 10,205,510,171,231, 45,139,467, 29, 86,505, 32, 72, 26,342,150,313,490,431,238,411,325,149,473, 40,119,174,355, 185,233,389, 71,448,273,372, 55,110,178,322, 12,469,392,369,190, 1,109,375,137,181, 88, 75,308,260,484, 98,272,370,275,412,111, 336,318, 4,504,492,259,304, 77,337,435, 21,357,303,332,483, 18, 47, 85, 25,497,474,289,100,269,296,478,270,106, 31,104,433, 84, 414,486,394, 96, 99,154,511,148,413,361,409,255,162,215,302,201, 266,351,343,144,441,365,108,298,251, 34,182,509,138,210,335,133, 311,352,328,141,396,346,123,319,450,281,429,228,443,481, 92,404, 485,422,248,297, 23,213,130,466, 22,217,283, 70,294,360,419,127, 312,377, 7,468,194, 2,117,295,463,258,224,447,247,187, 80,398, 284,353,105,390,299,471,470,184, 57,200,348, 63,204,188, 33,451, 97, 30,310,219, 94,160,129,493, 64,179,263,102,189,207,114,402, 438,477,387,122,192, 42,381, 5,145,118,180,449,293,323,136,380, 43, 66, 60,455,341,445,202,432, 8,237, 15,376,436,464, 59,461}; static const uint16_t C[9] = { 0, 0x0123,0x4567,0x89AB,0xCDEF, 0xFEDC,0xBA98,0x7654,0x3210 }; uint8_t CA = 0x00; uint8_t CB = 0x15; /* Bearer */ uint32_t CC = 0x398a59b4; /* Count */ uint8_t CD = 1; /* Uplink Direction */ uint16_t CE = 0x00; uint64_t A = 0; uint64_t CK[2] = {0xd3c5d592327fb11c, 0x4035c6680af8c6d1}; uint64_t KM[2] = {0x5555555555555555, 0x5555555555555555}; uint64_t ModifiedCK[2]; uint16_t K[9] = {0}; uint16_t Kprime[9] = {0}; uint16_t KL[9][3]; uint16_t KO[9][4]; uint16_t KI[9][4]; uint32_t L[9] = {0}, R[9] = {0}; char *get_bin_str(uint16_t num, uint8_t bit) { static uint8_t buf[32] = {0}; int8_t i; buf[0] = '\0'; for(i=(bit-1); i >= 0; i--) { if(((num >> i) & 1) == 1) strcat(buf, "1"); else strcat(buf, "0"); if(i==0)break; } strcat(buf, "b"); return buf; } static uint32_t FL(uint32_t I, uint16_t round_num) { uint16_t FLL[2], FLR[2]; printf("Computation of FL%u function\n\n", round_num); FLL[0] = (uint16_t)(I>>16); FLR[0] = (uint16_t)(I)&0xFFFF; printf("FLL0 = %X\n", FLL[0]); printf("FLR0 = %X\n", FLR[0]); FLR[1] = (ROL16((FLL[0] & KL[round_num][1]),1)) ^ FLR[0]; FLL[1] = FLL[0] ^ (ROL16((FLR[1] | KL[round_num][2]),1)); printf("FLR1 = ((FLL0 AND KL%u1) <<< 1) XOR FLR0\n", round_num); printf(" = ((%04X AND %04X) <<< 1) XOR %04X\n", FLL[0], KL[round_num][1], FLR[0]); printf(" = %04X\n", FLR[1]); printf("FLL1 = FLL0 XOR ((FLR1 OR KL%u2) <<< 1)\n", round_num); printf(" = %04X XOR ((%04X OR %04X) <<< 1)\n", FLL[0], FLR[1], KL[round_num][2]); printf(" = %04X\n", FLL[1]); printf("Output of FL%u = FLL1 || FLR1 = %X\n", round_num, ((uint32_t)FLL[1] << 16) + FLR[1]); return ((uint32_t)FLL[1] << 16) + FLR[1]; } static uint16_t FI(uint16_t I, uint16_t round_num, uint16_t subround_num) { uint16_t FIL[5], FIR[5]; uint16_t KI1, KI2; printf("Computation of FI%u%u\n", round_num, subround_num); KI1 = KI[round_num][subround_num] >> 9; KI2 = KI[round_num][subround_num] & 0x1ff; printf("KI%u%u = %04X\n", round_num, subround_num, KI[round_num][subround_num]); printf("KI%u%u1 = KI%u%u >> 9 = %X\n", round_num, subround_num,round_num, subround_num, KI1); printf("KI%u%u2 = KI%u%u & 1FF = %X\n", round_num, subround_num,round_num, subround_num, KI2); FIL[0] = (uint16_t)(I>>7)&0x1FF; FIR[0] = (uint16_t)(I&0x7F); printf("FIL0 = %X\n", FIL[0]); printf("FIR0 = %X\n", FIR[0]); FIR[1] = (uint16_t)(S9[FIL[0]] ^ ZE(FIR[0])); FIL[1] = FIR[0]; printf("FIR1 = S9[FIL0] XOR ZE[FIR0]\n"); printf(" = S9[%X] XOR ZE[%X]\n", FIL[0], FIR[0]); printf(" = %X XOR %X\n", S9[FIL[0]], ZE(FIR[0])); printf(" = %s XOR ", get_bin_str(S9[FIL[0]], 9)); printf("%s\n", get_bin_str(ZE(FIR[0]), 9)); printf(" = %X\n", FIR[1]); printf("FIL1 = FIR0 = %X\n", FIL[1]); FIR[2] = (S7[FIL[1]] ^ TR(FIR[1])) ^ KI1; FIL[2] = (FIR[1] ^ KI2); printf("FIR2 = (S7[FIL1] XOR TR[FIR1]) XOR KI%u%u1\n", round_num, subround_num); printf(" = (S7[%X] XOR TR[%X]) XOR %X\n", FIL[1], FIR[1], KI1); printf(" = (%X XOR %X) XOR %X\n", S7[FIL[1]], TR(FIR[1]), KI1); printf(" = (%s XOR ", get_bin_str(S7[FIL[1]], 7)); printf("%s) XOR ", get_bin_str(TR(FIR[1]), 7)); printf("%s\n", get_bin_str(KI1,7)); printf(" = %X XOR %X\n", S7[FIL[1]] ^ TR(FIR[1]), KI1); printf(" = %X\n", FIR[2]); printf("FIL2 = FIR1 XOR KI%u%u2\n", round_num, subround_num); printf(" = %X XOR %X\n", FIR[1], KI2); printf(" = %X\n", FIL[2]); FIL[3] = FIR[2]; FIR[3] = S9[FIL[2]] ^ ZE(FIR[2]); printf("FIL3 = FIR2 = %X\n", FIL[3]); printf("FIR3 = S9[FIL2] XOR ZE(FIR2)\n"); printf(" = S9[%X] XOR ZE(%X)\n", FIL[2], FIR[2]); printf(" = %X XOR %X\n", S9[FIL[2]], ZE(FIR[2])); printf(" = %s XOR ", get_bin_str(S9[FIL[2]], 9)); printf("%s\n", get_bin_str(ZE(FIR[2]), 9)); printf(" = %X\n", FIR[3]); FIR[4] = FIR[3]; FIL[4] = S7[FIL[3]] ^ TR(FIR[3]); printf("FIR4 = FIR3 = %X\n", FIR[4]); printf("FIL4 = S7[FIL3] XOR TR(FIR3)\n"); printf(" = S7[%X] XOR TR(%X)\n", FIL[3], FIR[3]); printf(" = %X XOR %X\n", S7[FIL[3]], TR(FIR[3])); printf(" = %s XOR ", get_bin_str(S7[FIL[3]], 7)); printf("%s\n", get_bin_str(TR(FIR[3]), 7)); printf(" = %X\n", FIL[4]); printf("FI%u%u = FIL4 || FIR4 = %X || %X = %04X\n", round_num, subround_num, FIL[4], FIR[4], (FIL[4]<<9)+FIR[4]); return (FIL[4]<<9)+FIR[4]; } static uint32_t FO(uint32_t I, uint16_t round_num) { uint16_t FOL[4], FOR[4]; printf("Computation of FO%u\n", round_num); FOL[0] = I >> 16; FOR[0] = I & 0xFFFF; printf("FOL0 = %04X\n", FOL[0]); printf("FOR0 = %04X\n", FOR[0]); FOL[1] = FOR[0]; printf("FOL1 = FOR0 = %04X\n", FOL[1]); printf("FOR1 = FI%u%u(FOL0 XOR KO%u%u) ^ FOR0\n", round_num, 1, round_num, 1); printf(" = FI%u%u(%04X XOR %04X) ^ %04X\n", round_num, 1, FOL[0], KO[round_num][1], FOR[0]); FOR[1] = FI(FOL[0] ^ KO[round_num][1], round_num, 1) ^ FOR[0]; printf("FOR1 = %04X\n", FOR[1]); FOL[2] = FOR[1]; printf("FOL2 = FOR1 = %04X\n", FOL[2]); printf("FOR2 = FI%u%u(FOL0 XOR KO%u%u) ^ FOR0\n", round_num, 2, round_num, 2); printf(" = FI%u%u(%04X XOR %04X) ^ %04X\n", round_num, 2, FOL[1], KO[round_num][2], FOR[1]); FOR[2] = FI(FOL[1] ^ KO[round_num][2], round_num, 2) ^ FOR[1]; printf("FOR2 = %04X\n", FOR[2]); FOL[3] = FOR[2]; printf("FOL3 = FOR2 = %04X\n", FOL[3]); printf("FOR3 = FI%u%u(FOL0 XOR KO%u%u) ^ FOR0\n", round_num, 3, round_num, 3); printf(" = FI%u%u(%04X XOR %04X) ^ %04X\n", round_num, 3, FOL[2], KO[round_num][3], FOR[2]); FOR[3] = FI(FOL[2] ^ KO[round_num][3], round_num, 3) ^ FOR[2]; printf("FOR3 = %04X\n", FOR[3]); printf("The final output for FO%u is\n", round_num); printf(" FOL3 || FOR3 = %X\n", (FOL[3] << 16) + FOR[3]); return (FOL[3] << 16) + FOR[3]; } int main(void) { int i=0; printf("CA:%X\n",CA); printf("CB:%X\n",CB); printf("CC:%X\n",CC); printf("CD:%X\n",CD); printf("CE:%X\n",CE); A = 0; A = ((uint64_t)CC << 32) | ((uint64_t)CB << 27) | ((uint64_t)CD << 26) | ((uint64_t)CA << 16) | (uint64_t)CE; printf("First of all, Generate a 64-bit value A\n"); printf(" CC || CB || CD || 00 || CA || CE = %llX\n", A); ModifiedCK[0] = CK[0] ^ KM[0]; ModifiedCK[1] = CK[1] ^ KM[1]; printf("Modified CK = CK XOR KM \n= %llX%llX XOR %llX%llX\n= %llX%llX\n", CK[0], CK[1], KM[0], KM[0], ModifiedCK[0], ModifiedCK[1]); K[1] = (ModifiedCK[0] >> 48) & 0xFFFF; K[2] = (ModifiedCK[0] >> 32) & 0xFFFF; K[3] = (ModifiedCK[0] >> 16) & 0xFFFF; K[4] = (ModifiedCK[0] >> 00) & 0xFFFF; K[5] = (ModifiedCK[1] >> 48) & 0xFFFF; K[6] = (ModifiedCK[1] >> 32) & 0xFFFF; K[7] = (ModifiedCK[1] >> 16) & 0xFFFF; K[8] = (ModifiedCK[1] >> 00) & 0xFFFF; for(i=1; i <= 8; i++) { printf("K%d = %X\n", i, K[i]); } for(i=1; i <= 8; i++) Kprime[i] = K[i] ^ C[i]; for(i=1; i <= 8; i++) printf("K'%d = K%d XOR C%d = %X\n", i, i, i, Kprime[i]); for(i=1; i <= 8; i++) KL[i][1] = ROL16(K[i],1); for(i=1; i <= 8; i++) KL[i][2] = Kprime[ (i+1)%8 + 1 ]; for(i=1; i <= 8; i++) KO[i][1] = ROL16(K[ (i)%8 + 1 ],5); for(i=1; i <= 8; i++) KO[i][2] = ROL16(K[ (i+4)%8 + 1 ],8); for(i=1; i <= 8; i++) KO[i][3] = ROL16(K[ (i+5)%8 + 1 ],13); for(i=1; i <= 8; i++) KI[i][1] = Kprime[ (i+3)%8 + 1 ]; for(i=1; i <= 8; i++) KI[i][2] = Kprime[ (i+2)%8 + 1 ]; for(i=1; i <= 8; i++) KI[i][3] = Kprime[ (i+6)%8 + 1 ]; printf(" %3d%3s%3d%3s%3d%3s%3d%3s%3d%3s%3d%3s%3d%3s%3d%3s\n",1,"",2,"",3,"",4,"",5,"",6,"",7,"",8,""); printf("KLi,1 "); for(i=1; i <= 8; i++) printf("%04X ", KL[i][1]); printf("\n"); printf("KLi,2 "); for(i=1; i <= 8; i++) printf("%04X ", KL[i][2]); printf("\n"); printf("KOi,1 "); for(i=1; i <= 8; i++) printf("%04X ", KO[i][1]); printf("\n"); printf("KOi,2 "); for(i=1; i <= 8; i++) printf("%04X ", KO[i][2]); printf("\n"); printf("KOi,3 "); for(i=1; i <= 8; i++) printf("%04X ", KO[i][3]); printf("\n"); printf("KIi,1 "); for(i=1; i <= 8; i++) printf("%04X ", KI[i][1]); printf("\n"); printf("KIi,2 "); for(i=1; i <= 8; i++) printf("%04X ", KI[i][2]); printf("\n"); printf("KIi,3 "); for(i=1; i <= 8; i++) printf("%04X ", KI[i][3]); printf("\n"); L[0] = A >> 32; R[0] = A & 0xFFFFFFFF; printf("L0 = %X\n", L[0]); printf("R0 = %X\n", R[0]); for(i=1; i <= 8;) { R[i] = L[i-1]; printf("R%u = L%u = %08X\n", i, i-1, R[i]); L[i] = FO(FL(L[i-1], i), i) ^ R[i-1]; printf("L%u = %08X\n", i, L[i]); i++; R[i] = L[i-1]; printf("R%u = L%u = %08X\n", i, i-1, R[i]); L[i] = FL(FO(L[i-1], i),i) ^ R[i-1]; printf("L%u = %08X\n", i, L[i]); i++; } for(i=1; i <=8; i++) { printf("L%u = %08X R%u = %08X\n", i, L[i], i, R[i]); } return 0; }