├── CMakeLists.txt ├── COPYING ├── ChangeLog ├── README.md ├── config.h.in ├── mrtd.pc.in ├── src ├── CMakeLists.txt ├── bac.c ├── bac.h ├── bachelper.c ├── bachelper.h ├── crypto-gcrypt.c ├── crypto-tomcrypt.c ├── crypto.h ├── fileread.c ├── fileread.h ├── hardware.c ├── mrtd.h └── mrtdreader.c └── test ├── CMakeLists.txt └── test1.c /CMakeLists.txt: -------------------------------------------------------------------------------- 1 | cmake_minimum_required (VERSION 2.6) 2 | 3 | SET(CMAKE_BUILD_TYPE Release CACHE STRING "If build type is not specified on command line, build Release") 4 | 5 | project (mrtdreader) 6 | 7 | find_package(PkgConfig) 8 | INCLUDE(CheckIncludeFiles) 9 | 10 | pkg_check_modules(NFC libnfc) 11 | CHECK_INCLUDE_FILES(gcrypt.h HAVE_GCRYPT) 12 | 13 | if(NOT NFC_FOUND) 14 | MESSAGE(FATAL_ERROR "The development files for libnfc are needed") 15 | endif() 16 | 17 | if(NOT HAVE_GCRYPT) 18 | MESSAGE(FATAL_ERROR "The development files for libgcrypt are needed") 19 | endif() 20 | 21 | set(MRTD_VERSION 0.1.6) 22 | 23 | INCLUDE_DIRECTORIES(${CMAKE_CURRENT_BINARY_DIR}) 24 | 25 | CONFIGURE_FILE(${CMAKE_CURRENT_SOURCE_DIR}/config.h.in ${CMAKE_CURRENT_BINARY_DIR}/config.h) 26 | 27 | CONFIGURE_FILE(${CMAKE_CURRENT_SOURCE_DIR}/mrtd.pc.in ${CMAKE_CURRENT_BINARY_DIR}/mrtd.pc) 28 | 29 | if(${CMAKE_INSTALL_PREFIX} STREQUAL "/usr") 30 | install(FILES ${CMAKE_CURRENT_BINARY_DIR}/mrtd.pc DESTINATION ${CMAKE_INSTALL_PREFIX}/lib/${CMAKE_LIBRARY_ARCHITECTURE}/pkgconfig) 31 | else() 32 | install(FILES ${CMAKE_CURRENT_BINARY_DIR}/mrtd.pc DESTINATION ${CMAKE_INSTALL_PREFIX}/lib/pkgconfig) 33 | endif() 34 | 35 | add_subdirectory(src) 36 | add_subdirectory(test) 37 | -------------------------------------------------------------------------------- /COPYING: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /ChangeLog: -------------------------------------------------------------------------------- 1 | 0.1.6 2 | Search for start of jpg and jpeg2000 images. This makes it 3 | work with some english and american passports 4 | 0.1.5 5 | Saving JPEG2000 images to .jp2 files 6 | Fixed ugly regression 7 | 0.1.4 8 | Fixed memory allocation problem in mrtdreader 9 | 0.1.3 10 | Input arguments now set to const 11 | 0.1.2 12 | Now also working with german passport - found two mistakes: 13 | - Not polling for NFC-A 14 | - Not long enough timeout 15 | Installing .pc file for multi-arch 16 | 0.1.1: 17 | rnd_ifd and kifd can be set or randomized 18 | mrtdreader also reading EF.SOD 19 | Some cleanup 20 | More in README.md 21 | 0.1.0: 22 | First version to be released. BAC supported, but no support for EAC. 23 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | mrtdreader 2 | ========== 3 | 4 | Machine-readable travel documents such as passports nowadays usually contain 5 | an RFID chip for storing various data. This library provides useful 6 | functions for reading out the data from these documents. This version of the 7 | library supports the Basic Access Control (BAC). It uses several cryptographic 8 | functions from either libgcrypt or libtomcrypt (depending on compile-time 9 | options) in order to do the necessary decryption of the content of the MRTDs. 10 | The key for the BAC-scheme is derived from the Machine-readable zone (MRZ) 11 | which is printed on the MRTD. 12 | 13 | The library depends on libnfc for the hardware interaction and only devices 14 | supported by libnfc will therefore work. 15 | 16 | 17 | Build instruction 18 | ----------------- 19 | - cmake . 20 | - make 21 | - sudo make install 22 | - sudo ldconfig 23 | 24 | 25 | Usage 26 | ------------ 27 | There is a tool called *mrtdreader* using the library which can be run like 28 | this: 29 | 30 | - mrtdreader <MRZ> 31 | 32 | MRZ is the bottom line on the machine-readable travel document. 33 | 34 | Content of MRTDs 35 | ---------------- 36 | 37 | The following files may be present in the MRTD: 38 | 39 | * EF.DG1 - 0101 - MRZ 40 | * EF.DG2 - 0102 - Face 41 | * EF.DG3 - 0103 - Fingerprint 42 | * EF.DG4 - 0104 - Iris 43 | * EF.DG5 - 0105 - Portrait 44 | * EF.DG6 - 0106 - RFU 45 | * EF.DG7 - 0107 - Displayed signature 46 | * EF.DG8 - 0108 - Data features 47 | * EF.DG9 - 0109 - Structure features 48 | * EF.DG10 - 010A - Substance features 49 | * EF.DG11 - 010B - Additional personal details 50 | * EF.DG12 - 010C - Additional document features 51 | * EF.DG13 - 010D - Optional details 52 | * EF.DG14 - 010E - EAC 53 | * EF.DG15 - 010F - AA Public key 54 | * EF.DG16 - 0110 - Persons to notify 55 | * EF.CA - 011C - 56 | * EF.SOD - 011D - Security object data - hash values 57 | * EF.COM - 011E - EF.COM 58 | 59 | The example program *mrtdreader* reads out the MRZ, the facial image, the EF.COM 60 | file and the EF.SOD file. 61 | -------------------------------------------------------------------------------- /config.h.in: -------------------------------------------------------------------------------- 1 | 2 | #define MRTD_VERSION ${MRTD_VERSION} 3 | -------------------------------------------------------------------------------- /mrtd.pc.in: -------------------------------------------------------------------------------- 1 | prefix=${CMAKE_INSTALL_PREFIX} 2 | exec_prefix=${CMAKE_INSTALL_PREFIX}/bin 3 | libdir=${CMAKE_INSTALL_PREFIX}/lib 4 | includedir=${CMAKE_INSTALL_PREFIX}/include 5 | 6 | Name: mrtd 7 | Description: MRTD - machine-readable travel document reader 8 | Version: ${MRTD_VERSION} 9 | Requires: 10 | Libs: -lmrtd -lnfc 11 | Cflags: -I${CMAKE_INSTALL_PREFIX}/include/mrtd 12 | -------------------------------------------------------------------------------- /src/CMakeLists.txt: -------------------------------------------------------------------------------- 1 | add_library(mrtd SHARED bac.c bachelper.c fileread.c hardware.c crypto-gcrypt.c) 2 | target_link_libraries(mrtd nfc) 3 | target_link_libraries(mrtd usb) 4 | target_link_libraries(mrtd gcrypt) 5 | 6 | add_executable(mrtdreader mrtdreader.c) 7 | target_link_libraries(mrtdreader mrtd) 8 | 9 | set_target_properties(mrtd PROPERTIES VERSION 0.0.1 SOVERSION 0) 10 | 11 | install(TARGETS mrtdreader DESTINATION bin) 12 | if(${CMAKE_INSTALL_PREFIX} STREQUAL "/usr") 13 | install(TARGETS mrtd DESTINATION lib/${CMAKE_LIBRARY_ARCHITECTURE}) 14 | else() 15 | install(TARGETS mrtd DESTINATION lib) 16 | endif() 17 | 18 | install(FILES mrtd.h DESTINATION include/mrtd) 19 | install(FILES bac.h DESTINATION include/mrtd) 20 | install(FILES bachelper.h DESTINATION include/mrtd) 21 | install(FILES crypto.h DESTINATION include/mrtd) 22 | install(FILES fileread.h DESTINATION include/mrtd) 23 | -------------------------------------------------------------------------------- /src/bac.c: -------------------------------------------------------------------------------- 1 | /* 2 | * bac.c - Basic Access Control 3 | * 4 | * Copyright (C) 2014 Ruben Undheim 5 | * 6 | * This program is free software: you can redistribute it and/or modify 7 | * it under the terms of the GNU General Public License as published by 8 | * the Free Software Foundation, either version 3 of the License, or 9 | * (at your option) any later version. 10 | * 11 | * This program is distributed in the hope that it will be useful, 12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | * GNU General Public License for more details. 15 | * 16 | * You should have received a copy of the GNU General Public License 17 | * along with this program. If not, see . 18 | * 19 | */ 20 | 21 | #include 22 | #include 23 | #include 24 | #include 25 | #include 26 | #include "bachelper.h" 27 | #include "bac.h" 28 | 29 | static uint8_t rnd_ifd_int[8] = {0x78,0x17,0x23,0x86,0x0c,0x06,0xc2,0x26}; 30 | static uint8_t kifd_int[16] = {0x0b,0x79,0x52,0x40,0xcb,0x70,0x49,0xb0,0x1c,0x19,0xb3,0x3e,0x32,0x80,0x4f,0x0b}; 31 | 32 | int mrtd_bac_keyhandshake(nfc_device *pnd, const uint8_t *kmrz, uint8_t *ksenc, uint8_t *ksmac, uint64_t *ssc_long) 33 | { 34 | int i; 35 | int res; 36 | uint8_t txbuffer[300]; 37 | int txlen; 38 | uint8_t rxbuffer[300]; 39 | int rxlen; 40 | 41 | txlen = 12; 42 | memcpy(txbuffer, "\x00\xa4\x04\x0c\x07\xa0\x00\x00\x02\x47\x10\x01", txlen); 43 | rxlen = sizeof(rxbuffer); 44 | if((res = nfc_initiator_transceive_bytes(pnd,txbuffer,txlen,rxbuffer,rxlen,500)) < 0){ 45 | fprintf(stderr,"Unable to send"); 46 | goto failed; 47 | } 48 | else{ 49 | rxlen = res; 50 | } 51 | 52 | txlen = 5; 53 | memcpy(txbuffer, "\x00\x84\x00\x00\x08", txlen); 54 | rxlen = sizeof(rxbuffer); 55 | if((res = nfc_initiator_transceive_bytes(pnd,txbuffer,txlen,rxbuffer,rxlen,500)) < 0){ 56 | fprintf(stderr,"Unable to send"); 57 | goto failed; 58 | } 59 | else{ 60 | rxlen = res; 61 | } 62 | 63 | uint8_t remotechallenge[8]; 64 | memcpy(remotechallenge,rxbuffer,8); 65 | 66 | 67 | uint8_t kenc[16]; 68 | uint8_t kmac[16]; 69 | 70 | mrtd_bac_kmrz_to_kenc_kmac(kmrz,kenc,kmac); 71 | 72 | uint8_t cmd_data[40]; 73 | 74 | mrtd_bac_cmd_data(rnd_ifd_int,kifd_int,remotechallenge,kenc,kmac,cmd_data); 75 | 76 | txlen = 46; 77 | memcpy(txbuffer, "\x00\x82\x00\x00\x28", 5); 78 | memcpy(txbuffer+5,cmd_data,40); 79 | txbuffer[45] = 0x28; 80 | rxlen = sizeof(rxbuffer); 81 | if((res = nfc_initiator_transceive_bytes(pnd,txbuffer,txlen,rxbuffer,rxlen,100000)) < 0){ 82 | fprintf(stderr,"Unable to send"); 83 | goto failed; 84 | } 85 | else{ 86 | rxlen = res; 87 | } 88 | 89 | uint8_t rnd_icc[8]; 90 | uint8_t kicc[16]; 91 | 92 | if(mrtd_bac_challenge_ok(rxbuffer,kenc,rnd_ifd_int,rnd_icc,kicc)){ 93 | } 94 | else { 95 | goto challengefailed; 96 | } 97 | uint8_t xored[16]; 98 | 99 | for(i=0;i<16;i++){ 100 | xored[i] = kifd_int[i] ^ kicc[i]; 101 | } 102 | 103 | 104 | mrtd_bac_kenc_kmac(xored,ksenc,ksmac); 105 | 106 | //printhex("ksenc",ksenc,16); 107 | //printhex("ksmac",ksmac,16); 108 | 109 | (*ssc_long) = mrtd_bac_get_ssc(remotechallenge,rnd_ifd_int); 110 | 111 | //printf("ssc: %lx\n",ssc_long); 112 | 113 | return 0; 114 | 115 | failed: 116 | return -1; 117 | challengefailed: 118 | return RET_CHALLENGE_FAILED; 119 | } 120 | 121 | void mrtd_bac_set_rndifd_kifd(const uint8_t *rnd_ifd, const uint8_t *kifd) 122 | { 123 | int i; 124 | int r = rand(); 125 | for(i=0;i<8;i++){ 126 | rnd_ifd_int[i] = rnd_ifd[i]; 127 | } 128 | for(i=0;i<16;i++){ 129 | kifd_int[i] = kifd[i]; 130 | } 131 | } 132 | 133 | void mrtd_bac_randomize_rndifd_kifd() 134 | { 135 | int i,r; 136 | for(i=0;i<8;i++){ 137 | r = rand(); 138 | rnd_ifd_int[i] = (uint8_t)(r & 0xff); 139 | } 140 | for(i=0;i<16;i++){ 141 | r = rand(); 142 | kifd_int[i] = (uint8_t)(r & 0xff); 143 | } 144 | } 145 | 146 | 147 | -------------------------------------------------------------------------------- /src/bac.h: -------------------------------------------------------------------------------- 1 | /* 2 | * header for bac.c 3 | * 4 | * Copyright (C) 2014 Ruben Undheim 5 | * 6 | * This program is free software: you can redistribute it and/or modify 7 | * it under the terms of the GNU General Public License as published by 8 | * the Free Software Foundation, either version 3 of the License, or 9 | * (at your option) any later version. 10 | * 11 | * This program is distributed in the hope that it will be useful, 12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | * GNU General Public License for more details. 15 | * 16 | * You should have received a copy of the GNU General Public License 17 | * along with this program. If not, see . 18 | * 19 | */ 20 | 21 | 22 | #ifndef INC_BAC_H 23 | #define INC_BAC_H 24 | 25 | #include 26 | 27 | #define RET_CHALLENGE_FAILED -2 28 | 29 | int mrtd_bac_keyhandshake(nfc_device *pnd, const uint8_t *kmrz, uint8_t *ksenc, uint8_t *ksmac, uint64_t *ssc_long); 30 | 31 | void mrtd_bac_set_rndifd_kifd(const uint8_t *rnd_ifd, const uint8_t *kifd); 32 | 33 | void mrtd_bac_randomize_rndifd_kifd(); 34 | 35 | #endif /* INC_BAC_H */ 36 | 37 | -------------------------------------------------------------------------------- /src/bachelper.c: -------------------------------------------------------------------------------- 1 | /* 2 | * bachelper.c - functions that implement basic algorithms that are 3 | * part of the BAC procedure 4 | * 5 | * Copyright (C) 2014 Ruben Undheim 6 | * 7 | * This program is free software: you can redistribute it and/or modify 8 | * it under the terms of the GNU General Public License as published by 9 | * the Free Software Foundation, either version 3 of the License, or 10 | * (at your option) any later version. 11 | * 12 | * This program is distributed in the hope that it will be useful, 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 | * GNU General Public License for more details. 16 | * 17 | * You should have received a copy of the GNU General Public License 18 | * along with this program. If not, see . 19 | * 20 | */ 21 | 22 | 23 | 24 | #include 25 | #include 26 | #include 27 | #include 28 | #include "crypto.h" 29 | 30 | 31 | static int endianness() 32 | { 33 | int i = 1; 34 | char *p = (char *)&i; 35 | if(p[0] == 1) 36 | return 0; 37 | else 38 | return 1; 39 | } 40 | 41 | void mrtd_bac_kenc_kmac(const uint8_t *input, uint8_t *kenc, uint8_t *kmac) 42 | { 43 | uint8_t hash[20]; 44 | uint8_t k[20]; 45 | uint8_t kenc_tmp[20]; 46 | uint8_t kmac_tmp[20]; 47 | int tmp; 48 | memcpy(hash,input,16); 49 | memcpy(hash+16,"\x00\x00\x00\x01",4); 50 | mrtd_crypto_sha1(hash,20,k); 51 | mrtd_crypto_fix_parity(k,kenc_tmp,20,&tmp); 52 | memcpy(kenc,kenc_tmp,16); 53 | 54 | hash[19] = 0x02; 55 | mrtd_crypto_sha1(hash,20,k); 56 | mrtd_crypto_fix_parity(k,kmac_tmp,20,&tmp); 57 | memcpy(kmac,kmac_tmp,16); 58 | } 59 | 60 | void mrtd_bac_kmrz_to_kenc_kmac(const uint8_t *kmrz, uint8_t *kenc, uint8_t *kmac) 61 | { 62 | uint8_t hash[20]; 63 | mrtd_crypto_sha1(kmrz,24,hash); 64 | mrtd_bac_kenc_kmac(hash,kenc,kmac); 65 | } 66 | 67 | void mrtd_bac_eifd_mifd(const uint8_t *rnd_ifd, const uint8_t *kifd, const uint8_t *remote_challenge, const uint8_t *kenc, const uint8_t *kmac, uint8_t *eifd, uint8_t *mifd) 68 | { 69 | uint8_t S[32]; 70 | memcpy(S,rnd_ifd,8); 71 | memcpy(S+8,remote_challenge,8); 72 | memcpy(S+16,kifd,16); 73 | 74 | mrtd_crypto_encrypt_3des(S,eifd,32,kenc); 75 | mrtd_crypto_mac_padding(eifd,mifd,32,kmac); 76 | } 77 | 78 | void mrtd_bac_cmd_data(const uint8_t *rnd_ifd, const uint8_t *kifd, const uint8_t *remote_challenge, const uint8_t *kenc, const uint8_t *kmac, uint8_t *cmd_data) 79 | { 80 | mrtd_bac_eifd_mifd(rnd_ifd,kifd,remote_challenge,kenc,kmac,cmd_data,cmd_data+32); 81 | } 82 | 83 | 84 | char mrtd_bac_challenge_ok(const uint8_t *rx_data, const uint8_t *kenc, const uint8_t *rnd_ifd, uint8_t *rnd_icc, uint8_t *kicc) 85 | { 86 | int i; 87 | uint8_t decryptedresp[32]; 88 | const uint8_t *resp; 89 | const uint8_t *mac_received; 90 | uint8_t *rec_ifd; 91 | 92 | resp = rx_data; 93 | mac_received = rx_data+32; 94 | 95 | mrtd_crypto_decrypt_3des(resp,decryptedresp,32,kenc); 96 | 97 | if(rnd_icc != NULL) 98 | memcpy(rnd_icc,decryptedresp,8); 99 | if(kicc != NULL) 100 | memcpy(kicc,decryptedresp+16,16); 101 | rec_ifd = decryptedresp+8; 102 | for(i=0;i<8;i++){ 103 | if(rec_ifd[i] != rnd_ifd[i]){ 104 | return 0; 105 | } 106 | } 107 | return 1; 108 | } 109 | 110 | uint64_t mrtd_bac_get_ssc(const uint8_t *remote_challenge, const uint8_t *rnd_ifd) 111 | { 112 | char ssc[8]; 113 | uint64_t ssc_long; 114 | 115 | memcpy(ssc,remote_challenge+4,4); 116 | memcpy(ssc+4,rnd_ifd+4,4); 117 | 118 | if(endianness()){ 119 | *(((uint8_t*)(&ssc_long))+0) = ssc[0]; 120 | *(((uint8_t*)(&ssc_long))+1) = ssc[1]; 121 | *(((uint8_t*)(&ssc_long))+2) = ssc[2]; 122 | *(((uint8_t*)(&ssc_long))+3) = ssc[3]; 123 | *(((uint8_t*)(&ssc_long))+4) = ssc[4]; 124 | *(((uint8_t*)(&ssc_long))+5) = ssc[5]; 125 | *(((uint8_t*)(&ssc_long))+6) = ssc[6]; 126 | *(((uint8_t*)(&ssc_long))+7) = ssc[7]; 127 | } 128 | else { 129 | *(((uint8_t*)(&ssc_long))+7) = ssc[0]; 130 | *(((uint8_t*)(&ssc_long))+6) = ssc[1]; 131 | *(((uint8_t*)(&ssc_long))+5) = ssc[2]; 132 | *(((uint8_t*)(&ssc_long))+4) = ssc[3]; 133 | *(((uint8_t*)(&ssc_long))+3) = ssc[4]; 134 | *(((uint8_t*)(&ssc_long))+2) = ssc[5]; 135 | *(((uint8_t*)(&ssc_long))+1) = ssc[6]; 136 | *(((uint8_t*)(&ssc_long))+0) = ssc[7]; 137 | } 138 | 139 | return ssc_long; 140 | } 141 | 142 | 143 | void mrtd_bac_protected_apdu(const uint8_t *input, uint8_t *output, const int length, int *outputlength, const uint8_t *ksenc, const uint8_t *ksmac, const uint64_t ssc_long) 144 | { 145 | int datalength; 146 | char has_le; 147 | uint8_t *do87 = NULL; 148 | uint8_t do8e[10]; 149 | uint8_t padded_command[8]; 150 | uint8_t *A; 151 | int padded_data_length; 152 | int do87_length; 153 | uint8_t *do97 = NULL; 154 | int do97_length; 155 | uint8_t le; 156 | 157 | if(length > 5){ 158 | datalength = (int)input[4]; 159 | } 160 | else{ 161 | datalength = 0; 162 | } 163 | if(datalength != 0 ? length > (5+datalength) : length == 5){ 164 | le = input[length-1]; 165 | has_le = 1; 166 | } 167 | else{ 168 | le = 0; 169 | has_le = 0; 170 | } 171 | 172 | //printf("datalength: %d\n",datalength); 173 | //printf("hasle: %d\n",has_le); 174 | int i; 175 | 176 | if(datalength != 0){ 177 | uint8_t *padded_data; 178 | padded_data = malloc(((datalength+8)/8)*8); 179 | mrtd_crypto_padding(input+5,padded_data,datalength,&padded_data_length); 180 | do87 = malloc(padded_data_length+3); 181 | mrtd_crypto_encrypt_3des(padded_data,do87+3,padded_data_length,ksenc); 182 | do87[0] = 0x87; 183 | do87[1] = 0x09; 184 | do87[2] = 0x01; 185 | do87_length = padded_data_length+3; 186 | 187 | free(padded_data); 188 | } 189 | else{ 190 | do87_length = 0; 191 | padded_data_length = 0; 192 | } 193 | 194 | if(has_le){ 195 | do97_length = 3; 196 | do97 = malloc(do97_length); 197 | do97[0] = 0x97; 198 | do97[1] = 0x01; 199 | do97[2] = le; 200 | } 201 | else{ 202 | do97_length = 0; 203 | } 204 | 205 | int padded_command_length; 206 | mrtd_crypto_padding(input,padded_command,4,&padded_command_length); 207 | padded_command[0] = 0x0c; 208 | 209 | 210 | A = malloc(16+do87_length+do97_length); 211 | if(endianness()){ 212 | A[0] = *(((uint8_t*)(&ssc_long))+0); 213 | A[1] = *(((uint8_t*)(&ssc_long))+1); 214 | A[2] = *(((uint8_t*)(&ssc_long))+2); 215 | A[3] = *(((uint8_t*)(&ssc_long))+3); 216 | A[4] = *(((uint8_t*)(&ssc_long))+4); 217 | A[5] = *(((uint8_t*)(&ssc_long))+5); 218 | A[6] = *(((uint8_t*)(&ssc_long))+6); 219 | A[7] = *(((uint8_t*)(&ssc_long))+7); 220 | } 221 | else { 222 | A[0] = *(((uint8_t*)(&ssc_long))+7); 223 | A[1] = *(((uint8_t*)(&ssc_long))+6); 224 | A[2] = *(((uint8_t*)(&ssc_long))+5); 225 | A[3] = *(((uint8_t*)(&ssc_long))+4); 226 | A[4] = *(((uint8_t*)(&ssc_long))+3); 227 | A[5] = *(((uint8_t*)(&ssc_long))+2); 228 | A[6] = *(((uint8_t*)(&ssc_long))+1); 229 | A[7] = *(((uint8_t*)(&ssc_long))+0); 230 | } 231 | memcpy(A+8,padded_command,8); 232 | if(do87 != NULL) 233 | memcpy(A+16,do87,do87_length); 234 | if(do97 != NULL) 235 | memcpy(A+16+do87_length,do97,do97_length); 236 | 237 | 238 | do8e[0] = 0x8e; 239 | do8e[1] = 0x08; 240 | 241 | mrtd_crypto_mac_padding(A,do8e+2,16+do87_length+do97_length,ksmac); 242 | 243 | (*outputlength) = 5+do87_length+do97_length+10+1; 244 | memcpy(output,padded_command,4); 245 | output[4] = (*outputlength)-6; 246 | if(do87 != NULL) 247 | memcpy(output+5,do87,do87_length); 248 | if(do97 != NULL) 249 | memcpy(output+5+do87_length,do97,do97_length); 250 | memcpy(output+5+do87_length+do97_length,do8e,10); 251 | output[(*outputlength)-1] = 0x00; 252 | 253 | //printf("tot_length: %d\n",*outputlength); 254 | 255 | free(A); 256 | if(do87 != NULL) 257 | free(do87); 258 | if(do97 != NULL) 259 | free(do97); 260 | 261 | return ; 262 | } 263 | 264 | void mrtd_bac_decrypt_response(const uint8_t *input, uint8_t *output, const int length, int *outputlength, uint8_t *ksenc) 265 | { 266 | uint8_t *tmp; 267 | int tmplength; 268 | const uint8_t *tobedecrypted = input+3; 269 | tmplength = length-16-3; 270 | if(tmplength > 0){ 271 | tmp = malloc(tmplength); 272 | 273 | mrtd_crypto_decrypt_3des(tobedecrypted,tmp,tmplength,ksenc); 274 | 275 | mrtd_crypto_padding_remove(tmp,output,tmplength,outputlength); 276 | 277 | free(tmp); 278 | } 279 | else { 280 | (*outputlength) = 0; 281 | } 282 | } 283 | 284 | static int mrtd_get_mrz_weight(int i) 285 | { 286 | switch(i){ 287 | case(0): return 7; 288 | case(1): return 3; 289 | case(2): return 1; 290 | } 291 | } 292 | 293 | int mrtd_bac_check_digit(const uint8_t *input, const int length) 294 | { 295 | int i; 296 | int tmp; 297 | int out_value; 298 | int check_digit; 299 | check_digit = 0; 300 | for(i=0;i= 'A' && input[i] <= 'Z') 302 | tmp = input[i] - 55; 303 | else if (input[i] == '<') 304 | tmp = 0; 305 | else 306 | tmp = input[i] - 0x30; 307 | check_digit += tmp * mrtd_get_mrz_weight(i % 3); 308 | } 309 | return (check_digit % 10); 310 | } 311 | 312 | void mrtd_bac_get_kmrz(const uint8_t *pn, const uint8_t *dob, const uint8_t *eov, uint8_t *output) 313 | { 314 | uint8_t tmp[20]; 315 | int cd; 316 | int len; 317 | 318 | len = strlen(pn); 319 | if (len < 9){ 320 | memcpy(output,pn,len); 321 | memset(output+len,'<',9-len); 322 | } 323 | else { 324 | memcpy(output,pn,9); 325 | } 326 | 327 | cd = mrtd_bac_check_digit(output,9); 328 | output[9] = (uint8_t)(cd+0x30); 329 | 330 | memcpy(output+10,dob,6); 331 | cd = mrtd_bac_check_digit(dob,6); 332 | output[16] = (uint8_t)(cd+0x30); 333 | 334 | memcpy(output+17,eov,6); 335 | cd = mrtd_bac_check_digit(eov,6); 336 | output[23] = (uint8_t)(cd+0x30); 337 | output[24] = 0; 338 | 339 | } 340 | 341 | void mrtd_bac_get_kmrz_from_mrz(const uint8_t *mrz, uint8_t *kmrz) 342 | { 343 | uint8_t pn[9]; 344 | uint8_t dob[6]; 345 | uint8_t eov[6]; 346 | 347 | memcpy(pn,mrz,9); 348 | memcpy(dob,mrz+13,6); 349 | memcpy(eov,mrz+21,6); 350 | 351 | mrtd_bac_get_kmrz(pn,dob,eov,kmrz); 352 | 353 | } 354 | 355 | 356 | -------------------------------------------------------------------------------- /src/bachelper.h: -------------------------------------------------------------------------------- 1 | /* 2 | * header for bachelper.c 3 | * 4 | * Copyright (C) 2014 Ruben Undheim 5 | * 6 | * This program is free software: you can redistribute it and/or modify 7 | * it under the terms of the GNU General Public License as published by 8 | * the Free Software Foundation, either version 3 of the License, or 9 | * (at your option) any later version. 10 | * 11 | * This program is distributed in the hope that it will be useful, 12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | * GNU General Public License for more details. 15 | * 16 | * You should have received a copy of the GNU General Public License 17 | * along with this program. If not, see . 18 | * 19 | */ 20 | 21 | #ifndef INC_BAC_HELPER_H 22 | #define INC_BAC_HELPER_H 23 | 24 | #include 25 | 26 | void mrtd_bac_kmrz_to_kenc_kmac(const uint8_t *kmrz, uint8_t *kenc, uint8_t *kmac); 27 | 28 | void mrtd_bac_kenc_kmac(const uint8_t *input, uint8_t *kenc, uint8_t *kmac); 29 | 30 | void mrtd_bac_eifd_mifd(const uint8_t *rnd_ifd, const uint8_t *kifd, const uint8_t *remote_challenge, const uint8_t *kenc, const uint8_t *kmac, uint8_t *eifd, uint8_t *mifd); 31 | 32 | void mrtd_bac_cmd_data(const uint8_t *rnd_ifd, const uint8_t *kifd, const uint8_t *remote_challenge, const uint8_t *kenc, const uint8_t *kmac, uint8_t *cmd_data); 33 | 34 | char mrtd_bac_challenge_ok(const uint8_t *rx_data, const uint8_t *kenc, const uint8_t *rnd_ifd, uint8_t *rnd_icc, uint8_t *kicc); 35 | 36 | uint64_t mrtd_bac_get_ssc(const uint8_t *remote_challenge, const uint8_t *rnd_ifd); 37 | 38 | void mrtd_bac_protected_apdu(const uint8_t *input, uint8_t *output, const int length, int *outputlength, const uint8_t *ksenc, const uint8_t *ksmac, const uint64_t ssc_long); 39 | 40 | void mrtd_bac_decrypt_response(const uint8_t *input, uint8_t *output, const int length, int *outputlength, const uint8_t *ksenc); 41 | 42 | int mrtd_bac_check_digit(const uint8_t *input, const int length); 43 | 44 | void mrtd_bac_get_kmrz(const uint8_t *pn, const uint8_t *dob, const uint8_t *eov, uint8_t *output); 45 | 46 | void mrtd_bac_get_kmrz_from_mrz(const uint8_t *mrz, uint8_t *kmrz); 47 | 48 | #endif /* INC_BAC_HELPER_H */ 49 | -------------------------------------------------------------------------------- /src/crypto-gcrypt.c: -------------------------------------------------------------------------------- 1 | /* 2 | * crypto-gcrypt.c - Cryptography routines needed by mrtreader using 3 | * libgcrypt. 4 | * 5 | * Copyright (C) 2014 Ruben Undheim 6 | * 7 | * This program is free software: you can redistribute it and/or modify 8 | * it under the terms of the GNU General Public License as published by 9 | * the Free Software Foundation, either version 3 of the License, or 10 | * (at your option) any later version. 11 | * 12 | * This program is distributed in the hope that it will be useful, 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 | * GNU General Public License for more details. 16 | * 17 | * You should have received a copy of the GNU General Public License 18 | * along with this program. If not, see . 19 | * 20 | */ 21 | 22 | 23 | #include 24 | #include 25 | #include 26 | #include 27 | #include 28 | 29 | 30 | void mrtd_crypto_sha1(const uint8_t *input, const int length, uint8_t *output) 31 | { 32 | gcry_md_hash_buffer(GCRY_MD_SHA1, output, input, length); 33 | } 34 | 35 | void mrtd_crypto_crypt_des(const uint8_t *input, uint8_t *output, const int length, const uint8_t *key, const char encrypt) 36 | { 37 | int err; 38 | uint8_t iv[8]; 39 | memset(iv,0,8); 40 | gcry_cipher_hd_t handle; 41 | err = gcry_cipher_open(&handle, GCRY_CIPHER_DES,GCRY_CIPHER_MODE_CBC,0); 42 | err = gcry_cipher_setkey(handle, key,8); 43 | err = gcry_cipher_setiv(handle, iv, 8); 44 | if(encrypt) 45 | err = gcry_cipher_encrypt(handle,output,length,input,length); 46 | else 47 | err = gcry_cipher_decrypt(handle,output,length,input,length); 48 | gcry_cipher_close(handle); 49 | 50 | } 51 | 52 | void mrtd_crypto_encrypt_des(const uint8_t *input, uint8_t *output, const int length, const uint8_t *key) 53 | { 54 | mrtd_crypto_crypt_des(input,output,length,key,1); 55 | } 56 | 57 | void mrtd_crypto_decrypt_des(const uint8_t *input, uint8_t *output, const int length, const uint8_t *key) 58 | { 59 | mrtd_crypto_crypt_des(input,output,length,key,0); 60 | } 61 | 62 | void mrtd_crypto_crypt_3des(const uint8_t *input, uint8_t *output, const int length, const uint8_t *key, const char encrypt) 63 | { 64 | int err; 65 | uint8_t longkey[24]; 66 | uint8_t iv[8]; 67 | memset(iv,0,8); 68 | memcpy(longkey,key,16); 69 | memcpy(longkey+16,key,8); 70 | gcry_cipher_hd_t handle; 71 | err = gcry_cipher_open(&handle, GCRY_CIPHER_3DES,GCRY_CIPHER_MODE_CBC,0); 72 | err = gcry_cipher_setkey(handle, longkey,24); 73 | err = gcry_cipher_setiv(handle, iv, 8); 74 | if(encrypt) 75 | err = gcry_cipher_encrypt(handle,output,length,input,length); 76 | else 77 | err = gcry_cipher_decrypt(handle,output,length,input,length); 78 | gcry_cipher_close(handle); 79 | } 80 | 81 | void mrtd_crypto_encrypt_3des(const uint8_t *input, uint8_t *output, const int length, const uint8_t *key) 82 | { 83 | mrtd_crypto_crypt_3des(input,output,length,key,1); 84 | } 85 | 86 | void mrtd_crypto_decrypt_3des(const uint8_t *input, uint8_t *output, const int length, const uint8_t *key) 87 | { 88 | mrtd_crypto_crypt_3des(input,output,length,key,0); 89 | } 90 | 91 | void mrtd_crypto_fix_parity(const uint8_t *input, uint8_t *output, const int length, int *newlength) 92 | { 93 | int i,j; 94 | unsigned char y; 95 | int parity; 96 | *newlength = length+(length/8); 97 | for(i=0;i> j & 1; 102 | } 103 | if(parity % 2 == 0){ 104 | output[i] = (char)(y + 1); 105 | } 106 | else{ 107 | output[i] = y; 108 | } 109 | } 110 | 111 | } 112 | void mrtd_crypto_padding(const uint8_t *input, uint8_t *output, const int length, int *newlength) 113 | { 114 | *newlength = ((length+8)/8)*8; 115 | memset(output,0,*newlength); 116 | memcpy(output,input,length); 117 | output[length] = 0x80; 118 | } 119 | void mrtd_crypto_padding_remove(const uint8_t *input, uint8_t *output, const int length, int *newlength) 120 | { 121 | int i; 122 | int pos; 123 | char found = 0; 124 | for(i=length-1;i>=0;i--){ 125 | if(input[i] == 0x00) { 126 | continue; 127 | } 128 | else if(input[i] == 0x80) { 129 | pos = i; 130 | found = 1; 131 | break; 132 | } 133 | else { 134 | goto failed; 135 | } 136 | } 137 | if(found){ 138 | *newlength = pos; 139 | memcpy(output,input,*newlength); 140 | } 141 | else{ 142 | goto failed; 143 | } 144 | 145 | return; 146 | 147 | failed: 148 | *newlength = 0; 149 | return; 150 | } 151 | 152 | void mrtd_crypto_mac(const uint8_t *input, uint8_t *output, const int length, const uint8_t *key) 153 | { 154 | int i,j; 155 | uint8_t current[8]; 156 | uint8_t mac[8]; 157 | uint8_t xormac[8]; 158 | uint8_t tmp[8]; 159 | memset(mac,0,8); 160 | for(i=0;i<(length/8);i++){ 161 | for(j=0;j<8;j++){ 162 | current[j] = input[i*8+j]; 163 | } 164 | for(j=0;j<8;j++){ 165 | xormac[j] = mac[j] ^ current[j]; 166 | } 167 | mrtd_crypto_encrypt_des(xormac,mac,8,key); 168 | } 169 | mrtd_crypto_decrypt_des(mac,tmp,8,key+8); 170 | mrtd_crypto_encrypt_des(tmp,output,8,key); 171 | } 172 | 173 | void mrtd_crypto_mac_padding(const uint8_t *input, uint8_t *output, const int length, const uint8_t *key) 174 | { 175 | int newlength; 176 | uint8_t *tmp; 177 | tmp = malloc(((length+8)/8)*8); 178 | mrtd_crypto_padding(input,tmp,length,&newlength); 179 | mrtd_crypto_mac(tmp,output,newlength,key); 180 | 181 | free(tmp); 182 | } 183 | -------------------------------------------------------------------------------- /src/crypto-tomcrypt.c: -------------------------------------------------------------------------------- 1 | /* 2 | * crypto-tomgrypt.c - Cryptography routines needed by mrtreader using 3 | * libtomcrypt. 4 | * 5 | * Copyright (C) 2014 Ruben Undheim 6 | * 7 | * This program is free software: you can redistribute it and/or modify 8 | * it under the terms of the GNU General Public License as published by 9 | * the Free Software Foundation, either version 3 of the License, or 10 | * (at your option) any later version. 11 | * 12 | * This program is distributed in the hope that it will be useful, 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 | * GNU General Public License for more details. 16 | * 17 | * You should have received a copy of the GNU General Public License 18 | * along with this program. If not, see . 19 | * 20 | */ 21 | 22 | 23 | #include 24 | #include 25 | #include 26 | #include 27 | #include 28 | 29 | 30 | void mrtd_crypto_sha1(const uint8_t *input, const int length, uint8_t *output) 31 | { 32 | hash_state md; 33 | sha1_init(&md); 34 | sha1_process(&md, (const unsigned char*) input, length); 35 | sha1_done(&md, output); 36 | } 37 | 38 | void mrtd_crypto_crypt_des(const uint8_t *input, uint8_t *output, const int length, const uint8_t *key, const char encrypt) 39 | { 40 | int err; 41 | symmetric_CBC cbc_state; 42 | char IV[8]; 43 | 44 | memset(IV,0,8); 45 | 46 | if(register_cipher(&des_desc) == -1){ 47 | printf("Error registering cipher\n"); 48 | } 49 | if((err = cbc_start(find_cipher("des"),IV,key,8,0,&cbc_state)) != CRYPT_OK){ 50 | printf("cbc_start error: %s\n", error_to_string(err)); 51 | } 52 | if(encrypt){ 53 | if((err = cbc_encrypt(input,output,length,&cbc_state)) != CRYPT_OK){ 54 | printf("cbc_encrypt error: %s\n", error_to_string(err)); 55 | } 56 | } 57 | else{ 58 | if((err = cbc_decrypt(input,output,length,&cbc_state)) != CRYPT_OK){ 59 | printf("cbc_encrypt error: %s\n", error_to_string(err)); 60 | } 61 | } 62 | if((err = cbc_done(&cbc_state)) != CRYPT_OK){ 63 | printf("cbc_done error: %s\n", error_to_string(err)); 64 | } 65 | } 66 | 67 | void mrtd_crypto_encrypt_des(const uint8_t *input, uint8_t *output, const int length, const uint8_t *key) 68 | { 69 | mrtd_crypto_crypt_des(input,output,length,key,1); 70 | } 71 | 72 | void mrtd_crypto_decrypt_des(const uint8_t *input, uint8_t *output, const int length, const uint8_t *key) 73 | { 74 | mrtd_crypto_crypt_des(input,output,length,key,0); 75 | } 76 | 77 | void mrtd_crypto_crypt_3des(const uint8_t *input, uint8_t *output, const int length, const uint8_t *key, const char encrypt) 78 | { 79 | int err; 80 | symmetric_CBC cbc_state; 81 | char longkey[24]; 82 | char IV[8]; 83 | 84 | memcpy(longkey,key,16); 85 | memcpy(longkey+16,key,8); 86 | memset(IV,0,8); 87 | 88 | if(register_cipher(&des3_desc) == -1){ 89 | printf("Error registering cipher\n"); 90 | exit(-1); 91 | } 92 | if((err = cbc_start(find_cipher("3des"),IV,longkey,24,0,&cbc_state)) != CRYPT_OK){ 93 | printf("cbc_start error: %s\n", error_to_string(err)); 94 | exit(-1); 95 | } 96 | if(encrypt){ 97 | if((err = cbc_encrypt(input,output,length,&cbc_state)) != CRYPT_OK){ 98 | printf("cbc_encrypt error: %s\n", error_to_string(err)); 99 | exit(-1); 100 | } 101 | } 102 | else{ 103 | if((err = cbc_decrypt(input,output,length,&cbc_state)) != CRYPT_OK){ 104 | printf("cbc_encrypt error: %s\n", error_to_string(err)); 105 | exit(-1); 106 | } 107 | } 108 | } 109 | 110 | void mrtd_crypto_encrypt_3des(const uint8_t *input, uint8_t *output, const int length, const uint8_t *key) 111 | { 112 | mrtd_crypto_crypt_3des(input,output,length,key,1); 113 | } 114 | 115 | void mrtd_crypto_decrypt_3des(const uint8_t *input, uint8_t *output, const int length, const uint8_t *key) 116 | { 117 | mrtd_crypto_crypt_3des(input,output,length,key,0); 118 | } 119 | 120 | void mrtd_crypto_fix_parity(const uint8_t *input, uint8_t *output, const int length, int *newlength) 121 | { 122 | int i,j; 123 | unsigned char y; 124 | int parity; 125 | *newlength = length+(length/8); 126 | for(i=0;i> j & 1; 131 | } 132 | if(parity % 2 == 0){ 133 | output[i] = (char)(y + 1); 134 | } 135 | else{ 136 | output[i] = y; 137 | } 138 | } 139 | 140 | } 141 | void mrtd_crypto_padding(const uint8_t *input, uint8_t *output, const int length, int *newlength) 142 | { 143 | *newlength = ((length+8)/8)*8; 144 | memset(output,0,*newlength); 145 | memcpy(output,input,length); 146 | output[length] = 0x80; 147 | } 148 | void mrtd_crypto_padding_remove(const uint8_t *input, uint8_t *output, const int length, int *newlength) 149 | { 150 | int i; 151 | int pos; 152 | char found = 0; 153 | for(i=length-1;i>=0;i--){ 154 | if(input[i] == 0x00) { 155 | continue; 156 | } 157 | else if(input[i] == 0x80) { 158 | pos = i; 159 | found = 1; 160 | break; 161 | } 162 | else { 163 | goto failed; 164 | } 165 | } 166 | if(found){ 167 | *newlength = pos; 168 | memcpy(output,input,*newlength); 169 | } 170 | else{ 171 | goto failed; 172 | } 173 | 174 | return; 175 | 176 | failed: 177 | *newlength = 0; 178 | return; 179 | } 180 | 181 | void mrtd_crypto_mac(const uint8_t *input, uint8_t *output, const int length, const uint8_t *key) 182 | { 183 | int i,j; 184 | uint8_t current[8]; 185 | uint8_t mac[8]; 186 | uint8_t xormac[8]; 187 | uint8_t tmp[8]; 188 | memset(mac,0,8); 189 | for(i=0;i<(length/8);i++){ 190 | for(j=0;j<8;j++){ 191 | current[j] = input[i*8+j]; 192 | } 193 | for(j=0;j<8;j++){ 194 | xormac[j] = mac[j] ^ current[j]; 195 | } 196 | mrtd_crypto_encrypt_des(xormac,mac,8,key); 197 | } 198 | mrtd_crypto_decrypt_des(mac,tmp,8,key+8); 199 | mrtd_crypto_encrypt_des(tmp,output,8,key); 200 | } 201 | 202 | void mrtd_crypto_mac_padding(const uint8_t *input, uint8_t *output, const int length, const uint8_t *key) 203 | { 204 | int newlength; 205 | uint8_t *tmp; 206 | tmp = malloc(((length+8)/8)*8); 207 | mrtd_crypto_padding(input,tmp,length,&newlength); 208 | mrtd_crypto_mac(tmp,output,newlength,key); 209 | 210 | free(tmp); 211 | } 212 | -------------------------------------------------------------------------------- /src/crypto.h: -------------------------------------------------------------------------------- 1 | /* 2 | * header for crypto_*.c - this header makes the higher-level code 3 | * independent of which crypto-library that is used. 4 | * 5 | * Copyright (C) 2014 Ruben Undheim 6 | * 7 | * This program is free software: you can redistribute it and/or modify 8 | * it under the terms of the GNU General Public License as published by 9 | * the Free Software Foundation, either version 3 of the License, or 10 | * (at your option) any later version. 11 | * 12 | * This program is distributed in the hope that it will be useful, 13 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 14 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 15 | * GNU General Public License for more details. 16 | * 17 | * You should have received a copy of the GNU General Public License 18 | * along with this program. If not, see . 19 | * 20 | */ 21 | 22 | #ifndef INC_BAC_CRYPTO_H 23 | #define INC_BAC_CRYPTO_H 24 | 25 | #include 26 | 27 | void mrtd_crypto_sha1(const uint8_t *input, const int length, uint8_t *output); 28 | 29 | void mrtd_crypto_encrypt_3des(const uint8_t *input, uint8_t *output, const int length, const uint8_t *key); 30 | 31 | void mrtd_crypto_decrypt_3des(const uint8_t *input, uint8_t *output, const int length, const uint8_t *key); 32 | 33 | void mrtd_crypto_encrypt_des(const uint8_t *input, uint8_t *output, const int length, const uint8_t *key); 34 | 35 | void mrtd_crypto_decrypt_des(const uint8_t *input, uint8_t *output, const int length, const uint8_t *key); 36 | 37 | void mrtd_crypto_fix_parity(const uint8_t *input, uint8_t *output, const int length, int *newlength); 38 | 39 | void mrtd_crypto_mac_padding(const uint8_t *input, uint8_t *output, const int length, const uint8_t *key); 40 | 41 | void mrtd_crypto_mac(const uint8_t *input, uint8_t *output, const int length, const uint8_t *key); 42 | 43 | void mrtd_crypto_padding(const uint8_t *input, uint8_t *output, const int length, int *newlength); 44 | 45 | void mrtd_crypto_padding_remove(const uint8_t *input, uint8_t *output, const int length, int *newlength); 46 | 47 | #endif /* INC_BAC_CRYPTO_H */ 48 | -------------------------------------------------------------------------------- /src/fileread.c: -------------------------------------------------------------------------------- 1 | /* 2 | * fileread.c - Functions for reading secure files from MRTD 3 | * 4 | * Copyright (C) 2014 Ruben Undheim 5 | * 6 | * This program is free software: you can redistribute it and/or modify 7 | * it under the terms of the GNU General Public License as published by 8 | * the Free Software Foundation, either version 3 of the License, or 9 | * (at your option) any later version. 10 | * 11 | * This program is distributed in the hope that it will be useful, 12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | * GNU General Public License for more details. 15 | * 16 | * You should have received a copy of the GNU General Public License 17 | * along with this program. If not, see . 18 | * 19 | */ 20 | 21 | #include 22 | #include 23 | #include 24 | #include 25 | #include 26 | #include "crypto.h" 27 | #include "bac.h" 28 | #include "bachelper.h" 29 | 30 | 31 | #define MAXREAD 100 32 | 33 | static int endianness() 34 | { 35 | int i = 1; 36 | char *p = (char *)&i; 37 | if(p[0] == 1) 38 | return 0; 39 | else 40 | return 1; 41 | } 42 | 43 | int mrtd_fileread_read(nfc_device *pnd, const uint8_t *file_index, uint8_t *output, int *outputlength, const uint8_t *ksenc, const uint8_t *ksmac, uint64_t *ssc_long) 44 | { 45 | int res; 46 | uint8_t txbuffer[300]; 47 | int txlen; 48 | uint8_t rxbuffer[300]; 49 | int rxlen; 50 | int already_received; 51 | 52 | uint8_t unprotected[300]; 53 | int unprotectedlength; 54 | unprotectedlength = 7; 55 | memcpy(unprotected,"\x00\xa4\x02\x0c\x02\x01\x1e",5); 56 | memcpy(unprotected+5,file_index,2); 57 | (*ssc_long)++; 58 | mrtd_bac_protected_apdu(unprotected,txbuffer,unprotectedlength,&txlen,ksenc,ksmac,*ssc_long); 59 | 60 | //printhex("Transmit",txbuffer,txlen); 61 | rxlen = sizeof(rxbuffer); 62 | if((res = nfc_initiator_transceive_bytes(pnd,txbuffer,txlen,rxbuffer,rxlen,500)) < 0){ 63 | fprintf(stderr,"Unable to send"); 64 | goto failed; 65 | } 66 | else{ 67 | rxlen = res; 68 | } 69 | //printhex("Received (encrypted)",rxbuffer,rxlen); 70 | (*ssc_long)++; 71 | mrtd_bac_decrypt_response(rxbuffer,unprotected,rxlen,&unprotectedlength,ksenc); 72 | //printhex("Received (decrypted)",unprotected,unprotectedlength); 73 | 74 | already_received=0; 75 | 76 | unprotectedlength = 5; 77 | memcpy(unprotected,"\x00\xb0\x00\x00\x04",unprotectedlength); 78 | (*ssc_long)++; 79 | mrtd_bac_protected_apdu(unprotected,txbuffer,unprotectedlength,&txlen,ksenc,ksmac,*ssc_long); 80 | //printhex("Transmit",txbuffer,txlen); 81 | rxlen = sizeof(rxbuffer); 82 | if((res = nfc_initiator_transceive_bytes(pnd,txbuffer,txlen,rxbuffer,rxlen,500)) < 0){ 83 | fprintf(stderr,"Unable to send"); 84 | goto failed; 85 | } 86 | else{ 87 | rxlen = res; 88 | } 89 | //printhex("Received (encrypted)",rxbuffer,rxlen); 90 | (*ssc_long)++; 91 | mrtd_bac_decrypt_response(rxbuffer,unprotected,rxlen,&unprotectedlength,ksenc); 92 | //printhex("Received (decrypted)",unprotected,unprotectedlength); 93 | memcpy(output+already_received,unprotected,unprotectedlength); 94 | already_received += unprotectedlength; 95 | 96 | uint16_t numberbytes; 97 | int field_length; 98 | if(unprotected[1] <= 0x7f){ 99 | numberbytes = (uint16_t)unprotected[1]; 100 | field_length = 1; 101 | } 102 | else if(unprotected[1] == 0x81){ 103 | numberbytes = (uint16_t)unprotected[2]; 104 | field_length = 2; 105 | } 106 | else if(unprotected[1] == 0x82){ 107 | if(endianness()){ 108 | *(((uint8_t*)(&numberbytes))+0) = unprotected[2]; 109 | *(((uint8_t*)(&numberbytes))+1) = unprotected[3]; 110 | } 111 | else { 112 | *(((uint8_t*)(&numberbytes))+1) = unprotected[2]; 113 | *(((uint8_t*)(&numberbytes))+0) = unprotected[3]; 114 | } 115 | field_length = 3; 116 | } 117 | else { 118 | fprintf(stderr,"Not correct field length"); 119 | goto failed; 120 | } 121 | //printf("numberbytes: %d\n",numberbytes); 122 | 123 | int left_to_read; 124 | int readnow; 125 | left_to_read = numberbytes - (3-field_length); 126 | 127 | while (left_to_read > 0){ 128 | if(left_to_read > MAXREAD) 129 | readnow = MAXREAD; 130 | else 131 | readnow = left_to_read; 132 | unprotectedlength = 5; 133 | memcpy(unprotected,"\x00\xb0\x00\x00\x00",unprotectedlength); 134 | if(endianness()){ 135 | unprotected[2] = *(((uint8_t*)&already_received)+0); 136 | unprotected[3] = *(((uint8_t*)&already_received)+1); 137 | } 138 | else { 139 | unprotected[2] = *(((uint8_t*)&already_received)+1); 140 | unprotected[3] = *(((uint8_t*)&already_received)+0); 141 | } 142 | unprotected[4] = readnow; 143 | (*ssc_long)++; 144 | mrtd_bac_protected_apdu(unprotected,txbuffer,unprotectedlength,&txlen,ksenc,ksmac,*ssc_long); 145 | //printhex("Transmit",txbuffer,txlen); 146 | rxlen = sizeof(rxbuffer); 147 | if((res = nfc_initiator_transceive_bytes(pnd,txbuffer,txlen,rxbuffer,rxlen,500)) < 0){ 148 | fprintf(stderr,"Unable to send"); 149 | goto failed; 150 | } 151 | else{ 152 | rxlen = res; 153 | } 154 | //printhex("Received (encrypted)",rxbuffer,rxlen); 155 | (*ssc_long)++; 156 | mrtd_bac_decrypt_response(rxbuffer,unprotected,rxlen,&unprotectedlength,ksenc); 157 | //printhex("Received (decrypted)",unprotected,unprotectedlength); 158 | memcpy(output+already_received,unprotected,unprotectedlength); 159 | already_received += unprotectedlength; 160 | left_to_read -= unprotectedlength; 161 | } 162 | (*outputlength) = already_received; 163 | 164 | return 0; 165 | 166 | failed: 167 | return -1; 168 | } 169 | 170 | void mrtd_fileread_write_image_to_file(const uint8_t *file_content, const int file_size, const char *filename) 171 | { 172 | FILE *out; 173 | char filetype; 174 | char filenamebuf[256]; 175 | int baselength=0; 176 | unsigned char start_sequence_jpeg[10] = {0xff,0xd8,0xff,0xe0,0x00,0x10,0x4a,0x46,0x49,0x46}; 177 | unsigned char start_sequence_jpeg2000[10] = {0x00,0x00,0x00,0x0c,0x6a,0x50,0x20,0x20,0x0d,0x0a}; 178 | unsigned char *start_sequence; 179 | int comparelen = 0; 180 | if(file_size > 84){ 181 | filetype = file_content[73]; // 0x00: JPG, 0x01: JPEG2000 182 | if(strlen(filename) > 3 && filename[strlen(filename)-4] == '.') 183 | baselength = strlen(filename)-4; 184 | else 185 | baselength = strlen(filename); 186 | memcpy(filenamebuf, filename, baselength); 187 | if(filetype == 0x00) { 188 | memcpy(filenamebuf+baselength,".jpg",4); 189 | start_sequence = start_sequence_jpeg; 190 | comparelen = 2; 191 | } 192 | else { 193 | memcpy(filenamebuf+baselength,".jp2",4); 194 | start_sequence = start_sequence_jpeg2000; 195 | comparelen = 10; 196 | } 197 | filenamebuf[baselength+4] = 0; 198 | 199 | int i,j; 200 | int offset = 0; 201 | char equal = 0; 202 | for(i=0;i<120;i++) { 203 | j = 0; 204 | if(file_content[i] == start_sequence[j]){ 205 | equal = 1; 206 | for(j=1;j 5 | * 6 | * This program is free software: you can redistribute it and/or modify 7 | * it under the terms of the GNU General Public License as published by 8 | * the Free Software Foundation, either version 3 of the License, or 9 | * (at your option) any later version. 10 | * 11 | * This program is distributed in the hope that it will be useful, 12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | * GNU General Public License for more details. 15 | * 16 | * You should have received a copy of the GNU General Public License 17 | * along with this program. If not, see . 18 | * 19 | */ 20 | 21 | #ifndef INC_FILEREAD_H 22 | #define INC_FILEREAD_H 23 | 24 | int mrtd_fileread_read(nfc_device *pnd, const uint8_t *file_index, uint8_t *output, int *outputlength, const uint8_t *ksenc, const uint8_t *ksmac, uint64_t *ssc_long); 25 | 26 | void mrtd_fileread_write_image_to_file(const uint8_t *file_content, const int file_size, const char *filename); 27 | 28 | void mrtd_fileread_decode_ef_com(const uint8_t *file_content, const int file_size, uint8_t *datagroups, int *numdatagroups); 29 | 30 | void mrtd_fileread_get_datagroup_name(const uint8_t dg, char *name); 31 | 32 | #endif /* INC_FILEREAD_H */ 33 | -------------------------------------------------------------------------------- /src/hardware.c: -------------------------------------------------------------------------------- 1 | /* 2 | * hardware.c - sort of a hardware abstraction layer around libnfc 3 | * 4 | * Copyright (C) 2014 Ruben Undheim 5 | * 6 | * This program is free software: you can redistribute it and/or modify 7 | * it under the terms of the GNU General Public License as published by 8 | * the Free Software Foundation, either version 3 of the License, or 9 | * (at your option) any later version. 10 | * 11 | * This program is distributed in the hope that it will be useful, 12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | * GNU General Public License for more details. 15 | * 16 | * You should have received a copy of the GNU General Public License 17 | * along with this program. If not, see . 18 | * 19 | */ 20 | 21 | 22 | -------------------------------------------------------------------------------- /src/mrtd.h: -------------------------------------------------------------------------------- 1 | /* 2 | * mrtd.h - Header file for libmrtd.so 3 | * 4 | * Copyright (C) 2014 Ruben Undheim 5 | * 6 | * This program is free software: you can redistribute it and/or modify 7 | * it under the terms of the GNU General Public License as published by 8 | * the Free Software Foundation, either version 3 of the License, or 9 | * (at your option) any later version. 10 | * 11 | * This program is distributed in the hope that it will be useful, 12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | * GNU General Public License for more details. 15 | * 16 | * You should have received a copy of the GNU General Public License 17 | * along with this program. If not, see . 18 | * 19 | */ 20 | 21 | #ifndef INC_MRTD_H 22 | #define INC_MRTD_H 23 | 24 | #include "bac.h" 25 | #include "bachelper.h" 26 | #include "crypto.h" 27 | #include "fileread.h" 28 | 29 | #endif /* INC_MRTD_H */ 30 | 31 | -------------------------------------------------------------------------------- /src/mrtdreader.c: -------------------------------------------------------------------------------- 1 | /* 2 | * mrtdreader.c - Main program 3 | * 4 | * Copyright (C) 2014 Ruben Undheim 5 | * 6 | * This program is free software: you can redistribute it and/or modify 7 | * it under the terms of the GNU General Public License as published by 8 | * the Free Software Foundation, either version 3 of the License, or 9 | * (at your option) any later version. 10 | * 11 | * This program is distributed in the hope that it will be useful, 12 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 13 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 14 | * GNU General Public License for more details. 15 | * 16 | * You should have received a copy of the GNU General Public License 17 | * along with this program. If not, see . 18 | * 19 | */ 20 | 21 | 22 | #include 23 | #include 24 | #include 25 | #include 26 | #include 27 | #include 28 | #include 29 | #include 30 | #include "mrtd.h" 31 | 32 | #define MAX_DEVICE_COUNT 5 33 | 34 | static nfc_context *context = NULL; 35 | static nfc_device *pnd = NULL; 36 | 37 | static char *pn = NULL; 38 | static char *dob = NULL; 39 | static char *eov = NULL; 40 | static char *extra_argument = NULL; 41 | 42 | static char done = 0; 43 | 44 | static void closedown(int sig) 45 | { 46 | done = 1; 47 | printf("Stopping...\n"); 48 | } 49 | static void forcestop(int sig) 50 | { 51 | done = 1; 52 | printf("Stopping...\n"); 53 | if(pnd != NULL) 54 | nfc_close(pnd); 55 | if(context != NULL) 56 | nfc_exit(context); 57 | exit(-1); 58 | } 59 | 60 | void printhex(char *description, uint8_t *input, int length) 61 | { 62 | int i; 63 | printf("%s: ",description); 64 | for(i=0;i\n",argv[0]); 118 | goto failed; 119 | } 120 | uint8_t *kmrz; 121 | uint8_t buffer[25]; 122 | int inlength; 123 | if(extra_argument != NULL){ 124 | inlength = strlen(extra_argument); 125 | if(inlength == 24){ 126 | kmrz = extra_argument; 127 | } 128 | else if(inlength == 44){ 129 | mrtd_bac_get_kmrz_from_mrz(extra_argument, buffer); 130 | kmrz = buffer; 131 | } 132 | else{ 133 | fprintf(stderr,"Did not recognize \n"); 134 | goto failed; 135 | } 136 | } 137 | else { 138 | mrtd_bac_get_kmrz(pn, dob, eov, buffer); 139 | kmrz = buffer; 140 | } 141 | if(pn != NULL) { 142 | free(pn); 143 | pn = NULL; 144 | } 145 | if(dob != NULL){ 146 | free(dob); 147 | dob = NULL; 148 | } 149 | if(eov != NULL){ 150 | free(eov); 151 | eov = NULL; 152 | } 153 | 154 | 155 | signal(SIGINT, forcestop); 156 | srand(time(NULL)); 157 | 158 | nfc_init(&context); 159 | nfc_target ant; 160 | 161 | if(context == NULL){ 162 | fprintf(stderr,"Unable to init libnfc (malloc)\n"); 163 | goto failed; 164 | } 165 | nfc_connstring connstrings[MAX_DEVICE_COUNT]; 166 | size_t szDeviceFound = nfc_list_devices(context,connstrings,MAX_DEVICE_COUNT); 167 | 168 | if(szDeviceFound == 0){ 169 | fprintf(stderr,"No NFC device found.\n"); 170 | goto failed; 171 | } 172 | 173 | pnd = nfc_open(context, connstrings[0]); 174 | if(pnd == NULL){ 175 | fprintf(stderr,"Unable to open NFC device: %s\n",connstrings[0]); 176 | goto failed; 177 | } 178 | if(nfc_initiator_init(pnd) < 0){ 179 | nfc_perror(pnd,"nfc_initiator_init"); 180 | goto failed; 181 | } 182 | 183 | printf("NFC device: %s opened\n",nfc_device_get_name(pnd)); 184 | 185 | if (nfc_device_set_property_bool(pnd, NP_INFINITE_SELECT, false) < 0){ 186 | fprintf(stderr, "error setting property\n"); 187 | goto failed; 188 | } 189 | 190 | nfc_modulation nmA,nmB; 191 | nmA.nmt = NMT_ISO14443A; 192 | nmA.nbr = NBR_106; 193 | nmB.nmt = NMT_ISO14443B; 194 | nmB.nbr = NBR_106; 195 | 196 | signal(SIGINT, closedown); 197 | while(1){ 198 | ret = nfc_initiator_select_passive_target(pnd,nmA,NULL,0,&ant); 199 | if(ret > 0 || done) break; 200 | ret = nfc_initiator_select_passive_target(pnd,nmB,NULL,0,&ant); 201 | if(ret > 0 || done) break; 202 | } 203 | if(done) 204 | goto failed; 205 | printf("Target found!\n"); 206 | signal(SIGINT, forcestop); 207 | 208 | uint8_t txbuffer[300]; 209 | int txlen; 210 | uint8_t rxbuffer[300]; 211 | int rxlen; 212 | 213 | uint64_t ssc_long; 214 | uint8_t ksenc[16]; 215 | uint8_t ksmac[16]; 216 | 217 | mrtd_bac_randomize_rndifd_kifd(); 218 | ret = mrtd_bac_keyhandshake(pnd,kmrz,ksenc,ksmac,&ssc_long); 219 | 220 | if(ret == RET_CHALLENGE_FAILED){ 221 | fprintf(stderr,"======================\nChallenge failed...\n======================\n"); 222 | goto failed; 223 | } 224 | else if(ret < 0){ 225 | goto failed; 226 | } 227 | printf("======================\nChallenge successful!\n======================\n"); 228 | 229 | printf("\n"); 230 | uint8_t *filecontent = NULL; 231 | filecontent = malloc(50000); 232 | int filecontentlength; 233 | 234 | 235 | printf("Getting EF.COM..."); 236 | fflush(stdout); 237 | mrtd_fileread_read(pnd,"\x01\x1e",filecontent,&filecontentlength,ksenc,ksmac,&ssc_long); 238 | printf(" done\n"); 239 | 240 | printhex("File content",filecontent,filecontentlength); 241 | printf("File size: %d\n",filecontentlength); 242 | 243 | uint8_t datagroups[20]; 244 | int ndatagroups; 245 | mrtd_fileread_decode_ef_com(filecontent,filecontentlength,datagroups,&ndatagroups); 246 | 247 | printf("\n"); 248 | 249 | printf("Getting EF.SOD..."); 250 | fflush(stdout); 251 | mrtd_fileread_read(pnd,"\x01\x1d",filecontent,&filecontentlength,ksenc,ksmac,&ssc_long); 252 | printf(" done\n"); 253 | 254 | printhex("File content",filecontent,filecontentlength); 255 | printf("File size: %d\n",filecontentlength); 256 | 257 | printf("\n"); 258 | 259 | printf("Getting EF.DG1..."); 260 | fflush(stdout); 261 | mrtd_fileread_read(pnd,"\x01\x01",filecontent,&filecontentlength,ksenc,ksmac,&ssc_long); 262 | printf(" done\n"); 263 | 264 | filecontent[filecontentlength] = 0; 265 | printf("%s\n\n",filecontent); 266 | printf("File size: %d\n",filecontentlength); 267 | 268 | printf("\n"); 269 | printf("Getting EF.DG2 which contains the image..."); 270 | fflush(stdout); 271 | mrtd_fileread_read(pnd,"\x01\x02",filecontent,&filecontentlength,ksenc,ksmac,&ssc_long); 272 | printf(" done\n"); 273 | 274 | 275 | mrtd_fileread_write_image_to_file(filecontent, filecontentlength, "image"); 276 | 277 | nfc_close(pnd); 278 | nfc_exit(context); 279 | if(filecontent != NULL) 280 | free(filecontent); 281 | return 0; 282 | 283 | failed: 284 | if(pnd != NULL) 285 | nfc_close(pnd); 286 | if(context != NULL) 287 | nfc_exit(context); 288 | if(pn != NULL) 289 | free(pn); 290 | if(dob != NULL) 291 | free(dob); 292 | if(eov != NULL) 293 | free(eov); 294 | if(filecontent != NULL) 295 | free(filecontent); 296 | return -1; 297 | } 298 | 299 | -------------------------------------------------------------------------------- /test/CMakeLists.txt: -------------------------------------------------------------------------------- 1 | add_executable(test1 test1.c ../src/bachelper.c ../src/crypto-gcrypt.c) 2 | target_link_libraries(test1 gcrypt) 3 | 4 | -------------------------------------------------------------------------------- /test/test1.c: -------------------------------------------------------------------------------- 1 | #include 2 | #include 3 | #include 4 | #include 5 | #include "../src/crypto.h" 6 | #include "../src/bachelper.h" 7 | 8 | void printhex(char *description, uint8_t *input, int length) 9 | { 10 | int i; 11 | printf("%s: ",description); 12 | for(i=0;i