CHG: minor change initializing array.

[proxmark3-svn] / client / nonce2key / crapto1.c

diff --git a/client/nonce2key/crapto1.c b/client/nonce2key/crapto1.c
index fc878a0deb83eef6e5034ee0d3d0166fe870ec8f..dfad1c4048507b67ae2d2c77afcfa8a312f9715c 100644 (file)
--- a/client/nonce2key/crapto1.c
+++ b/client/nonce2key/crapto1.c
@@ -21,14 +21,20 @@
 #include <stdlib.h>\r
 \r
 #if !defined LOWMEM && defined __GNUC__\r
 #include <stdlib.h>\r
 \r
 #if !defined LOWMEM && defined __GNUC__\r

-static uint8_t filterlut[1 << 20];\r
+uint8_t filterlut[1 << 20];\r

 static void __attribute__((constructor)) fill_lut()\r
 {\r
 static void __attribute__((constructor)) fill_lut()\r
 {\r

-        uint32_t i;\r
-        for(i = 0; i < 1 << 20; ++i)\r
-                filterlut[i] = filter(i);\r
+       uint32_t x;\r
+       uint32_t f;\r
+       for(x = 0; x < 1 << 20; ++x) {\r
+               f  = 0xf22c0 >> (x       & 0xf) & 16;\r
+               f |= 0x6c9c0 >> (x >>  4 & 0xf) &  8;\r
+               f |= 0x3c8b0 >> (x >>  8 & 0xf) &  4;\r
+               f |= 0x1e458 >> (x >> 12 & 0xf) &  2;\r
+               f |= 0x0d938 >> (x >> 16 & 0xf) &  1;\r
+               filterlut[x] = BIT(0xEC57E80A, f);\r
+       }\r

 }\r
 }\r

-#define filter(x) (filterlut[(x) & 0xfffff])\r

 #endif\r
 \r
 \r
 #endif\r
 \r
 \r


@@ -46,7 +52,7 @@ typedef struct bucket_info {
                } bucket_info[2][0x100];\r
                uint32_t numbuckets;\r
        } bucket_info_t;\r
                } bucket_info[2][0x100];\r
                uint32_t numbuckets;\r
        } bucket_info_t;\r

-       \r
+\r

 \r
 static void bucket_sort_intersect(uint32_t* const estart, uint32_t* const estop,\r
                                                                  uint32_t* const ostart, uint32_t* const ostop,\r
 \r
 static void bucket_sort_intersect(uint32_t* const estart, uint32_t* const estop,\r
                                                                  uint32_t* const ostart, uint32_t* const ostop,\r


@@ -55,28 +61,28 @@ static void bucket_sort_intersect(uint32_t* const estart, uint32_t* const estop,
        uint32_t *p1, *p2;\r
        uint32_t *start[2];\r
        uint32_t *stop[2];\r
        uint32_t *p1, *p2;\r
        uint32_t *start[2];\r
        uint32_t *stop[2];\r

-       \r
+\r

        start[0] = estart;\r
        stop[0] = estop;\r
        start[1] = ostart;\r
        stop[1] = ostop;\r
        start[0] = estart;\r
        stop[0] = estop;\r
        start[1] = ostart;\r
        stop[1] = ostop;\r

-       \r
+\r

        // init buckets to be empty\r
        for (uint32_t i = 0; i < 2; i++) {\r
                for (uint32_t j = 0x00; j <= 0xff; j++) {\r
                        bucket[i][j].bp = bucket[i][j].head;\r
                }\r
        }\r
        // init buckets to be empty\r
        for (uint32_t i = 0; i < 2; i++) {\r
                for (uint32_t j = 0x00; j <= 0xff; j++) {\r
                        bucket[i][j].bp = bucket[i][j].head;\r
                }\r
        }\r

-       \r
+\r

        // sort the lists into the buckets based on the MSB (contribution bits)\r
        // sort the lists into the buckets based on the MSB (contribution bits)\r

-       for (uint32_t i = 0; i < 2; i++) { \r
+       for (uint32_t i = 0; i < 2; i++) {\r

                for (p1 = start[i]; p1 <= stop[i]; p1++) {\r
                        uint32_t bucket_index = (*p1 & 0xff000000) >> 24;\r
                        *(bucket[i][bucket_index].bp++) = *p1;\r
                }\r
        }\r
 \r
                for (p1 = start[i]; p1 <= stop[i]; p1++) {\r
                        uint32_t bucket_index = (*p1 & 0xff000000) >> 24;\r
                        *(bucket[i][bucket_index].bp++) = *p1;\r
                }\r
        }\r
 \r

-       \r
+\r

        // write back intersecting buckets as sorted list.\r
        // fill in bucket_info with head and tail of the bucket contents in the list and number of non-empty buckets.\r
        uint32_t nonempty_bucket;\r
        // write back intersecting buckets as sorted list.\r
        // fill in bucket_info with head and tail of the bucket contents in the list and number of non-empty buckets.\r
        uint32_t nonempty_bucket;\r


@@ -95,32 +101,6 @@ static void bucket_sort_intersect(uint32_t* const estart, uint32_t* const estop,
                }\r
 }\r
 \r
                }\r
 }\r
 \r

