]> git.zerfleddert.de Git - proxmark3-svn/blame - tools/nonce2key/crapto1.h
Merge branch 'master' into GenericTracing
[proxmark3-svn] / tools / nonce2key / crapto1.h
CommitLineData
93f57590 1/* crapto1.h
2
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.
7
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.
12
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,
16 MA 02110-1301, US$
17
18 Copyright (C) 2008-2008 bla <blapost@gmail.com>
19*/
20#ifndef CRAPTO1_INCLUDED
21#define CRAPTO1_INCLUDED
22#include <stdint.h>
23#ifdef __cplusplus
24extern "C" {
25#endif
26
27struct Crypto1State {uint32_t odd, even;};
28struct Crypto1State* crypto1_create(uint64_t);
29void crypto1_destroy(struct Crypto1State*);
30void crypto1_get_lfsr(struct Crypto1State*, uint64_t*);
31uint8_t crypto1_bit(struct Crypto1State*, uint8_t, int);
32uint8_t crypto1_byte(struct Crypto1State*, uint8_t, int);
33uint32_t crypto1_word(struct Crypto1State*, uint32_t, int);
34uint32_t prng_successor(uint32_t x, uint32_t n);
35
36struct Crypto1State* lfsr_recovery32(uint32_t ks2, uint32_t in);
37struct Crypto1State* lfsr_recovery64(uint32_t ks2, uint32_t ks3);
38uint32_t *lfsr_prefix_ks(uint8_t ks[8], int isodd);
39struct Crypto1State*
40lfsr_common_prefix(uint32_t pfx, uint32_t rr, uint8_t ks[8], uint8_t par[8][8]);
41
42
43void lfsr_rollback_bit(struct Crypto1State* s, uint32_t in, int fb);
44void lfsr_rollback_byte(struct Crypto1State* s, uint32_t in, int fb);
45void lfsr_rollback_word(struct Crypto1State* s, uint32_t in, int fb);
46int nonce_distance(uint32_t from, uint32_t to);
47#define FOREACH_VALID_NONCE(N, FILTER, FSIZE)\
48 uint32_t __n = 0,__M = 0, N = 0;\
49 int __i;\
50 for(; __n < 1 << 16; N = prng_successor(__M = ++__n, 16))\
51 for(__i = FSIZE - 1; __i >= 0; __i--)\
52 if(BIT(FILTER, __i) ^ parity(__M & 0xFF01))\
53 break;\
54 else if(__i)\
55 __M = prng_successor(__M, (__i == 7) ? 48 : 8);\
56 else
57
58#define LF_POLY_ODD (0x29CE5C)
59#define LF_POLY_EVEN (0x870804)
60#define BIT(x, n) ((x) >> (n) & 1)
61#define BEBIT(x, n) BIT(x, (n) ^ 24)
62static inline int parity(uint32_t x)
63{
64#if !defined __i386__ || !defined __GNUC__
65 x ^= x >> 16;
66 x ^= x >> 8;
67 x ^= x >> 4;
68 return BIT(0x6996, x & 0xf);
69#else
70 asm( "movl %1, %%eax\n"
71 "mov %%ax, %%cx\n"
72 "shrl $0x10, %%eax\n"
73 "xor %%ax, %%cx\n"
74 "xor %%ch, %%cl\n"
75 "setpo %%al\n"
76 "movzx %%al, %0\n": "=r"(x) : "r"(x): "eax","ecx");
77 return x;
78#endif
79}
80static inline int filter(uint32_t const x)
81{
82 uint32_t f;
83
84 f = 0xf22c0 >> (x & 0xf) & 16;
85 f |= 0x6c9c0 >> (x >> 4 & 0xf) & 8;
86 f |= 0x3c8b0 >> (x >> 8 & 0xf) & 4;
87 f |= 0x1e458 >> (x >> 12 & 0xf) & 2;
88 f |= 0x0d938 >> (x >> 16 & 0xf) & 1;
89 return BIT(0xEC57E80A, f);
90}
91#ifdef __cplusplus
92}
93#endif
94#endif
Impressum, Datenschutz