]> cvs.zerfleddert.de Git - proxmark3-svn/blob - tools/nonce2key/crypto1.c
ADD: `analyse nuid` - generates NUID 4byte from a UID 7byte. Mifare Classic Ev1...
[proxmark3-svn] / tools / nonce2key / crypto1.c
1 /* crypto1.c
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 #include "crapto1.h"
21 #include <stdlib.h>
22
23 struct Crypto1State * crypto1_create(uint64_t key)
24 {
25 struct Crypto1State *s = malloc(sizeof(*s));
26 if ( !s ) return NULL;
27
28 s->odd = s->even = 0;
29
30 int i;
31 //for(i = 47;s && i > 0; i -= 2) {
32 for(i = 47; i > 0; i -= 2) {
33 s->odd = s->odd << 1 | BIT(key, (i - 1) ^ 7);
34 s->even = s->even << 1 | BIT(key, i ^ 7);
35 }
36 return s;
37 }
38 void crypto1_destroy(struct Crypto1State *state)
39 {
40 free(state);
41 }
42 void crypto1_get_lfsr(struct Crypto1State *state, uint64_t *lfsr)
43 {
44 int i;
45 for(*lfsr = 0, i = 23; i >= 0; --i) {
46 *lfsr = *lfsr << 1 | BIT(state->odd, i ^ 3);
47 *lfsr = *lfsr << 1 | BIT(state->even, i ^ 3);
48 }
49 }
50 uint8_t crypto1_bit(struct Crypto1State *s, uint8_t in, int is_encrypted)
51 {
52 uint32_t feedin;
53 uint32_t tmp;
54 uint8_t ret = filter(s->odd);
55
56 feedin = ret & !!is_encrypted;
57 feedin ^= !!in;
58 feedin ^= LF_POLY_ODD & s->odd;
59 feedin ^= LF_POLY_EVEN & s->even;
60 s->even = s->even << 1 | parity(feedin);
61
62 tmp = s->odd;
63 s->odd = s->even;
64 s->even = tmp;
65
66 return ret;
67 }
68 uint8_t crypto1_byte(struct Crypto1State *s, uint8_t in, int is_encrypted)
69 {
70 /*
71 uint8_t i, ret = 0;
72
73 for (i = 0; i < 8; ++i)
74 ret |= crypto1_bit(s, BIT(in, i), is_encrypted) << i;
75 */
76 // unfold loop 20161012
77 uint8_t ret = 0;
78 ret |= crypto1_bit(s, BIT(in, 0), is_encrypted) << 0;
79 ret |= crypto1_bit(s, BIT(in, 1), is_encrypted) << 1;
80 ret |= crypto1_bit(s, BIT(in, 2), is_encrypted) << 2;
81 ret |= crypto1_bit(s, BIT(in, 3), is_encrypted) << 3;
82 ret |= crypto1_bit(s, BIT(in, 4), is_encrypted) << 4;
83 ret |= crypto1_bit(s, BIT(in, 5), is_encrypted) << 5;
84 ret |= crypto1_bit(s, BIT(in, 6), is_encrypted) << 6;
85 ret |= crypto1_bit(s, BIT(in, 7), is_encrypted) << 7;
86 return ret;
87 }
88 uint32_t crypto1_word(struct Crypto1State *s, uint32_t in, int is_encrypted)
89 {
90 /*
91 uint32_t i, ret = 0;
92
93 for (i = 0; i < 32; ++i)
94 ret |= crypto1_bit(s, BEBIT(in, i), is_encrypted) << (i ^ 24);
95 */
96 //unfold loop 2016012
97 uint32_t ret = 0;
98 ret |= crypto1_bit(s, BEBIT(in, 0), is_encrypted) << (0 ^ 24);
99 ret |= crypto1_bit(s, BEBIT(in, 1), is_encrypted) << (1 ^ 24);
100 ret |= crypto1_bit(s, BEBIT(in, 2), is_encrypted) << (2 ^ 24);
101 ret |= crypto1_bit(s, BEBIT(in, 3), is_encrypted) << (3 ^ 24);
102 ret |= crypto1_bit(s, BEBIT(in, 4), is_encrypted) << (4 ^ 24);
103 ret |= crypto1_bit(s, BEBIT(in, 5), is_encrypted) << (5 ^ 24);
104 ret |= crypto1_bit(s, BEBIT(in, 6), is_encrypted) << (6 ^ 24);
105 ret |= crypto1_bit(s, BEBIT(in, 7), is_encrypted) << (7 ^ 24);
106
107 ret |= crypto1_bit(s, BEBIT(in, 8), is_encrypted) << (8 ^ 24);
108 ret |= crypto1_bit(s, BEBIT(in, 9), is_encrypted) << (9 ^ 24);
109 ret |= crypto1_bit(s, BEBIT(in, 10), is_encrypted) << (10 ^ 24);
110 ret |= crypto1_bit(s, BEBIT(in, 11), is_encrypted) << (11 ^ 24);
111 ret |= crypto1_bit(s, BEBIT(in, 12), is_encrypted) << (12 ^ 24);
112 ret |= crypto1_bit(s, BEBIT(in, 13), is_encrypted) << (13 ^ 24);
113 ret |= crypto1_bit(s, BEBIT(in, 14), is_encrypted) << (14 ^ 24);
114 ret |= crypto1_bit(s, BEBIT(in, 15), is_encrypted) << (15 ^ 24);
115
116 ret |= crypto1_bit(s, BEBIT(in, 16), is_encrypted) << (16 ^ 24);
117 ret |= crypto1_bit(s, BEBIT(in, 17), is_encrypted) << (17 ^ 24);
118 ret |= crypto1_bit(s, BEBIT(in, 18), is_encrypted) << (18 ^ 24);
119 ret |= crypto1_bit(s, BEBIT(in, 19), is_encrypted) << (19 ^ 24);
120 ret |= crypto1_bit(s, BEBIT(in, 20), is_encrypted) << (20 ^ 24);
121 ret |= crypto1_bit(s, BEBIT(in, 21), is_encrypted) << (21 ^ 24);
122 ret |= crypto1_bit(s, BEBIT(in, 22), is_encrypted) << (22 ^ 24);
123 ret |= crypto1_bit(s, BEBIT(in, 23), is_encrypted) << (23 ^ 24);
124
125 ret |= crypto1_bit(s, BEBIT(in, 24), is_encrypted) << (24 ^ 24);
126 ret |= crypto1_bit(s, BEBIT(in, 25), is_encrypted) << (25 ^ 24);
127 ret |= crypto1_bit(s, BEBIT(in, 26), is_encrypted) << (26 ^ 24);
128 ret |= crypto1_bit(s, BEBIT(in, 27), is_encrypted) << (27 ^ 24);
129 ret |= crypto1_bit(s, BEBIT(in, 28), is_encrypted) << (28 ^ 24);
130 ret |= crypto1_bit(s, BEBIT(in, 29), is_encrypted) << (29 ^ 24);
131 ret |= crypto1_bit(s, BEBIT(in, 30), is_encrypted) << (30 ^ 24);
132 ret |= crypto1_bit(s, BEBIT(in, 31), is_encrypted) << (31 ^ 24);
133 return ret;
134 }
135
136 /* prng_successor
137 * helper used to obscure the keystream during authentication
138 */
139 uint32_t prng_successor(uint32_t x, uint32_t n)
140 {
141 SWAPENDIAN(x);
142 while(n--)
143 x = x >> 1 | (x >> 16 ^ x >> 18 ^ x >> 19 ^ x >> 21) << 31;
144
145 return SWAPENDIAN(x);
146 }
Impressum, Datenschutz