]>
git.zerfleddert.de Git - proxmark3-svn/blob - client/nonce2key/crapto1.h
3 This program is free software; you can redistribute it and/or
4 modify it under the terms of the GNU General Public License
5 as published by the Free Software Foundation; either version 2
6 of the License, or (at your option) any later version.
8 This program is distributed in the hope that it will be useful,
9 but WITHOUT ANY WARRANTY; without even the implied warranty of
10 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
11 GNU General Public License for more details.
13 You should have received a copy of the GNU General Public License
14 along with this program; if not, write to the Free Software
15 Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston,
18 Copyright (C) 2008-2008 bla <blapost@gmail.com>
20 #ifndef CRAPTO1_INCLUDED
21 #define CRAPTO1_INCLUDED
27 struct Crypto1State
{uint32_t odd
, even
;};
28 struct Crypto1State
* crypto1_create(uint64_t);
29 void crypto1_destroy(struct Crypto1State
*);
30 void crypto1_get_lfsr(struct Crypto1State
*, uint64_t*);
31 uint8_t crypto1_bit(struct Crypto1State
*, uint8_t, int);
32 uint8_t crypto1_byte(struct Crypto1State
*, uint8_t, int);
33 uint32_t crypto1_word(struct Crypto1State
*, uint32_t, int);
34 uint32_t prng_successor(uint32_t x
, uint32_t n
);
36 struct Crypto1State
* lfsr_recovery32(uint32_t ks2
, uint32_t in
);
37 struct Crypto1State
* lfsr_recovery64(uint32_t ks2
, uint32_t ks3
);
38 uint32_t *lfsr_prefix_ks(uint8_t ks
[8], int isodd
);
40 lfsr_common_prefix(uint32_t pfx
, uint32_t rr
, uint8_t ks
[8], uint8_t par
[8][8]);
43 void lfsr_rollback_bit(struct Crypto1State
* s
, uint32_t in
, int fb
);
44 void lfsr_rollback_byte(struct Crypto1State
* s
, uint32_t in
, int fb
);
45 void lfsr_rollback_word(struct Crypto1State
* s
, uint32_t in
, int fb
);
46 int nonce_distance(uint32_t from
, uint32_t to
);
47 #define SWAPENDIAN(x)\
48 (x = (x >> 8 & 0xff00ff) | (x & 0xff00ff) << 8, x = x >> 16 | x << 16)
50 #define FOREACH_VALID_NONCE(N, FILTER, FSIZE)\
51 uint32_t __n = 0,__M = 0, N = 0;\
53 for(; __n < 1 << 16; N = prng_successor(__M = ++__n, 16))\
54 for(__i = FSIZE - 1; __i >= 0; __i--)\
55 if(BIT(FILTER, __i) ^ parity(__M & 0xFF01))\
58 __M = prng_successor(__M, (__i == 7) ? 48 : 8);\
61 #define LF_POLY_ODD (0x29CE5C)
62 #define LF_POLY_EVEN (0x870804)
63 #define BIT(x, n) ((x) >> (n) & 1)
64 #define BEBIT(x, n) BIT(x, (n) ^ 24)
65 static inline int parity(uint32_t x
)
67 #if !defined __i386__ || !defined __GNUC__
71 return BIT(0x6996, x
& 0xf);
73 asm( "movl %1, %%eax\n"
79 "movzx %%al, %0\n": "=r"(x
) : "r"(x
): "eax","ecx");
83 static inline int filter(uint32_t const x
)
87 f
= 0xf22c0 >> (x
& 0xf) & 16;
88 f
|= 0x6c9c0 >> (x
>> 4 & 0xf) & 8;
89 f
|= 0x3c8b0 >> (x
>> 8 & 0xf) & 4;
90 f
|= 0x1e458 >> (x
>> 12 & 0xf) & 2;
91 f
|= 0x0d938 >> (x
>> 16 & 0xf) & 1;
92 return BIT(0xEC57E80A, f
);