cvs.zerfleddert.de Git - proxmark3-svn/blob - client/loclass/ikeys.c

   1 /*****************************************************************************
   2  * WARNING
   3  *
   4  * THIS CODE IS CREATED FOR EXPERIMENTATION AND EDUCATIONAL USE ONLY.
   5  *
   6  * USAGE OF THIS CODE IN OTHER WAYS MAY INFRINGE UPON THE INTELLECTUAL
   7  * PROPERTY OF OTHER PARTIES, SUCH AS INSIDE SECURE AND HID GLOBAL,
   8  * AND MAY EXPOSE YOU TO AN INFRINGEMENT ACTION FROM THOSE PARTIES.
   9  *
  10  * THIS CODE SHOULD NEVER BE USED TO INFRINGE PATENTS OR INTELLECTUAL PROPERTY RIGHTS.
  11  *
  12  *****************************************************************************
  13  *
  14  * This file is part of loclass. It is a reconstructon of the cipher engine
  15  * used in iClass, and RFID techology.
  16  *
  17  * The implementation is based on the work performed by
  18  * Flavio D. Garcia, Gerhard de Koning Gans, Roel Verdult and
  19  * Milosch Meriac in the paper "Dismantling IClass".
  20  *
  21  * Copyright (C) 2014 Martin Holst Swende
  22  *
  23  * This is free software: you can redistribute it and/or modify
  24  * it under the terms of the GNU General Public License version 2 as published
  25  * by the Free Software Foundation.
  26  *
  27  * This file is distributed in the hope that it will be useful,
  28  * but WITHOUT ANY WARRANTY; without even the implied warranty of
  29  * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
  30  * GNU General Public License for more details.
  31  *
  32  * You should have received a copy of the GNU General Public License
  33  * along with loclass.  If not, see <http://www.gnu.org/licenses/>.
  34  *
  35  *
  36  *
  37  ****************************************************************************/
  38 /**
  39
  40 From "Dismantling iclass":
  41         This section describes in detail the built-in key diversification algorithm of iClass.
  42         Besides the obvious purpose of deriving a card key from a master key, this
  43         algorithm intends to circumvent weaknesses in the cipher by preventing the
  44         usage of certain ‘weak’ keys. In order to compute a diversified key, the iClass
  45         reader first encrypts the card identity id with the master key K, using single
  46         DES. The resulting ciphertext is then input to a function called hash0 which
  47         outputs the diversified key k.
  48
  49         k = hash0(DES enc (id, K))
  50
  51         Here the DES encryption of id with master key K outputs a cryptogram c
  52         of 64 bits. These 64 bits are divided as c = x, y, z [0] , . . . , z [7] ∈ F 82 × F 82 × (F 62 ) 8
  53         which is used as input to the hash0 function. This function introduces some
  54         obfuscation by performing a number of permutations, complement and modulo
  55         operations, see Figure 2.5. Besides that, it checks for and removes patterns like
  56         similar key bytes, which could produce a strong bias in the cipher. Finally, the
  57         output of hash0 is the diversified card key k = k [0] , . . . , k [7] ∈ (F 82 ) 8 .
  58
  59 **/
  60 #include <stdint.h>
  61 #include <stdbool.h>
  62 #include <string.h>
  63 #include <stdio.h>
  64 #include <inttypes.h>
  65 #include "fileutils.h"
  66 #include "cipherutils.h"
  67 #include "des.h"
  68
  69 uint8_t pi[35] = {0x0F,0x17,0x1B,0x1D,0x1E,0x27,0x2B,0x2D,0x2E,0x33,0x35,0x39,0x36,0x3A,0x3C,0x47,0x4B,0x4D,0x4E,0x53,0x55,0x56,0x59,0x5A,0x5C,0x63,0x65,0x66,0x69,0x6A,0x6C,0x71,0x72,0x74,0x78};
  70
  71 static des_context ctx_enc = {DES_ENCRYPT,{0}};
  72 static des_context ctx_dec = {DES_DECRYPT,{0}};
  73
  74 static int debug_print = 0;
  75
  76 /**
  77  * @brief The key diversification algorithm uses 6-bit bytes.
  78  * This implementation uses 64 bit uint to pack seven of them into one
  79  * variable. When they are there, they are placed as follows:
  80  * XXXX XXXX N0 .... N7, occupying the lsat 48 bits.
  81  *
  82  * This function picks out one from such a collection
  83  * @param all
  84  * @param n bitnumber
  85  * @return
  86  */
  87 uint8_t getSixBitByte(uint64_t c, int n)
  88 {
  89         return (c >> (42-6*n)) & 0x3F;
  90 }
  91
  92 /**
  93  * @brief Puts back a six-bit 'byte' into a uint64_t.
  94  * @param c buffer
  95  * @param z the value to place there
  96  * @param n bitnumber.
  97  */
  98 void pushbackSixBitByte(uint64_t *c, uint8_t z, int n)
  99 {
 100         //0x XXXX YYYY ZZZZ ZZZZ ZZZZ
 101         //             ^z0         ^z7
 102         //z0:  1111 1100 0000 0000
 103
 104         uint64_t masked = z & 0x3F;
 105         uint64_t eraser = 0x3F;
 106         masked <<= 42-6*n;
 107         eraser <<= 42-6*n;
 108
 109         //masked <<= 6*n;
 110         //eraser <<= 6*n;
 111
 112         eraser = ~eraser;
 113         (*c) &= eraser;
 114         (*c) |= masked;
 115
 116 }
 117 /**
 118  * @brief Swaps the z-values.
 119  * If the input value has format XYZ0Z1...Z7, the output will have the format
 120  * XYZ7Z6...Z0 instead
 121  * @param c
 122  * @return
 123  */
 124 uint64_t swapZvalues(uint64_t c)
 125 {
 126         uint64_t newz = 0;
 127         pushbackSixBitByte(&newz, getSixBitByte(c,0),7);
 128         pushbackSixBitByte(&newz, getSixBitByte(c,1),6);
 129         pushbackSixBitByte(&newz, getSixBitByte(c,2),5);
 130         pushbackSixBitByte(&newz, getSixBitByte(c,3),4);
 131         pushbackSixBitByte(&newz, getSixBitByte(c,4),3);
 132         pushbackSixBitByte(&newz, getSixBitByte(c,5),2);
 133         pushbackSixBitByte(&newz, getSixBitByte(c,6),1);
 134         pushbackSixBitByte(&newz, getSixBitByte(c,7),0);
 135         newz |= (c & 0xFFFF000000000000);
 136         return newz;
 137 }
 138
 139 /**
 140 * @return 4 six-bit bytes chunked into a uint64_t,as 00..00a0a1a2a3
 141 */
 142 uint64_t ck(int i, int j, uint64_t z)
 143 {
 144
 145         if(i == 1 && j == -1)
 146         {
 147                 // ck(1, −1, z [0] . . . z [3] ) = z [0] . . . z [3]
 148                 return z;
 149
 150         }else if( j == -1)
 151         {
 152                 // ck(i, −1, z [0] . . . z [3] ) = ck(i − 1, i − 2, z [0] . . . z [3] )
 153                 return ck(i-1,i-2, z);
 154         }
 155
 156         if(getSixBitByte(z,i) == getSixBitByte(z,j))
 157         {
 158
 159                 //ck(i, j − 1, z [0] . . . z [i] ← j . . . z [3] )
 160                 uint64_t newz = 0;
 161                 int c;
 162                 for(c = 0; c < 4 ;c++)
 163                 {
 164                         uint8_t val = getSixBitByte(z,c);
 165                         if(c == i)
 166                         {
 167                                 pushbackSixBitByte(&newz, j, c);
 168                         }else
 169                         {
 170                                 pushbackSixBitByte(&newz, val, c);
 171                         }
 172                 }
 173                 return ck(i,j-1,newz);
 174         }else
 175         {
 176                 return ck(i,j-1,z);
 177         }
 178 }
 179 /**
 180
 181         Definition 8.
 182         Let the function check : (F 62 ) 8 → (F 62 ) 8 be defined as
 183         check(z [0] . . . z [7] ) = ck(3, 2, z [0] . . . z [3] ) · ck(3, 2, z [4] . . . z [7] )
 184
 185         where ck : N × N × (F 62 ) 4 → (F 62 ) 4 is defined as
 186
 187                 ck(1, −1, z [0] . . . z [3] ) = z [0] . . . z [3]
 188                 ck(i, −1, z [0] . . . z [3] ) = ck(i − 1, i − 2, z [0] . . . z [3] )
 189                 ck(i, j, z [0] . . . z [3] ) =
 190                 ck(i, j − 1, z [0] . . . z [i] ← j . . . z [3] ),  if z [i] = z [j] ;
 191                 ck(i, j − 1, z [0] . . . z [3] ), otherwise
 192
 193         otherwise.
 194 **/
 195
 196 uint64_t check(uint64_t z)
 197 {
 198         //These 64 bits are divided as c = x, y, z [0] , . . . , z [7]
 199
 200         // ck(3, 2, z [0] . . . z [3] )
 201         uint64_t ck1 = ck(3,2, z );
 202
 203         // ck(3, 2, z [4] . . . z [7] )
 204         uint64_t ck2 = ck(3,2, z << 24);
 205
 206         //The ck function will place the values
 207         // in the middle of z.
 208         ck1 &= 0x00000000FFFFFF000000;
 209         ck2 &= 0x00000000FFFFFF000000;
 210
 211         return ck1 | ck2 >> 24;
 212
 213 }
 214
 215 void permute(BitstreamIn *p_in, uint64_t z,int l,int r, BitstreamOut* out)
 216 {
 217         if(bitsLeft(p_in) == 0)
 218                 return;
 219
 220         bool pn = tailBit(p_in);
 221         if( pn ) // pn = 1
 222         {
 223                 uint8_t zl = getSixBitByte(z,l);
 224
 225                 push6bits(out, zl+1);
 226                 permute(p_in, z, l+1,r, out);
 227         }else // otherwise
 228         {
 229                 uint8_t zr = getSixBitByte(z,r);
 230
 231                 push6bits(out, zr);
 232                 permute(p_in,z,l,r+1,out);
 233         }
 234 }
 235 void printbegin() {
 236         if (debug_print < 2)
 237                 return;
 238
 239         prnlog("          | x| y|z0|z1|z2|z3|z4|z5|z6|z7|");
 240 }
 241
 242 void printState(char* desc, uint64_t c)
 243 {
 244         if(debug_print < 2)
 245                 return;
 246
 247         printf("%s : ", desc);
 248         uint8_t x =     (c & 0xFF00000000000000 ) >> 56;
 249         uint8_t y =     (c & 0x00FF000000000000 ) >> 48;
 250         printf("  %02x %02x", x,y);
 251         int i;
 252         for(i = 0; i < 8; i++)
 253                 printf(" %02x", getSixBitByte(c,i));
 254         printf("\n");
 255 }
 256
 257 /**
 258  * @brief
 259  *Definition 11. Let the function hash0 : F 82 × F 82 × (F 62 ) 8 → (F 82 ) 8 be defined as
 260  *      hash0(x, y, z [0] . . . z [7] ) = k [0] . . . k [7] where
 261  * z'[i] = (z[i] mod (63-i)) + i        i =  0...3
 262  * z'[i+4] = (z[i+4] mod (64-i)) + i    i =  0...3
 263  * ẑ = check(z');
 264  * @param c
 265  * @param k this is where the diversified key is put (should be 8 bytes)
 266  * @return
 267  */
 268 void hash0(uint64_t c, uint8_t k[8])
 269 {
 270         c = swapZvalues(c);
 271
 272         printbegin();
 273         printState("origin",c);
 274         //These 64 bits are divided as c = x, y, z [0] , . . . , z [7]
 275         // x = 8 bits
 276         // y = 8 bits
 277         // z0-z7 6 bits each : 48 bits
 278         uint8_t x =     (c & 0xFF00000000000000 ) >> 56;
 279         uint8_t y =     (c & 0x00FF000000000000 ) >> 48;
 280         int n;
 281         uint8_t zn, zn4, _zn, _zn4;
 282         uint64_t zP = 0;
 283
 284         for(n = 0;  n < 4 ; n++)
 285         {
 286                 zn = getSixBitByte(c,n);
 287
 288                 zn4 = getSixBitByte(c,n+4);
 289
 290                 _zn = (zn % (63-n)) + n;
 291                 _zn4 = (zn4 % (64-n)) + n;
 292
 293                 pushbackSixBitByte(&zP, _zn,n);
 294                 pushbackSixBitByte(&zP, _zn4,n+4);
 295         }
 296
 297         printState("0|0|z'",zP);
 298
 299         uint64_t zCaret = check(zP);
 300         printState("0|0|z^",zP);
 301
 302         uint8_t p = pi[x % 35];
 303
 304         if(x & 1) //Check if x7 is 1
 305                 p = ~p;
 306
 307         if(debug_print >= 2) prnlog("p:%02x", p);
 308
 309         BitstreamIn p_in = { &p, 8,0 };
 310         uint8_t outbuffer[] = {0,0,0,0,0,0,0,0};
 311         BitstreamOut out = {outbuffer,0,0};
 312         permute(&p_in,zCaret,0,4,&out);//returns 48 bits? or 6 8-bytes
 313
 314         //Out is now a buffer containing six-bit bytes, should be 48 bits
 315         // if all went well
 316         //Shift z-values down onto the lower segment
 317
 318     uint64_t zTilde = x_bytes_to_num(outbuffer,8);
 319
 320         zTilde >>= 16;
 321
 322         printState("0|0|z~", zTilde);
 323
 324         int i;
 325         int zerocounter =0 ;
 326         for(i = 0; i < 8; i++)
 327         {
 328                 // the key on index i is first a bit from y
 329                 // then six bits from z,
 330                 // then a bit from p
 331
 332                 // Init with zeroes
 333                 k[i] = 0;
 334                 // First, place yi leftmost in k
 335                 //k[i] |= (y  << i) & 0x80 ;
 336
 337                 // First, place y(7-i) leftmost in k
 338                 k[i] |= (y  << (7-i)) & 0x80 ;
 339
 340
 341
 342                 uint8_t zTilde_i = getSixBitByte(zTilde, i);
 343                 // zTildeI is now on the form 00XXXXXX
 344                 // with one leftshift, it'll be
 345                 // 0XXXXXX0
 346                 // So after leftshift, we can OR it into k
 347                 // However, when doing complement, we need to
 348                 // again MASK 0XXXXXX0 (0x7E)
 349                 zTilde_i <<= 1;
 350
 351                 //Finally, add bit from p or p-mod
 352                 //Shift bit i into rightmost location (mask only after complement)
 353                 uint8_t p_i = p >> i & 0x1;
 354
 355                 if( k[i] )// yi = 1
 356                 {
 357                         //printf("k[%d] +1\n", i);
 358                         k[i] |= ~zTilde_i & 0x7E;
 359                         k[i] |= p_i & 1;
 360                         k[i] += 1;
 361
 362                 }else // otherwise
 363                 {
 364                         k[i] |= zTilde_i & 0x7E;
 365                         k[i] |= (~p_i) & 1;
 366                 }
 367                 if((k[i]  & 1 )== 0)
 368                 {
 369                         zerocounter ++;
 370                 }
 371         }
 372 }
 373 /**
 374  * @brief Performs Elite-class key diversification
 375  * @param csn
 376  * @param key
 377  * @param div_key
 378  */
 379 void diversifyKey(uint8_t csn[8], uint8_t key[8], uint8_t div_key[8])
 380 {
 381         // Prepare the DES key
 382         des_setkey_enc( &ctx_enc, key);
 383
 384         uint8_t crypted_csn[8] = {0};
 385
 386         // Calculate DES(CSN, KEY)
 387         des_crypt_ecb(&ctx_enc,csn, crypted_csn);
 388
 389         //Calculate HASH0(DES))
 390     uint64_t crypt_csn = x_bytes_to_num(crypted_csn, 8);
 391     //uint64_t crypted_csn_swapped = swapZvalues(crypt_csn);
 392
 393         hash0(crypt_csn,div_key);
 394 }
 395
 396 void testPermute()
 397 {
 398         uint64_t x = 0;
 399         pushbackSixBitByte(&x,0x00,0);
 400         pushbackSixBitByte(&x,0x01,1);
 401         pushbackSixBitByte(&x,0x02,2);
 402         pushbackSixBitByte(&x,0x03,3);
 403         pushbackSixBitByte(&x,0x04,4);
 404         pushbackSixBitByte(&x,0x05,5);
 405         pushbackSixBitByte(&x,0x06,6);
 406         pushbackSixBitByte(&x,0x07,7);
 407
 408         uint8_t mres[8] = { getSixBitByte(x, 0),
 409                                                 getSixBitByte(x, 1),
 410                                                 getSixBitByte(x, 2),
 411                                                 getSixBitByte(x, 3),
 412                                                 getSixBitByte(x, 4),
 413                                                 getSixBitByte(x, 5),
 414                                                 getSixBitByte(x, 6),
 415                                                 getSixBitByte(x, 7)};
 416         printarr("input_perm", mres,8);
 417
 418         uint8_t p = ~pi[0];
 419         BitstreamIn p_in = { &p, 8,0 };
 420         uint8_t outbuffer[] = {0,0,0,0,0,0,0,0};
 421         BitstreamOut out = {outbuffer,0,0};
 422
 423         permute(&p_in, x,0,4, &out);
 424
 425     uint64_t permuted = x_bytes_to_num(outbuffer,8);
 426         //printf("zTilde 0x%"PRIX64"\n", zTilde);
 427         permuted >>= 16;
 428
 429         uint8_t res[8] = { getSixBitByte(permuted, 0),
 430                                                 getSixBitByte(permuted, 1),
 431                                                 getSixBitByte(permuted, 2),
 432                                                 getSixBitByte(permuted, 3),
 433                                                 getSixBitByte(permuted, 4),
 434                                                 getSixBitByte(permuted, 5),
 435                                                 getSixBitByte(permuted, 6),
 436                                                 getSixBitByte(permuted, 7)};
 437         printarr("permuted", res, 8);
 438 }
 439
 440 //These testcases are
 441 //{ UID , TEMP_KEY, DIV_KEY} using the specific key
 442 typedef struct
 443 {
 444         uint8_t uid[8];
 445         uint8_t t_key[8];
 446         uint8_t div_key[8];
 447 } Testcase;
 448
 449 int testDES(Testcase testcase, des_context ctx_enc, des_context ctx_dec)
 450 {
 451         uint8_t des_encrypted_csn[8] = {0};
 452         uint8_t decrypted[8] = {0};
 453         uint8_t div_key[8] = {0};
 454         int retval = des_crypt_ecb(&ctx_enc,testcase.uid,des_encrypted_csn);
 455         retval |= des_crypt_ecb(&ctx_dec,des_encrypted_csn,decrypted);
 456
 457         if(memcmp(testcase.uid,decrypted,8) != 0)
 458         {
 459                 //Decryption fail
 460                 prnlog("Encryption <-> Decryption FAIL");
 461                 printarr("Input", testcase.uid, 8);
 462                 printarr("Decrypted", decrypted, 8);
 463                 retval = 1;
 464         }
 465
 466         if(memcmp(des_encrypted_csn,testcase.t_key,8) != 0)
 467         {
 468                 //Encryption fail
 469                 prnlog("Encryption != Expected result");
 470                 printarr("Output", des_encrypted_csn, 8);
 471                 printarr("Expected", testcase.t_key, 8);
 472                 retval = 1;
 473         }
 474     uint64_t crypted_csn = x_bytes_to_num(des_encrypted_csn,8);
 475         hash0(crypted_csn, div_key);
 476
 477         if(memcmp(div_key, testcase.div_key ,8) != 0)
 478         {
 479                 //Key diversification fail
 480                 prnlog("Div key != expected result");
 481                 printarr("  csn   ", testcase.uid,8);
 482                 printarr("{csn}   ", des_encrypted_csn,8);
 483                 printarr("hash0   ", div_key, 8);
 484                 printarr("Expected", testcase.div_key, 8);
 485                 retval = 1;
 486         }
 487         return retval;
 488 }
 489 bool des_getParityBitFromKey(uint8_t key)
 490 {//The top 7 bits is used
 491         bool parity = ((key & 0x80) >> 7)
 492                         ^ ((key & 0x40) >> 6) ^ ((key & 0x20) >> 5)
 493                         ^ ((key & 0x10) >> 4) ^ ((key & 0x08) >> 3)
 494                         ^ ((key & 0x04) >> 2) ^ ((key & 0x02) >> 1);
 495         return !parity;
 496 }
 497
 498 void des_checkParity(uint8_t* key) {
 499         int i;
 500         int fails = 0;
 501         for(i = 0; i < 8; i++) {
 502                 bool parity = des_getParityBitFromKey(key[i]);
 503                 if (parity != (key[i] & 0x1)) {
 504                         fails++;
 505                         prnlog("[+] parity1 fail, byte %d [%02x] was %d, should be %d", i, key[i], (key[i] & 0x1), parity);
 506                 }
 507         }
 508         if(fails)
 509                 prnlog("[+] parity fails: %d", fails);
 510         else
 511                 prnlog("[+] Key syntax is with parity bits inside each byte");
 512 }
 513
 514 Testcase testcases[] ={
 515
 516         {{0x8B,0xAC,0x60,0x1F,0x53,0xB8,0xED,0x11},{0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x01,0x03,0x05,0x07}},
 517         {{0xAE,0x51,0xE5,0x62,0xE7,0x9A,0x99,0x39},{0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x01},{0x04,0x02,0x06,0x08,0x01,0x03,0x05,0x07}},
 518         {{0x9B,0x21,0xE4,0x31,0x6A,0x00,0x29,0x62},{0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x02},{0x06,0x04,0x02,0x08,0x01,0x03,0x05,0x07}},
 519         {{0x65,0x24,0x0C,0x41,0x4F,0xC2,0x21,0x93},{0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x04},{0x0A,0x04,0x06,0x08,0x01,0x03,0x05,0x07}},
 520         {{0x7F,0xEB,0xAE,0x93,0xE5,0x30,0x08,0xBD},{0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x08},{0x12,0x04,0x06,0x08,0x01,0x03,0x05,0x07}},
 521         {{0x49,0x7B,0x70,0x74,0x9B,0x35,0x1B,0x83},{0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x10},{0x22,0x04,0x06,0x08,0x01,0x03,0x05,0x07}},
 522         {{0x02,0x3C,0x15,0x6B,0xED,0xA5,0x64,0x6C},{0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x20},{0x42,0x04,0x06,0x08,0x01,0x03,0x05,0x07}},
 523         {{0xE8,0x37,0xE0,0xE2,0xC6,0x45,0x24,0xF3},{0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x40},{0x02,0x06,0x04,0x08,0x01,0x03,0x05,0x07}},
 524         {{0xAB,0xBD,0x30,0x05,0x29,0xC8,0xF7,0x12},{0x00,0x00,0x00,0x00,0x00,0x00,0x00,0x80},{0x02,0x08,0x06,0x04,0x01,0x03,0x05,0x07}},
 525         {{0x17,0xE8,0x97,0xF0,0x99,0xB6,0x79,0x31},{0x00,0x00,0x00,0x00,0x00,0x00,0x01,0x00},{0x02,0x0C,0x06,0x08,0x01,0x03,0x05,0x07}},
 526         {{0x49,0xA4,0xF0,0x8F,0x5F,0x96,0x83,0x16},{0x00,0x00,0x00,0x00,0x00,0x00,0x02,0x00},{0x02,0x14,0x06,0x08,0x01,0x03,0x05,0x07}},
 527         {{0x60,0xF5,0x7E,0x54,0xAA,0x41,0x83,0xD4},{0x00,0x00,0x00,0x00,0x00,0x00,0x04,0x00},{0x02,0x24,0x06,0x08,0x01,0x03,0x05,0x07}},
 528         {{0x1D,0xF6,0x3B,0x6B,0x85,0x55,0xF0,0x4B},{0x00,0x00,0x00,0x00,0x00,0x00,0x08,0x00},{0x02,0x44,0x06,0x08,0x01,0x03,0x05,0x07}},
 529         {{0x1F,0xDC,0x95,0x1A,0xEA,0x6B,0x4B,0xB4},{0x00,0x00,0x00,0x00,0x00,0x00,0x10,0x00},{0x02,0x04,0x08,0x06,0x01,0x03,0x05,0x07}},
 530         {{0xEC,0x93,0x72,0xF0,0x3B,0xA9,0xF5,0x0B},{0x00,0x00,0x00,0x00,0x00,0x00,0x20,0x00},{0x02,0x04,0x0A,0x08,0x01,0x03,0x05,0x07}},
 531         {{0xDE,0x57,0x5C,0xBE,0x2D,0x55,0x03,0x12},{0x00,0x00,0x00,0x00,0x00,0x00,0x40,0x00},{0x02,0x04,0x0E,0x08,0x01,0x03,0x05,0x07}},
 532         {{0x1E,0xD2,0xB5,0xCE,0x90,0xC9,0xC1,0xCC},{0x00,0x00,0x00,0x00,0x00,0x00,0x80,0x00},{0x02,0x04,0x16,0x08,0x01,0x03,0x05,0x07}},
 533         {{0xD8,0x65,0x96,0x4E,0xE7,0x74,0x99,0xB8},{0x00,0x00,0x00,0x00,0x00,0x01,0x00,0x00},{0x02,0x04,0x26,0x08,0x01,0x03,0x05,0x07}},
 534         {{0xE3,0x7A,0x29,0x83,0x31,0xD5,0x3A,0x54},{0x00,0x00,0x00,0x00,0x00,0x02,0x00,0x00},{0x02,0x04,0x46,0x08,0x01,0x03,0x05,0x07}},
 535         {{0x3A,0xB5,0x1A,0x34,0x34,0x25,0x12,0xF0},{0x00,0x00,0x00,0x00,0x00,0x04,0x00,0x00},{0x02,0x04,0x06,0x0A,0x01,0x03,0x05,0x07}},
 536         {{0xF2,0x88,0xEE,0x6F,0x70,0x6F,0xC2,0x52},{0x00,0x00,0x00,0x00,0x00,0x08,0x00,0x00},{0x02,0x04,0x06,0x0C,0x01,0x03,0x05,0x07}},
 537         {{0x76,0xEF,0xEB,0x80,0x52,0x43,0x83,0x57},{0x00,0x00,0x00,0x00,0x00,0x10,0x00,0x00},{0x02,0x04,0x06,0x10,0x01,0x03,0x05,0x07}},
 538         {{0x1C,0x09,0x8E,0x3B,0x23,0x23,0x52,0xB5},{0x00,0x00,0x00,0x00,0x00,0x20,0x00,0x00},{0x02,0x04,0x06,0x18,0x01,0x03,0x05,0x07}},
 539         {{0xA9,0x13,0xA2,0xBE,0xCF,0x1A,0xC4,0x9A},{0x00,0x00,0x00,0x00,0x00,0x40,0x00,0x00},{0x02,0x04,0x06,0x28,0x01,0x03,0x05,0x07}},
 540         {{0x25,0x56,0x4B,0xB0,0xC8,0x2A,0xD4,0x27},{0x00,0x00,0x00,0x00,0x00,0x80,0x00,0x00},{0x02,0x04,0x06,0x48,0x01,0x03,0x05,0x07}},
 541         {{0xB1,0x04,0x57,0x3F,0xA7,0x16,0x62,0xD4},{0x00,0x00,0x00,0x00,0x01,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x03,0x01,0x05,0x07}},
 542         {{0x45,0x46,0xED,0xCC,0xE7,0xD3,0x8E,0xA3},{0x00,0x00,0x00,0x00,0x02,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x05,0x03,0x01,0x07}},
 543         {{0x22,0x6D,0xB5,0x35,0xE0,0x5A,0xE0,0x90},{0x00,0x00,0x00,0x00,0x04,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x09,0x03,0x05,0x07}},
 544         {{0xB8,0xF5,0xE5,0x44,0xC5,0x98,0x4A,0xBD},{0x00,0x00,0x00,0x00,0x08,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x11,0x03,0x05,0x07}},
 545         {{0xAC,0x78,0x0A,0x23,0x9E,0xF6,0xBC,0xA0},{0x00,0x00,0x00,0x00,0x10,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x21,0x03,0x05,0x07}},
 546         {{0x46,0x6B,0x2D,0x70,0x41,0x17,0xBF,0x3D},{0x00,0x00,0x00,0x00,0x20,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x41,0x03,0x05,0x07}},
 547         {{0x64,0x44,0x24,0x71,0xA2,0x56,0xDF,0xB5},{0x00,0x00,0x00,0x00,0x40,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x01,0x05,0x03,0x07}},
 548         {{0xC4,0x00,0x52,0x24,0xA2,0xD6,0x16,0x7A},{0x00,0x00,0x00,0x00,0x80,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x01,0x07,0x05,0x03}},
 549         {{0xD8,0x4A,0x80,0x1E,0x95,0x5B,0x70,0xC4},{0x00,0x00,0x00,0x01,0x00,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x01,0x0B,0x05,0x07}},
 550         {{0x08,0x56,0x6E,0xB5,0x64,0xD6,0x47,0x4E},{0x00,0x00,0x00,0x02,0x00,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x01,0x13,0x05,0x07}},
 551         {{0x41,0x6F,0xBA,0xA4,0xEB,0xAE,0xA0,0x55},{0x00,0x00,0x00,0x04,0x00,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x01,0x23,0x05,0x07}},
 552         {{0x62,0x9D,0xDE,0x72,0x84,0x4A,0x53,0xD5},{0x00,0x00,0x00,0x08,0x00,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x01,0x43,0x05,0x07}},
 553         {{0x39,0xD3,0x2B,0x66,0xB8,0x08,0x40,0x2E},{0x00,0x00,0x00,0x10,0x00,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x01,0x03,0x07,0x05}},
 554         {{0xAF,0x67,0xA9,0x18,0x57,0x21,0xAF,0x8D},{0x00,0x00,0x00,0x20,0x00,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x01,0x03,0x09,0x07}},
 555         {{0x34,0xBC,0x9D,0xBC,0xC4,0xC2,0x3B,0xC8},{0x00,0x00,0x00,0x40,0x00,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x01,0x03,0x0D,0x07}},
 556         {{0xB6,0x50,0xF9,0x81,0xF6,0xBF,0x90,0x3C},{0x00,0x00,0x00,0x80,0x00,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x01,0x03,0x15,0x07}},
 557         {{0x71,0x41,0x93,0xA1,0x59,0x81,0xA5,0x52},{0x00,0x00,0x01,0x00,0x00,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x01,0x03,0x25,0x07}},
 558         {{0x6B,0x00,0xBD,0x74,0x1C,0x3C,0xE0,0x1A},{0x00,0x00,0x02,0x00,0x00,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x01,0x03,0x45,0x07}},
 559         {{0x76,0xFD,0x0B,0xD0,0x41,0xD2,0x82,0x5D},{0x00,0x00,0x04,0x00,0x00,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x01,0x03,0x05,0x09}},
 560         {{0xC6,0x3A,0x1C,0x25,0x63,0x5A,0x2F,0x0E},{0x00,0x00,0x08,0x00,0x00,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x01,0x03,0x05,0x0B}},
 561         {{0xD9,0x0E,0xD7,0x30,0xE2,0xAD,0xA9,0x87},{0x00,0x00,0x10,0x00,0x00,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x01,0x03,0x05,0x0F}},
 562         {{0x6B,0x81,0xC6,0xD1,0x05,0x09,0x87,0x1E},{0x00,0x00,0x20,0x00,0x00,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x01,0x03,0x05,0x17}},
 563         {{0xB4,0xA7,0x1E,0x02,0x54,0x37,0x43,0x35},{0x00,0x00,0x40,0x00,0x00,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x01,0x03,0x05,0x27}},
 564         {{0x45,0x14,0x7C,0x7F,0xE0,0xDE,0x09,0x65},{0x00,0x00,0x80,0x00,0x00,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x01,0x03,0x05,0x47}},
 565         {{0x78,0xB0,0xF5,0x20,0x8B,0x7D,0xF3,0xDD},{0x00,0x01,0x00,0x00,0x00,0x00,0x00,0x00},{0xFE,0x04,0x06,0x08,0x01,0x03,0x05,0x07}},
 566         {{0x88,0xB3,0x3C,0xE1,0xF7,0x87,0x42,0xA1},{0x00,0x02,0x00,0x00,0x00,0x00,0x00,0x00},{0x02,0xFC,0x06,0x08,0x01,0x03,0x05,0x07}},
 567         {{0x11,0x2F,0xB2,0xF7,0xE2,0xB2,0x4F,0x6E},{0x00,0x04,0x00,0x00,0x00,0x00,0x00,0x00},{0x02,0x04,0xFA,0x08,0x01,0x03,0x05,0x07}},
 568         {{0x25,0x56,0x4E,0xC6,0xEB,0x2D,0x74,0x5B},{0x00,0x08,0x00,0x00,0x00,0x00,0x00,0x00},{0x02,0x04,0x06,0xF8,0x01,0x03,0x05,0x07}},
 569         {{0x7E,0x98,0x37,0xF9,0x80,0x8F,0x09,0x82},{0x00,0x10,0x00,0x00,0x00,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0xFF,0x03,0x05,0x07}},
 570         {{0xF9,0xB5,0x62,0x3B,0xD8,0x7B,0x3C,0x3F},{0x00,0x20,0x00,0x00,0x00,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x01,0xFD,0x05,0x07}},
 571         {{0x29,0xC5,0x2B,0xFA,0xD1,0xFC,0x5C,0xC7},{0x00,0x40,0x00,0x00,0x00,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x01,0x03,0xFB,0x07}},
 572         {{0xC1,0xA3,0x09,0x71,0xBD,0x8E,0xAF,0x2F},{0x00,0x80,0x00,0x00,0x00,0x00,0x00,0x00},{0x02,0x04,0x06,0x08,0x01,0x03,0x05,0xF9}},
 573         {{0xB6,0xDD,0xD1,0xAD,0xAA,0x15,0x6F,0x29},{0x01,0x00,0x00,0x00,0x00,0x00,0x00,0x00},{0x01,0x03,0x05,0x02,0x07,0x04,0x06,0x08}},
 574         {{0x65,0x34,0x03,0x19,0x17,0xB3,0xA3,0x96},{0x02,0x00,0x00,0x00,0x00,0x00,0x00,0x00},{0x02,0x04,0x01,0x06,0x08,0x03,0x05,0x07}},
 575         {{0xF9,0x38,0x43,0x56,0x52,0xE5,0xB1,0xA9},{0x04,0x00,0x00,0x00,0x00,0x00,0x00,0x00},{0x01,0x02,0x04,0x06,0x08,0x03,0x05,0x07}},
 576
 577         {{0xA4,0xA0,0xAF,0xDA,0x48,0xB0,0xA1,0x10},{0x08,0x00,0x00,0x00,0x00,0x00,0x00,0x00},{0x01,0x02,0x04,0x06,0x03,0x08,0x05,0x07}},
 578         {{0x55,0x15,0x8A,0x0D,0x48,0x29,0x01,0xD8},{0x10,0x00,0x00,0x00,0x00,0x00,0x00,0x00},{0x02,0x04,0x01,0x06,0x03,0x05,0x08,0x07}},
 579         {{0xC4,0x81,0x96,0x7D,0xA3,0xB7,0x73,0x50},{0x20,0x00,0x00,0x00,0x00,0x00,0x00,0x00},{0x01,0x02,0x03,0x05,0x04,0x06,0x08,0x07}},
 580         {{0x36,0x73,0xDF,0xC1,0x1B,0x98,0xA8,0x1D},{0x40,0x00,0x00,0x00,0x00,0x00,0x00,0x00},{0x01,0x02,0x03,0x04,0x05,0x06,0x08,0x07}},
 581         {{0xCE,0xE0,0xB3,0x1B,0x41,0xEB,0x15,0x12},{0x80,0x00,0x00,0x00,0x00,0x00,0x00,0x00},{0x01,0x02,0x03,0x04,0x06,0x05,0x08,0x07}},
 582         {{0},{0},{0}}
 583 };
 584
 585 int testKeyDiversificationWithMasterkeyTestcases() {
 586         int error = 0;
 587         int i;
 588         uint8_t empty[8]={0};
 589
 590         prnlog("[+} Testing encryption/decryption");
 591
 592         for (i = 0;  memcmp(testcases+i, empty, 8); i++)
 593                 error += testDES(testcases[i], ctx_enc, ctx_dec);
 594
 595         if (error)
 596                 prnlog("[+] %d errors occurred (%d testcases)", error, i);
 597         else
 598                 prnlog("[+] Hashing seems to work (%d testcases)", i);
 599         return error;
 600 }
 601
 602 void print64bits(char*name, uint64_t val) {
 603         printf("%s%08x%08x\n",name,(uint32_t) (val >> 32) ,(uint32_t) (val & 0xFFFFFFFF));
 604 }
 605
 606 uint64_t testCryptedCSN(uint64_t crypted_csn, uint64_t expected)
 607 {
 608         int retval = 0;
 609         uint8_t result[8] = {0};
 610         if(debug_print) prnlog("debug_print %d", debug_print);
 611         if(debug_print) print64bits("    {csn}      ", crypted_csn );
 612
 613         uint64_t crypted_csn_swapped = swapZvalues(crypted_csn);
 614
 615         if(debug_print) print64bits("    {csn-revz} ", crypted_csn_swapped);
 616
 617         hash0(crypted_csn, result);
 618     uint64_t resultbyte = x_bytes_to_num(result,8 );
 619         if(debug_print) print64bits("    hash0      " , resultbyte );
 620
 621         if(resultbyte != expected ) {
 622                 if(debug_print) {
 623                         prnlog("\n[+] FAIL!");
 624                         print64bits("    expected       " ,  expected );
 625                 }
 626                 retval = 1;
 627         } else {
 628                 if (debug_print) prnlog(" [OK]");
 629         }
 630         return retval;
 631 }
 632
 633 int testDES2(uint64_t csn, uint64_t expected) {
 634         uint8_t result[8] = {0};
 635         uint8_t input[8] = {0};
 636
 637         print64bits("   csn ", csn);
 638     x_num_to_bytes(csn, 8,input);
 639
 640         des_crypt_ecb(&ctx_enc,input, result);
 641
 642     uint64_t crypt_csn = x_bytes_to_num(result, 8);
 643         print64bits("   {csn}    ", crypt_csn );
 644         print64bits("   expected ", expected );
 645
 646         if( expected == crypt_csn ) {
 647                 prnlog("[+] OK");
 648                 return 0;
 649         } else {
 650                 return 1;
 651         }
 652 }
 653
 654 /**
 655  * These testcases come from http://www.proxmark.org/forum/viewtopic.php?pid=10977#p10977
 656  * @brief doTestsWithKnownInputs
 657  * @return
 658  */
 659 int doTestsWithKnownInputs() {
 660         // KSel from http://www.proxmark.org/forum/viewtopic.php?pid=10977#p10977
 661         int errors = 0;
 662         prnlog("[+] Testing DES encryption");
 663         uint8_t key[8] = {0x6c,0x8d,0x44,0xf9,0x2a,0x2d,0x01,0xbf};
 664
 665         des_setkey_enc( &ctx_enc, key);
 666         testDES2(0xbbbbaaaabbbbeeee,0xd6ad3ca619659e6b);
 667
 668         prnlog("[+] Testing hashing algorithm");
 669
 670         errors += testCryptedCSN(0x0102030405060708,0x0bdd6512073c460a);
 671         errors += testCryptedCSN(0x1020304050607080,0x0208211405f3381f);
 672         errors += testCryptedCSN(0x1122334455667788,0x2bee256d40ac1f3a);
 673         errors += testCryptedCSN(0xabcdabcdabcdabcd,0xa91c9ec66f7da592);
 674         errors += testCryptedCSN(0xbcdabcdabcdabcda,0x79ca5796a474e19b);
 675         errors += testCryptedCSN(0xcdabcdabcdabcdab,0xa8901b9f7ec76da4);
 676         errors += testCryptedCSN(0xdabcdabcdabcdabc,0x357aa8e0979a5b8d);
 677         errors += testCryptedCSN(0x21ba6565071f9299,0x34e80f88d5cf39ea);
 678         errors += testCryptedCSN(0x14e2adfc5bb7e134,0x6ac90c6508bd9ea3);
 679
 680         if (errors)
 681                 prnlog("[+] %d errors occurred (9 testcases)", errors);
 682         else
 683                 prnlog("[+] Hashing seems to work (9 testcases)" );
 684         return errors;
 685 }
 686
 687 int readKeyFile(uint8_t key[8]) {
 688         int retval = 1;
 689         FILE *f = fopen("iclass_key.bin", "rb");
 690         if (!f)
 691                 return 0;
 692
 693         size_t bytes_read = fread(key, sizeof(uint8_t), 8, f);
 694         if ( bytes_read == 1)
 695                 retval = 0;
 696
 697         if (f) {
 698                 fclose(f);
 699                 f = NULL;
 700         }
 701         return retval;
 702 }
 703
 704
 705 int doKeyTests(uint8_t debuglevel)
 706 {
 707         debug_print = debuglevel;
 708
 709         prnlog("[+] Checking if the master key is present (iclass_key.bin)...");
 710         uint8_t key[8] = {0};
 711         if (readKeyFile(key)) {
 712                 prnlog("[+] Master key not present, will not be able to do all testcases");
 713         } else {
 714
 715                 //Test if it's the right key...
 716                 uint8_t i;
 717                 uint8_t j = 0;
 718                 for (i = 0; i < sizeof(key); i++)
 719                         j += key[i];
 720
 721                 if (j != 185) {
 722                         prnlog("[+] A key was loaded, but it does not seem to be the correct one. Aborting these tests");
 723                 } else {
 724                         prnlog("[+] Key present");
 725                         prnlog("[+] Checking key parity...");
 726                         des_checkParity(key);
 727                         des_setkey_enc( &ctx_enc, key);
 728                         des_setkey_dec( &ctx_dec, key);
 729                         // Test hashing functions
 730                         prnlog("[+] The following tests require the correct 8-byte master key");
 731                         testKeyDiversificationWithMasterkeyTestcases();
 732                 }
 733         }
 734         prnlog("[+] Testing key diversification with non-sensitive keys...");
 735         doTestsWithKnownInputs();
 736         return 0;
 737 }
 738
 739 /**
 740
 741 void checkParity2(uint8_t* key)
 742 {
 743
 744         uint8_t stored_parity = key[7];
 745         printf("Parity byte: 0x%02x\n", stored_parity);
 746         int i;
 747         int byte;
 748         int fails =0;
 749         BitstreamIn bits = {key, 56, 0};
 750
 751         bool parity = 0;
 752
 753         for(i =0 ; i  < 56; i++)
 754         {
 755
 756                 if ( i > 0 && i % 7 == 0)
 757                 {
 758                         parity = !parity;
 759                         bool pbit = stored_parity & (0x80 >> (byte));
 760                         if(parity != pbit)
 761                         {
 762                                 printf("parity2 fail byte %d, should be %d, was %d\n", (i / 7), parity, pbit);
 763                                 fails++;
 764                         }
 765                         parity =0 ;
 766                         byte = i / 7;
 767                 }
 768                 parity = parity ^ headBit(&bits);
 769         }
 770         if(fails)
 771         {
 772                 printf("parity2 fails: %d\n", fails);
 773         }else
 774         {
 775                 printf("Key syntax is with parity bits grouped in the last byte!\n");
 776         }
 777 }
 778 void modifyKey_put_parity_last(uint8_t * key, uint8_t* output)
 779 {
 780         uint8_t paritybits = 0;
 781         bool parity =0;
 782         BitstreamOut out = { output, 0,0};
 783         unsigned int bbyte, bbit;
 784         for(bbyte=0; bbyte <8 ; bbyte++ )
 785         {
 786                 for(bbit =0 ; bbit< 7 ; bbit++)
 787                 {
 788                         bool bit = *(key+bbyte) & (1 << (7-bbit));
 789                         pushBit(&out,bit);
 790                         parity ^= bit;
 791                 }
 792                 bool paritybit = *(key+bbyte) & 1;
 793                 paritybits |= paritybit << (7-bbyte);
 794                 parity = 0;
 795
 796         }
 797         output[7] = paritybits;
 798         printf("Parity byte: %02x\n", paritybits);
 799 }
 800
 801  * @brief Modifies a key with parity bits last, so that it is formed with parity
 802  *              bits inside each byte
 803  * @param key
 804  * @param output
 805
 806 void modifyKey_put_parity_allover(uint8_t * key, uint8_t* output)
 807 {
 808         bool parity =0;
 809         BitstreamOut out = { output, 0,0};
 810         BitstreamIn in = {key, 0,0};
 811         unsigned int bbyte, bbit;
 812         for(bbit =0 ; bbit < 56 ; bbit++) {
 813                 if( bbit > 0 && bbit % 7 == 0) {
 814                         pushBit(&out,!parity);
 815                         parity = 0;
 816                 }
 817                 bool bit = headBit(&in);
 818                 pushBit(&out,bit );
 819                 parity ^= bit;
 820         }
 821         pushBit(&out, !parity);
 822
 823         if(     des_key_check_key_parity(output))
 824                 printf("modifyKey_put_parity_allover fail, DES key invalid parity!");
 825 }
 826 */
 827
 828