-\r
-static void quicksort(uint32_t* const start, uint32_t* const stop)\r
-{\r
-       uint32_t *it = start + 1, *rit = stop;\r
-\r
-       if(it > rit)\r
-               return;\r
-\r
-       while(it < rit)\r
-               if(*it <= *start)\r
-                       ++it;\r
-               else if(*rit > *start)\r
-                       --rit;\r
-               else\r
-                       *it ^= (*it ^= *rit, *rit ^= *it);\r
-\r
-       if(*rit >= *start)\r
-               --rit;\r
-       if(rit != start)\r
-               *rit ^= (*rit ^= *start, *start ^= *rit);\r
-\r
-       quicksort(start, rit - 1);\r
-       quicksort(rit + 1, stop);\r
-}\r
-\r
-\r

 /** binsearch\r
  * Binary search for the first occurence of *stop's MSB in sorted [start,stop]\r
  */\r
 /** binsearch\r
  * Binary search for the first occurence of *stop's MSB in sorted [start,stop]\r
  */\r


@@ -173,9 +153,9 @@ extend_table(uint32_t *tbl, uint32_t **end, int bit, int m1, int m2, uint32_t in
                        *p ^= in;\r
                } else {                                                                                // drop\r
                        *p-- = *(*end)--;\r
                        *p ^= in;\r
                } else {                                                                                // drop\r
                        *p-- = *(*end)--;\r

-               } \r

        }\r
        }\r

-       \r
+       }\r
+\r

 }\r
 \r
 \r
 }\r
 \r
 \r


