ABOUT ME

-

Today
-
Yesterday
-
Total
-
  • AES의 쉬프트로우,서브바이트 C로구현
    공부/과거 2013. 10. 21. 20:16
    반응형

    AES의 모든과정중 서브바이트와 쉬프트로우만을 구현했습니다.


    #include <stdlib.h>

    #include <stdlib.h>

    #include <string.h>

    /* 타입정의/

    /* 상수정의/

    #define Nb4// AES 블록크기word)

    #define Nk4// AES 키길이word)

    typedef unsigned int WORD;

    typedef unsigned char BYTE;

     

    /* 매크로함수/

    #define HIHEX(x) ( x >> 4 )// 8bit에서상위bit 값을구하는함수

    define LOWHEX(x) ( x & 0x0F )// 8bit에서하위bit 값을구하는함수

    define BTOW(b0, b1, b2, b3) ( ((WORD)b0 << 24) | ((WORD)b1 << 16) | ((WORD)b2 << 8) | (WORD)b3 )// BYTEORD로변환하는함수

     

     

    oid CirShiftRows(BYTE* row);

    void SubBytes(BYTE state[][4]);

    void ShiftRows(BYTE state[][4]);

    void Inv_SubBytes(BYTE state[][4]);// Invers SubBytes

    void Inv_ShiftRows(BYTE state[][4]);// Invers ShiftRows

    void Inv_CirShiftRows(BYTE* row);

     

     

    // 암호화-box

    BYTE S_box[16][16] = {

    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,

    };

    BYTE Inv_S_box[16][16] = {

    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,

    };

     

    void SubBytes(BYTE state[][4])

    {

    int i,j;

     

    for(i=0;i<4;i++)

    for(j=0;j<4;j++)

    state[i][j] = S_box[HIHEX(state[i][j])]

    [LOWHEX(state[i][j])];

     

    }

     

    void ShiftRows(BYTE state[][4])

    {

    int i,j;

    for(i=1;i<4;i++)

    for(j=0;j<i;j++)

    CirShiftRows(state[i]);

    }

     

    void CirShiftRows(BYTE* row)

    {

    BYTE temp = row[0];

     

    row[0] = row[1];

    row[1] = row[2];

    row[2] = row[3];

    row[3] = temp;

    }

    void Inv_SubBytes(BYTE state[][4])

    {

    int i,j;

     

    for(i=0;i<4;i++)

    for(j=0;j<4;j++)

    state[i][j] = Inv_S_box[HIHEX(state[i][j])]

    [LOWHEX(state[i][j])];

     

    }

     

    void Inv_CirShiftRows(BYTE* row)

    {

    BYTE temp = row[3];

     

    row[3] = row[2];

    row[2] = row[1];

    row[1] = row[0];

    row[0] = temp;

    }

     

    void Inv_ShiftRows(BYTE state[][4])

    {

    int i,j;

    for(i=1;i<4;i++)

    for(j=0;j<i;j++)

    Inv_CirShiftRows(state[i]);

    }

     

    void main()

    {

    int i,j;

    BYTE state[4][4];

    BYTE p_text[128] = {0,};

    BYTE out_text[128] = {0,};

     

    //평문입력

    rintf("* 평문입력 \n");

    scanf("%s",p_text);

     

    for(i=0;i<4;i++)

    for(j=0;j<4;j++)

    state[i][j] = p_text[i*4+j];

     

     

    for(i=0;i<4;i++)

    for(j=0;j<4;j++)

    out_text[i*4+j] = state[i][j];

     

    SubBytes(state);

    ShiftRows(state);

     

     

    printf("암호문출력");

    for(i=0;i<16;i++)

    {

    printf("%#x",state[i]);

    }

     

     

     

    for(i=0;i<4;i++)

    for(j=0;j<4;j++)

    state[i][j] = p_text[i*4+j] ;

     

    Inv_ShiftRows(state);

    Inv_SubBytes(state);

     

    printf("\n복호문출력");

    for(i=0;i<16;i++)

    {

    printf("%#c",out_text[i]);

    }

    }

     


    '공부 > 과거' 카테고리의 다른 글

    RSA전자서명 실습  (0) 2013.11.26
    C언어 계산기라고말하기도 창피한 사칙연산기  (0) 2013.10.03
    MFC로 좌표때려박기로 구현  (0) 2013.10.01

    댓글

Designed by Tistory.