SRC_ISO15693 = iso15693.c iso15693tools.c
SRC_ISO14443a = epa.c iso14443a.c mifareutil.c mifarecmd.c mifaresniff.c
SRC_ISO14443b = iso14443b.c
-SRC_CRAPTO1 = crapto1.c crypto1.c des.c aes.c
+SRC_CRAPTO1 = crypto1.c des.c aes.c
SRC_CRC = iso14443crc.c crc.c crc16.c crc32.c
#the FPGA bitstream files. Note: order matters!
+++ /dev/null
-/* crapto1.c\r
-\r
- This program is free software; you can redistribute it and/or\r
- modify it under the terms of the GNU General Public License\r
- as published by the Free Software Foundation; either version 2\r
- of the License, or (at your option) any later version.\r
-\r
- This program is distributed in the hope that it will be useful,\r
- but WITHOUT ANY WARRANTY; without even the implied warranty of\r
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r
- GNU General Public License for more details.\r
-\r
- You should have received a copy of the GNU General Public License\r
- along with this program; if not, write to the Free Software\r
- Foundation, Inc., 51 Franklin Street, Fifth Floor,\r
- Boston, MA 02110-1301, US$\r
-\r
- Copyright (C) 2008-2008 bla <blapost@gmail.com>\r
-*/\r
-#include "crapto1.h"\r
-#include <stdlib.h>\r
-\r
-#if !defined LOWMEM && defined __GNUC__\r
-static uint8_t filterlut[1 << 20];\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
-}\r
-#define filter(x) (filterlut[(x) & 0xfffff])\r
-#endif\r
-\r
-static void quicksort(uint32_t* const start, uint32_t* const stop)\r
-{\r
- uint32_t *it = start + 1, *rit = stop;\r
- uint32_t tmp;\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
- tmp = *it;\r
- *it = *rit;\r
- *rit = tmp;\r
- }\r
-\r
- if(*rit >= *start)\r
- --rit;\r
- if(rit != start) {\r
- tmp = *rit;\r
- *rit = *start;\r
- *start = tmp;\r
- }\r
-\r
- quicksort(start, rit - 1);\r
- quicksort(rit + 1, stop);\r
-}\r
-/** binsearch\r
- * Binary search for the first occurence of *stop's MSB in sorted [start,stop]\r
- */\r
-static inline uint32_t* binsearch(uint32_t *start, uint32_t *stop)\r
-{\r
- uint32_t mid, val = *stop & 0xff000000;\r
- while(start != stop)\r
- if(start[mid = (stop - start) >> 1] > val)\r
- stop = &start[mid];\r
- else\r
- start += mid + 1;\r
-\r
- return start;\r
-}\r
-\r
-/** update_contribution\r
- * helper, calculates the partial linear feedback contributions and puts in MSB\r
- */\r
-static inline void\r
-update_contribution(uint32_t *item, const uint32_t mask1, const uint32_t mask2)\r
-{\r
- uint32_t p = *item >> 25;\r
-\r
- p = p << 1 | parity(*item & mask1);\r
- p = p << 1 | parity(*item & mask2);\r
- *item = p << 24 | (*item & 0xffffff);\r
-}\r
-\r
-/** extend_table\r
- * using a bit of the keystream extend the table of possible lfsr states\r
- */\r
-static inline void\r
-extend_table(uint32_t *tbl, uint32_t **end, int bit, int m1, int m2, uint32_t in)\r
-{\r
- in <<= 24;\r
- for(*tbl <<= 1; tbl <= *end; *++tbl <<= 1)\r
- if(filter(*tbl) ^ filter(*tbl | 1)) {\r
- *tbl |= filter(*tbl) ^ bit;\r
- update_contribution(tbl, m1, m2);\r
- *tbl ^= in;\r
- } else if(filter(*tbl) == bit) {\r
- *++*end = tbl[1];\r
- tbl[1] = tbl[0] | 1;\r
- update_contribution(tbl, m1, m2);\r
- *tbl++ ^= in;\r
- update_contribution(tbl, m1, m2);\r
- *tbl ^= in;\r
- } else\r
- *tbl-- = *(*end)--;\r
-}\r
-/** extend_table_simple\r
- * using a bit of the keystream extend the table of possible lfsr states\r
- */\r
-static inline void extend_table_simple(uint32_t *tbl, uint32_t **end, int bit)\r
-{\r
- for(*tbl <<= 1; tbl <= *end; *++tbl <<= 1)\r
- if(filter(*tbl) ^ filter(*tbl | 1))\r
- *tbl |= filter(*tbl) ^ bit;\r
- else if(filter(*tbl) == bit) {\r
- *++*end = *++tbl;\r
- *tbl = tbl[-1] | 1;\r
- } else\r
- *tbl-- = *(*end)--;\r
-}\r
-/** recover\r
- * recursively narrow down the search space, 4 bits of keystream at a time\r
- */\r
-static struct Crypto1State*\r
-recover(uint32_t *o_head, uint32_t *o_tail, uint32_t oks,\r
- uint32_t *e_head, uint32_t *e_tail, uint32_t eks, int rem,\r
- struct Crypto1State *sl, uint32_t in)\r
-{\r
- uint32_t *o, *e, i;\r
-\r
- if(rem == -1) {\r
- for(e = e_head; e <= e_tail; ++e) {\r
- *e = *e << 1 ^ parity(*e & LF_POLY_EVEN) ^ !!(in & 4);\r
- for(o = o_head; o <= o_tail; ++o, ++sl) {\r
- sl->even = *o;\r
- sl->odd = *e ^ parity(*o & LF_POLY_ODD);\r
- sl[1].odd = sl[1].even = 0;\r
- }\r
- }\r
- return sl;\r
- }\r
-\r
- for(i = 0; i < 4 && rem--; i++) {\r
- oks >>= 1;\r
- eks >>= 1;\r
- in >>= 2;\r
- extend_table(o_head, &o_tail, oks & 1, LF_POLY_EVEN << 1 | 1,\r
- LF_POLY_ODD << 1, 0);\r
- if(o_head > o_tail)\r
- return sl;\r
-\r
- extend_table(e_head, &e_tail, eks & 1, LF_POLY_ODD,\r
- LF_POLY_EVEN << 1 | 1, in & 3);\r
- if(e_head > e_tail)\r
- return sl;\r
- }\r
-\r
- quicksort(o_head, o_tail);\r
- quicksort(e_head, e_tail);\r
-\r
- while(o_tail >= o_head && e_tail >= e_head)\r
- if(((*o_tail ^ *e_tail) >> 24) == 0) {\r
- o_tail = binsearch(o_head, o = o_tail);\r
- e_tail = binsearch(e_head, e = e_tail);\r
- sl = recover(o_tail--, o, oks,\r
- e_tail--, e, eks, rem, sl, in);\r
- }\r
- else if(*o_tail > *e_tail)\r
- o_tail = binsearch(o_head, o_tail) - 1;\r
- else\r
- e_tail = binsearch(e_head, e_tail) - 1;\r
-\r
- return sl;\r
-}\r
-/** lfsr_recovery\r
- * recover the state of the lfsr given 32 bits of the keystream\r
- * additionally you can use the in parameter to specify the value\r
- * that was fed into the lfsr at the time the keystream was generated\r
- */\r
-struct Crypto1State* lfsr_recovery32(uint32_t ks2, uint32_t in)\r
-{\r
- struct Crypto1State *statelist;\r
- uint32_t *odd_head = 0, *odd_tail = 0, oks = 0;\r
- uint32_t *even_head = 0, *even_tail = 0, eks = 0;\r
- int i;\r
-\r
- for(i = 31; i >= 0; i -= 2)\r
- oks = oks << 1 | BEBIT(ks2, i);\r
- for(i = 30; i >= 0; i -= 2)\r
- eks = eks << 1 | BEBIT(ks2, i);\r
-\r
- odd_head = odd_tail = malloc(sizeof(uint32_t) << 21);\r
- even_head = even_tail = malloc(sizeof(uint32_t) << 21);\r
- statelist = malloc(sizeof(struct Crypto1State) << 18);\r
- if(!odd_tail-- || !even_tail-- || !statelist) {\r
- free(statelist);\r
- statelist = 0;\r
- goto out;\r
- }\r
-\r
- statelist->odd = statelist->even = 0;\r
-\r
- for(i = 1 << 20; i >= 0; --i) {\r
- if(filter(i) == (oks & 1))\r
- *++odd_tail = i;\r
- if(filter(i) == (eks & 1))\r
- *++even_tail = i;\r
- }\r
-\r
- for(i = 0; i < 4; i++) {\r
- extend_table_simple(odd_head, &odd_tail, (oks >>= 1) & 1);\r
- extend_table_simple(even_head, &even_tail, (eks >>= 1) & 1);\r
- }\r
-\r
- in = (in >> 16 & 0xff) | (in << 16) | (in & 0xff00);\r
- recover(odd_head, odd_tail, oks,\r
- even_head, even_tail, eks, 11, statelist, in << 1);\r
-\r
-out:\r
- free(odd_head);\r
- free(even_head);\r
- return statelist;\r
-}\r
-\r
-static const uint32_t S1[] = { 0x62141, 0x310A0, 0x18850, 0x0C428, 0x06214,\r
- 0x0310A, 0x85E30, 0xC69AD, 0x634D6, 0xB5CDE, 0xDE8DA, 0x6F46D, 0xB3C83,\r
- 0x59E41, 0xA8995, 0xD027F, 0x6813F, 0x3409F, 0x9E6FA};\r
-static const uint32_t S2[] = { 0x3A557B00, 0x5D2ABD80, 0x2E955EC0, 0x174AAF60,\r
- 0x0BA557B0, 0x05D2ABD8, 0x0449DE68, 0x048464B0, 0x42423258, 0x278192A8,\r
- 0x156042D0, 0x0AB02168, 0x43F89B30, 0x61FC4D98, 0x765EAD48, 0x7D8FDD20,\r
- 0x7EC7EE90, 0x7F63F748, 0x79117020};\r
-static const uint32_t T1[] = {\r
- 0x4F37D, 0x279BE, 0x97A6A, 0x4BD35, 0x25E9A, 0x12F4D, 0x097A6, 0x80D66,\r
- 0xC4006, 0x62003, 0xB56B4, 0x5AB5A, 0xA9318, 0xD0F39, 0x6879C, 0xB057B,\r
- 0x582BD, 0x2C15E, 0x160AF, 0x8F6E2, 0xC3DC4, 0xE5857, 0x72C2B, 0x39615,\r
- 0x98DBF, 0xC806A, 0xE0680, 0x70340, 0x381A0, 0x98665, 0x4C332, 0xA272C};\r
-static const uint32_t T2[] = { 0x3C88B810, 0x5E445C08, 0x2982A580, 0x14C152C0,\r
- 0x4A60A960, 0x253054B0, 0x52982A58, 0x2FEC9EA8, 0x1156C4D0, 0x08AB6268,\r
- 0x42F53AB0, 0x217A9D58, 0x161DC528, 0x0DAE6910, 0x46D73488, 0x25CB11C0,\r
- 0x52E588E0, 0x6972C470, 0x34B96238, 0x5CFC3A98, 0x28DE96C8, 0x12CFC0E0,\r
- 0x4967E070, 0x64B3F038, 0x74F97398, 0x7CDC3248, 0x38CE92A0, 0x1C674950,\r
- 0x0E33A4A8, 0x01B959D0, 0x40DCACE8, 0x26CEDDF0};\r
-static const uint32_t C1[] = { 0x846B5, 0x4235A, 0x211AD};\r
-static const uint32_t C2[] = { 0x1A822E0, 0x21A822E0, 0x21A822E0};\r
-/** Reverse 64 bits of keystream into possible cipher states\r
- * Variation mentioned in the paper. Somewhat optimized version\r
- */\r
-struct Crypto1State* lfsr_recovery64(uint32_t ks2, uint32_t ks3)\r
-{\r
- struct Crypto1State *statelist, *sl;\r
- uint8_t oks[32], eks[32], hi[32];\r
- uint32_t low = 0, win = 0;\r
- uint32_t *tail, table[1 << 16];\r
- int i, j;\r
-\r
- sl = statelist = malloc(sizeof(struct Crypto1State) << 4);\r
- if(!sl)\r
- return 0;\r
- sl->odd = sl->even = 0;\r
-\r
- for(i = 30; i >= 0; i -= 2) {\r
- oks[i >> 1] = BEBIT(ks2, i);\r
- oks[16 + (i >> 1)] = BEBIT(ks3, i);\r
- }\r
- for(i = 31; i >= 0; i -= 2) {\r
- eks[i >> 1] = BEBIT(ks2, i);\r
- eks[16 + (i >> 1)] = BEBIT(ks3, i);\r
- }\r
-\r
- for(i = 0xfffff; i >= 0; --i) {\r
- if (filter(i) != oks[0])\r
- continue;\r
-\r
- *(tail = table) = i;\r
- for(j = 1; tail >= table && j < 29; ++j)\r
- extend_table_simple(table, &tail, oks[j]);\r
-\r
- if(tail < table)\r
- continue;\r
-\r
- for(j = 0; j < 19; ++j)\r
- low = low << 1 | parity(i & S1[j]);\r
- for(j = 0; j < 32; ++j)\r
- hi[j] = parity(i & T1[j]);\r
-\r
- for(; tail >= table; --tail) {\r
- for(j = 0; j < 3; ++j) {\r
- *tail = *tail << 1;\r
- *tail |= parity((i & C1[j]) ^ (*tail & C2[j]));\r
- if(filter(*tail) != oks[29 + j])\r
- goto continue2;\r
- }\r
-\r
- for(j = 0; j < 19; ++j)\r
- win = win << 1 | parity(*tail & S2[j]);\r
-\r
- win ^= low;\r
- for(j = 0; j < 32; ++j) {\r
- win = win << 1 ^ hi[j] ^ parity(*tail & T2[j]);\r
- if(filter(win) != eks[j])\r
- goto continue2;\r
- }\r
-\r
- *tail = *tail << 1 | parity(LF_POLY_EVEN & *tail);\r
- sl->odd = *tail ^ parity(LF_POLY_ODD & win);\r
- sl->even = win;\r
- ++sl;\r
- sl->odd = sl->even = 0;\r
- continue2:;\r
- }\r
- }\r
- return statelist;\r
-}\r
-\r
-/** lfsr_rollback_bit\r
- * Rollback the shift register in order to get previous states\r
- */\r
-uint8_t lfsr_rollback_bit(struct Crypto1State *s, uint32_t in, int fb)\r
-{\r
- int out;\r
- uint8_t ret;\r
- uint32_t tmp;\r
-\r
- s->odd &= 0xffffff;\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
- out ^= LF_POLY_ODD & s->odd;\r
- out ^= !!in;\r
- out ^= (ret = filter(s->odd)) & !!fb;\r
-\r
- s->even |= parity(out) << 23;\r
- return ret;\r
-}\r
-/** lfsr_rollback_byte\r
- * Rollback the shift register in order to get previous states\r
- */\r
-uint8_t lfsr_rollback_byte(struct Crypto1State *s, uint32_t in, int fb)\r
-{\r
- int i, ret = 0;\r
- for (i = 7; i >= 0; --i)\r
- ret |= lfsr_rollback_bit(s, BIT(in, i), fb) << i;\r
- return ret;\r
-}\r
-/** lfsr_rollback_word\r
- * Rollback the shift register in order to get previous states\r
- */\r
-uint32_t lfsr_rollback_word(struct Crypto1State *s, uint32_t in, int fb)\r
-{\r
- int i;\r
- uint32_t ret = 0;\r
- for (i = 31; i >= 0; --i)\r
- ret |= lfsr_rollback_bit(s, BEBIT(in, i), fb) << (i ^ 24);\r
- return ret;\r
-}\r
-\r
-/** nonce_distance\r
- * x,y valid tag nonces, then prng_successor(x, nonce_distance(x, y)) = y\r
- */\r
-static uint16_t *dist = 0;\r
-int nonce_distance(uint32_t from, uint32_t to)\r
-{\r
- uint16_t x, i;\r
- if(!dist) {\r
- dist = malloc(2 << 16);\r
- if(!dist)\r
- return -1;\r
- for (x = i = 1; i; ++i) {\r
- dist[(x & 0xff) << 8 | x >> 8] = i;\r
- x = x >> 1 | (x ^ x >> 2 ^ x >> 3 ^ x >> 5) << 15;\r
- }\r
- }\r
- return (65535 + dist[to >> 16] - dist[from >> 16]) % 65535;\r
-}\r
-\r
-\r
-static uint32_t fastfwd[2][8] = {\r
- { 0, 0x4BC53, 0xECB1, 0x450E2, 0x25E29, 0x6E27A, 0x2B298, 0x60ECB},\r
- { 0, 0x1D962, 0x4BC53, 0x56531, 0xECB1, 0x135D3, 0x450E2, 0x58980}};\r
-/** lfsr_prefix_ks\r
- *\r
- * Is an exported helper function from the common prefix attack\r
- * Described in the "dark side" paper. It returns an -1 terminated array\r
- * of possible partial(21 bit) secret state.\r
- * The required keystream(ks) needs to contain the keystream that was used to\r
- * encrypt the NACK which is observed when varying only the 3 last bits of Nr\r
- * only correct iff [NR_3] ^ NR_3 does not depend on Nr_3\r
- */\r
-uint32_t *lfsr_prefix_ks(uint8_t ks[8], int isodd)\r
-{\r
- uint32_t c, entry, *candidates = malloc(4 << 10);\r
- int i, size = 0, good;\r
-\r
- if(!candidates)\r
- return 0;\r
-\r
- for(i = 0; i < 1 << 21; ++i) {\r
- for(c = 0, good = 1; good && c < 8; ++c) {\r
- entry = i ^ fastfwd[isodd][c];\r
- good &= (BIT(ks[c], isodd) == filter(entry >> 1));\r
- good &= (BIT(ks[c], isodd + 2) == filter(entry));\r
- }\r
- if(good)\r
- candidates[size++] = i;\r
- }\r
-\r
- candidates[size] = -1;\r
-\r
- return candidates;\r
-}\r
-\r
-/** check_pfx_parity\r
- * helper function which eliminates possible secret states using parity bits\r
- */\r
-static struct Crypto1State*\r
-check_pfx_parity(uint32_t prefix, uint32_t rresp, uint8_t parities[8][8],\r
- uint32_t odd, uint32_t even, struct Crypto1State* sl)\r
-{\r
- uint32_t ks1, nr, ks2, rr, ks3, c, good = 1;\r
-\r
- for(c = 0; good && c < 8; ++c) {\r
- sl->odd = odd ^ fastfwd[1][c];\r
- sl->even = even ^ fastfwd[0][c];\r
-\r
- lfsr_rollback_bit(sl, 0, 0);\r
- lfsr_rollback_bit(sl, 0, 0);\r
-\r
- ks3 = lfsr_rollback_bit(sl, 0, 0);\r
- ks2 = lfsr_rollback_word(sl, 0, 0);\r
- ks1 = lfsr_rollback_word(sl, prefix | c << 5, 1);\r
-\r
- nr = ks1 ^ (prefix | c << 5);\r
- rr = ks2 ^ rresp;\r
-\r
- good &= parity(nr & 0x000000ff) ^ parities[c][3] ^ BIT(ks2, 24);\r
- good &= parity(rr & 0xff000000) ^ parities[c][4] ^ BIT(ks2, 16);\r
- good &= parity(rr & 0x00ff0000) ^ parities[c][5] ^ BIT(ks2, 8);\r
- good &= parity(rr & 0x0000ff00) ^ parities[c][6] ^ BIT(ks2, 0);\r
- good &= parity(rr & 0x000000ff) ^ parities[c][7] ^ ks3;\r
- }\r
-\r
- return sl + good;\r
-}\r
-\r
-\r
-/** lfsr_common_prefix\r
- * Implentation of the common prefix attack.\r
- */\r
-struct Crypto1State*\r
-lfsr_common_prefix(uint32_t pfx, uint32_t rr, uint8_t ks[8], uint8_t par[8][8])\r
-{\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(statelist);\r
- statelist = 0;\r
- goto out;\r
- }\r
-\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
- s = check_pfx_parity(pfx, rr, par, *o, *e, s);\r
- }\r
-\r
- s->odd = s->even = 0;\r
-out:\r
- free(odd);\r
- free(even);\r
- return statelist;\r
-}\r
+++ /dev/null
-/* crapto1.h
-
- This program is free software; you can redistribute it and/or
- modify it under the terms of the GNU General Public License
- as published by the Free Software Foundation; either version 2
- of the License, or (at your option) any later version.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
-
- You should have received a copy of the GNU General Public License
- along with this program; if not, write to the Free Software
- Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
- MA 02110-1301, US$
-
- Copyright (C) 2008-2008 bla <blapost@gmail.com>
-*/
-#ifndef CRAPTO1_INCLUDED
-#define CRAPTO1_INCLUDED
-#include <stdint.h>
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-struct Crypto1State {uint32_t odd, even;};
-void crypto1_create(struct Crypto1State *s, uint64_t key);
-void crypto1_destroy(struct Crypto1State*);
-void crypto1_get_lfsr(struct Crypto1State*, uint64_t*);
-uint8_t crypto1_bit(struct Crypto1State*, uint8_t, int);
-uint8_t crypto1_byte(struct Crypto1State*, uint8_t, int);
-uint32_t crypto1_word(struct Crypto1State*, uint32_t, int);
-uint32_t prng_successor(uint32_t x, uint32_t n);
-
-struct Crypto1State* lfsr_recovery32(uint32_t ks2, uint32_t in);
-struct Crypto1State* lfsr_recovery64(uint32_t ks2, uint32_t ks3);
-uint32_t *lfsr_prefix_ks(uint8_t ks[8], int isodd);
-struct Crypto1State*
-lfsr_common_prefix(uint32_t pfx, uint32_t rr, uint8_t ks[8], uint8_t par[8][8]);
-
-uint8_t lfsr_rollback_bit(struct Crypto1State* s, uint32_t in, int fb);
-uint8_t lfsr_rollback_byte(struct Crypto1State* s, uint32_t in, int fb);
-uint32_t lfsr_rollback_word(struct Crypto1State* s, uint32_t in, int fb);
-int nonce_distance(uint32_t from, uint32_t to);
-#define FOREACH_VALID_NONCE(N, FILTER, FSIZE)\
- uint32_t __n = 0,__M = 0, N = 0;\
- int __i;\
- for(; __n < 1 << 16; N = prng_successor(__M = ++__n, 16))\
- for(__i = FSIZE - 1; __i >= 0; __i--)\
- if(BIT(FILTER, __i) ^ parity(__M & 0xFF01))\
- break;\
- else if(__i)\
- __M = prng_successor(__M, (__i == 7) ? 48 : 8);\
- else
-
-#define LF_POLY_ODD (0x29CE5C)
-#define LF_POLY_EVEN (0x870804)
-#define BIT(x, n) ((x) >> (n) & 1)
-#define BEBIT(x, n) BIT(x, (n) ^ 24)
-static inline int parity(uint32_t x)
-{
-#if !defined __i386__ || !defined __GNUC__
- x ^= x >> 16;
- x ^= x >> 8;
- x ^= x >> 4;
- return BIT(0x6996, x & 0xf);
-#else
- asm( "movl %1, %%eax\n"
- "mov %%ax, %%cx\n"
- "shrl $0x10, %%eax\n"
- "xor %%ax, %%cx\n"
- "xor %%ch, %%cl\n"
- "setpo %%al\n"
- "movzx %%al, %0\n": "=r"(x) : "r"(x): "eax","ecx");
- return x;
-#endif
-}
-static inline int filter(uint32_t const x)
-{
- uint32_t f;
-
- f = 0xf22c0 >> (x & 0xf) & 16;
- f |= 0x6c9c0 >> (x >> 4 & 0xf) & 8;
- f |= 0x3c8b0 >> (x >> 8 & 0xf) & 4;
- f |= 0x1e458 >> (x >> 12 & 0xf) & 2;
- f |= 0x0d938 >> (x >> 16 & 0xf) & 1;
- return BIT(0xEC57E80A, f);
-}
-#ifdef __cplusplus
-}
-#endif
-#endif
+++ /dev/null
-/* crypto1.c
-
- This program is free software; you can redistribute it and/or
- modify it under the terms of the GNU General Public License
- as published by the Free Software Foundation; either version 2
- of the License, or (at your option) any later version.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
-
- You should have received a copy of the GNU General Public License
- along with this program; if not, write to the Free Software
- Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
- MA 02110-1301, US
-
- Copyright (C) 2008-2008 bla <blapost@gmail.com>
-*/
-#include "crapto1.h"
-#include <stdlib.h>
-
-#define SWAPENDIAN(x)\
- (x = (x >> 8 & 0xff00ff) | (x & 0xff00ff) << 8, x = x >> 16 | x << 16)
-
-void crypto1_create(struct Crypto1State *s, uint64_t key)
-{
-// struct Crypto1State *s = malloc(sizeof(*s));
- int i;
-
- for(i = 47;s && i > 0; i -= 2) {
- s->odd = s->odd << 1 | BIT(key, (i - 1) ^ 7);
- s->even = s->even << 1 | BIT(key, i ^ 7);
- }
- return;
-}
-void crypto1_destroy(struct Crypto1State *state)
-{
-// free(state);
- state->odd = 0;
- state->even = 0;
-}
-void crypto1_get_lfsr(struct Crypto1State *state, uint64_t *lfsr)
-{
- int i;
- for(*lfsr = 0, i = 23; i >= 0; --i) {
- *lfsr = *lfsr << 1 | BIT(state->odd, i ^ 3);
- *lfsr = *lfsr << 1 | BIT(state->even, i ^ 3);
- }
-}
-uint8_t crypto1_bit(struct Crypto1State *s, uint8_t in, int is_encrypted)
-{
- uint32_t feedin;
- uint32_t tmp;
- uint8_t ret = filter(s->odd);
-
- feedin = ret & !!is_encrypted;
- feedin ^= !!in;
- feedin ^= LF_POLY_ODD & s->odd;
- feedin ^= LF_POLY_EVEN & s->even;
- s->even = s->even << 1 | parity(feedin);
-
- tmp = s->odd;
- s->odd = s->even;
- s->even = tmp;
-
- return ret;
-}
-uint8_t crypto1_byte(struct Crypto1State *s, uint8_t in, int is_encrypted)
-{
- uint8_t i, ret = 0;
-
- for (i = 0; i < 8; ++i)
- ret |= crypto1_bit(s, BIT(in, i), is_encrypted) << i;
-
- return ret;
-}
-uint32_t crypto1_word(struct Crypto1State *s, uint32_t in, int is_encrypted)
-{
- uint32_t i, ret = 0;
-
- for (i = 0; i < 32; ++i)
- ret |= crypto1_bit(s, BEBIT(in, i), is_encrypted) << (i ^ 24);
-
- return ret;
-}
-
-/* prng_successor
- * helper used to obscure the keystream during authentication
- */
-uint32_t prng_successor(uint32_t x, uint32_t n)
-{
- SWAPENDIAN(x);
- while(n--)
- x = x >> 1 | (x >> 16 ^ x >> 18 ^ x >> 19 ^ x >> 21) << 31;
-
- return SWAPENDIAN(x);
-}
#include "cmd.h"
#include "iso14443crc.h"
#include "iso14443a.h"
-#include "crapto1.h"
+#include "crapto1/crapto1.h"
#include "mifareutil.h"
#include "BigBuf.h"
#include "protocols.h"
\r
#include "iso14443crc.h"\r
#include "iso14443a.h"\r
-#include "crapto1.h"\r
+#include "crapto1/crapto1.h"\r
#include "mifareutil.h"\r
#include "common.h"\r
\r
\r
#include "mifaresniff.h"\r
#include "apps.h"\r
+#include "proxmark3.h"\r
+#include "util.h"\r
+#include "string.h"\r
+#include "iso14443crc.h"\r
+#include "iso14443a.h"\r
+#include "crapto1/crapto1.h"\r
+#include "mifareutil.h"\r
+#include "common.h"\r
+\r
\r
static int sniffState = SNF_INIT;\r
static uint8_t sniffUIDType;\r
#ifndef __MIFARESNIFF_H\r
#define __MIFARESNIFF_H\r
\r
-#include "proxmark3.h"\r
-#include "apps.h"\r
+#include <stdint.h>\r
+#include <stdbool.h>\r
#include "util.h"\r
-#include "string.h"\r
-\r
-#include "iso14443crc.h"\r
-#include "iso14443a.h"\r
-#include "crapto1.h"\r
-#include "mifareutil.h"\r
-#include "common.h"\r
\r
#define SNF_INIT 0\r
-#define SNF_NO_FIELD 1\r
-#define SNF_WUPREQ 2\r
+#define SNF_NO_FIELD 1\r
+#define SNF_WUPREQ 2\r
#define SNF_ATQA 3\r
-#define SNF_ANTICOL1 4\r
+#define SNF_ANTICOL1 4\r
#define SNF_UID1 5\r
-#define SNF_ANTICOL2 6\r
+#define SNF_ANTICOL2 6\r
#define SNF_UID2 7\r
#define SNF_SAK 8\r
-#define SNF_CARD_IDLE 9\r
-#define SNF_CARD_CMD 10\r
-#define SNF_CARD_RESP 11\r
+#define SNF_CARD_IDLE 9\r
+#define SNF_CARD_CMD 10\r
+#define SNF_CARD_RESP 11\r
\r
#define SNF_UID_4 0\r
#define SNF_UID_7 0\r
bool intMfSniffSend();\r
bool MfSniffEnd(void);\r
\r
-#endif
\ No newline at end of file
+#endif\r
// Work with mifare cards.\r
//-----------------------------------------------------------------------------\r
\r
+#include "mifareutil.h"\r
#include "proxmark3.h"\r
#include "apps.h"\r
#include "util.h"\r
\r
#include "iso14443crc.h"\r
#include "iso14443a.h"\r
-#include "crapto1.h"\r
-#include "mifareutil.h"\r
+#include "crapto1/crapto1.h"\r
#include "des.h"\r
\r
int MF_DBGLEVEL = MF_DBG_ALL;\r
//-----------------------------------------------------------------------------\r
// code for work with mifare cards.\r
//-----------------------------------------------------------------------------\r
-#include "crapto1.h"\r
\r
#ifndef __MIFAREUTIL_H\r
#define __MIFAREUTIL_H\r
\r
+#include "crapto1/crapto1.h"\r
+\r
// mifare authentication\r
#define CRYPT_NONE 0\r
#define CRYPT_ALL 1\r
CC=gcc
CXX=g++
#COMMON_FLAGS = -m32
-VPATH = ../common ../zlib
+VPATH = ../common ../zlib ../tools
OBJDIR = obj
LDLIBS = -L/opt/local/lib -L/usr/local/lib -lreadline -lpthread -lm
LUALIB = ../liblua/liblua.a
LDFLAGS = $(COMMON_FLAGS)
-CFLAGS = -std=c99 -D_ISOC99_SOURCE -I. -I../include -I../common -I../zlib -I/opt/local/include -I../liblua -Wall $(COMMON_FLAGS) -g -O4
+CFLAGS = -std=c99 -D_ISOC99_SOURCE -I. -I../include -I../common -I../tools -I../zlib -I/opt/local/include -I../liblua -Wall $(COMMON_FLAGS) -g -O4
LUAPLATFORM = generic
ifneq (,$(findstring MINGW,$(platform)))
sleep.c
-CMDSRCS = nonce2key/crapto1.c\
- nonce2key/crypto1.c\
+CMDSRCS = crapto1/crapto1.c\
+ crapto1/crypto1.c\
nonce2key/nonce2key.c\
loclass/cipher.c \
loclass/cipherutils.c \
#include <string.h>\r
#include <pthread.h>\r
\r
-#include "nonce2key/crapto1.h"\r
+#include "crapto1/crapto1.h"\r
#include "proxmark3.h"\r
#include "usb_cmd.h"\r
#include "cmdmain.h"\r
+++ /dev/null
-/* crapto1.c\r
-\r
- This program is free software; you can redistribute it and/or\r
- modify it under the terms of the GNU General Public License\r
- as published by the Free Software Foundation; either version 2\r
- of the License, or (at your option) any later version.\r
-\r
- This program is distributed in the hope that it will be useful,\r
- but WITHOUT ANY WARRANTY; without even the implied warranty of\r
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r
- GNU General Public License for more details.\r
-\r
- You should have received a copy of the GNU General Public License\r
- along with this program; if not, write to the Free Software\r
- Foundation, Inc., 51 Franklin Street, Fifth Floor,\r
- Boston, MA 02110-1301, US$\r
-\r
- Copyright (C) 2008-2008 bla <blapost@gmail.com>\r
-*/\r
-#include "crapto1.h"\r
-#include <stdlib.h>\r
-\r
-#if !defined LOWMEM && defined __GNUC__\r
-static uint8_t filterlut[1 << 20];\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
-}\r
-#define filter(x) (filterlut[(x) & 0xfffff])\r
-#endif\r
-\r
-\r
-\r
-typedef struct bucket {\r
- uint32_t *head;\r
- uint32_t *bp;\r
-} bucket_t;\r
-\r
-typedef bucket_t bucket_array_t[2][0x100];\r
-\r
-typedef struct bucket_info {\r
- struct {\r
- uint32_t *head, *tail;\r
- } bucket_info[2][0x100];\r
- uint32_t numbuckets;\r
- } bucket_info_t;\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
- bucket_info_t *bucket_info, bucket_array_t bucket)\r
-{\r
- uint32_t *p1, *p2;\r
- uint32_t *start[2];\r
- uint32_t *stop[2];\r
-\r
- start[0] = estart;\r
- stop[0] = estop;\r
- start[1] = ostart;\r
- stop[1] = ostop;\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
- // sort the lists into the buckets based on the MSB (contribution bits)\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
-\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
- for (uint32_t i = 0; i < 2; i++) {\r
- p1 = start[i];\r
- nonempty_bucket = 0;\r
- for (uint32_t j = 0x00; j <= 0xff; j++) {\r
- if (bucket[0][j].bp != bucket[0][j].head && bucket[1][j].bp != bucket[1][j].head) { // non-empty intersecting buckets only\r
- bucket_info->bucket_info[i][nonempty_bucket].head = p1;\r
- for (p2 = bucket[i][j].head; p2 < bucket[i][j].bp; *p1++ = *p2++);\r
- bucket_info->bucket_info[i][nonempty_bucket].tail = p1 - 1;\r
- nonempty_bucket++;\r
- }\r
- }\r
- bucket_info->numbuckets = nonempty_bucket;\r
- }\r
-}\r
-\r
-/** binsearch\r
- * Binary search for the first occurence of *stop's MSB in sorted [start,stop]\r
- */\r
-static inline uint32_t*\r
-binsearch(uint32_t *start, uint32_t *stop)\r
-{\r
- uint32_t mid, val = *stop & 0xff000000;\r
- while(start != stop)\r
- if(start[mid = (stop - start) >> 1] > val)\r
- stop = &start[mid];\r
- else\r
- start += mid + 1;\r
-\r
- return start;\r
-}\r
-\r
-/** update_contribution\r
- * helper, calculates the partial linear feedback contributions and puts in MSB\r
- */\r
-static inline void\r
-update_contribution(uint32_t *item, const uint32_t mask1, const uint32_t mask2)\r
-{\r
- uint32_t p = *item >> 25;\r
-\r
- p = p << 1 | parity(*item & mask1);\r
- p = p << 1 | parity(*item & mask2);\r
- *item = p << 24 | (*item & 0xffffff);\r
-}\r
-\r
-/** extend_table\r
- * using a bit of the keystream extend the table of possible lfsr states\r
- */\r
-static inline void\r
-extend_table(uint32_t *tbl, uint32_t **end, int bit, int m1, int m2, uint32_t in)\r
-{\r
- in <<= 24;\r
-\r
- for(uint32_t *p = tbl; p <= *end; p++) {\r
- *p <<= 1;\r
- if(filter(*p) != filter(*p | 1)) { // replace\r
- *p |= filter(*p) ^ bit;\r
- update_contribution(p, m1, m2);\r
- *p ^= in;\r
- } else if(filter(*p) == bit) { // insert\r
- *++*end = p[1];\r
- p[1] = p[0] | 1;\r
- update_contribution(p, m1, m2);\r
- *p++ ^= in;\r
- update_contribution(p, m1, m2);\r
- *p ^= in;\r
- } else { // drop\r
- *p-- = *(*end)--;\r
- }\r
- }\r
-\r
-}\r
-\r
-\r
-/** extend_table_simple\r
- * using a bit of the keystream extend the table of possible lfsr states\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
- if(filter(*tbl) ^ filter(*tbl | 1)) { // replace\r
- *tbl |= filter(*tbl) ^ bit;\r
- } else if(filter(*tbl) == bit) { // insert\r
- *++*end = *++tbl;\r
- *tbl = tbl[-1] | 1;\r
- } else // drop\r
- *tbl-- = *(*end)--;\r
-}\r
-\r
-\r
-/** recover\r
- * recursively narrow down the search space, 4 bits of keystream at a time\r
- */\r
-static struct Crypto1State*\r
-recover(uint32_t *o_head, uint32_t *o_tail, uint32_t oks,\r
- uint32_t *e_head, uint32_t *e_tail, uint32_t eks, int rem,\r
- struct Crypto1State *sl, uint32_t in, bucket_array_t bucket)\r
-{\r
- uint32_t *o, *e;\r
- bucket_info_t bucket_info;\r
-\r
- if(rem == -1) {\r
- for(e = e_head; e <= e_tail; ++e) {\r
- *e = *e << 1 ^ parity(*e & LF_POLY_EVEN) ^ !!(in & 4);\r
- for(o = o_head; o <= o_tail; ++o, ++sl) {\r
- sl->even = *o;\r
- sl->odd = *e ^ parity(*o & LF_POLY_ODD);\r
- }\r
- }\r
- sl->odd = sl->even = 0;\r
- return sl;\r
- }\r
-\r
- for(uint32_t i = 0; i < 4 && rem--; i++) {\r
- extend_table(o_head, &o_tail, (oks >>= 1) & 1,\r
- LF_POLY_EVEN << 1 | 1, LF_POLY_ODD << 1, 0);\r
- if(o_head > o_tail)\r
- return sl;\r
-\r
- extend_table(e_head, &e_tail, (eks >>= 1) & 1,\r
- LF_POLY_ODD, LF_POLY_EVEN << 1 | 1, (in >>= 2) & 3);\r
- if(e_head > e_tail)\r
- return sl;\r
- }\r
-\r
- bucket_sort_intersect(e_head, e_tail, o_head, o_tail, &bucket_info, 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
- return sl;\r
-}\r
-/** lfsr_recovery\r
- * recover the state of the lfsr given 32 bits of the keystream\r
- * additionally you can use the in parameter to specify the value\r
- * that was fed into the lfsr at the time the keystream was generated\r
- */\r
-struct Crypto1State* lfsr_recovery32(uint32_t ks2, uint32_t in)\r
-{\r
- struct Crypto1State *statelist;\r
- uint32_t *odd_head = 0, *odd_tail = 0, oks = 0;\r
- uint32_t *even_head = 0, *even_tail = 0, eks = 0;\r
- int i;\r
-\r
- // split the keystream into an odd and even part\r
- for(i = 31; i >= 0; i -= 2)\r
- oks = oks << 1 | BEBIT(ks2, i);\r
- for(i = 30; i >= 0; i -= 2)\r
- eks = eks << 1 | BEBIT(ks2, i);\r
-\r
- odd_head = odd_tail = malloc(sizeof(uint32_t) << 21);\r
- even_head = even_tail = malloc(sizeof(uint32_t) << 21);\r
- statelist = malloc(sizeof(struct Crypto1State) << 18);\r
- if(!odd_tail-- || !even_tail-- || !statelist) {\r
- goto out;\r
- }\r
- statelist->odd = statelist->even = 0;\r
-\r
- // allocate memory for out of place bucket_sort\r
- bucket_array_t bucket;\r
- for (uint32_t i = 0; i < 2; i++)\r
- for (uint32_t j = 0; j <= 0xff; j++) {\r
- bucket[i][j].head = malloc(sizeof(uint32_t)<<14);\r
- if (!bucket[i][j].head) {\r
- goto out;\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
- *++odd_tail = i;\r
- if(filter(i) == (eks & 1))\r
- *++even_tail = i;\r
- }\r
-\r
- // extend the statelists. Look at the next 8 Bits of the keystream (4 Bit each odd and even):\r
- for(i = 0; i < 4; i++) {\r
- extend_table_simple(odd_head, &odd_tail, (oks >>= 1) & 1);\r
- extend_table_simple(even_head, &even_tail, (eks >>= 1) & 1);\r
- }\r
-\r
- // the statelists now contain all states which could have generated the last 10 Bits of the keystream.\r
- // 22 bits to go to recover 32 bits in total. From now on, we need to take the "in"\r
- // parameter into account.\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
-\r
-out:\r
- free(odd_head);\r
- free(even_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
- return statelist;\r
-}\r
-\r
-static const uint32_t S1[] = { 0x62141, 0x310A0, 0x18850, 0x0C428, 0x06214,\r
- 0x0310A, 0x85E30, 0xC69AD, 0x634D6, 0xB5CDE, 0xDE8DA, 0x6F46D, 0xB3C83,\r
- 0x59E41, 0xA8995, 0xD027F, 0x6813F, 0x3409F, 0x9E6FA};\r
-static const uint32_t S2[] = { 0x3A557B00, 0x5D2ABD80, 0x2E955EC0, 0x174AAF60,\r
- 0x0BA557B0, 0x05D2ABD8, 0x0449DE68, 0x048464B0, 0x42423258, 0x278192A8,\r
- 0x156042D0, 0x0AB02168, 0x43F89B30, 0x61FC4D98, 0x765EAD48, 0x7D8FDD20,\r
- 0x7EC7EE90, 0x7F63F748, 0x79117020};\r
-static const uint32_t T1[] = {\r
- 0x4F37D, 0x279BE, 0x97A6A, 0x4BD35, 0x25E9A, 0x12F4D, 0x097A6, 0x80D66,\r
- 0xC4006, 0x62003, 0xB56B4, 0x5AB5A, 0xA9318, 0xD0F39, 0x6879C, 0xB057B,\r
- 0x582BD, 0x2C15E, 0x160AF, 0x8F6E2, 0xC3DC4, 0xE5857, 0x72C2B, 0x39615,\r
- 0x98DBF, 0xC806A, 0xE0680, 0x70340, 0x381A0, 0x98665, 0x4C332, 0xA272C};\r
-static const uint32_t T2[] = { 0x3C88B810, 0x5E445C08, 0x2982A580, 0x14C152C0,\r
- 0x4A60A960, 0x253054B0, 0x52982A58, 0x2FEC9EA8, 0x1156C4D0, 0x08AB6268,\r
- 0x42F53AB0, 0x217A9D58, 0x161DC528, 0x0DAE6910, 0x46D73488, 0x25CB11C0,\r
- 0x52E588E0, 0x6972C470, 0x34B96238, 0x5CFC3A98, 0x28DE96C8, 0x12CFC0E0,\r
- 0x4967E070, 0x64B3F038, 0x74F97398, 0x7CDC3248, 0x38CE92A0, 0x1C674950,\r
- 0x0E33A4A8, 0x01B959D0, 0x40DCACE8, 0x26CEDDF0};\r
-static const uint32_t C1[] = { 0x846B5, 0x4235A, 0x211AD};\r
-static const uint32_t C2[] = { 0x1A822E0, 0x21A822E0, 0x21A822E0};\r
-/** Reverse 64 bits of keystream into possible cipher states\r
- * Variation mentioned in the paper. Somewhat optimized version\r
- */\r
-struct Crypto1State* lfsr_recovery64(uint32_t ks2, uint32_t ks3)\r
-{\r
- struct Crypto1State *statelist, *sl;\r
- uint8_t oks[32], eks[32], hi[32];\r
- uint32_t low = 0, win = 0;\r
- uint32_t *tail, table[1 << 16];\r
- int i, j;\r
-\r
- sl = statelist = malloc(sizeof(struct Crypto1State) << 4);\r
- if(!sl)\r
- return 0;\r
- sl->odd = sl->even = 0;\r
-\r
- for(i = 30; i >= 0; i -= 2) {\r
- oks[i >> 1] = BIT(ks2, i ^ 24);\r
- oks[16 + (i >> 1)] = BIT(ks3, i ^ 24);\r
- }\r
- for(i = 31; i >= 0; i -= 2) {\r
- eks[i >> 1] = BIT(ks2, i ^ 24);\r
- eks[16 + (i >> 1)] = BIT(ks3, i ^ 24);\r
- }\r
-\r
- for(i = 0xfffff; i >= 0; --i) {\r
- if (filter(i) != oks[0])\r
- continue;\r
-\r
- *(tail = table) = i;\r
- for(j = 1; tail >= table && j < 29; ++j)\r
- extend_table_simple(table, &tail, oks[j]);\r
-\r
- if(tail < table)\r
- continue;\r
-\r
- for(j = 0; j < 19; ++j)\r
- low = low << 1 | parity(i & S1[j]);\r
- for(j = 0; j < 32; ++j)\r
- hi[j] = parity(i & T1[j]);\r
-\r
- for(; tail >= table; --tail) {\r
- for(j = 0; j < 3; ++j) {\r
- *tail = *tail << 1;\r
- *tail |= parity((i & C1[j]) ^ (*tail & C2[j]));\r
- if(filter(*tail) != oks[29 + j])\r
- goto continue2;\r
- }\r
-\r
- for(j = 0; j < 19; ++j)\r
- win = win << 1 | parity(*tail & S2[j]);\r
-\r
- win ^= low;\r
- for(j = 0; j < 32; ++j) {\r
- win = win << 1 ^ hi[j] ^ parity(*tail & T2[j]);\r
- if(filter(win) != eks[j])\r
- goto continue2;\r
- }\r
-\r
- *tail = *tail << 1 | parity(LF_POLY_EVEN & *tail);\r
- sl->odd = *tail ^ parity(LF_POLY_ODD & win);\r
- sl->even = win;\r
- ++sl;\r
- sl->odd = sl->even = 0;\r
- continue2:;\r
- }\r
- }\r
- return statelist;\r
-}\r
-\r
-/** lfsr_rollback_bit\r
- * Rollback the shift register in order to get previous states\r
- */\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
- 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
- out ^= LF_POLY_ODD & s->odd;\r
- out ^= !!in;\r
- out ^= filter(s->odd) & !!fb;\r
-\r
- s->even |= parity(out) << 23;\r
-}\r
-/** lfsr_rollback_byte\r
- * Rollback the shift register in order to get previous states\r
- */\r
-void lfsr_rollback_byte(struct Crypto1State *s, uint32_t in, int fb)\r
-{\r
- int i;\r
- for (i = 7; i >= 0; --i)\r
- lfsr_rollback_bit(s, BEBIT(in, i), 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
- int i;\r
- for (i = 31; i >= 0; --i)\r
- lfsr_rollback_bit(s, BEBIT(in, i), fb);\r
-}\r
-\r
-/** nonce_distance\r
- * x,y valid tag nonces, then prng_successor(x, nonce_distance(x, y)) = y\r
- */\r
-static uint16_t *dist = 0;\r
-int nonce_distance(uint32_t from, uint32_t to)\r
-{\r
- uint16_t x, i;\r
- if(!dist) {\r
- dist = malloc(2 << 16);\r
- if(!dist)\r
- return -1;\r
- for (x = i = 1; i; ++i) {\r
- dist[(x & 0xff) << 8 | x >> 8] = i;\r
- x = x >> 1 | (x ^ x >> 2 ^ x >> 3 ^ x >> 5) << 15;\r
- }\r
- }\r
- return (65535 + dist[to >> 16] - dist[from >> 16]) % 65535;\r
-}\r
-\r
-\r
-static uint32_t fastfwd[2][8] = {\r
- { 0, 0x4BC53, 0xECB1, 0x450E2, 0x25E29, 0x6E27A, 0x2B298, 0x60ECB},\r
- { 0, 0x1D962, 0x4BC53, 0x56531, 0xECB1, 0x135D3, 0x450E2, 0x58980}};\r
-\r
-\r
-/** lfsr_prefix_ks\r
- *\r
- * Is an exported helper function from the common prefix attack\r
- * Described in the "dark side" paper. It returns an -1 terminated array\r
- * of possible partial(21 bit) secret state.\r
- * The required keystream(ks) needs to contain the keystream that was used to\r
- * encrypt the NACK which is observed when varying only the 4 last bits of Nr\r
- * only correct iff [NR_3] ^ NR_3 does not depend on Nr_3\r
- */\r
-uint32_t *lfsr_prefix_ks(uint8_t ks[8], int isodd)\r
-{\r
- uint32_t *candidates = malloc(4 << 21);\r
- uint32_t c, entry;\r
- int size, i;\r
-\r
- if(!candidates)\r
- return 0;\r
-\r
- size = (1 << 21) - 1;\r
- for(i = 0; i <= size; ++i)\r
- candidates[i] = i;\r
-\r
- for(c = 0; c < 8; ++c)\r
- for(i = 0;i <= size; ++i) {\r
- entry = candidates[i] ^ fastfwd[isodd][c];\r
-\r
- if(filter(entry >> 1) == BIT(ks[c], isodd))\r
- if(filter(entry) == BIT(ks[c], isodd + 2))\r
- continue;\r
-\r
- candidates[i--] = candidates[size--];\r
- }\r
-\r
- candidates[size + 1] = -1;\r
-\r
- return candidates;\r
-}\r
-\r
-/** brute_top\r
- * helper function which eliminates possible secret states using parity bits\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, uint8_t no_chk)\r
-{\r
- struct Crypto1State s;\r
- uint32_t ks1, nr, ks2, rr, ks3, good, c;\r
-\r
- for(c = 0; c < 8; ++c) {\r
- s.odd = odd ^ fastfwd[1][c];\r
- s.even = even ^ fastfwd[0][c];\r
-\r
- lfsr_rollback_bit(&s, 0, 0);\r
- lfsr_rollback_bit(&s, 0, 0);\r
- lfsr_rollback_bit(&s, 0, 0);\r
-\r
- lfsr_rollback_word(&s, 0, 0);\r
- lfsr_rollback_word(&s, prefix | c << 5, 1);\r
-\r
- sl->odd = s.odd;\r
- sl->even = s.even;\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
- nr = ks1 ^ (prefix | c << 5);\r
- rr = ks2 ^ rresp;\r
-\r
- good = 1;\r
- good &= parity(nr & 0x000000ff) ^ parities[c][3] ^ BIT(ks2, 24);\r
- good &= parity(rr & 0xff000000) ^ parities[c][4] ^ BIT(ks2, 16);\r
- good &= parity(rr & 0x00ff0000) ^ parities[c][5] ^ BIT(ks2, 8);\r
- good &= parity(rr & 0x0000ff00) ^ parities[c][6] ^ BIT(ks2, 0);\r
- good &= parity(rr & 0x000000ff) ^ parities[c][7] ^ BIT(ks3, 24);\r
-\r
- if(!good)\r
- return sl;\r
- }\r
-\r
- return ++sl;\r
-}\r
-\r
-\r
-/** lfsr_common_prefix\r
- * Implentation of the common prefix attack.\r
- * Requires the 28 bit constant prefix used as reader nonce (pfx)\r
- * The reader response used (rr)\r
- * The keystream used to encrypt the observed NACK's (ks)\r
- * The parity bits (par)\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], uint8_t no_par)\r
-{\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
- statelist = malloc((sizeof *statelist) << 21); //how large should be?\r
- if(!statelist || !odd || !even)\r
- {\r
- free(statelist);\r
- free(odd);\r
- free(even);\r
- return 0;\r
- }\r
-\r
- s = statelist;\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
- s = brute_top(pfx, rr, par, *o, *e, s, no_par);\r
- }\r
-\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
+++ /dev/null
-/* crapto1.h
-
- This program is free software; you can redistribute it and/or
- modify it under the terms of the GNU General Public License
- as published by the Free Software Foundation; either version 2
- of the License, or (at your option) any later version.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
-
- You should have received a copy of the GNU General Public License
- along with this program; if not, write to the Free Software
- Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
- MA 02110-1301, US$
-
- Copyright (C) 2008-2008 bla <blapost@gmail.com>
-*/
-#ifndef CRAPTO1_INCLUDED
-#define CRAPTO1_INCLUDED
-#include <stdint.h>
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-struct Crypto1State {uint32_t odd, even;};
-struct Crypto1State* crypto1_create(uint64_t);
-void crypto1_destroy(struct Crypto1State*);
-void crypto1_get_lfsr(struct Crypto1State*, uint64_t*);
-uint8_t crypto1_bit(struct Crypto1State*, uint8_t, int);
-uint8_t crypto1_byte(struct Crypto1State*, uint8_t, int);
-uint32_t crypto1_word(struct Crypto1State*, uint32_t, int);
-uint32_t prng_successor(uint32_t x, uint32_t n);
-
-struct Crypto1State* lfsr_recovery32(uint32_t ks2, uint32_t in);
-struct Crypto1State* lfsr_recovery64(uint32_t ks2, uint32_t ks3);
-uint32_t *lfsr_prefix_ks(uint8_t ks[8], int isodd);
-struct Crypto1State*
-lfsr_common_prefix(uint32_t pfx, uint32_t rr, uint8_t ks[8], uint8_t par[8][8], uint8_t no_par);
-
-
-void lfsr_rollback_bit(struct Crypto1State* s, uint32_t in, int fb);
-void lfsr_rollback_byte(struct Crypto1State* s, uint32_t in, int fb);
-void lfsr_rollback_word(struct Crypto1State* s, uint32_t in, int fb);
-int nonce_distance(uint32_t from, uint32_t to);
-#define SWAPENDIAN(x)\
- (x = (x >> 8 & 0xff00ff) | (x & 0xff00ff) << 8, x = x >> 16 | x << 16)
-
-#define FOREACH_VALID_NONCE(N, FILTER, FSIZE)\
- uint32_t __n = 0,__M = 0, N = 0;\
- int __i;\
- for(; __n < 1 << 16; N = prng_successor(__M = ++__n, 16))\
- for(__i = FSIZE - 1; __i >= 0; __i--)\
- if(BIT(FILTER, __i) ^ parity(__M & 0xFF01))\
- break;\
- else if(__i)\
- __M = prng_successor(__M, (__i == 7) ? 48 : 8);\
- else
-
-#define LF_POLY_ODD (0x29CE5C)
-#define LF_POLY_EVEN (0x870804)
-#define BIT(x, n) ((x) >> (n) & 1)
-#define BEBIT(x, n) BIT(x, (n) ^ 24)
-static inline int parity(uint32_t x)
-{
-#if !defined __i386__ || !defined __GNUC__
- x ^= x >> 16;
- x ^= x >> 8;
- x ^= x >> 4;
- return BIT(0x6996, x & 0xf);
-#else
- __asm( "movl %1, %%eax\n"
- "mov %%ax, %%cx\n"
- "shrl $0x10, %%eax\n"
- "xor %%ax, %%cx\n"
- "xor %%ch, %%cl\n"
- "setpo %%al\n"
- "movzx %%al, %0\n": "=r"(x) : "r"(x): "eax","ecx");
- return x;
-#endif
-}
-static inline int filter(uint32_t const x)
-{
- uint32_t f;
-
- f = 0xf22c0 >> (x & 0xf) & 16;
- f |= 0x6c9c0 >> (x >> 4 & 0xf) & 8;
- f |= 0x3c8b0 >> (x >> 8 & 0xf) & 4;
- f |= 0x1e458 >> (x >> 12 & 0xf) & 2;
- f |= 0x0d938 >> (x >> 16 & 0xf) & 1;
- return BIT(0xEC57E80A, f);
-}
-#ifdef __cplusplus
-}
-#endif
-#endif
+++ /dev/null
-/* crypto1.c
-
- This program is free software; you can redistribute it and/or
- modify it under the terms of the GNU General Public License
- as published by the Free Software Foundation; either version 2
- of the License, or (at your option) any later version.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
-
- You should have received a copy of the GNU General Public License
- along with this program; if not, write to the Free Software
- Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
- MA 02110-1301, US
-
- Copyright (C) 2008-2008 bla <blapost@gmail.com>
-*/
-#include "crapto1.h"
-#include <stdlib.h>
-
-#define SWAPENDIAN(x)\
- (x = (x >> 8 & 0xff00ff) | (x & 0xff00ff) << 8, x = x >> 16 | x << 16)
-
-struct Crypto1State * crypto1_create(uint64_t key)
-{
- struct Crypto1State *s = malloc(sizeof(*s));
- int i;
-
- for(i = 47;s && i > 0; i -= 2) {
- s->odd = s->odd << 1 | BIT(key, (i - 1) ^ 7);
- s->even = s->even << 1 | BIT(key, i ^ 7);
- }
- return s;
-}
-void crypto1_destroy(struct Crypto1State *state)
-{
- free(state);
-}
-void crypto1_get_lfsr(struct Crypto1State *state, uint64_t *lfsr)
-{
- int i;
- for(*lfsr = 0, i = 23; i >= 0; --i) {
- *lfsr = *lfsr << 1 | BIT(state->odd, i ^ 3);
- *lfsr = *lfsr << 1 | BIT(state->even, i ^ 3);
- }
-}
-uint8_t crypto1_bit(struct Crypto1State *s, uint8_t in, int is_encrypted)
-{
- uint32_t feedin;
- uint32_t tmp;
- uint8_t ret = filter(s->odd);
-
- feedin = ret & !!is_encrypted;
- feedin ^= !!in;
- feedin ^= LF_POLY_ODD & s->odd;
- feedin ^= LF_POLY_EVEN & s->even;
- s->even = s->even << 1 | parity(feedin);
-
- tmp = s->odd;
- s->odd = s->even;
- s->even = tmp;
-
- return ret;
-}
-uint8_t crypto1_byte(struct Crypto1State *s, uint8_t in, int is_encrypted)
-{
- uint8_t i, ret = 0;
-
- for (i = 0; i < 8; ++i)
- ret |= crypto1_bit(s, BIT(in, i), is_encrypted) << i;
-
- return ret;
-}
-uint32_t crypto1_word(struct Crypto1State *s, uint32_t in, int is_encrypted)
-{
- uint32_t i, ret = 0;
-
- for (i = 0; i < 4; ++i, in <<= 8)
- ret = ret << 8 | crypto1_byte(s, in >> 24, is_encrypted);
-
- return ret;
-}
-
-/* prng_successor
- * helper used to obscure the keystream during authentication
- */
-uint32_t prng_successor(uint32_t x, uint32_t n)
-{
- SWAPENDIAN(x);
- while(n--)
- x = x >> 1 | (x >> 16 ^ x >> 18 ^ x >> 19 ^ x >> 21) << 31;
-
- return SWAPENDIAN(x);
-}
#include "mifarehost.h"
#include "ui.h"
#include "util.h"
+#include "crapto1/crapto1.h"
int compar_state(const void * a, const void * b) {
// didn't work: (the result is truncated to 32 bits)
int nonce2key(uint32_t uid, uint32_t nt, uint32_t nr, uint64_t par_info, uint64_t ks_info, uint64_t * key) {
struct Crypto1State *state;
uint32_t i, pos, rr, nr_diff, key_count;//, ks1, ks2;
- byte_t bt, ks3x[8], par[8][8];
+ uint8_t bt, ks3x[8], par[8][8];
uint64_t key_recovered;
int64_t *state_s;
static uint32_t last_uid;
if (par_info==0)
PrintAndLog("parity is all zero,try special attack!just wait for few more seconds...");
- state = lfsr_common_prefix(nr, rr, ks3x, par, par_info==0);
+ state = lfsr_common_prefix(nr, rr, ks3x, par);
state_s = (int64_t*)state;
//char filename[50] ;
#ifndef __NONCE2KEY_H
#define __NONCE2KEY_H
-#include <stdio.h>
-#include <stdlib.h>
-#include "crapto1.h"
-#include "common.h"
-//#include <stdbool.h> //for bool
+#include <stdint.h>
+#include <stdbool.h>
typedef struct {
uint32_t cuid;
# Also search prerequisites in the common directory (for usb.c), the fpga directory (for fpga.bit), and the zlib directory
-VPATH = . ../common ../fpga ../zlib
+VPATH = . ../common ../common/crapto1 ../fpga ../zlib
INCLUDES = ../include/proxmark3.h ../include/at91sam7s512.h ../include/config_gpio.h ../include/usb_cmd.h $(APP_INCLUDES)
--- /dev/null
+/* crapto1.c
+
+ This program is free software; you can redistribute it and/or
+ modify it under the terms of the GNU General Public License
+ as published by the Free Software Foundation; either version 2
+ of the License, or (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program; if not, write to the Free Software
+ Foundation, Inc., 51 Franklin Street, Fifth Floor,
+ Boston, MA 02110-1301, US$
+
+ Copyright (C) 2008-2008 bla <blapost@gmail.com>
+*/
+#include "crapto1.h"
+#include <stdlib.h>
+#include <stdbool.h>
+
+#if !defined LOWMEM && defined __GNUC__
+static uint8_t filterlut[1 << 20];
+static void __attribute__((constructor)) fill_lut()
+{
+ uint32_t i;
+ for(i = 0; i < 1 << 20; ++i)
+ filterlut[i] = filter(i);
+}
+#define filter(x) (filterlut[(x) & 0xfffff])
+#endif
+
+
+
+typedef struct bucket {
+ uint32_t *head;
+ uint32_t *bp;
+} bucket_t;
+
+typedef bucket_t bucket_array_t[2][0x100];
+
+typedef struct bucket_info {
+ struct {
+ uint32_t *head, *tail;
+ } bucket_info[2][0x100];
+ uint32_t numbuckets;
+ } bucket_info_t;
+
+
+static void bucket_sort_intersect(uint32_t* const estart, uint32_t* const estop,
+ uint32_t* const ostart, uint32_t* const ostop,
+ bucket_info_t *bucket_info, bucket_array_t bucket)
+{
+ uint32_t *p1, *p2;
+ uint32_t *start[2];
+ uint32_t *stop[2];
+
+ start[0] = estart;
+ stop[0] = estop;
+ start[1] = ostart;
+ stop[1] = ostop;
+
+ // init buckets to be empty
+ for (uint32_t i = 0; i < 2; i++) {
+ for (uint32_t j = 0x00; j <= 0xff; j++) {
+ bucket[i][j].bp = bucket[i][j].head;
+ }
+ }
+
+ // sort the lists into the buckets based on the MSB (contribution bits)
+ for (uint32_t i = 0; i < 2; i++) {
+ for (p1 = start[i]; p1 <= stop[i]; p1++) {
+ uint32_t bucket_index = (*p1 & 0xff000000) >> 24;
+ *(bucket[i][bucket_index].bp++) = *p1;
+ }
+ }
+
+
+ // write back intersecting buckets as sorted list.
+ // fill in bucket_info with head and tail of the bucket contents in the list and number of non-empty buckets.
+ uint32_t nonempty_bucket;
+ for (uint32_t i = 0; i < 2; i++) {
+ p1 = start[i];
+ nonempty_bucket = 0;
+ for (uint32_t j = 0x00; j <= 0xff; j++) {
+ if (bucket[0][j].bp != bucket[0][j].head && bucket[1][j].bp != bucket[1][j].head) { // non-empty intersecting buckets only
+ bucket_info->bucket_info[i][nonempty_bucket].head = p1;
+ for (p2 = bucket[i][j].head; p2 < bucket[i][j].bp; *p1++ = *p2++);
+ bucket_info->bucket_info[i][nonempty_bucket].tail = p1 - 1;
+ nonempty_bucket++;
+ }
+ }
+ bucket_info->numbuckets = nonempty_bucket;
+ }
+}
+
+/** binsearch
+ * Binary search for the first occurence of *stop's MSB in sorted [start,stop]
+ */
+static inline uint32_t*
+binsearch(uint32_t *start, uint32_t *stop)
+{
+ uint32_t mid, val = *stop & 0xff000000;
+ while(start != stop)
+ if(start[mid = (stop - start) >> 1] > val)
+ stop = &start[mid];
+ else
+ start += mid + 1;
+
+ return start;
+}
+
+/** update_contribution
+ * helper, calculates the partial linear feedback contributions and puts in MSB
+ */
+static inline void
+update_contribution(uint32_t *item, const uint32_t mask1, const uint32_t mask2)
+{
+ uint32_t p = *item >> 25;
+
+ p = p << 1 | parity(*item & mask1);
+ p = p << 1 | parity(*item & mask2);
+ *item = p << 24 | (*item & 0xffffff);
+}
+
+/** extend_table
+ * using a bit of the keystream extend the table of possible lfsr states
+ */
+static inline void
+extend_table(uint32_t *tbl, uint32_t **end, int bit, int m1, int m2, uint32_t in)
+{
+ in <<= 24;
+
+ for(uint32_t *p = tbl; p <= *end; p++) {
+ *p <<= 1;
+ if(filter(*p) != filter(*p | 1)) { // replace
+ *p |= filter(*p) ^ bit;
+ update_contribution(p, m1, m2);
+ *p ^= in;
+ } else if(filter(*p) == bit) { // insert
+ *++*end = p[1];
+ p[1] = p[0] | 1;
+ update_contribution(p, m1, m2);
+ *p++ ^= in;
+ update_contribution(p, m1, m2);
+ *p ^= in;
+ } else { // drop
+ *p-- = *(*end)--;
+ }
+ }
+
+}
+
+
+/** extend_table_simple
+ * using a bit of the keystream extend the table of possible lfsr states
+ */
+static inline void
+extend_table_simple(uint32_t *tbl, uint32_t **end, int bit)
+{
+ for(*tbl <<= 1; tbl <= *end; *++tbl <<= 1)
+ if(filter(*tbl) ^ filter(*tbl | 1)) { // replace
+ *tbl |= filter(*tbl) ^ bit;
+ } else if(filter(*tbl) == bit) { // insert
+ *++*end = *++tbl;
+ *tbl = tbl[-1] | 1;
+ } else // drop
+ *tbl-- = *(*end)--;
+}
+
+
+/** recover
+ * recursively narrow down the search space, 4 bits of keystream at a time
+ */
+static struct Crypto1State*
+recover(uint32_t *o_head, uint32_t *o_tail, uint32_t oks,
+ uint32_t *e_head, uint32_t *e_tail, uint32_t eks, int rem,
+ struct Crypto1State *sl, uint32_t in, bucket_array_t bucket)
+{
+ uint32_t *o, *e;
+ bucket_info_t bucket_info;
+
+ if(rem == -1) {
+ for(e = e_head; e <= e_tail; ++e) {
+ *e = *e << 1 ^ parity(*e & LF_POLY_EVEN) ^ !!(in & 4);
+ for(o = o_head; o <= o_tail; ++o, ++sl) {
+ sl->even = *o;
+ sl->odd = *e ^ parity(*o & LF_POLY_ODD);
+ }
+ }
+ sl->odd = sl->even = 0;
+ return sl;
+ }
+
+ for(uint32_t i = 0; i < 4 && rem--; i++) {
+ extend_table(o_head, &o_tail, (oks >>= 1) & 1,
+ LF_POLY_EVEN << 1 | 1, LF_POLY_ODD << 1, 0);
+ if(o_head > o_tail)
+ return sl;
+
+ extend_table(e_head, &e_tail, (eks >>= 1) & 1,
+ LF_POLY_ODD, LF_POLY_EVEN << 1 | 1, (in >>= 2) & 3);
+ if(e_head > e_tail)
+ return sl;
+ }
+
+ bucket_sort_intersect(e_head, e_tail, o_head, o_tail, &bucket_info, bucket);
+
+ for (int i = bucket_info.numbuckets - 1; i >= 0; i--) {
+ sl = recover(bucket_info.bucket_info[1][i].head, bucket_info.bucket_info[1][i].tail, oks,
+ bucket_info.bucket_info[0][i].head, bucket_info.bucket_info[0][i].tail, eks,
+ rem, sl, in, bucket);
+ }
+
+ return sl;
+}
+/** lfsr_recovery
+ * recover the state of the lfsr given 32 bits of the keystream
+ * additionally you can use the in parameter to specify the value
+ * that was fed into the lfsr at the time the keystream was generated
+ */
+struct Crypto1State* lfsr_recovery32(uint32_t ks2, uint32_t in)
+{
+ struct Crypto1State *statelist;
+ uint32_t *odd_head = 0, *odd_tail = 0, oks = 0;
+ uint32_t *even_head = 0, *even_tail = 0, eks = 0;
+ int i;
+
+ // split the keystream into an odd and even part
+ for(i = 31; i >= 0; i -= 2)
+ oks = oks << 1 | BEBIT(ks2, i);
+ for(i = 30; i >= 0; i -= 2)
+ eks = eks << 1 | BEBIT(ks2, i);
+
+ odd_head = odd_tail = malloc(sizeof(uint32_t) << 21);
+ even_head = even_tail = malloc(sizeof(uint32_t) << 21);
+ statelist = malloc(sizeof(struct Crypto1State) << 18);
+ if(!odd_tail-- || !even_tail-- || !statelist) {
+ goto out;
+ }
+ statelist->odd = statelist->even = 0;
+
+ // allocate memory for out of place bucket_sort
+ bucket_array_t bucket;
+ for (uint32_t i = 0; i < 2; i++)
+ for (uint32_t j = 0; j <= 0xff; j++) {
+ bucket[i][j].head = malloc(sizeof(uint32_t)<<14);
+ if (!bucket[i][j].head) {
+ goto out;
+ }
+ }
+
+
+ // initialize statelists: add all possible states which would result into the rightmost 2 bits of the keystream
+ for(i = 1 << 20; i >= 0; --i) {
+ if(filter(i) == (oks & 1))
+ *++odd_tail = i;
+ if(filter(i) == (eks & 1))
+ *++even_tail = i;
+ }
+
+ // extend the statelists. Look at the next 8 Bits of the keystream (4 Bit each odd and even):
+ for(i = 0; i < 4; i++) {
+ extend_table_simple(odd_head, &odd_tail, (oks >>= 1) & 1);
+ extend_table_simple(even_head, &even_tail, (eks >>= 1) & 1);
+ }
+
+ // the statelists now contain all states which could have generated the last 10 Bits of the keystream.
+ // 22 bits to go to recover 32 bits in total. From now on, we need to take the "in"
+ // parameter into account.
+
+ in = (in >> 16 & 0xff) | (in << 16) | (in & 0xff00); // Byte swapping
+
+ recover(odd_head, odd_tail, oks,
+ even_head, even_tail, eks, 11, statelist, in << 1, bucket);
+
+
+out:
+ free(odd_head);
+ free(even_head);
+ for (uint32_t i = 0; i < 2; i++)
+ for (uint32_t j = 0; j <= 0xff; j++)
+ free(bucket[i][j].head);
+
+ return statelist;
+}
+
+static const uint32_t S1[] = { 0x62141, 0x310A0, 0x18850, 0x0C428, 0x06214,
+ 0x0310A, 0x85E30, 0xC69AD, 0x634D6, 0xB5CDE, 0xDE8DA, 0x6F46D, 0xB3C83,
+ 0x59E41, 0xA8995, 0xD027F, 0x6813F, 0x3409F, 0x9E6FA};
+static const uint32_t S2[] = { 0x3A557B00, 0x5D2ABD80, 0x2E955EC0, 0x174AAF60,
+ 0x0BA557B0, 0x05D2ABD8, 0x0449DE68, 0x048464B0, 0x42423258, 0x278192A8,
+ 0x156042D0, 0x0AB02168, 0x43F89B30, 0x61FC4D98, 0x765EAD48, 0x7D8FDD20,
+ 0x7EC7EE90, 0x7F63F748, 0x79117020};
+static const uint32_t T1[] = {
+ 0x4F37D, 0x279BE, 0x97A6A, 0x4BD35, 0x25E9A, 0x12F4D, 0x097A6, 0x80D66,
+ 0xC4006, 0x62003, 0xB56B4, 0x5AB5A, 0xA9318, 0xD0F39, 0x6879C, 0xB057B,
+ 0x582BD, 0x2C15E, 0x160AF, 0x8F6E2, 0xC3DC4, 0xE5857, 0x72C2B, 0x39615,
+ 0x98DBF, 0xC806A, 0xE0680, 0x70340, 0x381A0, 0x98665, 0x4C332, 0xA272C};
+static const uint32_t T2[] = { 0x3C88B810, 0x5E445C08, 0x2982A580, 0x14C152C0,
+ 0x4A60A960, 0x253054B0, 0x52982A58, 0x2FEC9EA8, 0x1156C4D0, 0x08AB6268,
+ 0x42F53AB0, 0x217A9D58, 0x161DC528, 0x0DAE6910, 0x46D73488, 0x25CB11C0,
+ 0x52E588E0, 0x6972C470, 0x34B96238, 0x5CFC3A98, 0x28DE96C8, 0x12CFC0E0,
+ 0x4967E070, 0x64B3F038, 0x74F97398, 0x7CDC3248, 0x38CE92A0, 0x1C674950,
+ 0x0E33A4A8, 0x01B959D0, 0x40DCACE8, 0x26CEDDF0};
+static const uint32_t C1[] = { 0x846B5, 0x4235A, 0x211AD};
+static const uint32_t C2[] = { 0x1A822E0, 0x21A822E0, 0x21A822E0};
+/** Reverse 64 bits of keystream into possible cipher states
+ * Variation mentioned in the paper. Somewhat optimized version
+ */
+struct Crypto1State* lfsr_recovery64(uint32_t ks2, uint32_t ks3)
+{
+ struct Crypto1State *statelist, *sl;
+ uint8_t oks[32], eks[32], hi[32];
+ uint32_t low = 0, win = 0;
+ uint32_t *tail, table[1 << 16];
+ int i, j;
+
+ sl = statelist = malloc(sizeof(struct Crypto1State) << 4);
+ if(!sl)
+ return 0;
+ sl->odd = sl->even = 0;
+
+ for(i = 30; i >= 0; i -= 2) {
+ oks[i >> 1] = BIT(ks2, i ^ 24);
+ oks[16 + (i >> 1)] = BIT(ks3, i ^ 24);
+ }
+ for(i = 31; i >= 0; i -= 2) {
+ eks[i >> 1] = BIT(ks2, i ^ 24);
+ eks[16 + (i >> 1)] = BIT(ks3, i ^ 24);
+ }
+
+ for(i = 0xfffff; i >= 0; --i) {
+ if (filter(i) != oks[0])
+ continue;
+
+ *(tail = table) = i;
+ for(j = 1; tail >= table && j < 29; ++j)
+ extend_table_simple(table, &tail, oks[j]);
+
+ if(tail < table)
+ continue;
+
+ for(j = 0; j < 19; ++j)
+ low = low << 1 | parity(i & S1[j]);
+ for(j = 0; j < 32; ++j)
+ hi[j] = parity(i & T1[j]);
+
+ for(; tail >= table; --tail) {
+ for(j = 0; j < 3; ++j) {
+ *tail = *tail << 1;
+ *tail |= parity((i & C1[j]) ^ (*tail & C2[j]));
+ if(filter(*tail) != oks[29 + j])
+ goto continue2;
+ }
+
+ for(j = 0; j < 19; ++j)
+ win = win << 1 | parity(*tail & S2[j]);
+
+ win ^= low;
+ for(j = 0; j < 32; ++j) {
+ win = win << 1 ^ hi[j] ^ parity(*tail & T2[j]);
+ if(filter(win) != eks[j])
+ goto continue2;
+ }
+
+ *tail = *tail << 1 | parity(LF_POLY_EVEN & *tail);
+ sl->odd = *tail ^ parity(LF_POLY_ODD & win);
+ sl->even = win;
+ ++sl;
+ sl->odd = sl->even = 0;
+ continue2:;
+ }
+ }
+ return statelist;
+}
+
+/** lfsr_rollback_bit
+ * Rollback the shift register in order to get previous states
+ */
+void lfsr_rollback_bit(struct Crypto1State *s, uint32_t in, int fb)
+{
+ int out;
+ uint32_t tmp;
+
+ s->odd &= 0xffffff;
+ tmp = s->odd;
+ s->odd = s->even;
+ s->even = tmp;
+
+ out = s->even & 1;
+ out ^= LF_POLY_EVEN & (s->even >>= 1);
+ out ^= LF_POLY_ODD & s->odd;
+ out ^= !!in;
+ out ^= filter(s->odd) & !!fb;
+
+ s->even |= parity(out) << 23;
+}
+/** lfsr_rollback_byte
+ * Rollback the shift register in order to get previous states
+ */
+void lfsr_rollback_byte(struct Crypto1State *s, uint32_t in, int fb)
+{
+ int i;
+ for (i = 7; i >= 0; --i)
+ lfsr_rollback_bit(s, BEBIT(in, i), fb);
+}
+/** lfsr_rollback_word
+ * Rollback the shift register in order to get previous states
+ */
+void lfsr_rollback_word(struct Crypto1State *s, uint32_t in, int fb)
+{
+ int i;
+ for (i = 31; i >= 0; --i)
+ lfsr_rollback_bit(s, BEBIT(in, i), fb);
+}
+
+/** nonce_distance
+ * x,y valid tag nonces, then prng_successor(x, nonce_distance(x, y)) = y
+ */
+static uint16_t *dist = 0;
+int nonce_distance(uint32_t from, uint32_t to)
+{
+ uint16_t x, i;
+ if(!dist) {
+ dist = malloc(2 << 16);
+ if(!dist)
+ return -1;
+ for (x = i = 1; i; ++i) {
+ dist[(x & 0xff) << 8 | x >> 8] = i;
+ x = x >> 1 | (x ^ x >> 2 ^ x >> 3 ^ x >> 5) << 15;
+ }
+ }
+ return (65535 + dist[to >> 16] - dist[from >> 16]) % 65535;
+}
+
+
+static uint32_t fastfwd[2][8] = {
+ { 0, 0x4BC53, 0xECB1, 0x450E2, 0x25E29, 0x6E27A, 0x2B298, 0x60ECB},
+ { 0, 0x1D962, 0x4BC53, 0x56531, 0xECB1, 0x135D3, 0x450E2, 0x58980}};
+
+
+/** lfsr_prefix_ks
+ *
+ * Is an exported helper function from the common prefix attack
+ * Described in the "dark side" paper. It returns an -1 terminated array
+ * of possible partial(21 bit) secret state.
+ * The required keystream(ks) needs to contain the keystream that was used to
+ * encrypt the NACK which is observed when varying only the 4 last bits of Nr
+ * only correct iff [NR_3] ^ NR_3 does not depend on Nr_3
+ */
+uint32_t *lfsr_prefix_ks(uint8_t ks[8], int isodd)
+{
+ uint32_t *candidates = malloc(4 << 21);
+ uint32_t c, entry;
+ int size, i;
+
+ if(!candidates)
+ return 0;
+
+ size = (1 << 21) - 1;
+ for(i = 0; i <= size; ++i)
+ candidates[i] = i;
+
+ for(c = 0; c < 8; ++c)
+ for(i = 0;i <= size; ++i) {
+ entry = candidates[i] ^ fastfwd[isodd][c];
+
+ if(filter(entry >> 1) == BIT(ks[c], isodd))
+ if(filter(entry) == BIT(ks[c], isodd + 2))
+ continue;
+
+ candidates[i--] = candidates[size--];
+ }
+
+ candidates[size + 1] = -1;
+
+ return candidates;
+}
+
+/** brute_top
+ * helper function which eliminates possible secret states using parity bits
+ */
+static struct Crypto1State*
+brute_top(uint32_t prefix, uint32_t rresp, unsigned char parities[8][8],
+ uint32_t odd, uint32_t even, struct Crypto1State* sl)
+{
+ struct Crypto1State s;
+ uint32_t ks1, nr, ks2, rr, ks3, good, c;
+
+ bool no_par = true;
+ for (int i = 0; i < 8; i++) {
+ for (int j = 0; j < 8; j++) {
+ if (parities[i][j] != 0) {
+ no_par = false;
+ break;
+ }
+ }
+ }
+
+ for(c = 0; c < 8; ++c) {
+ s.odd = odd ^ fastfwd[1][c];
+ s.even = even ^ fastfwd[0][c];
+
+ lfsr_rollback_bit(&s, 0, 0);
+ lfsr_rollback_bit(&s, 0, 0);
+ lfsr_rollback_bit(&s, 0, 0);
+
+ lfsr_rollback_word(&s, 0, 0);
+ lfsr_rollback_word(&s, prefix | c << 5, 1);
+
+ sl->odd = s.odd;
+ sl->even = s.even;
+
+ if (no_par)
+ break;
+
+ ks1 = crypto1_word(&s, prefix | c << 5, 1);
+ ks2 = crypto1_word(&s,0,0);
+ ks3 = crypto1_word(&s, 0,0);
+ nr = ks1 ^ (prefix | c << 5);
+ rr = ks2 ^ rresp;
+
+ good = 1;
+ good &= parity(nr & 0x000000ff) ^ parities[c][3] ^ BIT(ks2, 24);
+ good &= parity(rr & 0xff000000) ^ parities[c][4] ^ BIT(ks2, 16);
+ good &= parity(rr & 0x00ff0000) ^ parities[c][5] ^ BIT(ks2, 8);
+ good &= parity(rr & 0x0000ff00) ^ parities[c][6] ^ BIT(ks2, 0);
+ good &= parity(rr & 0x000000ff) ^ parities[c][7] ^ BIT(ks3, 24);
+
+ if(!good)
+ return sl;
+ }
+
+ return ++sl;
+}
+
+
+/** lfsr_common_prefix
+ * Implentation of the common prefix attack.
+ * Requires the 28 bit constant prefix used as reader nonce (pfx)
+ * The reader response used (rr)
+ * The keystream used to encrypt the observed NACK's (ks)
+ * The parity bits (par)
+ * It returns a zero terminated list of possible cipher states after the
+ * tag nonce was fed in
+ */
+struct Crypto1State*
+lfsr_common_prefix(uint32_t pfx, uint32_t rr, uint8_t ks[8], uint8_t par[8][8])
+{
+ struct Crypto1State *statelist, *s;
+ uint32_t *odd, *even, *o, *e, top;
+
+ odd = lfsr_prefix_ks(ks, 1);
+ even = lfsr_prefix_ks(ks, 0);
+
+ statelist = malloc((sizeof *statelist) << 21); //how large should be?
+ if(!statelist || !odd || !even)
+ {
+ free(statelist);
+ free(odd);
+ free(even);
+ return 0;
+ }
+
+ s = statelist;
+ for(o = odd; *o != -1; ++o)
+ for(e = even; *e != -1; ++e)
+ for(top = 0; top < 64; ++top) {
+ *o = (*o & 0x1fffff) | (top << 21);
+ *e = (*e & 0x1fffff) | (top >> 3) << 21;
+ s = brute_top(pfx, rr, par, *o, *e, s);
+ }
+
+ s->odd = s->even = -1;
+ //printf("state count = %d\n",s-statelist);
+
+ free(odd);
+ free(even);
+
+ return statelist;
+}
--- /dev/null
+/* crapto1.h
+
+ This program is free software; you can redistribute it and/or
+ modify it under the terms of the GNU General Public License
+ as published by the Free Software Foundation; either version 2
+ of the License, or (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program; if not, write to the Free Software
+ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
+ MA 02110-1301, US$
+
+ Copyright (C) 2008-2008 bla <blapost@gmail.com>
+*/
+#ifndef CRAPTO1_INCLUDED
+#define CRAPTO1_INCLUDED
+#include <stdint.h>
+#ifdef __cplusplus
+extern "C" {
+#endif
+
+struct Crypto1State {uint32_t odd, even;};
+#if defined(__arm__)
+void crypto1_create(struct Crypto1State *s, uint64_t key);
+#else
+struct Crypto1State *crypto1_create(uint64_t key);
+#endif
+void crypto1_destroy(struct Crypto1State*);
+void crypto1_get_lfsr(struct Crypto1State*, uint64_t*);
+uint8_t crypto1_bit(struct Crypto1State*, uint8_t, int);
+uint8_t crypto1_byte(struct Crypto1State*, uint8_t, int);
+uint32_t crypto1_word(struct Crypto1State*, uint32_t, int);
+uint32_t prng_successor(uint32_t x, uint32_t n);
+
+struct Crypto1State* lfsr_recovery32(uint32_t ks2, uint32_t in);
+struct Crypto1State* lfsr_recovery64(uint32_t ks2, uint32_t ks3);
+uint32_t *lfsr_prefix_ks(uint8_t ks[8], int isodd);
+struct Crypto1State*
+lfsr_common_prefix(uint32_t pfx, uint32_t rr, uint8_t ks[8], uint8_t par[8][8]);
+
+
+void lfsr_rollback_bit(struct Crypto1State* s, uint32_t in, int fb);
+void lfsr_rollback_byte(struct Crypto1State* s, uint32_t in, int fb);
+void lfsr_rollback_word(struct Crypto1State* s, uint32_t in, int fb);
+int nonce_distance(uint32_t from, uint32_t to);
+#define FOREACH_VALID_NONCE(N, FILTER, FSIZE)\
+ uint32_t __n = 0,__M = 0, N = 0;\
+ int __i;\
+ for(; __n < 1 << 16; N = prng_successor(__M = ++__n, 16))\
+ for(__i = FSIZE - 1; __i >= 0; __i--)\
+ if(BIT(FILTER, __i) ^ parity(__M & 0xFF01))\
+ break;\
+ else if(__i)\
+ __M = prng_successor(__M, (__i == 7) ? 48 : 8);\
+ else
+
+#define LF_POLY_ODD (0x29CE5C)
+#define LF_POLY_EVEN (0x870804)
+#define BIT(x, n) ((x) >> (n) & 1)
+#define BEBIT(x, n) BIT(x, (n) ^ 24)
+static inline int parity(uint32_t x)
+{
+#if !defined __i386__ || !defined __GNUC__
+ x ^= x >> 16;
+ x ^= x >> 8;
+ x ^= x >> 4;
+ return BIT(0x6996, x & 0xf);
+#else
+ __asm( "movl %1, %%eax\n"
+ "mov %%ax, %%cx\n"
+ "shrl $0x10, %%eax\n"
+ "xor %%ax, %%cx\n"
+ "xor %%ch, %%cl\n"
+ "setpo %%al\n"
+ "movzx %%al, %0\n": "=r"(x) : "r"(x): "eax","ecx");
+ return x;
+#endif
+}
+static inline int filter(uint32_t const x)
+{
+ uint32_t f;
+
+ f = 0xf22c0 >> (x & 0xf) & 16;
+ f |= 0x6c9c0 >> (x >> 4 & 0xf) & 8;
+ f |= 0x3c8b0 >> (x >> 8 & 0xf) & 4;
+ f |= 0x1e458 >> (x >> 12 & 0xf) & 2;
+ f |= 0x0d938 >> (x >> 16 & 0xf) & 1;
+ return BIT(0xEC57E80A, f);
+}
+#ifdef __cplusplus
+}
+#endif
+#endif
--- /dev/null
+/* crypto1.c
+
+ This program is free software; you can redistribute it and/or
+ modify it under the terms of the GNU General Public License
+ as published by the Free Software Foundation; either version 2
+ of the License, or (at your option) any later version.
+
+ This program is distributed in the hope that it will be useful,
+ but WITHOUT ANY WARRANTY; without even the implied warranty of
+ MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ GNU General Public License for more details.
+
+ You should have received a copy of the GNU General Public License
+ along with this program; if not, write to the Free Software
+ Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
+ MA 02110-1301, US
+
+ Copyright (C) 2008-2008 bla <blapost@gmail.com>
+*/
+#include "crapto1.h"
+#include <stdlib.h>
+
+#define SWAPENDIAN(x)\
+ (x = (x >> 8 & 0xff00ff) | (x & 0xff00ff) << 8, x = x >> 16 | x << 16)
+
+#if defined(__arm__)
+void crypto1_create(struct Crypto1State *s, uint64_t key)
+{
+#else
+struct Crypto1State * crypto1_create(uint64_t key)
+{
+ struct Crypto1State *s = malloc(sizeof(*s));
+#endif
+ int i;
+
+ for(i = 47;s && i > 0; i -= 2) {
+ s->odd = s->odd << 1 | BIT(key, (i - 1) ^ 7);
+ s->even = s->even << 1 | BIT(key, i ^ 7);
+ }
+#if defined(__arm__)
+ return;
+#else
+ return s;
+#endif
+}
+#if defined(__arm__)
+void crypto1_destroy(struct Crypto1State *state)
+{
+ state->odd = 0;
+ state->even = 0;
+}
+#else
+void crypto1_destroy(struct Crypto1State *state)
+{
+ free(state);
+}
+#endif
+void crypto1_get_lfsr(struct Crypto1State *state, uint64_t *lfsr)
+{
+ int i;
+ for(*lfsr = 0, i = 23; i >= 0; --i) {
+ *lfsr = *lfsr << 1 | BIT(state->odd, i ^ 3);
+ *lfsr = *lfsr << 1 | BIT(state->even, i ^ 3);
+ }
+}
+uint8_t crypto1_bit(struct Crypto1State *s, uint8_t in, int is_encrypted)
+{
+ uint32_t feedin;
+ uint32_t tmp;
+ uint8_t ret = filter(s->odd);
+
+ feedin = ret & !!is_encrypted;
+ feedin ^= !!in;
+ feedin ^= LF_POLY_ODD & s->odd;
+ feedin ^= LF_POLY_EVEN & s->even;
+ s->even = s->even << 1 | parity(feedin);
+
+ tmp = s->odd;
+ s->odd = s->even;
+ s->even = tmp;
+
+ return ret;
+}
+uint8_t crypto1_byte(struct Crypto1State *s, uint8_t in, int is_encrypted)
+{
+ uint8_t i, ret = 0;
+
+ for (i = 0; i < 8; ++i)
+ ret |= crypto1_bit(s, BIT(in, i), is_encrypted) << i;
+
+ return ret;
+}
+uint32_t crypto1_word(struct Crypto1State *s, uint32_t in, int is_encrypted)
+{
+ uint32_t i, ret = 0;
+
+ for (i = 0; i < 4; ++i, in <<= 8)
+ ret = ret << 8 | crypto1_byte(s, in >> 24, is_encrypted);
+
+ return ret;
+}
+
+/* prng_successor
+ * helper used to obscure the keystream during authentication
+ */
+uint32_t prng_successor(uint32_t x, uint32_t n)
+{
+ SWAPENDIAN(x);
+ while(n--)
+ x = x >> 1 | (x >> 16 ^ x >> 18 ^ x >> 19 ^ x >> 21) << 31;
+
+ return SWAPENDIAN(x);
+}
+++ /dev/null
-/* crapto1.c\r
-\r
- This program is free software; you can redistribute it and/or\r
- modify it under the terms of the GNU General Public License\r
- as published by the Free Software Foundation; either version 2\r
- of the License, or (at your option) any later version.\r
-\r
- This program is distributed in the hope that it will be useful,\r
- but WITHOUT ANY WARRANTY; without even the implied warranty of\r
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r
- GNU General Public License for more details.\r
-\r
- You should have received a copy of the GNU General Public License\r
- along with this program; if not, write to the Free Software\r
- Foundation, Inc., 51 Franklin Street, Fifth Floor,\r
- Boston, MA 02110-1301, US$\r
-\r
- Copyright (C) 2008-2008 bla <blapost@gmail.com>\r
-*/\r
-#include "crapto1.h"\r
-#include <stdlib.h>\r
-\r
-#if !defined LOWMEM && defined __GNUC__\r
-static uint8_t filterlut[1 << 20];\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
-}\r
-#define filter(x) (filterlut[(x) & 0xfffff])\r
-#endif\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
-/** binsearch\r
- * Binary search for the first occurence of *stop's MSB in sorted [start,stop]\r
- */\r
-static inline uint32_t* binsearch(uint32_t *start, uint32_t *stop)\r
-{\r
- uint32_t mid, val = *stop & 0xff000000;\r
- while(start != stop)\r
- if(start[mid = (stop - start) >> 1] > val)\r
- stop = &start[mid];\r
- else\r
- start += mid + 1;\r
-\r
- return start;\r
-}\r
-\r
-/** update_contribution\r
- * helper, calculates the partial linear feedback contributions and puts in MSB\r
- */\r
-static inline void\r
-update_contribution(uint32_t *item, const uint32_t mask1, const uint32_t mask2)\r
-{\r
- uint32_t p = *item >> 25;\r
-\r
- p = p << 1 | parity(*item & mask1);\r
- p = p << 1 | parity(*item & mask2);\r
- *item = p << 24 | (*item & 0xffffff);\r
-}\r
-\r
-/** extend_table\r
- * using a bit of the keystream extend the table of possible lfsr states\r
- */\r
-static inline void\r
-extend_table(uint32_t *tbl, uint32_t **end, int bit, int m1, int m2, uint32_t in)\r
-{\r
- in <<= 24;\r
- for(*tbl <<= 1; tbl <= *end; *++tbl <<= 1)\r
- if(filter(*tbl) ^ filter(*tbl | 1)) {\r
- *tbl |= filter(*tbl) ^ bit;\r
- update_contribution(tbl, m1, m2);\r
- *tbl ^= in;\r
- } else if(filter(*tbl) == bit) {\r
- *++*end = tbl[1];\r
- tbl[1] = tbl[0] | 1;\r
- update_contribution(tbl, m1, m2);\r
- *tbl++ ^= in;\r
- update_contribution(tbl, m1, m2);\r
- *tbl ^= in;\r
- } else\r
- *tbl-- = *(*end)--;\r
-}\r
-/** extend_table_simple\r
- * using a bit of the keystream extend the table of possible lfsr states\r
- */\r
-static inline void extend_table_simple(uint32_t *tbl, uint32_t **end, int bit)\r
-{\r
- for(*tbl <<= 1; tbl <= *end; *++tbl <<= 1)\r
- if(filter(*tbl) ^ filter(*tbl | 1))\r
- *tbl |= filter(*tbl) ^ bit;\r
- else if(filter(*tbl) == bit) {\r
- *++*end = *++tbl;\r
- *tbl = tbl[-1] | 1;\r
- } else\r
- *tbl-- = *(*end)--;\r
-}\r
-/** recover\r
- * recursively narrow down the search space, 4 bits of keystream at a time\r
- */\r
-static struct Crypto1State*\r
-recover(uint32_t *o_head, uint32_t *o_tail, uint32_t oks,\r
- uint32_t *e_head, uint32_t *e_tail, uint32_t eks, int rem,\r
- struct Crypto1State *sl, uint32_t in)\r
-{\r
- uint32_t *o, *e, i;\r
-\r
- if(rem == -1) {\r
- for(e = e_head; e <= e_tail; ++e) {\r
- *e = *e << 1 ^ parity(*e & LF_POLY_EVEN) ^ !!(in & 4);\r
- for(o = o_head; o <= o_tail; ++o, ++sl) {\r
- sl->even = *o;\r
- sl->odd = *e ^ parity(*o & LF_POLY_ODD);\r
- sl[1].odd = sl[1].even = 0;\r
- }\r
- }\r
- return sl;\r
- }\r
-\r
- for(i = 0; i < 4 && rem--; i++) {\r
- oks >>= 1;\r
- eks >>= 1;\r
- in >>= 2;\r
- extend_table(o_head, &o_tail, oks & 1, LF_POLY_EVEN << 1 | 1,\r
- LF_POLY_ODD << 1, 0);\r
- if(o_head > o_tail)\r
- return sl;\r
-\r
- extend_table(e_head, &e_tail, eks & 1, LF_POLY_ODD,\r
- LF_POLY_EVEN << 1 | 1, in & 3);\r
- if(e_head > e_tail)\r
- return sl;\r
- }\r
-\r
- quicksort(o_head, o_tail);\r
- quicksort(e_head, e_tail);\r
-\r
- while(o_tail >= o_head && e_tail >= e_head)\r
- if(((*o_tail ^ *e_tail) >> 24) == 0) {\r
- o_tail = binsearch(o_head, o = o_tail);\r
- e_tail = binsearch(e_head, e = e_tail);\r
- sl = recover(o_tail--, o, oks,\r
- e_tail--, e, eks, rem, sl, in);\r
- }\r
- else if(*o_tail > *e_tail)\r
- o_tail = binsearch(o_head, o_tail) - 1;\r
- else\r
- e_tail = binsearch(e_head, e_tail) - 1;\r
-\r
- return sl;\r
-}\r
-/** lfsr_recovery\r
- * recover the state of the lfsr given 32 bits of the keystream\r
- * additionally you can use the in parameter to specify the value\r
- * that was fed into the lfsr at the time the keystream was generated\r
- */\r
-struct Crypto1State* lfsr_recovery32(uint32_t ks2, uint32_t in)\r
-{\r
- struct Crypto1State *statelist;\r
- uint32_t *odd_head = 0, *odd_tail = 0, oks = 0;\r
- uint32_t *even_head = 0, *even_tail = 0, eks = 0;\r
- int i;\r
-\r
- for(i = 31; i >= 0; i -= 2)\r
- oks = oks << 1 | BEBIT(ks2, i);\r
- for(i = 30; i >= 0; i -= 2)\r
- eks = eks << 1 | BEBIT(ks2, i);\r
-\r
- odd_head = odd_tail = malloc(sizeof(uint32_t) << 21);\r
- even_head = even_tail = malloc(sizeof(uint32_t) << 21);\r
- statelist = malloc(sizeof(struct Crypto1State) << 18);\r
- if(!odd_tail-- || !even_tail-- || !statelist) {\r
- free(statelist);\r
- statelist = 0;\r
- goto out;\r
- }\r
-\r
- statelist->odd = statelist->even = 0;\r
-\r
- for(i = 1 << 20; i >= 0; --i) {\r
- if(filter(i) == (oks & 1))\r
- *++odd_tail = i;\r
- if(filter(i) == (eks & 1))\r
- *++even_tail = i;\r
- }\r
-\r
- for(i = 0; i < 4; i++) {\r
- extend_table_simple(odd_head, &odd_tail, (oks >>= 1) & 1);\r
- extend_table_simple(even_head, &even_tail, (eks >>= 1) & 1);\r
- }\r
-\r
- in = (in >> 16 & 0xff) | (in << 16) | (in & 0xff00);\r
- recover(odd_head, odd_tail, oks,\r
- even_head, even_tail, eks, 11, statelist, in << 1);\r
-\r
-out:\r
- free(odd_head);\r
- free(even_head);\r
- return statelist;\r
-}\r
-\r
-static const uint32_t S1[] = { 0x62141, 0x310A0, 0x18850, 0x0C428, 0x06214,\r
- 0x0310A, 0x85E30, 0xC69AD, 0x634D6, 0xB5CDE, 0xDE8DA, 0x6F46D, 0xB3C83,\r
- 0x59E41, 0xA8995, 0xD027F, 0x6813F, 0x3409F, 0x9E6FA};\r
-static const uint32_t S2[] = { 0x3A557B00, 0x5D2ABD80, 0x2E955EC0, 0x174AAF60,\r
- 0x0BA557B0, 0x05D2ABD8, 0x0449DE68, 0x048464B0, 0x42423258, 0x278192A8,\r
- 0x156042D0, 0x0AB02168, 0x43F89B30, 0x61FC4D98, 0x765EAD48, 0x7D8FDD20,\r
- 0x7EC7EE90, 0x7F63F748, 0x79117020};\r
-static const uint32_t T1[] = {\r
- 0x4F37D, 0x279BE, 0x97A6A, 0x4BD35, 0x25E9A, 0x12F4D, 0x097A6, 0x80D66,\r
- 0xC4006, 0x62003, 0xB56B4, 0x5AB5A, 0xA9318, 0xD0F39, 0x6879C, 0xB057B,\r
- 0x582BD, 0x2C15E, 0x160AF, 0x8F6E2, 0xC3DC4, 0xE5857, 0x72C2B, 0x39615,\r
- 0x98DBF, 0xC806A, 0xE0680, 0x70340, 0x381A0, 0x98665, 0x4C332, 0xA272C};\r
-static const uint32_t T2[] = { 0x3C88B810, 0x5E445C08, 0x2982A580, 0x14C152C0,\r
- 0x4A60A960, 0x253054B0, 0x52982A58, 0x2FEC9EA8, 0x1156C4D0, 0x08AB6268,\r
- 0x42F53AB0, 0x217A9D58, 0x161DC528, 0x0DAE6910, 0x46D73488, 0x25CB11C0,\r
- 0x52E588E0, 0x6972C470, 0x34B96238, 0x5CFC3A98, 0x28DE96C8, 0x12CFC0E0,\r
- 0x4967E070, 0x64B3F038, 0x74F97398, 0x7CDC3248, 0x38CE92A0, 0x1C674950,\r
- 0x0E33A4A8, 0x01B959D0, 0x40DCACE8, 0x26CEDDF0};\r
-static const uint32_t C1[] = { 0x846B5, 0x4235A, 0x211AD};\r
-static const uint32_t C2[] = { 0x1A822E0, 0x21A822E0, 0x21A822E0};\r
-/** Reverse 64 bits of keystream into possible cipher states\r
- * Variation mentioned in the paper. Somewhat optimized version\r
- */\r
-struct Crypto1State* lfsr_recovery64(uint32_t ks2, uint32_t ks3)\r
-{\r
- struct Crypto1State *statelist, *sl;\r
- uint8_t oks[32], eks[32], hi[32];\r
- uint32_t low = 0, win = 0;\r
- uint32_t *tail, table[1 << 16];\r
- int i, j;\r
-\r
- sl = statelist = malloc(sizeof(struct Crypto1State) << 4);\r
- if(!sl)\r
- return 0;\r
- sl->odd = sl->even = 0;\r
-\r
- for(i = 30; i >= 0; i -= 2) {\r
- oks[i >> 1] = BEBIT(ks2, i);\r
- oks[16 + (i >> 1)] = BEBIT(ks3, i);\r
- }\r
- for(i = 31; i >= 0; i -= 2) {\r
- eks[i >> 1] = BEBIT(ks2, i);\r
- eks[16 + (i >> 1)] = BEBIT(ks3, i);\r
- }\r
-\r
- for(i = 0xfffff; i >= 0; --i) {\r
- if (filter(i) != oks[0])\r
- continue;\r
-\r
- *(tail = table) = i;\r
- for(j = 1; tail >= table && j < 29; ++j)\r
- extend_table_simple(table, &tail, oks[j]);\r
-\r
- if(tail < table)\r
- continue;\r
-\r
- for(j = 0; j < 19; ++j)\r
- low = low << 1 | parity(i & S1[j]);\r
- for(j = 0; j < 32; ++j)\r
- hi[j] = parity(i & T1[j]);\r
-\r
- for(; tail >= table; --tail) {\r
- for(j = 0; j < 3; ++j) {\r
- *tail = *tail << 1;\r
- *tail |= parity((i & C1[j]) ^ (*tail & C2[j]));\r
- if(filter(*tail) != oks[29 + j])\r
- goto continue2;\r
- }\r
-\r
- for(j = 0; j < 19; ++j)\r
- win = win << 1 | parity(*tail & S2[j]);\r
-\r
- win ^= low;\r
- for(j = 0; j < 32; ++j) {\r
- win = win << 1 ^ hi[j] ^ parity(*tail & T2[j]);\r
- if(filter(win) != eks[j])\r
- goto continue2;\r
- }\r
-\r
- *tail = *tail << 1 | parity(LF_POLY_EVEN & *tail);\r
- sl->odd = *tail ^ parity(LF_POLY_ODD & win);\r
- sl->even = win;\r
- ++sl;\r
- sl->odd = sl->even = 0;\r
- continue2:;\r
- }\r
- }\r
- return statelist;\r
-}\r
-\r
-/** lfsr_rollback_bit\r
- * Rollback the shift register in order to get previous states\r
- */\r
-uint8_t lfsr_rollback_bit(struct Crypto1State *s, uint32_t in, int fb)\r
-{\r
- int out;\r
- uint8_t ret;\r
-\r
- s->odd &= 0xffffff;\r
- s->odd ^= (s->odd ^= s->even, s->even ^= s->odd);\r
-\r
- out = s->even & 1;\r
- out ^= LF_POLY_EVEN & (s->even >>= 1);\r
- out ^= LF_POLY_ODD & s->odd;\r
- out ^= !!in;\r
- out ^= (ret = filter(s->odd)) & !!fb;\r
-\r
- s->even |= parity(out) << 23;\r
- return ret;\r
-}\r
-/** lfsr_rollback_byte\r
- * Rollback the shift register in order to get previous states\r
- */\r
-uint8_t lfsr_rollback_byte(struct Crypto1State *s, uint32_t in, int fb)\r
-{\r
- int i, ret = 0;\r
- for (i = 7; i >= 0; --i)\r
- ret |= lfsr_rollback_bit(s, BIT(in, i), fb) << i;\r
- return ret;\r
-}\r
-/** lfsr_rollback_word\r
- * Rollback the shift register in order to get previous states\r
- */\r
-uint32_t lfsr_rollback_word(struct Crypto1State *s, uint32_t in, int fb)\r
-{\r
- int i;\r
- uint32_t ret = 0;\r
- for (i = 31; i >= 0; --i)\r
- ret |= lfsr_rollback_bit(s, BEBIT(in, i), fb) << (i ^ 24);\r
- return ret;\r
-}\r
-\r
-/** nonce_distance\r
- * x,y valid tag nonces, then prng_successor(x, nonce_distance(x, y)) = y\r
- */\r
-static uint16_t *dist = 0;\r
-int nonce_distance(uint32_t from, uint32_t to)\r
-{\r
- uint16_t x, i;\r
- if(!dist) {\r
- dist = malloc(2 << 16);\r
- if(!dist)\r
- return -1;\r
- for (x = i = 1; i; ++i) {\r
- dist[(x & 0xff) << 8 | x >> 8] = i;\r
- x = x >> 1 | (x ^ x >> 2 ^ x >> 3 ^ x >> 5) << 15;\r
- }\r
- }\r
- return (65535 + dist[to >> 16] - dist[from >> 16]) % 65535;\r
-}\r
-\r
-\r
-static uint32_t fastfwd[2][8] = {\r
- { 0, 0x4BC53, 0xECB1, 0x450E2, 0x25E29, 0x6E27A, 0x2B298, 0x60ECB},\r
- { 0, 0x1D962, 0x4BC53, 0x56531, 0xECB1, 0x135D3, 0x450E2, 0x58980}};\r
-/** lfsr_prefix_ks\r
- *\r
- * Is an exported helper function from the common prefix attack\r
- * Described in the "dark side" paper. It returns an -1 terminated array\r
- * of possible partial(21 bit) secret state.\r
- * The required keystream(ks) needs to contain the keystream that was used to\r
- * encrypt the NACK which is observed when varying only the 3 last bits of Nr\r
- * only correct iff [NR_3] ^ NR_3 does not depend on Nr_3\r
- */\r
-uint32_t *lfsr_prefix_ks(uint8_t ks[8], int isodd)\r
-{\r
- uint32_t c, entry, *candidates = malloc(4 << 10);\r
- int i, size = 0, good;\r
-\r
- if(!candidates)\r
- return 0;\r
-\r
- for(i = 0; i < 1 << 21; ++i) {\r
- for(c = 0, good = 1; good && c < 8; ++c) {\r
- entry = i ^ fastfwd[isodd][c];\r
- good &= (BIT(ks[c], isodd) == filter(entry >> 1));\r
- good &= (BIT(ks[c], isodd + 2) == filter(entry));\r
- }\r
- if(good)\r
- candidates[size++] = i;\r
- }\r
-\r
- candidates[size] = -1;\r
-\r
- return candidates;\r
-}\r
-\r
-/** check_pfx_parity\r
- * helper function which eliminates possible secret states using parity bits\r
- */\r
-static struct Crypto1State*\r
-check_pfx_parity(uint32_t prefix, uint32_t rresp, uint8_t parities[8][8],\r
- uint32_t odd, uint32_t even, struct Crypto1State* sl)\r
-{\r
- uint32_t ks1, nr, ks2, rr, ks3, c, good = 1;\r
-\r
- for(c = 0; good && c < 8; ++c) {\r
- sl->odd = odd ^ fastfwd[1][c];\r
- sl->even = even ^ fastfwd[0][c];\r
-\r
- lfsr_rollback_bit(sl, 0, 0);\r
- lfsr_rollback_bit(sl, 0, 0);\r
-\r
- ks3 = lfsr_rollback_bit(sl, 0, 0);\r
- ks2 = lfsr_rollback_word(sl, 0, 0);\r
- ks1 = lfsr_rollback_word(sl, prefix | c << 5, 1);\r
-\r
- nr = ks1 ^ (prefix | c << 5);\r
- rr = ks2 ^ rresp;\r
-\r
- good &= parity(nr & 0x000000ff) ^ parities[c][3] ^ BIT(ks2, 24);\r
- good &= parity(rr & 0xff000000) ^ parities[c][4] ^ BIT(ks2, 16);\r
- good &= parity(rr & 0x00ff0000) ^ parities[c][5] ^ BIT(ks2, 8);\r
- good &= parity(rr & 0x0000ff00) ^ parities[c][6] ^ BIT(ks2, 0);\r
- good &= parity(rr & 0x000000ff) ^ parities[c][7] ^ ks3;\r
- }\r
-\r
- return sl + good;\r
-} \r
-\r
-\r
-/** lfsr_common_prefix\r
- * Implentation of the common prefix attack.\r
- */\r
-struct Crypto1State*\r
-lfsr_common_prefix(uint32_t pfx, uint32_t rr, uint8_t ks[8], uint8_t par[8][8])\r
-{\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(statelist);\r
- statelist = 0;\r
- goto out;\r
- }\r
-\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
- s = check_pfx_parity(pfx, rr, par, *o, *e, s);\r
- }\r
-\r
- s->odd = s->even = 0;\r
-out:\r
- free(odd);\r
- free(even);\r
- return statelist;\r
-}\r
+++ /dev/null
-/* crapto1.h
-
- This program is free software; you can redistribute it and/or
- modify it under the terms of the GNU General Public License
- as published by the Free Software Foundation; either version 2
- of the License, or (at your option) any later version.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
-
- You should have received a copy of the GNU General Public License
- along with this program; if not, write to the Free Software
- Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
- MA 02110-1301, US$
-
- Copyright (C) 2008-2008 bla <blapost@gmail.com>
-*/
-#ifndef CRAPTO1_INCLUDED
-#define CRAPTO1_INCLUDED
-#include <stdint.h>
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-struct Crypto1State {uint32_t odd, even;};
-struct Crypto1State* crypto1_create(uint64_t);
-void crypto1_destroy(struct Crypto1State*);
-void crypto1_get_lfsr(struct Crypto1State*, uint64_t*);
-uint8_t crypto1_bit(struct Crypto1State*, uint8_t, int);
-uint8_t crypto1_byte(struct Crypto1State*, uint8_t, int);
-uint32_t crypto1_word(struct Crypto1State*, uint32_t, int);
-uint32_t prng_successor(uint32_t x, uint32_t n);
-
-struct Crypto1State* lfsr_recovery32(uint32_t ks2, uint32_t in);
-struct Crypto1State* lfsr_recovery64(uint32_t ks2, uint32_t ks3);
-uint32_t *lfsr_prefix_ks(uint8_t ks[8], int isodd);
-struct Crypto1State*
-lfsr_common_prefix(uint32_t pfx, uint32_t rr, uint8_t ks[8], uint8_t par[8][8]);
-
-uint8_t lfsr_rollback_bit(struct Crypto1State* s, uint32_t in, int fb);
-uint8_t lfsr_rollback_byte(struct Crypto1State* s, uint32_t in, int fb);
-uint32_t lfsr_rollback_word(struct Crypto1State* s, uint32_t in, int fb);
-int nonce_distance(uint32_t from, uint32_t to);
-#define FOREACH_VALID_NONCE(N, FILTER, FSIZE)\
- uint32_t __n = 0,__M = 0, N = 0;\
- int __i;\
- for(; __n < 1 << 16; N = prng_successor(__M = ++__n, 16))\
- for(__i = FSIZE - 1; __i >= 0; __i--)\
- if(BIT(FILTER, __i) ^ parity(__M & 0xFF01))\
- break;\
- else if(__i)\
- __M = prng_successor(__M, (__i == 7) ? 48 : 8);\
- else
-
-#define LF_POLY_ODD (0x29CE5C)
-#define LF_POLY_EVEN (0x870804)
-#define BIT(x, n) ((x) >> (n) & 1)
-#define BEBIT(x, n) BIT(x, (n) ^ 24)
-static inline int parity(uint32_t x)
-{
-#if !defined __i386__ || !defined __GNUC__
- x ^= x >> 16;
- x ^= x >> 8;
- x ^= x >> 4;
- return BIT(0x6996, x & 0xf);
-#else
- asm( "movl %1, %%eax\n"
- "mov %%ax, %%cx\n"
- "shrl $0x10, %%eax\n"
- "xor %%ax, %%cx\n"
- "xor %%ch, %%cl\n"
- "setpo %%al\n"
- "movzx %%al, %0\n": "=r"(x) : "r"(x): "eax","ecx");
- return x;
-#endif
-}
-static inline int filter(uint32_t const x)
-{
- uint32_t f;
-
- f = 0xf22c0 >> (x & 0xf) & 16;
- f |= 0x6c9c0 >> (x >> 4 & 0xf) & 8;
- f |= 0x3c8b0 >> (x >> 8 & 0xf) & 4;
- f |= 0x1e458 >> (x >> 12 & 0xf) & 2;
- f |= 0x0d938 >> (x >> 16 & 0xf) & 1;
- return BIT(0xEC57E80A, f);
-}
-#ifdef __cplusplus
-}
-#endif
-#endif
+++ /dev/null
-/* crypto1.c
-
- This program is free software; you can redistribute it and/or
- modify it under the terms of the GNU General Public License
- as published by the Free Software Foundation; either version 2
- of the License, or (at your option) any later version.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
-
- You should have received a copy of the GNU General Public License
- along with this program; if not, write to the Free Software
- Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
- MA 02110-1301, US
-
- Copyright (C) 2008-2008 bla <blapost@gmail.com>
-*/
-#include "crapto1.h"
-#include <stdlib.h>
-
-#define SWAPENDIAN(x)\
- (x = (x >> 8 & 0xff00ff) | (x & 0xff00ff) << 8, x = x >> 16 | x << 16)
-
-struct Crypto1State * crypto1_create(uint64_t key)
-{
- struct Crypto1State *s = malloc(sizeof(*s));
- int i;
-
- for(i = 47;s && i > 0; i -= 2) {
- s->odd = s->odd << 1 | BIT(key, (i - 1) ^ 7);
- s->even = s->even << 1 | BIT(key, i ^ 7);
- }
- return s;
-}
-void crypto1_destroy(struct Crypto1State *state)
-{
- free(state);
-}
-void crypto1_get_lfsr(struct Crypto1State *state, uint64_t *lfsr)
-{
- int i;
- for(*lfsr = 0, i = 23; i >= 0; --i) {
- *lfsr = *lfsr << 1 | BIT(state->odd, i ^ 3);
- *lfsr = *lfsr << 1 | BIT(state->even, i ^ 3);
- }
-}
-uint8_t crypto1_bit(struct Crypto1State *s, uint8_t in, int is_encrypted)
-{
- uint32_t feedin;
- uint8_t ret = filter(s->odd);
-
- feedin = ret & !!is_encrypted;
- feedin ^= !!in;
- feedin ^= LF_POLY_ODD & s->odd;
- feedin ^= LF_POLY_EVEN & s->even;
- s->even = s->even << 1 | parity(feedin);
-
- s->odd ^= (s->odd ^= s->even, s->even ^= s->odd);
-
- return ret;
-}
-uint8_t crypto1_byte(struct Crypto1State *s, uint8_t in, int is_encrypted)
-{
- uint8_t i, ret = 0;
-
- for (i = 0; i < 8; ++i)
- ret |= crypto1_bit(s, BIT(in, i), is_encrypted) << i;
-
- return ret;
-}
-uint32_t crypto1_word(struct Crypto1State *s, uint32_t in, int is_encrypted)
-{
- uint32_t i, ret = 0;
-
- for (i = 0; i < 32; ++i)
- ret |= crypto1_bit(s, BEBIT(in, i), is_encrypted) << (i ^ 24);
-
- return ret;
-}
-
-/* prng_successor
- * helper used to obscure the keystream during authentication
- */
-uint32_t prng_successor(uint32_t x, uint32_t n)
-{
- SWAPENDIAN(x);
- while(n--)
- x = x >> 1 | (x >> 16 ^ x >> 18 ^ x >> 19 ^ x >> 21) << 31;
-
- return SWAPENDIAN(x);
-}
+++ /dev/null
-/* crapto1.c\r
-\r
- This program is free software; you can redistribute it and/or\r
- modify it under the terms of the GNU General Public License\r
- as published by the Free Software Foundation; either version 2\r
- of the License, or (at your option) any later version.\r
-\r
- This program is distributed in the hope that it will be useful,\r
- but WITHOUT ANY WARRANTY; without even the implied warranty of\r
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the\r
- GNU General Public License for more details.\r
-\r
- You should have received a copy of the GNU General Public License\r
- along with this program; if not, write to the Free Software\r
- Foundation, Inc., 51 Franklin Street, Fifth Floor,\r
- Boston, MA 02110-1301, US$\r
-\r
- Copyright (C) 2008-2008 bla <blapost@gmail.com>\r
-*/\r
-#include "crapto1.h"\r
-#include <stdlib.h>\r
-\r
-#if !defined LOWMEM && defined __GNUC__\r
-static uint8_t filterlut[1 << 20];\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
-}\r
-#define filter(x) (filterlut[(x) & 0xfffff])\r
-#endif\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
-/** binsearch\r
- * Binary search for the first occurence of *stop's MSB in sorted [start,stop]\r
- */\r
-static inline uint32_t*\r
-binsearch(uint32_t *start, uint32_t *stop)\r
-{\r
- uint32_t mid, val = *stop & 0xff000000;\r
- while(start != stop)\r
- if(start[mid = (stop - start) >> 1] > val)\r
- stop = &start[mid];\r
- else\r
- start += mid + 1;\r
-\r
- return start;\r
-}\r
-\r
-/** update_contribution\r
- * helper, calculates the partial linear feedback contributions and puts in MSB\r
- */\r
-static inline void\r
-update_contribution(uint32_t *item, const uint32_t mask1, const uint32_t mask2)\r
-{\r
- uint32_t p = *item >> 25;\r
-\r
- p = p << 1 | parity(*item & mask1);\r
- p = p << 1 | parity(*item & mask2);\r
- *item = p << 24 | (*item & 0xffffff);\r
-}\r
-\r
-/** extend_table\r
- * using a bit of the keystream extend the table of possible lfsr states\r
- */\r
-static inline void\r
-extend_table(uint32_t *tbl, uint32_t **end, int bit, int m1, int m2, uint32_t in)\r
-{\r
- in <<= 24;\r
- for(*tbl <<= 1; tbl <= *end; *++tbl <<= 1)\r
- if(filter(*tbl) ^ filter(*tbl | 1)) {\r
- *tbl |= filter(*tbl) ^ bit;\r
- update_contribution(tbl, m1, m2);\r
- *tbl ^= in;\r
- } else if(filter(*tbl) == bit) {\r
- *++*end = tbl[1];\r
- tbl[1] = tbl[0] | 1;\r
- update_contribution(tbl, m1, m2);\r
- *tbl++ ^= in;\r
- update_contribution(tbl, m1, m2);\r
- *tbl ^= in;\r
- } else\r
- *tbl-- = *(*end)--;\r
-}\r
-/** extend_table_simple\r
- * using a bit of the keystream extend the table of possible lfsr states\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
- if(filter(*tbl) ^ filter(*tbl | 1)) {\r
- *tbl |= filter(*tbl) ^ bit;\r
- } else if(filter(*tbl) == bit) {\r
- *++*end = *++tbl;\r
- *tbl = tbl[-1] | 1;\r
- } else\r
- *tbl-- = *(*end)--;\r
-}\r
-/** recover\r
- * recursively narrow down the search space, 4 bits of keystream at a time\r
- */\r
-static struct Crypto1State*\r
-recover(uint32_t *o_head, uint32_t *o_tail, uint32_t oks,\r
- uint32_t *e_head, uint32_t *e_tail, uint32_t eks, int rem,\r
- struct Crypto1State *sl, uint32_t in)\r
-{\r
- uint32_t *o, *e, i;\r
-\r
- if(rem == -1) {\r
- for(e = e_head; e <= e_tail; ++e) {\r
- *e = *e << 1 ^ parity(*e & LF_POLY_EVEN) ^ !!(in & 4);\r
- for(o = o_head; o <= o_tail; ++o, ++sl) {\r
- sl->even = *o;\r
- sl->odd = *e ^ parity(*o & LF_POLY_ODD);\r
- sl[1].odd = sl[1].even = 0;\r
- }\r
- }\r
- return sl;\r
- }\r
-\r
- for(i = 0; i < 4 && rem--; i++) {\r
- extend_table(o_head, &o_tail, (oks >>= 1) & 1,\r
- LF_POLY_EVEN << 1 | 1, LF_POLY_ODD << 1, 0);\r
- if(o_head > o_tail)\r
- return sl;\r
-\r
- extend_table(e_head, &e_tail, (eks >>= 1) & 1,\r
- LF_POLY_ODD, LF_POLY_EVEN << 1 | 1, (in >>= 2) & 3);\r
- if(e_head > e_tail)\r
- return sl;\r
- }\r
-\r
- quicksort(o_head, o_tail);\r
- quicksort(e_head, e_tail);\r
-\r
- while(o_tail >= o_head && e_tail >= e_head)\r
- if(((*o_tail ^ *e_tail) >> 24) == 0) {\r
- o_tail = binsearch(o_head, o = o_tail);\r
- e_tail = binsearch(e_head, e = e_tail);\r
- sl = recover(o_tail--, o, oks,\r
- e_tail--, e, eks, rem, sl, in);\r
- }\r
- else if(*o_tail > *e_tail)\r
- o_tail = binsearch(o_head, o_tail) - 1;\r
- else\r
- e_tail = binsearch(e_head, e_tail) - 1;\r
-\r
- return sl;\r
-}\r
-/** lfsr_recovery\r
- * recover the state of the lfsr given 32 bits of the keystream\r
- * additionally you can use the in parameter to specify the value\r
- * that was fed into the lfsr at the time the keystream was generated\r
- */\r
-struct Crypto1State* lfsr_recovery32(uint32_t ks2, uint32_t in)\r
-{\r
- struct Crypto1State *statelist;\r
- uint32_t *odd_head = 0, *odd_tail = 0, oks = 0;\r
- uint32_t *even_head = 0, *even_tail = 0, eks = 0;\r
- int i;\r
-\r
- for(i = 31; i >= 0; i -= 2)\r
- oks = oks << 1 | BEBIT(ks2, i);\r
- for(i = 30; i >= 0; i -= 2)\r
- eks = eks << 1 | BEBIT(ks2, i);\r
-\r
- odd_head = odd_tail = malloc(sizeof(uint32_t) << 21);\r
- even_head = even_tail = malloc(sizeof(uint32_t) << 21);\r
- statelist = malloc(sizeof(struct Crypto1State) << 18);\r
- if(!odd_tail-- || !even_tail-- || !statelist)\r
- goto out;\r
-\r
- statelist->odd = statelist->even = 0;\r
-\r
- for(i = 1 << 20; i >= 0; --i) {\r
- if(filter(i) == (oks & 1))\r
- *++odd_tail = i;\r
- if(filter(i) == (eks & 1))\r
- *++even_tail = i;\r
- }\r
-\r
- for(i = 0; i < 4; i++) {\r
- extend_table_simple(odd_head, &odd_tail, (oks >>= 1) & 1);\r
- extend_table_simple(even_head, &even_tail, (eks >>= 1) & 1);\r
- }\r
-\r
- in = (in >> 16 & 0xff) | (in << 16) | (in & 0xff00);\r
- recover(odd_head, odd_tail, oks,\r
- even_head, even_tail, eks, 11, statelist, in << 1);\r
-\r
-out:\r
- free(odd_head);\r
- free(even_head);\r
- return statelist;\r
-}\r
-\r
-static const uint32_t S1[] = { 0x62141, 0x310A0, 0x18850, 0x0C428, 0x06214,\r
- 0x0310A, 0x85E30, 0xC69AD, 0x634D6, 0xB5CDE, 0xDE8DA, 0x6F46D, 0xB3C83,\r
- 0x59E41, 0xA8995, 0xD027F, 0x6813F, 0x3409F, 0x9E6FA};\r
-static const uint32_t S2[] = { 0x3A557B00, 0x5D2ABD80, 0x2E955EC0, 0x174AAF60,\r
- 0x0BA557B0, 0x05D2ABD8, 0x0449DE68, 0x048464B0, 0x42423258, 0x278192A8,\r
- 0x156042D0, 0x0AB02168, 0x43F89B30, 0x61FC4D98, 0x765EAD48, 0x7D8FDD20,\r
- 0x7EC7EE90, 0x7F63F748, 0x79117020};\r
-static const uint32_t T1[] = {\r
- 0x4F37D, 0x279BE, 0x97A6A, 0x4BD35, 0x25E9A, 0x12F4D, 0x097A6, 0x80D66,\r
- 0xC4006, 0x62003, 0xB56B4, 0x5AB5A, 0xA9318, 0xD0F39, 0x6879C, 0xB057B,\r
- 0x582BD, 0x2C15E, 0x160AF, 0x8F6E2, 0xC3DC4, 0xE5857, 0x72C2B, 0x39615,\r
- 0x98DBF, 0xC806A, 0xE0680, 0x70340, 0x381A0, 0x98665, 0x4C332, 0xA272C};\r
-static const uint32_t T2[] = { 0x3C88B810, 0x5E445C08, 0x2982A580, 0x14C152C0,\r
- 0x4A60A960, 0x253054B0, 0x52982A58, 0x2FEC9EA8, 0x1156C4D0, 0x08AB6268,\r
- 0x42F53AB0, 0x217A9D58, 0x161DC528, 0x0DAE6910, 0x46D73488, 0x25CB11C0,\r
- 0x52E588E0, 0x6972C470, 0x34B96238, 0x5CFC3A98, 0x28DE96C8, 0x12CFC0E0,\r
- 0x4967E070, 0x64B3F038, 0x74F97398, 0x7CDC3248, 0x38CE92A0, 0x1C674950,\r
- 0x0E33A4A8, 0x01B959D0, 0x40DCACE8, 0x26CEDDF0};\r
-static const uint32_t C1[] = { 0x846B5, 0x4235A, 0x211AD};\r
-static const uint32_t C2[] = { 0x1A822E0, 0x21A822E0, 0x21A822E0};\r
-/** Reverse 64 bits of keystream into possible cipher states\r
- * Variation mentioned in the paper. Somewhat optimized version\r
- */\r
-struct Crypto1State* lfsr_recovery64(uint32_t ks2, uint32_t ks3)\r
-{\r
- struct Crypto1State *statelist, *sl;\r
- uint8_t oks[32], eks[32], hi[32];\r
- uint32_t low = 0, win = 0;\r
- uint32_t *tail, table[1 << 16];\r
- int i, j;\r
-\r
- sl = statelist = malloc(sizeof(struct Crypto1State) << 4);\r
- if(!sl)\r
- return 0;\r
- sl->odd = sl->even = 0;\r
-\r
- for(i = 30; i >= 0; i -= 2) {\r
- oks[i >> 1] = BIT(ks2, i ^ 24);\r
- oks[16 + (i >> 1)] = BIT(ks3, i ^ 24);\r
- }\r
- for(i = 31; i >= 0; i -= 2) {\r
- eks[i >> 1] = BIT(ks2, i ^ 24);\r
- eks[16 + (i >> 1)] = BIT(ks3, i ^ 24);\r
- }\r
-\r
- for(i = 0xfffff; i >= 0; --i) {\r
- if (filter(i) != oks[0])\r
- continue;\r
-\r
- *(tail = table) = i;\r
- for(j = 1; tail >= table && j < 29; ++j)\r
- extend_table_simple(table, &tail, oks[j]);\r
-\r
- if(tail < table)\r
- continue;\r
-\r
- for(j = 0; j < 19; ++j)\r
- low = low << 1 | parity(i & S1[j]);\r
- for(j = 0; j < 32; ++j)\r
- hi[j] = parity(i & T1[j]);\r
-\r
- for(; tail >= table; --tail) {\r
- for(j = 0; j < 3; ++j) {\r
- *tail = *tail << 1;\r
- *tail |= parity((i & C1[j]) ^ (*tail & C2[j]));\r
- if(filter(*tail) != oks[29 + j])\r
- goto continue2;\r
- }\r
-\r
- for(j = 0; j < 19; ++j)\r
- win = win << 1 | parity(*tail & S2[j]);\r
-\r
- win ^= low;\r
- for(j = 0; j < 32; ++j) {\r
- win = win << 1 ^ hi[j] ^ parity(*tail & T2[j]);\r
- if(filter(win) != eks[j])\r
- goto continue2;\r
- }\r
-\r
- *tail = *tail << 1 | parity(LF_POLY_EVEN & *tail);\r
- sl->odd = *tail ^ parity(LF_POLY_ODD & win);\r
- sl->even = win;\r
- ++sl;\r
- sl->odd = sl->even = 0;\r
- continue2:;\r
- }\r
- }\r
- return statelist;\r
-}\r
-\r
-/** lfsr_rollback_bit\r
- * Rollback the shift register in order to get previous states\r
- */\r
-void lfsr_rollback_bit(struct Crypto1State *s, uint32_t in, int fb)\r
-{\r
- int out;\r
-\r
- s->odd &= 0xffffff;\r
- s->odd ^= (s->odd ^= s->even, s->even ^= s->odd);\r
-\r
- out = s->even & 1;\r
- out ^= LF_POLY_EVEN & (s->even >>= 1);\r
- out ^= LF_POLY_ODD & s->odd;\r
- out ^= !!in;\r
- out ^= filter(s->odd) & !!fb;\r
-\r
- s->even |= parity(out) << 23;\r
-}\r
-/** lfsr_rollback_byte\r
- * Rollback the shift register in order to get previous states\r
- */\r
-void lfsr_rollback_byte(struct Crypto1State *s, uint32_t in, int fb)\r
-{\r
- int i;\r
- for (i = 7; i >= 0; --i)\r
- lfsr_rollback_bit(s, BEBIT(in, i), 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
- int i;\r
- for (i = 31; i >= 0; --i)\r
- lfsr_rollback_bit(s, BEBIT(in, i), fb);\r
-}\r
-\r
-/** nonce_distance\r
- * x,y valid tag nonces, then prng_successor(x, nonce_distance(x, y)) = y\r
- */\r
-static uint16_t *dist = 0;\r
-int nonce_distance(uint32_t from, uint32_t to)\r
-{\r
- uint16_t x, i;\r
- if(!dist) {\r
- dist = malloc(2 << 16);\r
- if(!dist)\r
- return -1;\r
- for (x = i = 1; i; ++i) {\r
- dist[(x & 0xff) << 8 | x >> 8] = i;\r
- x = x >> 1 | (x ^ x >> 2 ^ x >> 3 ^ x >> 5) << 15;\r
- }\r
- }\r
- return (65535 + dist[to >> 16] - dist[from >> 16]) % 65535;\r
-}\r
-\r
-\r
-static uint32_t fastfwd[2][8] = {\r
- { 0, 0x4BC53, 0xECB1, 0x450E2, 0x25E29, 0x6E27A, 0x2B298, 0x60ECB},\r
- { 0, 0x1D962, 0x4BC53, 0x56531, 0xECB1, 0x135D3, 0x450E2, 0x58980}};\r
-\r
-\r
-/** lfsr_prefix_ks\r
- *\r
- * Is an exported helper function from the common prefix attack\r
- * Described in the "dark side" paper. It returns an -1 terminated array\r
- * of possible partial(21 bit) secret state.\r
- * The required keystream(ks) needs to contain the keystream that was used to\r
- * encrypt the NACK which is observed when varying only the 4 last bits of Nr\r
- * only correct iff [NR_3] ^ NR_3 does not depend on Nr_3\r
- */\r
-uint32_t *lfsr_prefix_ks(uint8_t ks[8], int isodd)\r
-{\r
- uint32_t *candidates = malloc(4 << 21);\r
- uint32_t c, entry;\r
- int size, i;\r
-\r
- if(!candidates)\r
- return 0;\r
-\r
- size = (1 << 21) - 1;\r
- for(i = 0; i <= size; ++i)\r
- candidates[i] = i;\r
-\r
- for(c = 0; c < 8; ++c)\r
- for(i = 0;i <= size; ++i) {\r
- entry = candidates[i] ^ fastfwd[isodd][c];\r
-\r
- if(filter(entry >> 1) == BIT(ks[c], isodd))\r
- if(filter(entry) == BIT(ks[c], isodd + 2))\r
- continue;\r
-\r
- candidates[i--] = candidates[size--];\r
- }\r
-\r
- candidates[size + 1] = -1;\r
-\r
- return candidates;\r
-}\r
-\r
-/** brute_top\r
- * helper function which eliminates possible secret states using parity bits\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
-{\r
- struct Crypto1State s;\r
- uint32_t ks1, nr, ks2, rr, ks3, good, c;\r
-\r
- for(c = 0; c < 8; ++c) {\r
- s.odd = odd ^ fastfwd[1][c];\r
- s.even = even ^ fastfwd[0][c];\r
- \r
- lfsr_rollback_bit(&s, 0, 0);\r
- lfsr_rollback_bit(&s, 0, 0);\r
- lfsr_rollback_bit(&s, 0, 0);\r
- \r
- lfsr_rollback_word(&s, 0, 0);\r
- lfsr_rollback_word(&s, prefix | c << 5, 1);\r
- \r
- sl->odd = s.odd;\r
- sl->even = s.even;\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
- nr = ks1 ^ (prefix | c << 5);\r
- rr = ks2 ^ rresp;\r
-\r
- good = 1;\r
- good &= parity(nr & 0x000000ff) ^ parities[c][3] ^ BIT(ks2, 24);\r
- good &= parity(rr & 0xff000000) ^ parities[c][4] ^ BIT(ks2, 16);\r
- good &= parity(rr & 0x00ff0000) ^ parities[c][5] ^ BIT(ks2, 8);\r
- good &= parity(rr & 0x0000ff00) ^ parities[c][6] ^ BIT(ks2, 0);\r
- good &= parity(rr & 0x000000ff) ^ parities[c][7] ^ BIT(ks3, 24);\r
-\r
- if(!good)\r
- return sl;\r
- }\r
-\r
- return ++sl;\r
-} \r
-\r
-\r
-/** lfsr_common_prefix\r
- * Implentation of the common prefix attack.\r
- * Requires the 28 bit constant prefix used as reader nonce (pfx)\r
- * The reader response used (rr)\r
- * The keystream used to encrypt the observed NACK's (ks)\r
- * The parity bits (par)\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
-{\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
- statelist = malloc((sizeof *statelist) << 20);\r
- if(!statelist || !odd || !even)\r
- return 0;\r
-\r
-\r
- s = statelist;\r
- for(o = odd; *o != 0xffffffff; ++o)\r
- for(e = even; *e != 0xffffffff; ++e)\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
- }\r
-\r
- s->odd = s->even = 0;\r
-\r
- free(odd);\r
- free(even);\r
-\r
- return statelist;\r
-}\r
+++ /dev/null
-/* crapto1.h
-
- This program is free software; you can redistribute it and/or
- modify it under the terms of the GNU General Public License
- as published by the Free Software Foundation; either version 2
- of the License, or (at your option) any later version.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
-
- You should have received a copy of the GNU General Public License
- along with this program; if not, write to the Free Software
- Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
- MA 02110-1301, US$
-
- Copyright (C) 2008-2008 bla <blapost@gmail.com>
-*/
-#ifndef CRAPTO1_INCLUDED
-#define CRAPTO1_INCLUDED
-#include <stdint.h>
-#ifdef __cplusplus
-extern "C" {
-#endif
-
-struct Crypto1State {uint32_t odd, even;};
-struct Crypto1State* crypto1_create(uint64_t);
-void crypto1_destroy(struct Crypto1State*);
-void crypto1_get_lfsr(struct Crypto1State*, uint64_t*);
-uint8_t crypto1_bit(struct Crypto1State*, uint8_t, int);
-uint8_t crypto1_byte(struct Crypto1State*, uint8_t, int);
-uint32_t crypto1_word(struct Crypto1State*, uint32_t, int);
-uint32_t prng_successor(uint32_t x, uint32_t n);
-
-struct Crypto1State* lfsr_recovery32(uint32_t ks2, uint32_t in);
-struct Crypto1State* lfsr_recovery64(uint32_t ks2, uint32_t ks3);
-uint32_t *lfsr_prefix_ks(uint8_t ks[8], int isodd);
-struct Crypto1State*
-lfsr_common_prefix(uint32_t pfx, uint32_t rr, uint8_t ks[8], uint8_t par[8][8]);
-
-
-void lfsr_rollback_bit(struct Crypto1State* s, uint32_t in, int fb);
-void lfsr_rollback_byte(struct Crypto1State* s, uint32_t in, int fb);
-void lfsr_rollback_word(struct Crypto1State* s, uint32_t in, int fb);
-int nonce_distance(uint32_t from, uint32_t to);
-#define FOREACH_VALID_NONCE(N, FILTER, FSIZE)\
- uint32_t __n = 0,__M = 0, N = 0;\
- int __i;\
- for(; __n < 1 << 16; N = prng_successor(__M = ++__n, 16))\
- for(__i = FSIZE - 1; __i >= 0; __i--)\
- if(BIT(FILTER, __i) ^ parity(__M & 0xFF01))\
- break;\
- else if(__i)\
- __M = prng_successor(__M, (__i == 7) ? 48 : 8);\
- else
-
-#define LF_POLY_ODD (0x29CE5C)
-#define LF_POLY_EVEN (0x870804)
-#define BIT(x, n) ((x) >> (n) & 1)
-#define BEBIT(x, n) BIT(x, (n) ^ 24)
-static inline int parity(uint32_t x)
-{
-#if !defined __i386__ || !defined __GNUC__
- x ^= x >> 16;
- x ^= x >> 8;
- x ^= x >> 4;
- return BIT(0x6996, x & 0xf);
-#else
- asm( "movl %1, %%eax\n"
- "mov %%ax, %%cx\n"
- "shrl $0x10, %%eax\n"
- "xor %%ax, %%cx\n"
- "xor %%ch, %%cl\n"
- "setpo %%al\n"
- "movzx %%al, %0\n": "=r"(x) : "r"(x): "eax","ecx");
- return x;
-#endif
-}
-static inline int filter(uint32_t const x)
-{
- uint32_t f;
-
- f = 0xf22c0 >> (x & 0xf) & 16;
- f |= 0x6c9c0 >> (x >> 4 & 0xf) & 8;
- f |= 0x3c8b0 >> (x >> 8 & 0xf) & 4;
- f |= 0x1e458 >> (x >> 12 & 0xf) & 2;
- f |= 0x0d938 >> (x >> 16 & 0xf) & 1;
- return BIT(0xEC57E80A, f);
-}
-#ifdef __cplusplus
-}
-#endif
-#endif
+++ /dev/null
-/* crypto1.c
-
- This program is free software; you can redistribute it and/or
- modify it under the terms of the GNU General Public License
- as published by the Free Software Foundation; either version 2
- of the License, or (at your option) any later version.
-
- This program is distributed in the hope that it will be useful,
- but WITHOUT ANY WARRANTY; without even the implied warranty of
- MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
- GNU General Public License for more details.
-
- You should have received a copy of the GNU General Public License
- along with this program; if not, write to the Free Software
- Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
- MA 02110-1301, US
-
- Copyright (C) 2008-2008 bla <blapost@gmail.com>
-*/
-#include "crapto1.h"
-#include <stdlib.h>
-
-#define SWAPENDIAN(x)\
- (x = (x >> 8 & 0xff00ff) | (x & 0xff00ff) << 8, x = x >> 16 | x << 16)
-
-struct Crypto1State * crypto1_create(uint64_t key)
-{
- struct Crypto1State *s = malloc(sizeof(*s));
- int i;
-
- for(i = 47;s && i > 0; i -= 2) {
- s->odd = s->odd << 1 | BIT(key, (i - 1) ^ 7);
- s->even = s->even << 1 | BIT(key, i ^ 7);
- }
- return s;
-}
-void crypto1_destroy(struct Crypto1State *state)
-{
- free(state);
-}
-void crypto1_get_lfsr(struct Crypto1State *state, uint64_t *lfsr)
-{
- int i;
- for(*lfsr = 0, i = 23; i >= 0; --i) {
- *lfsr = *lfsr << 1 | BIT(state->odd, i ^ 3);
- *lfsr = *lfsr << 1 | BIT(state->even, i ^ 3);
- }
-}
-uint8_t crypto1_bit(struct Crypto1State *s, uint8_t in, int is_encrypted)
-{
- uint32_t feedin;
- uint8_t ret = filter(s->odd);
-
- feedin = ret & !!is_encrypted;
- feedin ^= !!in;
- feedin ^= LF_POLY_ODD & s->odd;
- feedin ^= LF_POLY_EVEN & s->even;
- s->even = s->even << 1 | parity(feedin);
-
- s->odd ^= (s->odd ^= s->even, s->even ^= s->odd);
-
- return ret;
-}
-uint8_t crypto1_byte(struct Crypto1State *s, uint8_t in, int is_encrypted)
-{
- uint8_t i, ret = 0;
-
- for (i = 0; i < 8; ++i)
- ret |= crypto1_bit(s, BIT(in, i), is_encrypted) << i;
-
- return ret;
-}
-uint32_t crypto1_word(struct Crypto1State *s, uint32_t in, int is_encrypted)
-{
- uint32_t i, ret = 0;
-
- for (i = 0; i < 4; ++i, in <<= 8)
- ret = ret << 8 | crypto1_byte(s, in >> 24, is_encrypted);
-
- return ret;
-}
-
-/* prng_successor
- * helper used to obscure the keystream during authentication
- */
-uint32_t prng_successor(uint32_t x, uint32_t n)
-{
- SWAPENDIAN(x);
- while(n--)
- x = x >> 1 | (x >> 16 ^ x >> 18 ^ x >> 19 ^ x >> 21) << 31;
-
- return SWAPENDIAN(x);
-}
projects / proxmark3-svn / commitdiff