@@ -185,7 +165,7 @@ extend_table(uint32_t *tbl, uint32_t **end, int bit, int m1, int m2, uint32_t in
 static inline void\r
 extend_table_simple(uint32_t *tbl, uint32_t **end, int bit)\r
 {\r
 static inline void\r
 extend_table_simple(uint32_t *tbl, uint32_t **end, int bit)\r
 {\r

-       for(*tbl <<= 1; tbl <= *end; *++tbl <<= 1)      \r
+       for(*tbl <<= 1; tbl <= *end; *++tbl <<= 1)\r

                if(filter(*tbl) ^ filter(*tbl | 1)) {   // replace\r
                        *tbl |= filter(*tbl) ^ bit;\r
                } else if(filter(*tbl) == bit) {                // insert\r
                if(filter(*tbl) ^ filter(*tbl | 1)) {   // replace\r
                        *tbl |= filter(*tbl) ^ bit;\r
                } else if(filter(*tbl) == bit) {                // insert\r


@@ -232,13 +212,13 @@ recover(uint32_t *o_head, uint32_t *o_tail, uint32_t oks,
        }\r
 \r
        bucket_sort_intersect(e_head, e_tail, o_head, o_tail, &bucket_info, bucket);\r
        }\r
 \r
        bucket_sort_intersect(e_head, e_tail, o_head, o_tail, &bucket_info, bucket);\r

-       \r
+\r

        for (int i = bucket_info.numbuckets - 1; i >= 0; i--) {\r
                sl = recover(bucket_info.bucket_info[1][i].head, bucket_info.bucket_info[1][i].tail, oks,\r
                                     bucket_info.bucket_info[0][i].head, bucket_info.bucket_info[0][i].tail, eks,\r
                                         rem, sl, in, bucket);\r
        }\r
        for (int i = bucket_info.numbuckets - 1; i >= 0; i--) {\r
                sl = recover(bucket_info.bucket_info[1][i].head, bucket_info.bucket_info[1][i].tail, oks,\r
                                     bucket_info.bucket_info[0][i].head, bucket_info.bucket_info[0][i].tail, eks,\r
                                         rem, sl, in, bucket);\r
        }\r

-       \r
+\r

        return sl;\r
 }\r
 /** lfsr_recovery\r
        return sl;\r
 }\r
 /** lfsr_recovery\r


@@ -277,7 +257,6 @@ struct Crypto1State* lfsr_recovery32(uint32_t ks2, uint32_t in)
                        }\r
                }\r
 \r
                        }\r
                }\r
 \r

-       \r

        // initialize statelists: add all possible states which would result into the rightmost 2 bits of the keystream\r
        for(i = 1 << 20; i >= 0; --i) {\r
                if(filter(i) == (oks & 1))\r
        // initialize statelists: add all possible states which would result into the rightmost 2 bits of the keystream\r
        for(i = 1 << 20; i >= 0; --i) {\r
                if(filter(i) == (oks & 1))\r


@@ -298,9 +277,7 @@ struct Crypto1State* lfsr_recovery32(uint32_t ks2, uint32_t in)
 \r
        in = (in >> 16 & 0xff) | (in << 16) | (in & 0xff00);            // Byte swapping\r
 \r
 \r
        in = (in >> 16 & 0xff) | (in << 16) | (in & 0xff00);            // Byte swapping\r
 \r

-       recover(odd_head, odd_tail, oks,\r
-               even_head, even_tail, eks, 11, statelist, in << 1, bucket);\r
-\r
+       recover(odd_head, odd_tail, oks, even_head, even_tail, eks, 11, statelist, in << 1, bucket);\r

 \r
 out:\r
        free(odd_head);\r
 \r
 out:\r
        free(odd_head);\r


@@ -308,7 +285,7 @@ out:
        for (uint32_t i = 0; i < 2; i++)\r
                for (uint32_t j = 0; j <= 0xff; j++)\r
                        free(bucket[i][j].head);\r
        for (uint32_t i = 0; i < 2; i++)\r
                for (uint32_t j = 0; j <= 0xff; j++)\r
                        free(bucket[i][j].head);\r

-       \r
+\r

        return statelist;\r
 }\r
 \r
        return statelist;\r
 }\r
 \r


@@ -408,9 +385,12 @@ struct Crypto1State* lfsr_recovery64(uint32_t ks2, uint32_t ks3)
 void lfsr_rollback_bit(struct Crypto1State *s, uint32_t in, int fb)\r
 {\r
        int out;\r
 void lfsr_rollback_bit(struct Crypto1State *s, uint32_t in, int fb)\r
 {\r
        int out;\r

+       uint32_t tmp;\r

 \r
        s->odd &= 0xffffff;\r
 \r
        s->odd &= 0xffffff;\r

-       s->odd ^= (s->odd ^= s->even, s->even ^= s->odd);\r
+       tmp = s->odd;\r
+       s->odd = s->even;\r
+       s->even = tmp;\r

 \r
        out = s->even & 1;\r
        out ^= LF_POLY_EVEN & (s->even >>= 1);\r
 \r
        out = s->even & 1;\r
        out ^= LF_POLY_EVEN & (s->even >>= 1);\r


@@ -425,18 +405,66 @@ void lfsr_rollback_bit(struct Crypto1State *s, uint32_t in, int fb)
  */\r
 void lfsr_rollback_byte(struct Crypto1State *s, uint32_t in, int fb)\r
 {\r
  */\r
 void lfsr_rollback_byte(struct Crypto1State *s, uint32_t in, int fb)\r
 {\r

-       int i;\r
+/*     int i;\r

        for (i = 7; i >= 0; --i)\r
                lfsr_rollback_bit(s, BEBIT(in, i), fb);\r
        for (i = 7; i >= 0; --i)\r
                lfsr_rollback_bit(s, BEBIT(in, i), fb);\r

+*/\r
+// unfold loop 20160112\r
+       lfsr_rollback_bit(s, BEBIT(in, 7), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 6), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 5), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 4), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 3), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 2), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 1), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 0), fb);\r

 }\r
 /** lfsr_rollback_word\r
  * Rollback the shift register in order to get previous states\r
  */\r
 void lfsr_rollback_word(struct Crypto1State *s, uint32_t in, int fb)\r
 {\r
 }\r
 /** lfsr_rollback_word\r
  * Rollback the shift register in order to get previous states\r
  */\r
 void lfsr_rollback_word(struct Crypto1State *s, uint32_t in, int fb)\r
 {\r

+/*\r

        int i;\r
        for (i = 31; i >= 0; --i)\r
                lfsr_rollback_bit(s, BEBIT(in, i), fb);\r
        int i;\r
        for (i = 31; i >= 0; --i)\r
                lfsr_rollback_bit(s, BEBIT(in, i), fb);\r

+*/\r
+// unfold loop 20160112\r
+       lfsr_rollback_bit(s, BEBIT(in, 31), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 30), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 29), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 28), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 27), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 26), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 25), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 24), fb);\r
+\r
+       lfsr_rollback_bit(s, BEBIT(in, 23), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 22), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 21), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 20), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 19), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 18), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 17), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 16), fb);\r
+\r
+       lfsr_rollback_bit(s, BEBIT(in, 15), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 14), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 13), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 12), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 11), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 10), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 9), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 8), fb);\r
+\r
+       lfsr_rollback_bit(s, BEBIT(in, 7), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 6), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 5), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 4), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 3), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 2), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 1), fb);\r
+       lfsr_rollback_bit(s, BEBIT(in, 0), fb);\r

 }\r
 \r
 /** nonce_distance\r
 }\r
 \r
 /** nonce_distance\r


@@ -507,7 +535,7 @@ uint32_t *lfsr_prefix_ks(uint8_t ks[8], int isodd)
  */\r
 static struct Crypto1State*\r
 brute_top(uint32_t prefix, uint32_t rresp, unsigned char parities[8][8],\r
  */\r
 static struct Crypto1State*\r
 brute_top(uint32_t prefix, uint32_t rresp, unsigned char parities[8][8],\r

-          uint32_t odd, uint32_t even, struct Crypto1State* sl)\r
+          uint32_t odd, uint32_t even, struct Crypto1State* sl, uint8_t no_chk)\r

 {\r
        struct Crypto1State s;\r
        uint32_t ks1, nr, ks2, rr, ks3, good, c;\r
 {\r
        struct Crypto1State s;\r
        uint32_t ks1, nr, ks2, rr, ks3, good, c;\r


@@ -515,17 +543,20 @@ brute_top(uint32_t prefix, uint32_t rresp, unsigned char parities[8][8],
        for(c = 0; c < 8; ++c) {\r
                s.odd = odd ^ fastfwd[1][c];\r
                s.even = even ^ fastfwd[0][c];\r
        for(c = 0; c < 8; ++c) {\r
                s.odd = odd ^ fastfwd[1][c];\r
                s.even = even ^ fastfwd[0][c];\r

-               \r
+\r

                lfsr_rollback_bit(&s, 0, 0);\r
                lfsr_rollback_bit(&s, 0, 0);\r
                lfsr_rollback_bit(&s, 0, 0);\r
                lfsr_rollback_bit(&s, 0, 0);\r
                lfsr_rollback_bit(&s, 0, 0);\r
                lfsr_rollback_bit(&s, 0, 0);\r

-               \r
+\r

                lfsr_rollback_word(&s, 0, 0);\r
                lfsr_rollback_word(&s, prefix | c << 5, 1);\r
                lfsr_rollback_word(&s, 0, 0);\r
                lfsr_rollback_word(&s, prefix | c << 5, 1);\r

-               \r
+\r

                sl->odd = s.odd;\r
                sl->even = s.even;\r
                sl->odd = s.odd;\r
                sl->even = s.even;\r

-       \r
+\r
+               if (no_chk)\r
+                       break;\r
+\r

                ks1 = crypto1_word(&s, prefix | c << 5, 1);\r
                ks2 = crypto1_word(&s,0,0);\r
                ks3 = crypto1_word(&s, 0,0);\r
                ks1 = crypto1_word(&s, prefix | c << 5, 1);\r
                ks2 = crypto1_word(&s,0,0);\r
                ks3 = crypto1_word(&s, 0,0);\r


@@ -544,7 +575,7 @@ brute_top(uint32_t prefix, uint32_t rresp, unsigned char parities[8][8],
        }\r
 \r
        return ++sl;\r
        }\r
 \r
        return ++sl;\r

-} \r
+}\r

 \r
 \r
 /** lfsr_common_prefix\r
 \r
 \r
 /** lfsr_common_prefix\r


@@ -556,8 +587,7 @@ brute_top(uint32_t prefix, uint32_t rresp, unsigned char parities[8][8],
  * It returns a zero terminated list of possible cipher states after the\r
  * tag nonce was fed in\r
  */\r
  * It returns a zero terminated list of possible cipher states after the\r
  * tag nonce was fed in\r
  */\r

-struct Crypto1State*\r
-lfsr_common_prefix(uint32_t pfx, uint32_t rr, uint8_t ks[8], uint8_t par[8][8])\r
+struct Crypto1State* lfsr_common_prefix(uint32_t pfx, uint32_t rr, uint8_t ks[8], uint8_t par[8][8], uint8_t no_par)\r

 {\r
        struct Crypto1State *statelist, *s;\r
        uint32_t *odd, *even, *o, *e, top;\r
 {\r
        struct Crypto1State *statelist, *s;\r
        uint32_t *odd, *even, *o, *e, top;\r


@@ -565,24 +595,92 @@ lfsr_common_prefix(uint32_t pfx, uint32_t rr, uint8_t ks[8], uint8_t par[8][8])
        odd = lfsr_prefix_ks(ks, 1);\r
        even = lfsr_prefix_ks(ks, 0);\r
 \r
        odd = lfsr_prefix_ks(ks, 1);\r
        even = lfsr_prefix_ks(ks, 0);\r
 \r

-       statelist = malloc((sizeof *statelist) << 20);\r
+       statelist = malloc((sizeof *statelist) << 21);  //how large should be?\r

        if(!statelist || !odd || !even)\r
        if(!statelist || !odd || !even)\r

-                return 0;\r
-\r
+       {\r
+               free(statelist);\r
+               free(odd);\r
+               free(even);\r
+               return 0;\r
+       }\r

 \r
        s = statelist;\r
 \r
        s = statelist;\r

-       for(o = odd; *o != 0xffffffff; ++o)\r
-               for(e = even; *e != 0xffffffff; ++e)\r
+       for(o = odd; *o != -1; ++o)\r
+               for(e = even; *e != -1; ++e)\r

                        for(top = 0; top < 64; ++top) {\r
                                *o = (*o & 0x1fffff) | (top << 21);\r
                                *e = (*e & 0x1fffff) | (top >> 3) << 21;\r
                        for(top = 0; top < 64; ++top) {\r
                                *o = (*o & 0x1fffff) | (top << 21);\r
                                *e = (*e & 0x1fffff) | (top >> 3) << 21;\r

-                               s = brute_top(pfx, rr, par, *o, *e, s);\r
+                               s = brute_top(pfx, rr, par, *o, *e, s, no_par);\r

                        }\r
 \r
                        }\r
 \r

-       s->odd = s->even = 0;\r
+       s->odd = s->even = -1;\r
+       //printf("state count = %d\n",s-statelist);\r

 \r
        free(odd);\r
        free(even);\r
 \r
        return statelist;\r
 }\r
 \r
        free(odd);\r
        free(even);\r
 \r
        return statelist;\r
 }\r

+\r
+/*\r
+struct Crypto1State* lfsr_common_prefix(uint32_t pfx, uint32_t rr, uint8_t ks[8], uint8_t par[8][8], uint8_t no_par, uint32_t nt, uint32_t uid)\r
+{\r
+    long long int amount = 0;\r
+    struct Crypto1State *statelist, *s;\r
+    uint32_t *odd, *even, *o, *e, top;\r
+\r
+    odd = lfsr_prefix_ks(ks, 1);\r
+    even = lfsr_prefix_ks(ks, 0);\r
+\r
+    s = statelist = malloc((sizeof *statelist) << 20);\r
+    if(!s || !odd || !even) {\r
+               free(odd);\r
+               free(even);\r
+               free(statelist);\r
+               return 0;\r
+    }\r
+\r
+    char filename[50] = "archivo.txt";\r
+    sprintf(filename, "logs/%x.txt", nt);\r
+    PrintAndLog("Name: %s\n", filename);\r
+    FILE *file = fopen(filename,"w+");\r
+       if ( !file ) {\r
+               s->odd = s->even = 0;\r
+               free(odd);\r
+               free(even);\r
+               PrintAndLog("Failed to create file");\r
+               return 0;\r
+       }\r
+    PrintAndLog("Creating file... ");\r
+       uint32_t xored = uid^nt;\r
+       \r
+    int lastOdd = 0;\r
+    for(o = odd; *o + 1; ++o)\r
+        for(e = even; *e + 1; ++e)\r
+            for(top = 0; top < 64; ++top) {\r
+                *o += 1 << 21;\r
+                *e += (!(top & 7) + 1) << 21;\r
+\r
+                //added by MG\r
+                if(lastOdd != statelist->odd){\r
+                                       // Here I create a temporal crypto1 state, \r
+                                       // where I load the odd and even state and work with it,\r
+                                       // in order not to interfere with regular mechanism, This is what I save to file\r
+                                       struct Crypto1State *state;\r
+                    lastOdd = state->odd = statelist->odd; state->even = statelist->even;\r
+                    lfsr_rollback_word(state,xored,0);\r
+                    fprintf(file,"%x %x \n",state->odd,state->even);\r
+                    amount++;\r
+                }\r
+                //s = check_pfx_parity(pfx, rr, par, *o, *e, s); //This is not useful at all when attacking chineese cards\r
+                               s = brute_top(pfx, rr, par, *o, *e, s, no_par); \r
+            }\r
+\r
+       PrintAndLog("File created, amount %u\n",amount);\r
+       fclose(file);\r
+       s->odd = s->even = 0;\r
+       free(odd);\r
+       free(even);\r
+    return statelist;\r
+}\r
+ */\r