]>
cvs.zerfleddert.de Git - proxmark3-svn/blob - client/cmdlfindala.c
1 //-----------------------------------------------------------------------------
3 // This code is licensed to you under the terms of the GNU GPL, version 2 or,
4 // at your option, any later version. See the LICENSE.txt file for the text of
6 //-----------------------------------------------------------------------------
7 // Low frequency Indala commands
8 //-----------------------------------------------------------------------------
12 #include "cmdlfindala.h"
13 #include "proxmark3.h"
16 #include "cmdparser.h"
17 #include "cmddata.h" //for g_debugMode, demodbuff cmds
18 #include "lfdemod.h" //for indala26decode
19 #include "util.h" //for sprint_bin_break
20 #include "cmdlf.h" //for CmdLFRead
21 #include "cmdmain.h" //for clearCommandBuffer
23 static int CmdHelp(const char *Cmd
);
25 // Indala 26 bit decode
27 // optional arguments - same as PSKDemod (clock & invert & maxerr)
28 int CmdIndalaDecode(const char *Cmd
) {
31 ans
= PSKDemod(Cmd
, 0);
32 } else { //default to RF/32
33 ans
= PSKDemod("32", 0);
37 if (g_debugMode
) PrintAndLog("Error1: %i",ans
);
41 size_t size
= DemodBufferLen
;
42 int startIdx
= indala26decode(DemodBuffer
, &size
, &invert
);
43 if (startIdx
< 0 || size
> 224) {
44 if (g_debugMode
) PrintAndLog("Error2: %i",startIdx
);
47 setDemodBuf(DemodBuffer
, size
, (size_t)startIdx
);
50 PrintAndLog("Had to invert bits");
52 PrintAndLog("BitLen: %d",DemodBufferLen
);
54 uint32_t uid1
, uid2
, uid3
, uid4
, uid5
, uid6
, uid7
;
55 uid1
=bytebits_to_byte(DemodBuffer
,32);
56 uid2
=bytebits_to_byte(DemodBuffer
+32,32);
57 if (DemodBufferLen
==64) {
58 PrintAndLog("Indala UID=%s (%x%08x)", sprint_bin_break(DemodBuffer
,DemodBufferLen
,16), uid1
, uid2
);
59 } else if (DemodBufferLen
==224) {
60 uid3
=bytebits_to_byte(DemodBuffer
+64,32);
61 uid4
=bytebits_to_byte(DemodBuffer
+96,32);
62 uid5
=bytebits_to_byte(DemodBuffer
+128,32);
63 uid6
=bytebits_to_byte(DemodBuffer
+160,32);
64 uid7
=bytebits_to_byte(DemodBuffer
+192,32);
65 PrintAndLog("Indala UID=%s (%x%08x%08x%08x%08x%08x%08x)",
66 sprint_bin_break(DemodBuffer
,DemodBufferLen
,16), uid1
, uid2
, uid3
, uid4
, uid5
, uid6
, uid7
);
69 PrintAndLog("DEBUG: printing demodbuffer:");
75 int CmdIndalaRead(const char *Cmd
) {
77 getSamples("30000",false);
78 return CmdIndalaDecode("");
81 // older alternative indala demodulate (has some positives and negatives)
82 // returns false positives more often - but runs against more sets of samples
83 // poor psk signal can be difficult to demod this approach might succeed when the other fails
84 // but the other appears to currently be more accurate than this approach most of the time.
85 int CmdIndalaDemod(const char *Cmd
) {
86 // Usage: recover 64bit UID by default, specify "224" as arg to recover a 224bit UID
92 // worst case with GraphTraceLen=64000 is < 4096
93 // under normal conditions it's < 2048
95 uint8_t rawbits
[4096];
97 int worst
= 0, worstPos
= 0;
98 // PrintAndLog("Expecting a bit less than %d raw bits", GraphTraceLen / 32);
100 // loop through raw signal - since we know it is psk1 rf/32 fc/2 skip every other value (+=2)
101 for (i
= 0; i
< GraphTraceLen
-1; i
+= 2) {
103 if ((GraphBuffer
[i
] > GraphBuffer
[i
+ 1]) && (state
!= 1)) {
104 // appears redundant - marshmellow
106 for (j
= 0; j
< count
- 8; j
+= 16) {
107 rawbits
[rawbit
++] = 0;
109 if ((abs(count
- j
)) > worst
) {
110 worst
= abs(count
- j
);
116 } else if ((GraphBuffer
[i
] < GraphBuffer
[i
+ 1]) && (state
!= 0)) {
119 for (j
= 0; j
< count
- 8; j
+= 16) {
120 rawbits
[rawbit
++] = 1;
122 if ((abs(count
- j
)) > worst
) {
123 worst
= abs(count
- j
);
133 PrintAndLog("Recovered %d raw bits, expected: %d", rawbit
, GraphTraceLen
/32);
134 PrintAndLog("worst metric (0=best..7=worst): %d at pos %d", worst
, worstPos
);
139 // Finding the start of a UID
140 int uidlen
, long_wait
;
141 if (strcmp(Cmd
, "224") == 0) {
151 for (start
= 0; start
<= rawbit
- uidlen
; start
++) {
152 first
= rawbits
[start
];
153 for (i
= start
; i
< start
+ long_wait
; i
++) {
154 if (rawbits
[i
] != first
) {
158 if (i
== (start
+ long_wait
)) {
163 if (start
== rawbit
- uidlen
+ 1) {
164 PrintAndLog("nothing to wait for");
168 // Inverting signal if needed
170 for (i
= start
; i
< rawbit
; i
++) {
171 rawbits
[i
] = !rawbits
[i
];
176 uint8_t bits
[224] = {0x00};
177 char showbits
[225] = {0x00};
182 if (uidlen
> rawbit
) {
183 PrintAndLog("Warning: not enough raw bits to get a full UID");
184 for (bit
= 0; bit
< rawbit
; bit
++) {
185 bits
[bit
] = rawbits
[i
++];
186 // As we cannot know the parity, let's use "." and "/"
187 showbits
[bit
] = '.' + bits
[bit
];
189 showbits
[bit
+1]='\0';
190 PrintAndLog("Partial UID=%s", showbits
);
193 for (bit
= 0; bit
< uidlen
; bit
++) {
194 bits
[bit
] = rawbits
[i
++];
195 showbits
[bit
] = '0' + bits
[bit
];
201 uint32_t uid1
, uid2
, uid3
, uid4
, uid5
, uid6
, uid7
;
206 for( idx
=0; idx
<64; idx
++) {
207 if (showbits
[idx
] == '0') {
208 uid1
=(uid1
<<1)|(uid2
>>31);
211 uid1
=(uid1
<<1)|(uid2
>>31);
215 PrintAndLog("UID=%s (%x%08x)", showbits
, uid1
, uid2
);
218 uid3
= uid4
= uid5
= uid6
= uid7
= 0;
220 for( idx
=0; idx
<224; idx
++) {
221 uid1
=(uid1
<<1)|(uid2
>>31);
222 uid2
=(uid2
<<1)|(uid3
>>31);
223 uid3
=(uid3
<<1)|(uid4
>>31);
224 uid4
=(uid4
<<1)|(uid5
>>31);
225 uid5
=(uid5
<<1)|(uid6
>>31);
226 uid6
=(uid6
<<1)|(uid7
>>31);
228 if (showbits
[idx
] == '0')
229 uid7
= (uid7
<<1) | 0;
231 uid7
= (uid7
<<1) | 1;
233 PrintAndLog("UID=%s (%x%08x%08x%08x%08x%08x%08x)", showbits
, uid1
, uid2
, uid3
, uid4
, uid5
, uid6
, uid7
);
236 // Checking UID against next occurrences
238 for (; i
+ uidlen
<= rawbit
;) {
240 for (bit
= 0; bit
< uidlen
; bit
++) {
241 if (bits
[bit
] != rawbits
[i
++]) {
252 PrintAndLog("Occurrences: %d (expected %d)", times
, (rawbit
- start
) / uidlen
);
254 // Remodulating for tag cloning
255 // HACK: 2015-01-04 this will have an impact on our new way of seening lf commands (demod)
256 // since this changes graphbuffer data.
257 GraphTraceLen
= 32*uidlen
;
260 for (bit
= 0; bit
< uidlen
; bit
++) {
261 if (bits
[bit
] == 0) {
267 for (j
= 0; j
< 32; j
++) {
268 GraphBuffer
[i
++] = phase
;
273 RepaintGraphWindow();
277 int CmdIndalaClone(const char *Cmd
) {
279 unsigned int uid1
, uid2
, uid3
, uid4
, uid5
, uid6
, uid7
;
281 uid1
= uid2
= uid3
= uid4
= uid5
= uid6
= uid7
= 0;
284 if (strchr(Cmd
,'l') != 0) {
285 while (sscanf(&Cmd
[i
++], "%1x", &n
) == 1) {
286 uid1
= (uid1
<< 4) | (uid2
>> 28);
287 uid2
= (uid2
<< 4) | (uid3
>> 28);
288 uid3
= (uid3
<< 4) | (uid4
>> 28);
289 uid4
= (uid4
<< 4) | (uid5
>> 28);
290 uid5
= (uid5
<< 4) | (uid6
>> 28);
291 uid6
= (uid6
<< 4) | (uid7
>> 28);
292 uid7
= (uid7
<< 4) | (n
& 0xf);
294 PrintAndLog("Cloning 224bit tag with UID %x%08x%08x%08x%08x%08x%08x", uid1
, uid2
, uid3
, uid4
, uid5
, uid6
, uid7
);
295 c
.cmd
= CMD_INDALA_CLONE_TAG_L
;
296 c
.d
.asDwords
[0] = uid1
;
297 c
.d
.asDwords
[1] = uid2
;
298 c
.d
.asDwords
[2] = uid3
;
299 c
.d
.asDwords
[3] = uid4
;
300 c
.d
.asDwords
[4] = uid5
;
301 c
.d
.asDwords
[5] = uid6
;
302 c
.d
.asDwords
[6] = uid7
;
304 while (sscanf(&Cmd
[i
++], "%1x", &n
) == 1) {
305 uid1
= (uid1
<< 4) | (uid2
>> 28);
306 uid2
= (uid2
<< 4) | (n
& 0xf);
308 PrintAndLog("Cloning 64bit tag with UID %x%08x", uid1
, uid2
);
309 c
.cmd
= CMD_INDALA_CLONE_TAG
;
314 clearCommandBuffer();
319 static command_t CommandTable
[] = {
320 {"help", CmdHelp
, 1, "This help"},
321 {"demod", CmdIndalaDecode
, 1, "[clock] [invert<0|1>] -- Demodulate an indala tag (PSK1) from GraphBuffer (args optional)"},
322 {"read", CmdIndalaRead
, 0, "Read an Indala Prox tag from the antenna"},
323 {"clone", CmdIndalaClone
, 0, "<UID> ['l']-- Clone Indala to T55x7 (tag must be on antenna)(UID in HEX)(option 'l' for 224 UID"},
324 {"altdemod", CmdIndalaDemod
, 1, "['224'] -- Alternative method to Demodulate samples for Indala 64 bit UID (option '224' for 224 bit)"},
325 //{"sim", CmdIndalaSim, 0, "<ID> -- indala tag simulator"},
326 {NULL
, NULL
, 0, NULL
}
329 int CmdLFINDALA(const char *Cmd
) {
330 CmdsParse(CommandTable
, Cmd
);
334 int CmdHelp(const char *Cmd
) {
335 CmdsHelp(CommandTable
);