-
Notifications
You must be signed in to change notification settings - Fork 4
/
atrparser.cpp
536 lines (459 loc) · 15.3 KB
/
atrparser.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
/*
* Copyright (c) 2017, Sergey Stolyarov <sergei@regolit.com>
* All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions are met:
* * Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* * Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
* * Neither the name of the <organization> nor the
* names of its contributors may be used to endorse or promote products
* derived from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE
* DISCLAIMED. IN NO EVENT SHALL <COPYRIGHT HOLDER> BE LIABLE FOR ANY
* DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
* (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND
* ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS
* SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
/**
* @file atr_parser.cpp
* @author Sergey Stolyarov <sergei@regolit.com>
*/
#include <iostream>
#include <stdexcept>
#include <sstream>
#include <map>
#include <set>
#include "../include/xpcsc.hpp"
#include "debug.hpp"
namespace xpcsc {
// high nibble, XY -> X
#define HN(x) ((x>>4) & 0xf)
// low nibble, XY -> Y
#define LN(x) (x & 0xf)
// check bit: 1,2,...
#define CHECK_BIT(value, b) (((value) >> (b))&1)
typedef enum {ATRNONE, TS, T0, TA1, TB1, TC1, TD1,
TA2, TB2, TC2, TD2,
TA3, TB3, TC3, TD3,
TA4, TB4, TC4, TD4,
TA5, TB5, TC5, TD5,
TA6, TB6, TC6, TD6,
TA7, TB7, TC7, TD7,
TCK } ATRField;
struct ATRParser::Private
{
Bytes atr;
// common fields (like interface bytes)
std::map<ATRField, Byte> fields;
// historical bytes
Byte hb[15];
size_t hb_size;
std::set<ATRFeature> features;
};
static void initRIDMap();
static std::string decodeRID(const Bytes &);
static std::string decodeCardName(const Bytes &, const Bytes &);
ATRParser::ATRParser()
{
p = new Private;
}
ATRParser::ATRParser(const Bytes & bytes)
{
p = new Private;
load(bytes);
}
ATRParser::~ATRParser()
{
delete p;
}
void ATRParser::load(const Bytes & bytes)
{
initRIDMap();
size_t size = bytes.size();
if (size > 33) {
throw ATRParseError("too long");
}
if (size < 2) {
throw ATRParseError("too short");
}
p->atr.assign(bytes);
p->fields.clear();
Byte pos = 0;
Byte b;
// byte: TS
b = bytes.at(pos);
if (b != 0x3b && b != 0x3f) {
throw ATRParseError("Invalid TS");
}
p->fields[TS] = b;
pos++;
// byte: T0
b = bytes.at(pos);
p->fields[T0] = b;
// historical bytes, up to 15
p->hb_size = LN(b);
// read next sections
Byte TD_p = b;
// all section keys
ATRField sections_TA[] = {ATRNONE, TA1, TA2, TA3, TA4, TA5, TA6, TA7};
ATRField sections_TB[] = {ATRNONE, TB1, TB2, TB3, TB4, TB5, TB6, TB7};
ATRField sections_TC[] = {ATRNONE, TC1, TC2, TC3, TC4, TC5, TC6, TC7};
ATRField sections_TD[] = {ATRNONE, TD1, TD2, TD3, TD4, TD5, TD6, TD7};
// index of current section
size_t i = 1;
while (1) {
if (i > 7) {
throw ATRParseError("too much interface bytes");
}
// check presense of TAi
if (CHECK_BIT(TD_p, 4)) {
// next byte is TAi, remember it
pos++;
b = bytes.at(pos);
p->fields[sections_TA[i]] = b;
}
// check presense of TBi
if (CHECK_BIT(TD_p, 5)) {
// next byte is TBi, remember it
pos++;
b = bytes.at(pos);
p->fields[sections_TB[i]] = b;
}
// check presense of TCi
if (CHECK_BIT(TD_p, 6)) {
// next byte is TCi, remember it
pos++;
b = bytes.at(pos);
p->fields[sections_TC[i]] = b;
}
// check presense of TDi
if (CHECK_BIT(TD_p, 7)) {
// next byte is TCi, remember it
pos++;
b = bytes.at(pos);
p->fields[sections_TD[i]] = b;
PRINT_DEBUG("[D] TD" << i << " is set");
TD_p = b;
} else {
// no more interface bytes
PRINT_DEBUG("[D] no more bytes, pass " << i);
break;
}
i++;
}
if (pos > size - p->hb_size - 1) {
// PRINT_DEBUG("[E] position " << int(pos));
// PRINT_DEBUG("[E] HB size " << int(p->hb_size));
// PRINT_DEBUG("[E] size " << int(size));
throw ATRParseError("too short, no place for historical bytes");
}
// store historical bytes
for (i=0; i<p->hb_size; i++) {
pos++;
b = bytes.at(pos);
(p->hb)[i] = b;
}
// check final checksum byte
if (pos == size-2) {
// read TCK byte
pos++;
b = bytes.at(pos);
p->fields[TCK] = b;
} else if (pos >= size) {
throw ATRParseError("Incorrect ATR structure: actual size don't match calculated");
}
// PRINT_DEBUG("[E] position " << int(pos));
// PRINT_DEBUG("[E] size " << int(size));
}
std::string ATRParser::str() const
{
if (p->atr.size() == 0) {
throw ATRParseError("No ATR");
}
std::stringstream ss;
std::stringstream sd;
std::map<ATRField, Byte>::const_iterator end = p->fields.end();
Byte b;
PRINT_DEBUG("[D] Parsed fields: " << p->fields.size());
// try to detect PICC, see section 3.1.3.2.3.1 of PC/SC specification
bool is_picc = false;
if (p->fields[TS] == 0x3b && HN(p->fields[T0]) == 0x8
&& p->fields[TD1] == 0x80 && p->fields[TD2] == 0x01)
{
ss << " Proximity card detected.";
ss << '\n';
is_picc = true;
}
b = p->fields[TS];
ss << " Format byte TS=";
switch (b) {
case 0x3b:
ss << "3B: direct convention";
break;
case 0x3f:
ss << "3F: inverse convention";
break;
}
ss << '\n';
if (p->fields.find(TD1) != end) {
b = p->fields[TD1];
ss << " TD1=" << format(b);
switch (LN(b)) {
case 1:
ss << ", protocol T=1";
break;
case 0:
ss << ", protocol T=0";
break;
}
} else {
// see ISO 7816-3, section "8.2.3 Interface bytes TA TB TC TD"
ss << " TD1 is absent, protocol T=0 assumed";
}
ss << '\n';
float f_max[] = {4, 5, 6, 8, 12, 16, 20, -1, -1, 5, 7.5, 10, 15, 20, 0, 0};
int fi[] = {372, 372, 558, 744, 1116, 1488, 1860, -1, -1, 512, 768, 1024, 1536, 2048, -1, -1};
int Di[] = {-1, 1, 2, 4, 8, 16, 32, 64, 12, 20, -1, -1, -1, -1, -1, -1};
if (p->fields.find(TA1) != end) {
b = p->fields[TA1];
ss << " TA1=" << format(b) << ": ";
ss << "f_max=" << f_max[HN(b)] << ", Fi=" << fi[HN(b)] << ", Di=" << Di[LN(b)];
ss << '\n';
}
if (p->fields.find(TB1) != end) {
b = p->fields[TB1];
ss << " TB1=" << format(b);
ss << '\n';
}
if (p->fields.find(TC1) != end) {
b = p->fields[TC1];
ss << " TC1=" << format(b);
ss << ", EGTi=" << format(b);
ss << '\n';
}
if (p->fields.find(TD2) != end) {
b = p->fields[TD2];
ss << " TD2=" << format(b);
switch (LN(b)) {
case 1:
ss << ", protocol T=1";
break;
case 0:
ss << ", protocol T=0";
break;
}
ss << '\n';
}
if (p->fields.find(TA2) != end) {
b = p->fields[TA2];
ss << " TA2=" << format(b) << ": ";
ss << "f_max=" << f_max[HN(b)] << ", Fi=" << fi[HN(b)] << ", Di=" << Di[LN(b)];
ss << '\n';
}
if (p->fields.find(TC2) != end) {
b = p->fields[TC2];
ss << " TC2=" << format(b);
ss << ", EGTi=" << format(b);
ss << '\n';
}
// we don't care about TA2, TA3 etc
// historical bytes
ss << " Historical bytes size: " << p->hb_size;
// try to parse historical bytes
if (!is_picc) {
ss << ", proprietary format.";
} else {
ss << "";
}
ss << '\n';
if (p->hb_size > 0) {
Bytes hb(p->hb, p->hb_size);
ss << " Historical bytes: " << format(hb) << '\n';
// we can parse PICC historical data
if (is_picc) {
if (hb.at(0) == 0x80) {
if (p->hb_size >= 2 && hb.at(1) == 0x4f) {
ss << " PICC application detected" << '\n';
// next 5 bytes defines RID
Bytes RID = hb.substr(3, 5);
ss << " RID=" << decodeRID(RID) << '\n';
Byte SS = hb.at(8);
switch (SS) {
case 03:
ss << " SS=ISO/IEC 14443A, Part 3" << '\n';
break;
case 04:
ss << " SS=ISO/IEC 14443A, Part 4" << '\n';
break;
default:
ss << " SS=" << format(SS) << '\n';
}
Bytes CardName = hb.substr(9, 2);
ss << " CardName=" << decodeCardName(RID, CardName) << '\n';
} else {
ss << " TLV data" << '\n';
size_t i = 1;
size_t max_i = hb.size();
while (1) {
if (i >= max_i) {
break;
}
Byte tag = HN(hb.at(i));
Byte length = LN(hb.at(i));
switch (tag) {
case 0x3:
ss << " Card service data byte (tag 0x3)";
break;
case 0x4:
ss << " Initial access data (tag 0x4)";
break;
case 0x5:
ss << " Card issuer data (tag 0x5)";
break;
case 0x6:
ss << " Pre-issuing data (tag 0x6)";
break;
case 0x7:
ss << " Card capabilities (tag 0x7)";
break;
case 0x8:
ss << " Status indicator (tag 0x8)";
break;
default:
ss << " tag: " << format(tag);
}
// read next "length" bytes
size_t next_pos = i+length+1;
ss << "; bytes:";
i++;
for (;i<next_pos;i++) {
ss << " " << format(hb.at(i));
}
ss << '\n';
}
}
}
}
}
// TCK
if (p->fields.find(TCK) != end) {
// found TCK, check
ss << " TCK found: " << format(p->fields[TCK]);
Byte checksum = p->fields[TCK];
size_t max = p->atr.size() - 1;
for (size_t i=1; i<max; i++) {
checksum ^= p->atr.at(i);
}
if (checksum == 0) {
ss << ", matches";
} else {
ss << ", doesn't match!";
}
ss << '\n';
} else {
ss << " No TCK present" << '\n';
}
return ss.str();
// return sd.str() + ss.str();
}
bool ATRParser::checkFeature(ATRFeature feature)
{
if (p->atr.size() == 0) {
throw ATRParseError("No ATR");
}
if (p->features.size() == 0) {
// fill array with features
if (p->fields[TS] == 0x3b && HN(p->fields[T0]) == 0x8
&& p->fields[TD1] == 0x80 && p->fields[TD2] == 0x01)
{
p->features.insert(ATR_FEATURE_PICC);
Bytes hb(p->hb, p->hb_size);
if (p->hb_size >= 2 && hb.at(0) == 0x80 && hb.at(1) == 0x4f) {
Bytes RID = hb.substr(3, 5);
if (format(RID).compare("A0 00 00 03 06") == 0) {
unsigned int card_name = hb.at(9)*256 + hb.at(10);
switch (card_name) {
case 0x0001:
p->features.insert(ATR_FEATURE_MIFARE_1K);
break;
case 0x0002:
p->features.insert(ATR_FEATURE_MIFARE_4K);
break;
case 0x0003:
case 0x0026:
break;
case 0xff88:
p->features.insert(ATR_FEATURE_INFINEON_SLE_66R35);
p->features.insert(ATR_FEATURE_MIFARE_1K);
break;
}
}
}
} else {
p->features.insert(ATR_FEATURE_ICC);
}
}
return p->features.find(feature) != p->features.end();
}
static std::map<std::string, std::string> RID_map;
static std::map<int, std::string> PCSC_cardnames_map;
static const size_t RID_map_size = 1;
static const char * RID_map_keys[RID_map_size] = {"A0 00 00 03 06"};
static const char * RID_map_values[RID_map_size] = {"PC/SC Workgroup"};
static const size_t PCSC_cardnames_map_size = 8;
static int PCSC_cardnames_map_keys[PCSC_cardnames_map_size] = {
0x0001, 0x0002, 0x0003,
0x0026, 0xf004, 0xf011,
0xf012, 0xff88};
static const char * PCSC_cardnames_map_values[PCSC_cardnames_map_size] = {
"MIFARE Classic 1K", "MIFARE Classic 4K", "MIFARE Ultralight",
"MIFARE Mini", "Topaz and Jewel", "FeliCa 212K",
"FeliCa 242K", "Infineon SLE 66R35"};
static void initRIDMap()
{
if (RID_map.size() == 0) {
for (size_t i=0; i<RID_map_size; i++) {
RID_map[RID_map_keys[i]] = RID_map_values[i];
}
}
if (PCSC_cardnames_map.size() == 0) {
for (size_t i=0; i<PCSC_cardnames_map_size; i++) {
PCSC_cardnames_map[PCSC_cardnames_map_keys[i]] = PCSC_cardnames_map_values[i];
}
}
}
static std::string decodeRID(const Bytes & rid)
{
std::stringstream ss;
std::string hexRID = format(rid);
if (RID_map.find(hexRID) != RID_map.end()) {
ss << RID_map[hexRID] << " / ";
}
ss << hexRID;
return ss.str();
}
static std::string decodeCardName(const Bytes & rid, const Bytes & card_name)
{
std::stringstream ss;
Byte c1 = card_name.at(1);
Byte c2 = card_name.at(0);
int card = c2*256 + c1;
if (format(rid).compare("A0 00 00 03 06") == 0) {
if (PCSC_cardnames_map.find(card) != PCSC_cardnames_map.end()) {
ss << PCSC_cardnames_map[card] << " / ";
}
}
ss << format(c2) << " " << format(c1);
return ss.str();
}
}