├── LICENSE ├── README.md ├── bin └── TriIsoExtract.exe ├── build.bat ├── des.c ├── des.h └── main.c /LICENSE: -------------------------------------------------------------------------------- 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 | {one line to give the program's name and a brief idea of what it does.} 635 | Copyright (C) {year} {name of author} 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 | {project} Copyright (C) {year} {fullname} 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 | 676 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # Usage 2 | Grab the [TriIsoExtract.exe](bin/TriIsoExtract.exe?raw=true) and place it into a new folder. 3 | If you want to have .chd support get chdman.exe as well (needs to have CHD v5 support, just google chdman v146) and put it into the same folder as TriIsoExtract.exe. 4 | Drag and drop your raw binary/track 3 binary/chd file into TriIsoExtract.exe, it should then properly find the actual image in it and write it into a new .bin file. 5 | After you receive the new .bin file you can then use [triforce-hdr-patcher](https://github.com/FIX94/triforce-header-patcher) on it to get it ready for loaders such as Nintendont. 6 | This program should at least work with the following GD-ROMs in all their revisions: 7 | GDT-0001, GDT-0002, GDT-0004, GDT-0005, GDT-0006, GDT-0008, GDT-0009, GDT-0010, GDT-0011, GDT-0013, GDT-0014, GDT-0015, GDT-0017, GDT-0018, GDT-0019, GDT-0020, GDT-0021, GDT-0022 8 | 9 | 10 | # Manual Compiling 11 | As of right now this is a windows only code. If you have MinGW installed and gcc referenced in your PATH variable just use the "build.bat". 12 | Support for other OSes might follow in the future. 13 | -------------------------------------------------------------------------------- /bin/TriIsoExtract.exe: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/FIX94/triforce-iso-extract/699b169a9b41a977e8a9ab4d4d94f78c18adb7ab/bin/TriIsoExtract.exe -------------------------------------------------------------------------------- /build.bat: -------------------------------------------------------------------------------- 1 | gcc main.c des.c -Wall -static -Bstatic -O1 -s -o bin/TriIsoExtract 2 | pause -------------------------------------------------------------------------------- /des.c: -------------------------------------------------------------------------------- 1 | /* des.c - DES and Triple-DES encryption/decryption Algorithm 2 | * Copyright (C) 1998, 1999, 2000, 2001 Free Software Foundation, Inc. 3 | * 4 | * This file is part of GnuPG. 5 | * 6 | * GnuPG 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 | * GnuPG 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 | * According to the definition of DES in FIPS PUB 46-2 from December 1993. 21 | * For a description of triple encryption, see: 22 | * Bruce Schneier: Applied Cryptography. Second Edition. 23 | * John Wiley & Sons, 1996. ISBN 0-471-12845-7. Pages 358 ff. 24 | */ 25 | 26 | 27 | /* 28 | * Written by Michael Roth , September 1998 29 | */ 30 | 31 | 32 | /* 33 | * Code has been stripped down to a single .c file so it can be used as a 34 | * freestanding include, Triple-DES was removed as well because it was not used, 35 | * original des.c taken from GnuPG 1.4.19 36 | */ 37 | 38 | #include 39 | #include /* memcpy, memcmp */ 40 | #include "des.h" 41 | 42 | /* 43 | * The s-box values are permuted according to the 'primitive function P' 44 | * and are rotated one bit to the left. 45 | */ 46 | static unsigned int sbox1[64] = 47 | { 48 | 0x01010400, 0x00000000, 0x00010000, 0x01010404, 0x01010004, 0x00010404, 0x00000004, 0x00010000, 49 | 0x00000400, 0x01010400, 0x01010404, 0x00000400, 0x01000404, 0x01010004, 0x01000000, 0x00000004, 50 | 0x00000404, 0x01000400, 0x01000400, 0x00010400, 0x00010400, 0x01010000, 0x01010000, 0x01000404, 51 | 0x00010004, 0x01000004, 0x01000004, 0x00010004, 0x00000000, 0x00000404, 0x00010404, 0x01000000, 52 | 0x00010000, 0x01010404, 0x00000004, 0x01010000, 0x01010400, 0x01000000, 0x01000000, 0x00000400, 53 | 0x01010004, 0x00010000, 0x00010400, 0x01000004, 0x00000400, 0x00000004, 0x01000404, 0x00010404, 54 | 0x01010404, 0x00010004, 0x01010000, 0x01000404, 0x01000004, 0x00000404, 0x00010404, 0x01010400, 55 | 0x00000404, 0x01000400, 0x01000400, 0x00000000, 0x00010004, 0x00010400, 0x00000000, 0x01010004 56 | }; 57 | 58 | static unsigned int sbox2[64] = 59 | { 60 | 0x80108020, 0x80008000, 0x00008000, 0x00108020, 0x00100000, 0x00000020, 0x80100020, 0x80008020, 61 | 0x80000020, 0x80108020, 0x80108000, 0x80000000, 0x80008000, 0x00100000, 0x00000020, 0x80100020, 62 | 0x00108000, 0x00100020, 0x80008020, 0x00000000, 0x80000000, 0x00008000, 0x00108020, 0x80100000, 63 | 0x00100020, 0x80000020, 0x00000000, 0x00108000, 0x00008020, 0x80108000, 0x80100000, 0x00008020, 64 | 0x00000000, 0x00108020, 0x80100020, 0x00100000, 0x80008020, 0x80100000, 0x80108000, 0x00008000, 65 | 0x80100000, 0x80008000, 0x00000020, 0x80108020, 0x00108020, 0x00000020, 0x00008000, 0x80000000, 66 | 0x00008020, 0x80108000, 0x00100000, 0x80000020, 0x00100020, 0x80008020, 0x80000020, 0x00100020, 67 | 0x00108000, 0x00000000, 0x80008000, 0x00008020, 0x80000000, 0x80100020, 0x80108020, 0x00108000 68 | }; 69 | 70 | static unsigned int sbox3[64] = 71 | { 72 | 0x00000208, 0x08020200, 0x00000000, 0x08020008, 0x08000200, 0x00000000, 0x00020208, 0x08000200, 73 | 0x00020008, 0x08000008, 0x08000008, 0x00020000, 0x08020208, 0x00020008, 0x08020000, 0x00000208, 74 | 0x08000000, 0x00000008, 0x08020200, 0x00000200, 0x00020200, 0x08020000, 0x08020008, 0x00020208, 75 | 0x08000208, 0x00020200, 0x00020000, 0x08000208, 0x00000008, 0x08020208, 0x00000200, 0x08000000, 76 | 0x08020200, 0x08000000, 0x00020008, 0x00000208, 0x00020000, 0x08020200, 0x08000200, 0x00000000, 77 | 0x00000200, 0x00020008, 0x08020208, 0x08000200, 0x08000008, 0x00000200, 0x00000000, 0x08020008, 78 | 0x08000208, 0x00020000, 0x08000000, 0x08020208, 0x00000008, 0x00020208, 0x00020200, 0x08000008, 79 | 0x08020000, 0x08000208, 0x00000208, 0x08020000, 0x00020208, 0x00000008, 0x08020008, 0x00020200 80 | }; 81 | 82 | static unsigned int sbox4[64] = 83 | { 84 | 0x00802001, 0x00002081, 0x00002081, 0x00000080, 0x00802080, 0x00800081, 0x00800001, 0x00002001, 85 | 0x00000000, 0x00802000, 0x00802000, 0x00802081, 0x00000081, 0x00000000, 0x00800080, 0x00800001, 86 | 0x00000001, 0x00002000, 0x00800000, 0x00802001, 0x00000080, 0x00800000, 0x00002001, 0x00002080, 87 | 0x00800081, 0x00000001, 0x00002080, 0x00800080, 0x00002000, 0x00802080, 0x00802081, 0x00000081, 88 | 0x00800080, 0x00800001, 0x00802000, 0x00802081, 0x00000081, 0x00000000, 0x00000000, 0x00802000, 89 | 0x00002080, 0x00800080, 0x00800081, 0x00000001, 0x00802001, 0x00002081, 0x00002081, 0x00000080, 90 | 0x00802081, 0x00000081, 0x00000001, 0x00002000, 0x00800001, 0x00002001, 0x00802080, 0x00800081, 91 | 0x00002001, 0x00002080, 0x00800000, 0x00802001, 0x00000080, 0x00800000, 0x00002000, 0x00802080 92 | }; 93 | 94 | static unsigned int sbox5[64] = 95 | { 96 | 0x00000100, 0x02080100, 0x02080000, 0x42000100, 0x00080000, 0x00000100, 0x40000000, 0x02080000, 97 | 0x40080100, 0x00080000, 0x02000100, 0x40080100, 0x42000100, 0x42080000, 0x00080100, 0x40000000, 98 | 0x02000000, 0x40080000, 0x40080000, 0x00000000, 0x40000100, 0x42080100, 0x42080100, 0x02000100, 99 | 0x42080000, 0x40000100, 0x00000000, 0x42000000, 0x02080100, 0x02000000, 0x42000000, 0x00080100, 100 | 0x00080000, 0x42000100, 0x00000100, 0x02000000, 0x40000000, 0x02080000, 0x42000100, 0x40080100, 101 | 0x02000100, 0x40000000, 0x42080000, 0x02080100, 0x40080100, 0x00000100, 0x02000000, 0x42080000, 102 | 0x42080100, 0x00080100, 0x42000000, 0x42080100, 0x02080000, 0x00000000, 0x40080000, 0x42000000, 103 | 0x00080100, 0x02000100, 0x40000100, 0x00080000, 0x00000000, 0x40080000, 0x02080100, 0x40000100 104 | }; 105 | 106 | static unsigned int sbox6[64] = 107 | { 108 | 0x20000010, 0x20400000, 0x00004000, 0x20404010, 0x20400000, 0x00000010, 0x20404010, 0x00400000, 109 | 0x20004000, 0x00404010, 0x00400000, 0x20000010, 0x00400010, 0x20004000, 0x20000000, 0x00004010, 110 | 0x00000000, 0x00400010, 0x20004010, 0x00004000, 0x00404000, 0x20004010, 0x00000010, 0x20400010, 111 | 0x20400010, 0x00000000, 0x00404010, 0x20404000, 0x00004010, 0x00404000, 0x20404000, 0x20000000, 112 | 0x20004000, 0x00000010, 0x20400010, 0x00404000, 0x20404010, 0x00400000, 0x00004010, 0x20000010, 113 | 0x00400000, 0x20004000, 0x20000000, 0x00004010, 0x20000010, 0x20404010, 0x00404000, 0x20400000, 114 | 0x00404010, 0x20404000, 0x00000000, 0x20400010, 0x00000010, 0x00004000, 0x20400000, 0x00404010, 115 | 0x00004000, 0x00400010, 0x20004010, 0x00000000, 0x20404000, 0x20000000, 0x00400010, 0x20004010 116 | }; 117 | 118 | static unsigned int sbox7[64] = 119 | { 120 | 0x00200000, 0x04200002, 0x04000802, 0x00000000, 0x00000800, 0x04000802, 0x00200802, 0x04200800, 121 | 0x04200802, 0x00200000, 0x00000000, 0x04000002, 0x00000002, 0x04000000, 0x04200002, 0x00000802, 122 | 0x04000800, 0x00200802, 0x00200002, 0x04000800, 0x04000002, 0x04200000, 0x04200800, 0x00200002, 123 | 0x04200000, 0x00000800, 0x00000802, 0x04200802, 0x00200800, 0x00000002, 0x04000000, 0x00200800, 124 | 0x04000000, 0x00200800, 0x00200000, 0x04000802, 0x04000802, 0x04200002, 0x04200002, 0x00000002, 125 | 0x00200002, 0x04000000, 0x04000800, 0x00200000, 0x04200800, 0x00000802, 0x00200802, 0x04200800, 126 | 0x00000802, 0x04000002, 0x04200802, 0x04200000, 0x00200800, 0x00000000, 0x00000002, 0x04200802, 127 | 0x00000000, 0x00200802, 0x04200000, 0x00000800, 0x04000002, 0x04000800, 0x00000800, 0x00200002 128 | }; 129 | 130 | static unsigned int sbox8[64] = 131 | { 132 | 0x10001040, 0x00001000, 0x00040000, 0x10041040, 0x10000000, 0x10001040, 0x00000040, 0x10000000, 133 | 0x00040040, 0x10040000, 0x10041040, 0x00041000, 0x10041000, 0x00041040, 0x00001000, 0x00000040, 134 | 0x10040000, 0x10000040, 0x10001000, 0x00001040, 0x00041000, 0x00040040, 0x10040040, 0x10041000, 135 | 0x00001040, 0x00000000, 0x00000000, 0x10040040, 0x10000040, 0x10001000, 0x00041040, 0x00040000, 136 | 0x00041040, 0x00040000, 0x10041000, 0x00001000, 0x00000040, 0x10040040, 0x00001000, 0x00041040, 137 | 0x10001000, 0x00000040, 0x10000040, 0x10040000, 0x10040040, 0x10000000, 0x00040000, 0x10001040, 138 | 0x00000000, 0x10041040, 0x00040040, 0x10000040, 0x10040000, 0x10001000, 0x10001040, 0x00000000, 139 | 0x10041040, 0x00041000, 0x00041000, 0x00001040, 0x00001040, 0x00040040, 0x10000000, 0x10041000 140 | }; 141 | 142 | 143 | /* 144 | * These two tables are part of the 'permuted choice 1' function. 145 | * In this implementation several speed improvements are done. 146 | */ 147 | unsigned int leftkey_swap[16] = 148 | { 149 | 0x00000000, 0x00000001, 0x00000100, 0x00000101, 150 | 0x00010000, 0x00010001, 0x00010100, 0x00010101, 151 | 0x01000000, 0x01000001, 0x01000100, 0x01000101, 152 | 0x01010000, 0x01010001, 0x01010100, 0x01010101 153 | }; 154 | 155 | unsigned int rightkey_swap[16] = 156 | { 157 | 0x00000000, 0x01000000, 0x00010000, 0x01010000, 158 | 0x00000100, 0x01000100, 0x00010100, 0x01010100, 159 | 0x00000001, 0x01000001, 0x00010001, 0x01010001, 160 | 0x00000101, 0x01000101, 0x00010101, 0x01010101, 161 | }; 162 | 163 | 164 | /* 165 | * Numbers of left shifts per round for encryption subkeys. 166 | * To calculate the decryption subkeys we just reverse the 167 | * ordering of the calculated encryption subkeys. So their 168 | * is no need for a decryption rotate tab. 169 | */ 170 | static unsigned char encrypt_rotate_tab[16] = 171 | { 172 | 1, 1, 2, 2, 2, 2, 2, 2, 1, 2, 2, 2, 2, 2, 2, 1 173 | }; 174 | 175 | 176 | /* 177 | * Table with weak DES keys sorted in ascending order. 178 | * In DES their are 64 known keys wich are weak. They are weak 179 | * because they produce only one, two or four different 180 | * subkeys in the subkey scheduling process. 181 | * The keys in this table have all their parity bits cleared. 182 | */ 183 | static unsigned char weak_keys[64][8] = 184 | { 185 | { 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00, 0x00 }, { 0x00, 0x00, 0x1e, 0x1e, 0x00, 0x00, 0x0e, 0x0e }, 186 | { 0x00, 0x00, 0xe0, 0xe0, 0x00, 0x00, 0xf0, 0xf0 }, { 0x00, 0x00, 0xfe, 0xfe, 0x00, 0x00, 0xfe, 0xfe }, 187 | { 0x00, 0x1e, 0x00, 0x1e, 0x00, 0x0e, 0x00, 0x0e }, { 0x00, 0x1e, 0x1e, 0x00, 0x00, 0x0e, 0x0e, 0x00 }, 188 | { 0x00, 0x1e, 0xe0, 0xfe, 0x00, 0x0e, 0xf0, 0xfe }, { 0x00, 0x1e, 0xfe, 0xe0, 0x00, 0x0e, 0xfe, 0xf0 }, 189 | { 0x00, 0xe0, 0x00, 0xe0, 0x00, 0xf0, 0x00, 0xf0 }, { 0x00, 0xe0, 0x1e, 0xfe, 0x00, 0xf0, 0x0e, 0xfe }, 190 | { 0x00, 0xe0, 0xe0, 0x00, 0x00, 0xf0, 0xf0, 0x00 }, { 0x00, 0xe0, 0xfe, 0x1e, 0x00, 0xf0, 0xfe, 0x0e }, 191 | { 0x00, 0xfe, 0x00, 0xfe, 0x00, 0xfe, 0x00, 0xfe }, { 0x00, 0xfe, 0x1e, 0xe0, 0x00, 0xfe, 0x0e, 0xf0 }, 192 | { 0x00, 0xfe, 0xe0, 0x1e, 0x00, 0xfe, 0xf0, 0x0e }, { 0x00, 0xfe, 0xfe, 0x00, 0x00, 0xfe, 0xfe, 0x00 }, 193 | { 0x0e, 0x0e, 0x0e, 0x0e, 0xf0, 0xf0, 0xf0, 0xf0 }, { 0x1e, 0x00, 0x00, 0x1e, 0x0e, 0x00, 0x00, 0x0e }, 194 | { 0x1e, 0x00, 0x1e, 0x00, 0x0e, 0x00, 0x0e, 0x00 }, { 0x1e, 0x00, 0xe0, 0xfe, 0x0e, 0x00, 0xf0, 0xfe }, 195 | { 0x1e, 0x00, 0xfe, 0xe0, 0x0e, 0x00, 0xfe, 0xf0 }, { 0x1e, 0x1e, 0x00, 0x00, 0x0e, 0x0e, 0x00, 0x00 }, 196 | { 0x1e, 0x1e, 0x1e, 0x1e, 0x0e, 0x0e, 0x0e, 0x0e }, { 0x1e, 0x1e, 0xe0, 0xe0, 0x0e, 0x0e, 0xf0, 0xf0 }, 197 | { 0x1e, 0x1e, 0xfe, 0xfe, 0x0e, 0x0e, 0xfe, 0xfe }, { 0x1e, 0xe0, 0x00, 0xfe, 0x0e, 0xf0, 0x00, 0xfe }, 198 | { 0x1e, 0xe0, 0x1e, 0xe0, 0x0e, 0xf0, 0x0e, 0xf0 }, { 0x1e, 0xe0, 0xe0, 0x1e, 0x0e, 0xf0, 0xf0, 0x0e }, 199 | { 0x1e, 0xe0, 0xfe, 0x00, 0x0e, 0xf0, 0xfe, 0x00 }, { 0x1e, 0xfe, 0x00, 0xe0, 0x0e, 0xfe, 0x00, 0xf0 }, 200 | { 0x1e, 0xfe, 0x1e, 0xfe, 0x0e, 0xfe, 0x0e, 0xfe }, { 0x1e, 0xfe, 0xe0, 0x00, 0x0e, 0xfe, 0xf0, 0x00 }, 201 | { 0x1e, 0xfe, 0xfe, 0x1e, 0x0e, 0xfe, 0xfe, 0x0e }, { 0xe0, 0x00, 0x00, 0xe0, 0xf0, 0x00, 0x00, 0xf0 }, 202 | { 0xe0, 0x00, 0x1e, 0xfe, 0xf0, 0x00, 0x0e, 0xfe }, { 0xe0, 0x00, 0xe0, 0x00, 0xf0, 0x00, 0xf0, 0x00 }, 203 | { 0xe0, 0x00, 0xfe, 0x1e, 0xf0, 0x00, 0xfe, 0x0e }, { 0xe0, 0x1e, 0x00, 0xfe, 0xf0, 0x0e, 0x00, 0xfe }, 204 | { 0xe0, 0x1e, 0x1e, 0xe0, 0xf0, 0x0e, 0x0e, 0xf0 }, { 0xe0, 0x1e, 0xe0, 0x1e, 0xf0, 0x0e, 0xf0, 0x0e }, 205 | { 0xe0, 0x1e, 0xfe, 0x00, 0xf0, 0x0e, 0xfe, 0x00 }, { 0xe0, 0xe0, 0x00, 0x00, 0xf0, 0xf0, 0x00, 0x00 }, 206 | { 0xe0, 0xe0, 0x1e, 0x1e, 0xf0, 0xf0, 0x0e, 0x0e }, { 0xe0, 0xe0, 0xfe, 0xfe, 0xf0, 0xf0, 0xfe, 0xfe }, 207 | { 0xe0, 0xfe, 0x00, 0x1e, 0xf0, 0xfe, 0x00, 0x0e }, { 0xe0, 0xfe, 0x1e, 0x00, 0xf0, 0xfe, 0x0e, 0x00 }, 208 | { 0xe0, 0xfe, 0xe0, 0xfe, 0xf0, 0xfe, 0xf0, 0xfe }, { 0xe0, 0xfe, 0xfe, 0xe0, 0xf0, 0xfe, 0xfe, 0xf0 }, 209 | { 0xfe, 0x00, 0x00, 0xfe, 0xfe, 0x00, 0x00, 0xfe }, { 0xfe, 0x00, 0x1e, 0xe0, 0xfe, 0x00, 0x0e, 0xf0 }, 210 | { 0xfe, 0x00, 0xe0, 0x1e, 0xfe, 0x00, 0xf0, 0x0e }, { 0xfe, 0x00, 0xfe, 0x00, 0xfe, 0x00, 0xfe, 0x00 }, 211 | { 0xfe, 0x1e, 0x00, 0xe0, 0xfe, 0x0e, 0x00, 0xf0 }, { 0xfe, 0x1e, 0x1e, 0xfe, 0xfe, 0x0e, 0x0e, 0xfe }, 212 | { 0xfe, 0x1e, 0xe0, 0x00, 0xfe, 0x0e, 0xf0, 0x00 }, { 0xfe, 0x1e, 0xfe, 0x1e, 0xfe, 0x0e, 0xfe, 0x0e }, 213 | { 0xfe, 0xe0, 0x00, 0x1e, 0xfe, 0xf0, 0x00, 0x0e }, { 0xfe, 0xe0, 0x1e, 0x00, 0xfe, 0xf0, 0x0e, 0x00 }, 214 | { 0xfe, 0xe0, 0xe0, 0xfe, 0xfe, 0xf0, 0xf0, 0xfe }, { 0xfe, 0xe0, 0xfe, 0xe0, 0xfe, 0xf0, 0xfe, 0xf0 }, 215 | { 0xfe, 0xfe, 0x00, 0x00, 0xfe, 0xfe, 0x00, 0x00 }, { 0xfe, 0xfe, 0x1e, 0x1e, 0xfe, 0xfe, 0x0e, 0x0e }, 216 | { 0xfe, 0xfe, 0xe0, 0xe0, 0xfe, 0xfe, 0xf0, 0xf0 }, { 0xfe, 0xfe, 0xfe, 0xfe, 0xfe, 0xfe, 0xfe, 0xfe } 217 | }; 218 | 219 | /* 220 | * Macro to swap bits across two words. 221 | */ 222 | #define DO_PERMUTATION(a, temp, b, offset, mask) \ 223 | temp = ((a>>offset) ^ b) & mask; \ 224 | b ^= temp; \ 225 | a ^= temp<> 31); \ 239 | temp = (left ^ right) & 0xaaaaaaaa; \ 240 | right ^= temp; \ 241 | left ^= temp; \ 242 | left = (left << 1) | (left >> 31); 243 | 244 | /* 245 | * The 'inverse initial permutation'. 246 | */ 247 | #define FINAL_PERMUTATION(left, temp, right) \ 248 | left = (left << 31) | (left >> 1); \ 249 | temp = (left ^ right) & 0xaaaaaaaa; \ 250 | left ^= temp; \ 251 | right ^= temp; \ 252 | right = (right << 31) | (right >> 1); \ 253 | DO_PERMUTATION(right, temp, left, 8, 0x00ff00ff) \ 254 | DO_PERMUTATION(right, temp, left, 2, 0x33333333) \ 255 | DO_PERMUTATION(left, temp, right, 16, 0x0000ffff) \ 256 | DO_PERMUTATION(left, temp, right, 4, 0x0f0f0f0f) 257 | 258 | 259 | /* 260 | * A full DES round including 'expansion function', 'sbox substitution' 261 | * and 'primitive function P' but without swapping the left and right word. 262 | * Please note: The data in 'from' and 'to' is already rotated one bit to 263 | * the left, done in the initial permutation. 264 | */ 265 | #define DES_ROUND(from, to, work, subkey) \ 266 | work = from ^ *subkey++; \ 267 | to ^= sbox8[ work & 0x3f ]; \ 268 | to ^= sbox6[ (work>>8) & 0x3f ]; \ 269 | to ^= sbox4[ (work>>16) & 0x3f ]; \ 270 | to ^= sbox2[ (work>>24) & 0x3f ]; \ 271 | work = ((from << 28) | (from >> 4)) ^ *subkey++; \ 272 | to ^= sbox7[ work & 0x3f ]; \ 273 | to ^= sbox5[ (work>>8) & 0x3f ]; \ 274 | to ^= sbox3[ (work>>16) & 0x3f ]; \ 275 | to ^= sbox1[ (work>>24) & 0x3f ]; 276 | 277 | /* 278 | * Macros to convert 8 bytes from/to 32bit words. 279 | */ 280 | #define READ_64BIT_DATA(data, left, right) \ 281 | left = (data[0] << 24) | (data[1] << 16) | (data[2] << 8) | data[3]; \ 282 | right = (data[4] << 24) | (data[5] << 16) | (data[6] << 8) | data[7]; 283 | 284 | #define WRITE_64BIT_DATA(data, left, right) \ 285 | data[0] = (left >> 24) &0xff; data[1] = (left >> 16) &0xff; \ 286 | data[2] = (left >> 8) &0xff; data[3] = left &0xff; \ 287 | data[4] = (right >> 24) &0xff; data[5] = (right >> 16) &0xff; \ 288 | data[6] = (right >> 8) &0xff; data[7] = right &0xff; 289 | 290 | #define wipememory2(_ptr,_set,_len) do { volatile char *_vptr=(volatile char *)(_ptr); size_t _vlen=(_len); while(_vlen) { *_vptr=(_set); _vptr++; _vlen--; } } while(0) 291 | #define wipememory(_ptr,_len) wipememory2(_ptr,0,_len) 292 | 293 | static void 294 | burn_stack (int bytes) 295 | { 296 | char buf[64]; 297 | 298 | wipememory(buf,sizeof buf); 299 | bytes -= sizeof buf; 300 | if (bytes > 0) 301 | burn_stack (bytes); 302 | } 303 | 304 | /* 305 | * des_key_schedule(): Calculate 16 subkeys pairs (even/odd) for 306 | * 16 encryption rounds. 307 | * To calculate subkeys for decryption the caller 308 | * have to reorder the generated subkeys. 309 | * 310 | * rawkey: 8 bytes of key data 311 | * subkey: Array of at least 32 unsigned ints. Will be filled 312 | * with calculated subkeys. 313 | * 314 | */ 315 | static void 316 | des_key_schedule (const unsigned char * rawkey, unsigned int * subkey) 317 | { 318 | unsigned int left, right, work; 319 | int round; 320 | 321 | READ_64BIT_DATA (rawkey, left, right) 322 | 323 | DO_PERMUTATION (right, work, left, 4, 0x0f0f0f0f) 324 | DO_PERMUTATION (right, work, left, 0, 0x10101010) 325 | 326 | left = (leftkey_swap[(left >> 0) & 0xf] << 3) | (leftkey_swap[(left >> 8) & 0xf] << 2) 327 | | (leftkey_swap[(left >> 16) & 0xf] << 1) | (leftkey_swap[(left >> 24) & 0xf]) 328 | | (leftkey_swap[(left >> 5) & 0xf] << 7) | (leftkey_swap[(left >> 13) & 0xf] << 6) 329 | | (leftkey_swap[(left >> 21) & 0xf] << 5) | (leftkey_swap[(left >> 29) & 0xf] << 4); 330 | 331 | left &= 0x0fffffff; 332 | 333 | right = (rightkey_swap[(right >> 1) & 0xf] << 3) | (rightkey_swap[(right >> 9) & 0xf] << 2) 334 | | (rightkey_swap[(right >> 17) & 0xf] << 1) | (rightkey_swap[(right >> 25) & 0xf]) 335 | | (rightkey_swap[(right >> 4) & 0xf] << 7) | (rightkey_swap[(right >> 12) & 0xf] << 6) 336 | | (rightkey_swap[(right >> 20) & 0xf] << 5) | (rightkey_swap[(right >> 28) & 0xf] << 4); 337 | 338 | right &= 0x0fffffff; 339 | 340 | for (round = 0; round < 16; ++round) 341 | { 342 | left = ((left << encrypt_rotate_tab[round]) | (left >> (28 - encrypt_rotate_tab[round]))) & 0x0fffffff; 343 | right = ((right << encrypt_rotate_tab[round]) | (right >> (28 - encrypt_rotate_tab[round]))) & 0x0fffffff; 344 | 345 | *subkey++ = ((left << 4) & 0x24000000) 346 | | ((left << 28) & 0x10000000) 347 | | ((left << 14) & 0x08000000) 348 | | ((left << 18) & 0x02080000) 349 | | ((left << 6) & 0x01000000) 350 | | ((left << 9) & 0x00200000) 351 | | ((left >> 1) & 0x00100000) 352 | | ((left << 10) & 0x00040000) 353 | | ((left << 2) & 0x00020000) 354 | | ((left >> 10) & 0x00010000) 355 | | ((right >> 13) & 0x00002000) 356 | | ((right >> 4) & 0x00001000) 357 | | ((right << 6) & 0x00000800) 358 | | ((right >> 1) & 0x00000400) 359 | | ((right >> 14) & 0x00000200) 360 | | (right & 0x00000100) 361 | | ((right >> 5) & 0x00000020) 362 | | ((right >> 10) & 0x00000010) 363 | | ((right >> 3) & 0x00000008) 364 | | ((right >> 18) & 0x00000004) 365 | | ((right >> 26) & 0x00000002) 366 | | ((right >> 24) & 0x00000001); 367 | 368 | *subkey++ = ((left << 15) & 0x20000000) 369 | | ((left << 17) & 0x10000000) 370 | | ((left << 10) & 0x08000000) 371 | | ((left << 22) & 0x04000000) 372 | | ((left >> 2) & 0x02000000) 373 | | ((left << 1) & 0x01000000) 374 | | ((left << 16) & 0x00200000) 375 | | ((left << 11) & 0x00100000) 376 | | ((left << 3) & 0x00080000) 377 | | ((left >> 6) & 0x00040000) 378 | | ((left << 15) & 0x00020000) 379 | | ((left >> 4) & 0x00010000) 380 | | ((right >> 2) & 0x00002000) 381 | | ((right << 8) & 0x00001000) 382 | | ((right >> 14) & 0x00000808) 383 | | ((right >> 9) & 0x00000400) 384 | | ((right) & 0x00000200) 385 | | ((right << 7) & 0x00000100) 386 | | ((right >> 7) & 0x00000020) 387 | | ((right >> 3) & 0x00000011) 388 | | ((right << 2) & 0x00000004) 389 | | ((right >> 21) & 0x00000002); 390 | } 391 | } 392 | 393 | /* 394 | * Fill a DES context with subkeys calculated from a 64bit key. 395 | * Does not check parity bits, but simply ignore them. 396 | * Does not check for weak keys. 397 | */ 398 | int 399 | des_setkey (struct _des_ctx *ctx, const unsigned char * key) 400 | { 401 | int i; 402 | 403 | des_key_schedule (key, ctx->encrypt_subkeys); 404 | burn_stack (32); 405 | 406 | for(i=0; i<32; i+=2) 407 | { 408 | ctx->decrypt_subkeys[i] = ctx->encrypt_subkeys[30-i]; 409 | ctx->decrypt_subkeys[i+1] = ctx->encrypt_subkeys[31-i]; 410 | } 411 | 412 | return 0; 413 | } 414 | 415 | 416 | 417 | /* 418 | * Electronic Codebook Mode DES encryption/decryption of data according 419 | * to 'mode'. 420 | */ 421 | int 422 | des_ecb_crypt (struct _des_ctx *ctx, const unsigned char * from, unsigned char * to, int mode) 423 | { 424 | unsigned int left, right, work; 425 | unsigned int *keys; 426 | 427 | keys = mode ? ctx->decrypt_subkeys : ctx->encrypt_subkeys; 428 | 429 | READ_64BIT_DATA (from, left, right) 430 | INITIAL_PERMUTATION (left, work, right) 431 | 432 | DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) 433 | DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) 434 | DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) 435 | DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) 436 | DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) 437 | DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) 438 | DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) 439 | DES_ROUND (right, left, work, keys) DES_ROUND (left, right, work, keys) 440 | 441 | FINAL_PERMUTATION (right, work, left) 442 | WRITE_64BIT_DATA (to, right, left) 443 | 444 | return 0; 445 | } 446 | 447 | /* 448 | * Check whether the 8 byte key is weak. 449 | * Dose not check the parity bits of the key but simple ignore them. 450 | */ 451 | int 452 | is_weak_key ( const unsigned char *key ) 453 | { 454 | unsigned char work[8]; 455 | int i, left, right, middle, cmp_result; 456 | 457 | /* clear parity bits */ 458 | for(i=0; i<8; ++i) 459 | work[i] = key[i] & 0xfe; 460 | 461 | /* binary search in the weak key table */ 462 | left = 0; 463 | right = 63; 464 | while(left <= right) 465 | { 466 | middle = (left + right) / 2; 467 | 468 | if ( !(cmp_result=memcmp(work, weak_keys[middle], 8)) ) 469 | return -1; 470 | 471 | if ( cmp_result > 0 ) 472 | left = middle + 1; 473 | else 474 | right = middle - 1; 475 | } 476 | 477 | return 0; 478 | } 479 | -------------------------------------------------------------------------------- /des.h: -------------------------------------------------------------------------------- 1 | /* 2 | * This file can be used to work with the DES GnuPG 3 | * implementation without having any other includes 4 | */ 5 | 6 | #ifndef _DES_H_ 7 | #define _DES_H_ 8 | 9 | typedef struct _des_ctx 10 | { 11 | unsigned int encrypt_subkeys[32]; 12 | unsigned int decrypt_subkeys[32]; 13 | } 14 | des_ctx[1]; 15 | 16 | int des_setkey (struct _des_ctx *, const unsigned char *); 17 | int des_ecb_crypt (struct _des_ctx *, const unsigned char *, unsigned char *, int); 18 | int is_weak_key ( const unsigned char *key ); 19 | 20 | #define des_ecb_encrypt(ctx, from, to) des_ecb_crypt(ctx, from, to, 0) 21 | #define des_ecb_decrypt(ctx, from, to) des_ecb_crypt(ctx, from, to, 1) 22 | 23 | #endif 24 | -------------------------------------------------------------------------------- /main.c: -------------------------------------------------------------------------------- 1 | /* 2 | * Triforce ISO Extract 3 | * Copyright (C) 2015 - 2016 FIX94 4 | * 5 | * This program is free software; you can redistribute it and/or modify 6 | * it under the terms of the GNU General Public License as published by 7 | * the Free Software Foundation; either version 3 of the License, or 8 | * (at your option) any later version. 9 | * 10 | * This program is distributed in the hope that it will be useful, 11 | * but WITHOUT ANY WARRANTY; without even the implied warranty of 12 | * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 13 | * GNU General Public License for more details. 14 | * 15 | * You should have received a copy of the GNU General Public License 16 | * along with this program; if not, see . 17 | */ 18 | #include 19 | #include 20 | #include "des.h" 21 | 22 | /* All the Triforce DES Keys I know */ 23 | #define KEYS_AVAIL 12 24 | static const unsigned long long trikeys[KEYS_AVAIL] = { 25 | 0xA82F6B8C6BC2158CULL, //F-Zero AX 26 | 0xE0B9043E4C4F40BCULL, //Gekitou Pro Yakyuu 27 | 0x2ADAE57FEF076D1AULL, //The Key of Avalon 28 | 0xF2A24C7C6191E39DULL, //The Key of Avalon 2 29 | 0xD96446469BDCE9C1ULL, //Triforce Firmware Update 30 | 0x20FBD010E91AF4B3ULL, //Virtua Striker 3 Ver. 2002 (Japan) 31 | 0x0B45139D91E0084FULL, //Virtua Striker 3 Ver. 2002 (Export) 32 | 0x08BC388F76CB0231ULL, //Virtua Striker 4 (Japan) 33 | 0x86619BB95BEC924AULL, //Virtua Striker 4 (Export) (GDT-0014) 34 | 0x0BB58579C846C1DCULL, //Virtua Striker 4 (Export) (GDT-0015) 35 | 0x83622ABF57DA1951ULL, //Virtua Striker 4 Ver. 2006 (Japan) 36 | 0xABFBD902FBD980E5ULL, //Virtua Striker 4 Ver. 2006 (Export) 37 | }; 38 | 39 | /* Triforce games are encrypted a little weird */ 40 | static inline void do64BitSwap(void *in, void *out) 41 | { 42 | *(unsigned long long*)out = __builtin_bswap64(*(unsigned long long*)in); 43 | } 44 | 45 | /* Just a helper function for me to not get confused */ 46 | static inline void des_ecb_decrypt_swapped(struct _des_ctx *ctx, void *in, void *out) 47 | { 48 | do64BitSwap(in,out); //out is now the swapped input 49 | des_ecb_decrypt(ctx,out,out); //out is now swapped decrypted 50 | do64BitSwap(out,out); //out is now decrypted 51 | } 52 | 53 | static struct _des_ctx DESctx; 54 | /* Use the GC Magic Word to verify DES key */ 55 | int findDESKey(unsigned char *buf) 56 | { 57 | size_t i; 58 | unsigned char outbuf[8]; 59 | unsigned char gcMagic[8] = { 0x00, 0x00, 0x00, 0x00, 0xC2, 0x33, 0x9F, 0x3D}; 60 | for(i = 0; i < KEYS_AVAIL; i++) 61 | { 62 | des_setkey(&DESctx, (unsigned char*)(trikeys+i)); 63 | des_ecb_decrypt_swapped(&DESctx, buf+0x18, outbuf); 64 | if(memcmp(outbuf, gcMagic, 8) == 0) 65 | return 1; 66 | } 67 | return 0; 68 | } 69 | 70 | /* Only 2048 bytes are actually data */ 71 | void decryptSector(unsigned char *in, unsigned char *out) 72 | { 73 | size_t i; 74 | for(i = 0; i < 0x800; i+=8) 75 | des_ecb_decrypt_swapped(&DESctx, in+i, out+i); 76 | } 77 | 78 | #define ONE_MB 0x100000 79 | int main(int argc, char *argv[]) 80 | { 81 | FILE *f = NULL; 82 | int created_tmp = 0; 83 | int has_basepath = 0; 84 | char exebasepath[MAX_PATH], gamebasepath[MAX_PATH], tmppath[MAX_PATH]; 85 | //windows exec path is so ugly to get 86 | GetModuleFileName(NULL, exebasepath, MAX_PATH); 87 | if(strchr(exebasepath,'\\') != NULL) 88 | *strrchr(exebasepath,'\\') = '\0'; 89 | //lets actually do cool stuff 90 | puts("Triforce ISO Extract v1.4 by FIX94"); 91 | if(argc != 2) 92 | { 93 | puts("No input file!"); 94 | goto end_prog; 95 | } 96 | if(strchr(argv[1],'\\') != NULL) 97 | { 98 | has_basepath = 1; 99 | memcpy(gamebasepath,argv[1],strlen(argv[1])+1); 100 | *strrchr(gamebasepath,'\\') = '\0'; 101 | } 102 | if(strstr(argv[1],".chd") != NULL) 103 | { 104 | puts("CHD file mode"); 105 | puts("Creating tmp directory...\nCalling chdman...\n"); 106 | created_tmp = 1; 107 | char systemcmd[2048]; 108 | if(has_basepath) 109 | { 110 | sprintf(tmppath, "%s\\tmp", gamebasepath); 111 | mkdir(tmppath); 112 | sprintf(systemcmd,"\"\"%s\\chdman.exe\" extractraw -i \"%s\" -o \"%s\\tmp\\raw.bin\"\"", exebasepath, argv[1], gamebasepath); 113 | system(systemcmd); 114 | sprintf(tmppath, "%s\\tmp\\raw.bin", gamebasepath); 115 | f = fopen(tmppath, "rb"); 116 | } 117 | else 118 | { 119 | mkdir("tmp"); 120 | sprintf(systemcmd,"\"\"%s\\chdman.exe\" extractraw -i \"%s\" -o tmp/raw.bin\"", exebasepath, argv[1]); 121 | system(systemcmd); 122 | f = fopen("tmp/raw.bin", "rb"); 123 | } 124 | printf("\n"); 125 | if(!f) 126 | { 127 | puts("Unable to open raw.bin!"); 128 | printf("The following command line was used:\n%s\n", systemcmd); 129 | goto end_prog; 130 | } 131 | } 132 | else 133 | { 134 | puts("Direct file mode\n"); 135 | f = fopen(argv[1],"rb"); 136 | if(!f) 137 | { 138 | printf("Unable to open %s!\n",argv[1]); 139 | goto end_prog; 140 | } 141 | } 142 | fseek(f,0,SEEK_END); 143 | size_t fsize = ftell(f); 144 | if(fsize < ONE_MB) 145 | { 146 | puts("File too small!"); 147 | goto end_prog; 148 | } 149 | /* every image starts with SEGA so we can use that as offset */ 150 | unsigned char inBuf[0x1000],outBuf[0x1000]; 151 | puts("Trying to calculate file sector offset"); 152 | fseek(f,0,SEEK_SET); 153 | fread(inBuf,1,0x810,f); 154 | size_t sec_offset; 155 | for(sec_offset = 0; sec_offset <= 0x800; ++sec_offset) 156 | { 157 | if(memcmp(inBuf+sec_offset,"SEGA",4) == 0 158 | && memcmp(inBuf+0x40+sec_offset,"GDT-",4) == 0) 159 | { 160 | printf("Found GD-ROM: %.9s\n",inBuf+0x40+sec_offset); 161 | break; 162 | } 163 | } 164 | if(sec_offset > 0x800) 165 | { 166 | puts("Invalid Sector Offset!"); 167 | goto end_prog; 168 | } 169 | printf("Sector Offset: 0x%x\n\n",sec_offset); 170 | 171 | puts("Trying to calculate sector size"); 172 | size_t sec_size = 0x1001; 173 | size_t i,j,k, found = 0; 174 | for(i = 0x8000; i < 0x10000; i+=0xFF0) 175 | { 176 | fseek(f,i,SEEK_SET); 177 | fread(inBuf,1,0x1000,f); 178 | for(j = 0; j < 0x1000; j+=0x10) 179 | { 180 | if(memcmp(inBuf+j+1,"CD001",5) == 0) 181 | { 182 | printf("Known Sector Start: 0x%x\n",i+j-sec_offset); 183 | fseek(f,i+j+0x800,SEEK_SET); 184 | fread(inBuf,1,0x810,f); 185 | for(k = 0; k <= 0x800; k+=0x10) 186 | { 187 | if(memcmp(inBuf+k+1,"CD001",5) == 0) 188 | { 189 | sec_size = 0x800+k; 190 | printf("Known Sector End: 0x%x\n",i+j+sec_size-sec_offset); 191 | found = 1; 192 | break; 193 | } 194 | } 195 | } 196 | if(found) break; 197 | } 198 | if(found) break; 199 | } 200 | if(sec_size > 0x1000 || (sec_size - sec_offset) < 0x800) 201 | { 202 | puts("Invalid Sector Size!"); 203 | goto end_prog; 204 | } 205 | printf("Sector Size: %i bytes\n\n", sec_size); 206 | 207 | puts("Searching for GD-ROM Track 3"); 208 | size_t start_pos = 0, readMax = fsize - 0x1000; 209 | found = 0; 210 | for(i = 0; i < readMax; i+=0xFFC) 211 | { 212 | fseek(f,i,SEEK_SET); 213 | fread(inBuf,1,0x1000,f); 214 | for(start_pos = 0; start_pos < 0xFFC; start_pos++) 215 | { 216 | if(memcmp(inBuf+start_pos,"TOC1",4) == 0) 217 | { 218 | puts("Found TOC string"); 219 | found = 1; 220 | break; 221 | } 222 | } 223 | if(found) break; 224 | } 225 | if(!found || i >= readMax) 226 | { 227 | puts("GD-ROM Track 3 not found!"); 228 | goto end_prog; 229 | } 230 | size_t t3_start = (i+start_pos)-0x100-sec_offset; 231 | printf("GD-ROM Track 3 Start: 0x%08x\n\n", t3_start); 232 | 233 | puts("Trying to read file table"); 234 | size_t gc_offset = 0; 235 | size_t gc_size = 0; 236 | char fOutName[0x100]; 237 | //fixed? sector 238 | size_t fTableStart = t3_start+(0x14*sec_size); 239 | printf("File Table Start: 0x%08x\n", fTableStart); 240 | fseek(f,fTableStart+sec_offset,SEEK_SET); 241 | for(i = 0; i < 5; i++) //go through 5 reads 242 | { 243 | //this sector always provides its jump sizes 244 | unsigned char baseSize = 0; 245 | fread(&baseSize,1,1,f); 246 | if(baseSize == 0) 247 | { 248 | puts("Invalid file table read!"); 249 | break; 250 | } 251 | //too small for file names etc 252 | if(baseSize > 1 && baseSize < 0x24) 253 | { 254 | fseek(f,baseSize-1,SEEK_CUR); 255 | continue; 256 | } 257 | fread(inBuf,1,baseSize-1,f); 258 | //file start sector 259 | gc_offset = __builtin_bswap32(*(unsigned int*)(inBuf+5)); 260 | //file size in bytes 261 | gc_size = __builtin_bswap32(*(unsigned int*)(inBuf+13)); 262 | //file size including ;1 263 | unsigned char fNameLen = *(inBuf+31); 264 | if(fNameLen > 2) 265 | { 266 | if(gc_size > ONE_MB) 267 | { 268 | memcpy(fOutName,inBuf+32,fNameLen-2); 269 | fOutName[fNameLen-2] = '\0'; 270 | break; 271 | } 272 | else 273 | printf("Skipping over %.*s\n",fNameLen-2,inBuf+32); 274 | } 275 | } 276 | 277 | if((strstr(fOutName,".BIN") != NULL) || (strstr(fOutName,".GCM") != NULL)) 278 | { 279 | printf("Goal file name: %s\n",fOutName); 280 | //really ugly calculation to skip over some sectors if needed 281 | gc_offset = (gc_offset*sec_size)+(t3_start-(45000*sec_size)); 282 | //NOT sec_size because the usable data is always 0x800 bytes! 283 | size_t chunks_to_write = ((gc_size + 0x7FF) & ~0x7FF) / 0x800; 284 | printf("File Start: 0x%08x\nSize: %.02fMB\nChunks to write: %i\n",gc_offset,((float)gc_size)/1024.f/1024.f,chunks_to_write); 285 | if(gc_offset > 0 && gc_size > 0 && (gc_offset+(chunks_to_write*sec_size)) <= fsize) 286 | { 287 | fseek(f,gc_offset,SEEK_SET); 288 | fread(inBuf,1,sec_size,f); 289 | if(findDESKey(inBuf+sec_offset)) 290 | { 291 | puts("Found Valid DES Key!\n"); 292 | FILE *fOut = NULL; 293 | if(has_basepath) 294 | { 295 | sprintf(tmppath,"%s\\%s",gamebasepath,fOutName); 296 | fOut = fopen(tmppath,"wb"); 297 | } 298 | else 299 | fOut = fopen(fOutName,"wb"); 300 | if(!fOut) 301 | { 302 | puts("Unable to create file!"); 303 | goto end_prog; 304 | } 305 | printf("Writing file... 0%%"); 306 | fseek(f,gc_offset,SEEK_SET); 307 | for(i = 0; i < chunks_to_write; i++) 308 | { 309 | fread(inBuf,1,sec_size,f); 310 | //make sure to think about the start offset! 311 | decryptSector(inBuf+sec_offset,outBuf); 312 | //only write actually valid data 313 | size_t towrite = (gc_size > 0x800) ? 0x800 : gc_size; 314 | fwrite(outBuf,1,towrite,fOut); 315 | gc_size -= 0x800; 316 | //inform the user about the progress from time to time 317 | if((i%0xFFF) == 0) printf("\rWriting file... %.0f%%",((float)i / (float)chunks_to_write)*100); 318 | } 319 | printf("\rWriting file... 100%%\n%s done!\n", fOutName); 320 | fclose(fOut); 321 | } 322 | else 323 | puts("Unable to find GC Magic!"); 324 | } 325 | else 326 | puts("Invalid file!"); 327 | } 328 | else 329 | puts("No .BIN found!"); 330 | end_prog: 331 | if(f != NULL) 332 | fclose(f); 333 | if(created_tmp) 334 | { 335 | puts("Cleaning up tmp struct..."); 336 | if(has_basepath) 337 | { 338 | sprintf(tmppath, "%s\\tmp\\raw.bin", gamebasepath); 339 | unlink(tmppath); 340 | sprintf(tmppath, "%s\\tmp", gamebasepath); 341 | rmdir(tmppath); 342 | } 343 | else 344 | { 345 | unlink("tmp/raw.bin"); 346 | rmdir("tmp"); 347 | } 348 | } 349 | puts("Press enter to exit"); 350 | getc(stdin); 351 | return 0; 352 | } 353 | --------------------------------------------------------------------------------