Kevin Redon | be355cd | 2013-11-02 18:11:01 +0100 | [diff] [blame^] | 1 | /* COMP128 version 2 and 3 implementation |
| 2 | * |
| 3 | * This code is a C conversion of the original code from |
| 4 | * http://www.hackingprojects.net/ |
| 5 | * |
| 6 | */ |
| 7 | |
| 8 | /* (C) 2013 by Kévin Redon <kevredon@mail.tsaitgaist.info> |
| 9 | * |
| 10 | * All Rights Reserved |
| 11 | * |
| 12 | * This program is free software; you can redistribute it and/or modify |
| 13 | * it under the terms of the GNU General Public License as published by |
| 14 | * the Free Software Foundation; either version 2 of the License, or |
| 15 | * (at your option) any later version. |
| 16 | * |
| 17 | * This program is distributed in the hope that it will be useful, |
| 18 | * but WITHOUT ANY WARRANTY; without even the implied warranty of |
| 19 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the |
| 20 | * GNU General Public License for more details. |
| 21 | * |
| 22 | * You should have received a copy of the GNU General Public License along |
| 23 | * with this program; if not, write to the Free Software Foundation, Inc., |
| 24 | * 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. |
| 25 | * |
| 26 | */ |
| 27 | |
| 28 | #include <stdint.h> |
| 29 | #include <string.h> |
| 30 | |
| 31 | static const uint8_t table0[256] = { |
| 32 | 197, 235, 60, 151, 98, 96, 3, 100, 248, 118, 42, 117, 172, 211, 181, 203, 61, |
| 33 | 126, 156, 87, 149, 224, 55, 132, 186, 63, 238, 255, 85, 83, 152, 33, 160, |
| 34 | 184, 210, 219, 159, 11, 180, 194, 130, 212, 147, 5, 215, 92, 27, 46, 113, |
| 35 | 187, 52, 25, 185, 79, 221, 48, 70, 31, 101, 15, 195, 201, 50, 222, 137, |
| 36 | 233, 229, 106, 122, 183, 178, 177, 144, 207, 234, 182, 37, 254, 227, 231, 54, |
| 37 | 209, 133, 65, 202, 69, 237, 220, 189, 146, 120, 68, 21, 125, 38, 30, 2, |
| 38 | 155, 53, 196, 174, 176, 51, 246, 167, 76, 110, 20, 82, 121, 103, 112, 56, |
| 39 | 173, 49, 217, 252, 0, 114, 228, 123, 12, 93, 161, 253, 232, 240, 175, 67, |
| 40 | 128, 22, 158, 89, 18, 77, 109, 190, 17, 62, 4, 153, 163, 59, 145, 138, |
| 41 | 7, 74, 205, 10, 162, 80, 45, 104, 111, 150, 214, 154, 28, 191, 169, 213, |
| 42 | 88, 193, 198, 200, 245, 39, 164, 124, 84, 78, 1, 188, 170, 23, 86, 226, |
| 43 | 141, 32, 6, 131, 127, 199, 40, 135, 16, 57, 71, 91, 225, 168, 242, 206, |
| 44 | 97, 166, 44, 14, 90, 236, 239, 230, 244, 223, 108, 102, 119, 148, 251, 29, |
| 45 | 216, 8, 9, 249, 208, 24, 105, 94, 34, 64, 95, 115, 72, 134, 204, 43, |
| 46 | 247, 243, 218, 47, 58, 73, 107, 241, 179, 116, 66, 36, 143, 81, 250, 139, |
| 47 | 19, 13, 142, 140, 129, 192, 99, 171, 157, 136, 41, 75, 35, 165, 26 |
| 48 | }, table1[256] = { |
| 49 | 170, 42, 95, 141, 109, 30, 71, 89, 26, 147, 231, 205, 239, 212, 124, 129, 216, |
| 50 | 79, 15, 185, 153, 14, 251, 162, 0, 241, 172, 197, 43, 10, 194, 235, 6, |
| 51 | 20, 72, 45, 143, 104, 161, 119, 41, 136, 38, 189, 135, 25, 93, 18, 224, |
| 52 | 171, 252, 195, 63, 19, 58, 165, 23, 55, 133, 254, 214, 144, 220, 178, 156, |
| 53 | 52, 110, 225, 97, 183, 140, 39, 53, 88, 219, 167, 16, 198, 62, 222, 76, |
| 54 | 139, 175, 94, 51, 134, 115, 22, 67, 1, 249, 217, 3, 5, 232, 138, 31, |
| 55 | 56, 116, 163, 70, 128, 234, 132, 229, 184, 244, 13, 34, 73, 233, 154, 179, |
| 56 | 131, 215, 236, 142, 223, 27, 57, 246, 108, 211, 8, 253, 85, 66, 245, 193, |
| 57 | 78, 190, 4, 17, 7, 150, 127, 152, 213, 37, 186, 2, 243, 46, 169, 68, |
| 58 | 101, 60, 174, 208, 158, 176, 69, 238, 191, 90, 83, 166, 125, 77, 59, 21, |
| 59 | 92, 49, 151, 168, 99, 9, 50, 146, 113, 117, 228, 65, 230, 40, 82, 54, |
| 60 | 237, 227, 102, 28, 36, 107, 24, 44, 126, 206, 201, 61, 114, 164, 207, 181, |
| 61 | 29, 91, 64, 221, 255, 48, 155, 192, 111, 180, 210, 182, 247, 203, 148, 209, |
| 62 | 98, 173, 11, 75, 123, 250, 118, 32, 47, 240, 202, 74, 177, 100, 80, 196, |
| 63 | 33, 248, 86, 157, 137, 120, 130, 84, 204, 122, 81, 242, 188, 200, 149, 226, |
| 64 | 218, 160, 187, 106, 35, 87, 105, 96, 145, 199, 159, 12, 121, 103, 112 |
| 65 | }; |
| 66 | |
| 67 | #define RAND_SIZE 16 |
| 68 | #define KI_SIZE 16 |
| 69 | #define SRES_SIZE 4 |
| 70 | #define KC_SIZE 8 |
| 71 | |
| 72 | static void |
| 73 | _comp128v23_internal(uint8_t *output, const uint8_t *kxor, const uint8_t *rand) |
| 74 | { |
| 75 | uint8_t temp[RAND_SIZE]; |
| 76 | uint8_t km_rm[RAND_SIZE+KI_SIZE]; |
| 77 | uint8_t i,j,k,z; |
| 78 | |
| 79 | memset(temp,0,sizeof(temp)/sizeof(uint8_t)); |
| 80 | memcpy(km_rm,rand,RAND_SIZE); |
| 81 | memcpy(km_rm+RAND_SIZE,kxor,KI_SIZE); |
| 82 | |
| 83 | for (i=0; i<5; i++) { |
| 84 | for (z=0; z<16; z++) { |
| 85 | temp[z] = table0[table1[km_rm[16+z]]^km_rm[z]]; |
| 86 | } |
| 87 | j=0; |
| 88 | while ((1<<i)>j) { |
| 89 | k = 0; |
| 90 | while ((1<<(4-i))>k) { |
| 91 | km_rm[((2*k+1)<<i)+j] = table0[table1[temp[(k<<i)+j]]^(km_rm[(k<<i)+16+j])]; |
| 92 | km_rm[(k<<(i+1))+j] = temp[(k<<i)+j]; |
| 93 | k++; |
| 94 | } |
| 95 | j++; |
| 96 | } |
| 97 | } |
| 98 | |
| 99 | memset(output,0,16); |
| 100 | |
| 101 | for (i=0; i<16; i++) { |
| 102 | for (j=0; j<8; j++) { |
| 103 | output[i] ^= (((km_rm[(19*(j+8*i)+19)%256/8]>>(3*j+3)%8)&1)<< j); |
| 104 | } |
| 105 | } |
| 106 | } |
| 107 | |
| 108 | int |
| 109 | comp128v23(const uint8_t *ki, const uint8_t *rand, uint8_t version, uint8_t *sres, uint8_t *kc) |
| 110 | { |
| 111 | uint8_t k_mix[KI_SIZE]; |
| 112 | uint8_t rand_mix[RAND_SIZE]; |
| 113 | uint8_t katyvasz[KI_SIZE]; |
| 114 | uint8_t output[KI_SIZE]; |
| 115 | uint8_t i,s; |
| 116 | |
| 117 | if (!(version==2 || version==3)) |
| 118 | return 1; |
| 119 | |
| 120 | memset(k_mix,0,sizeof(k_mix)/sizeof(uint8_t)); |
| 121 | memset(rand_mix,0,sizeof(rand_mix)/sizeof(uint8_t)); |
| 122 | memset(katyvasz,0,sizeof(katyvasz)/sizeof(uint8_t)); |
| 123 | memset(output,0,sizeof(output)/sizeof(uint8_t)); |
| 124 | |
| 125 | for (i=0; i<8; i++) { |
| 126 | k_mix[i] = ki[15 - i]; |
| 127 | k_mix[15 - i] = ki[i]; |
| 128 | } |
| 129 | |
| 130 | for (i=0; i<8; i++) { |
| 131 | rand_mix[i] = rand[15 - i]; |
| 132 | rand_mix[15 - i] = rand[i]; |
| 133 | } |
| 134 | |
| 135 | for (i=0; i<16; i++) { |
| 136 | katyvasz[i] = k_mix[i]^rand_mix[i]; |
| 137 | } |
| 138 | |
| 139 | for (i=0; i<8; i++) { |
| 140 | _comp128v23_internal(rand_mix,katyvasz,rand_mix); |
| 141 | } |
| 142 | |
| 143 | for (i=0; i<16; i++) { |
| 144 | output[i] = rand_mix[15-i]; |
| 145 | } |
| 146 | |
| 147 | if (version==2) { |
| 148 | output[15] = 0; |
| 149 | output[14] = 4*(output[14]>>2); |
| 150 | } |
| 151 | |
| 152 | s = 8; |
| 153 | i = 0; |
| 154 | while (i<4) { |
| 155 | output[s+i-4] = output[s+i]; |
| 156 | output[s+i] = output[s+i+4]; |
| 157 | i++; |
| 158 | } |
| 159 | |
| 160 | /* the algorithm uses 16 bytes until this point, but only 12 bytes are effective |
| 161 | * also 12 bytes coming out from the SIM card */ |
| 162 | memcpy(sres,output,SRES_SIZE*sizeof(uint8_t)); |
| 163 | memcpy(kc,&output[SRES_SIZE],KC_SIZE*sizeof(uint8_t)); |
| 164 | |
| 165 | return 0; |
| 166 | } |