pax_global_header00006660000000000000000000000064130165573160014521gustar00rootroot0000000000000052 comment=cc7c24861b95f98b1acde57fb0b4f18f3c9fa48a bruteforce-salted-openssl-1.3.3/000077500000000000000000000000001301655731600166205ustar00rootroot00000000000000bruteforce-salted-openssl-1.3.3/.gitignore000066400000000000000000000002521301655731600206070ustar00rootroot00000000000000aclocal.m4 autom4te.cache/ /bruteforce-salted-openssl compile config.log config.status configure depcomp .deps/ .dirstamp install-sh Makefile Makefile.in missing src/*.o bruteforce-salted-openssl-1.3.3/AUTHORS000066400000000000000000000001631301655731600176700ustar00rootroot000000000000002014-2016 Guillaume LE VAILLANT 2015-2015 Simon WOOD bruteforce-salted-openssl-1.3.3/COPYING000066400000000000000000001071301301655731600176550ustar00rootroot00000000000000bruteforce-salted-openssl Copyright 2014-2016 Guillaume LE VAILLANT This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see . Additional permission under GNU GPL version 3 section 7 If you modify this program, or any covered work, by linking or combining it with the OpenSSL library (or a modified version of that library), containing parts covered by the terms of the OpenSSL license, the licensors of this program grant you additional permission to convey the resulting work. Corresponding source for a non-source form of such a combination shall include the source code for the parts of the OpenSSL library used as well as that of the covered work. -------------------------------------------------------------------------------- GNU GENERAL PUBLIC LICENSE Version 3, 29 June 2007 Copyright (C) 2007 Free Software Foundation, Inc. Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The GNU General Public License is a free, copyleft license for software and other kinds of works. The licenses for most software and other practical works are designed to take away your freedom to share and change the works. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change all versions of a program--to make sure it remains free software for all its users. We, the Free Software Foundation, use the GNU General Public License for most of our software; it applies also to any other work released this way by its authors. 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 them 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 prevent others from denying you these rights or asking you to surrender the rights. Therefore, you have certain responsibilities if you distribute copies of the software, or if you modify it: responsibilities to respect the freedom of others. For example, if you distribute copies of such a program, whether gratis or for a fee, you must pass on to the recipients the same freedoms that you received. 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. Developers that use the GNU GPL protect your rights with two steps: (1) assert copyright on the software, and (2) offer you this License giving you legal permission to copy, distribute and/or modify it. For the developers' and authors' protection, the GPL clearly explains that there is no warranty for this free software. For both users' and authors' sake, the GPL requires that modified versions be marked as changed, so that their problems will not be attributed erroneously to authors of previous versions. Some devices are designed to deny users access to install or run modified versions of the software inside them, although the manufacturer can do so. This is fundamentally incompatible with the aim of protecting users' freedom to change the software. The systematic pattern of such abuse occurs in the area of products for individuals to use, which is precisely where it is most unacceptable. Therefore, we have designed this version of the GPL to prohibit the practice for those products. If such problems arise substantially in other domains, we stand ready to extend this provision to those domains in future versions of the GPL, as needed to protect the freedom of users. Finally, every program is threatened constantly by software patents. States should not allow patents to restrict development and use of software on general-purpose computers, but in those that do, we wish to avoid the special danger that patents applied to a free program could make it effectively proprietary. To prevent this, the GPL assures that patents cannot be used to render the program non-free. The precise terms and conditions for copying, distribution and modification follow. TERMS AND CONDITIONS 0. Definitions. "This License" refers to version 3 of the GNU General Public License. "Copyright" also means copyright-like laws that apply to other kinds of works, such as semiconductor masks. "The Program" refers to any copyrightable work licensed under this License. Each licensee is addressed as "you". "Licensees" and "recipients" may be individuals or organizations. To "modify" a work means to copy from or adapt all or part of the work in a fashion requiring copyright permission, other than the making of an exact copy. The resulting work is called a "modified version" of the earlier work or a work "based on" the earlier work. A "covered work" means either the unmodified Program or a work based on the Program. To "propagate" a work means to do anything with it that, without permission, would make you directly or secondarily liable for infringement under applicable copyright law, except executing it on a computer or modifying a private copy. Propagation includes copying, distribution (with or without modification), making available to the public, and in some countries other activities as well. To "convey" a work means any kind of propagation that enables other parties to make or receive copies. Mere interaction with a user through a computer network, with no transfer of a copy, is not conveying. An interactive user interface displays "Appropriate Legal Notices" to the extent that it includes a convenient and prominently visible feature that (1) displays an appropriate copyright notice, and (2) tells the user that there is no warranty for the work (except to the extent that warranties are provided), that licensees may convey the work under this License, and how to view a copy of this License. If the interface presents a list of user commands or options, such as a menu, a prominent item in the list meets this criterion. 1. Source Code. The "source code" for a work means the preferred form of the work for making modifications to it. "Object code" means any non-source form of a work. A "Standard Interface" means an interface that either is an official standard defined by a recognized standards body, or, in the case of interfaces specified for a particular programming language, one that is widely used among developers working in that language. The "System Libraries" of an executable work include anything, other than the work as a whole, that (a) is included in the normal form of packaging a Major Component, but which is not part of that Major Component, and (b) serves only to enable use of the work with that Major Component, or to implement a Standard Interface for which an implementation is available to the public in source code form. A "Major Component", in this context, means a major essential component (kernel, window system, and so on) of the specific operating system (if any) on which the executable work runs, or a compiler used to produce the work, or an object code interpreter used to run it. The "Corresponding Source" for a work in object code form means all the source code needed to generate, install, and (for an executable work) run the object code and to modify the work, including scripts to control those activities. However, it does not include the work's System Libraries, or general-purpose tools or generally available free programs which are used unmodified in performing those activities but which are not part of the work. For example, Corresponding Source includes interface definition files associated with source files for the work, and the source code for shared libraries and dynamically linked subprograms that the work is specifically designed to require, such as by intimate data communication or control flow between those subprograms and other parts of the work. The Corresponding Source need not include anything that users can regenerate automatically from other parts of the Corresponding Source. The Corresponding Source for a work in source code form is that same work. 2. Basic Permissions. All rights granted under this License are granted for the term of copyright on the Program, and are irrevocable provided the stated conditions are met. This License explicitly affirms your unlimited permission to run the unmodified Program. The output from running a covered work is covered by this License only if the output, given its content, constitutes a covered work. This License acknowledges your rights of fair use or other equivalent, as provided by copyright law. You may make, run and propagate covered works that you do not convey, without conditions so long as your license otherwise remains in force. You may convey covered works to others for the sole purpose of having them make modifications exclusively for you, or provide you with facilities for running those works, provided that you comply with the terms of this License in conveying all material for which you do not control copyright. Those thus making or running the covered works for you must do so exclusively on your behalf, under your direction and control, on terms that prohibit them from making any copies of your copyrighted material outside their relationship with you. Conveying under any other circumstances is permitted solely under the conditions stated below. Sublicensing is not allowed; section 10 makes it unnecessary. 3. Protecting Users' Legal Rights From Anti-Circumvention Law. No covered work shall be deemed part of an effective technological measure under any applicable law fulfilling obligations under article 11 of the WIPO copyright treaty adopted on 20 December 1996, or similar laws prohibiting or restricting circumvention of such measures. When you convey a covered work, you waive any legal power to forbid circumvention of technological measures to the extent such circumvention is effected by exercising rights under this License with respect to the covered work, and you disclaim any intention to limit operation or modification of the work as a means of enforcing, against the work's users, your or third parties' legal rights to forbid circumvention of technological measures. 4. Conveying Verbatim Copies. You may convey 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; keep intact all notices stating that this License and any non-permissive terms added in accord with section 7 apply to the code; keep intact all notices of the absence of any warranty; and give all recipients a copy of this License along with the Program. You may charge any price or no price for each copy that you convey, and you may offer support or warranty protection for a fee. 5. Conveying Modified Source Versions. You may convey a work based on the Program, or the modifications to produce it from the Program, in the form of source code under the terms of section 4, provided that you also meet all of these conditions: a) The work must carry prominent notices stating that you modified it, and giving a relevant date. b) The work must carry prominent notices stating that it is released under this License and any conditions added under section 7. This requirement modifies the requirement in section 4 to "keep intact all notices". c) You must license the entire work, as a whole, under this License to anyone who comes into possession of a copy. This License will therefore apply, along with any applicable section 7 additional terms, to the whole of the work, and all its parts, regardless of how they are packaged. This License gives no permission to license the work in any other way, but it does not invalidate such permission if you have separately received it. d) If the work has interactive user interfaces, each must display Appropriate Legal Notices; however, if the Program has interactive interfaces that do not display Appropriate Legal Notices, your work need not make them do so. A compilation of a covered work with other separate and independent works, which are not by their nature extensions of the covered work, and which are not combined with it such as to form a larger program, in or on a volume of a storage or distribution medium, is called an "aggregate" if the compilation and its resulting copyright are not used to limit the access or legal rights of the compilation's users beyond what the individual works permit. Inclusion of a covered work in an aggregate does not cause this License to apply to the other parts of the aggregate. 6. Conveying Non-Source Forms. You may convey a covered work in object code form under the terms of sections 4 and 5, provided that you also convey the machine-readable Corresponding Source under the terms of this License, in one of these ways: a) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by the Corresponding Source fixed on a durable physical medium customarily used for software interchange. b) Convey the object code in, or embodied in, a physical product (including a physical distribution medium), accompanied by a written offer, valid for at least three years and valid for as long as you offer spare parts or customer support for that product model, to give anyone who possesses the object code either (1) a copy of the Corresponding Source for all the software in the product that is covered by this License, on a durable physical medium customarily used for software interchange, for a price no more than your reasonable cost of physically performing this conveying of source, or (2) access to copy the Corresponding Source from a network server at no charge. c) Convey individual copies of the object code with a copy of the written offer to provide the Corresponding Source. This alternative is allowed only occasionally and noncommercially, and only if you received the object code with such an offer, in accord with subsection 6b. d) Convey the object code by offering access from a designated place (gratis or for a charge), and offer equivalent access to the Corresponding Source in the same way through the same place at no further charge. You need not require recipients to copy the Corresponding Source along with the object code. If the place to copy the object code is a network server, the Corresponding Source may be on a different server (operated by you or a third party) that supports equivalent copying facilities, provided you maintain clear directions next to the object code saying where to find the Corresponding Source. Regardless of what server hosts the Corresponding Source, you remain obligated to ensure that it is available for as long as needed to satisfy these requirements. e) Convey the object code using peer-to-peer transmission, provided you inform other peers where the object code and Corresponding Source of the work are being offered to the general public at no charge under subsection 6d. A separable portion of the object code, whose source code is excluded from the Corresponding Source as a System Library, need not be included in conveying the object code work. A "User Product" is either (1) a "consumer product", which means any tangible personal property which is normally used for personal, family, or household purposes, or (2) anything designed or sold for incorporation into a dwelling. In determining whether a product is a consumer product, doubtful cases shall be resolved in favor of coverage. For a particular product received by a particular user, "normally used" refers to a typical or common use of that class of product, regardless of the status of the particular user or of the way in which the particular user actually uses, or expects or is expected to use, the product. A product is a consumer product regardless of whether the product has substantial commercial, industrial or non-consumer uses, unless such uses represent the only significant mode of use of the product. "Installation Information" for a User Product means any methods, procedures, authorization keys, or other information required to install and execute modified versions of a covered work in that User Product from a modified version of its Corresponding Source. The information must suffice to ensure that the continued functioning of the modified object code is in no case prevented or interfered with solely because modification has been made. If you convey an object code work under this section in, or with, or specifically for use in, a User Product, and the conveying occurs as part of a transaction in which the right of possession and use of the User Product is transferred to the recipient in perpetuity or for a fixed term (regardless of how the transaction is characterized), the Corresponding Source conveyed under this section must be accompanied by the Installation Information. But this requirement does not apply if neither you nor any third party retains the ability to install modified object code on the User Product (for example, the work has been installed in ROM). The requirement to provide Installation Information does not include a requirement to continue to provide support service, warranty, or updates for a work that has been modified or installed by the recipient, or for the User Product in which it has been modified or installed. Access to a network may be denied when the modification itself materially and adversely affects the operation of the network or violates the rules and protocols for communication across the network. Corresponding Source conveyed, and Installation Information provided, in accord with this section must be in a format that is publicly documented (and with an implementation available to the public in source code form), and must require no special password or key for unpacking, reading or copying. 7. Additional Terms. "Additional permissions" are terms that supplement the terms of this License by making exceptions from one or more of its conditions. Additional permissions that are applicable to the entire Program shall be treated as though they were included in this License, to the extent that they are valid under applicable law. If additional permissions apply only to part of the Program, that part may be used separately under those permissions, but the entire Program remains governed by this License without regard to the additional permissions. When you convey a copy of a covered work, you may at your option remove any additional permissions from that copy, or from any part of it. (Additional permissions may be written to require their own removal in certain cases when you modify the work.) You may place additional permissions on material, added by you to a covered work, for which you have or can give appropriate copyright permission. Notwithstanding any other provision of this License, for material you add to a covered work, you may (if authorized by the copyright holders of that material) supplement the terms of this License with terms: a) Disclaiming warranty or limiting liability differently from the terms of sections 15 and 16 of this License; or b) Requiring preservation of specified reasonable legal notices or author attributions in that material or in the Appropriate Legal Notices displayed by works containing it; or c) Prohibiting misrepresentation of the origin of that material, or requiring that modified versions of such material be marked in reasonable ways as different from the original version; or d) Limiting the use for publicity purposes of names of licensors or authors of the material; or e) Declining to grant rights under trademark law for use of some trade names, trademarks, or service marks; or f) Requiring indemnification of licensors and authors of that material by anyone who conveys the material (or modified versions of it) with contractual assumptions of liability to the recipient, for any liability that these contractual assumptions directly impose on those licensors and authors. All other non-permissive additional terms are considered "further restrictions" within the meaning of section 10. If the Program as you received it, or any part of it, contains a notice stating that it is governed by this License along with a term that is a further restriction, you may remove that term. If a license document contains a further restriction but permits relicensing or conveying under this License, you may add to a covered work material governed by the terms of that license document, provided that the further restriction does not survive such relicensing or conveying. If you add terms to a covered work in accord with this section, you must place, in the relevant source files, a statement of the additional terms that apply to those files, or a notice indicating where to find the applicable terms. Additional terms, permissive or non-permissive, may be stated in the form of a separately written license, or stated as exceptions; the above requirements apply either way. 8. Termination. You may not propagate or modify a covered work except as expressly provided under this License. Any attempt otherwise to propagate or modify it is void, and will automatically terminate your rights under this License (including any patent licenses granted under the third paragraph of section 11). However, if you cease all violation of this License, then your license from a particular copyright holder is reinstated (a) provisionally, unless and until the copyright holder explicitly and finally terminates your license, and (b) permanently, if the copyright holder fails to notify you of the violation by some reasonable means prior to 60 days after the cessation. Moreover, your license from a particular copyright holder is reinstated permanently if the copyright holder notifies you of the violation by some reasonable means, this is the first time you have received notice of violation of this License (for any work) from that copyright holder, and you cure the violation prior to 30 days after your receipt of the notice. Termination of your rights under this section does not terminate the licenses of parties who have received copies or rights from you under this License. If your rights have been terminated and not permanently reinstated, you do not qualify to receive new licenses for the same material under section 10. 9. Acceptance Not Required for Having Copies. You are not required to accept this License in order to receive or run a copy of the Program. Ancillary propagation of a covered work occurring solely as a consequence of using peer-to-peer transmission to receive a copy likewise does not require acceptance. However, nothing other than this License grants you permission to propagate or modify any covered work. These actions infringe copyright if you do not accept this License. Therefore, by modifying or propagating a covered work, you indicate your acceptance of this License to do so. 10. Automatic Licensing of Downstream Recipients. Each time you convey a covered work, the recipient automatically receives a license from the original licensors, to run, modify and propagate that work, subject to this License. You are not responsible for enforcing compliance by third parties with this License. An "entity transaction" is a transaction transferring control of an organization, or substantially all assets of one, or subdividing an organization, or merging organizations. If propagation of a covered work results from an entity transaction, each party to that transaction who receives a copy of the work also receives whatever licenses to the work the party's predecessor in interest had or could give under the previous paragraph, plus a right to possession of the Corresponding Source of the work from the predecessor in interest, if the predecessor has it or can get it with reasonable efforts. You may not impose any further restrictions on the exercise of the rights granted or affirmed under this License. For example, you may not impose a license fee, royalty, or other charge for exercise of rights granted under this License, and you may not initiate litigation (including a cross-claim or counterclaim in a lawsuit) alleging that any patent claim is infringed by making, using, selling, offering for sale, or importing the Program or any portion of it. 11. Patents. A "contributor" is a copyright holder who authorizes use under this License of the Program or a work on which the Program is based. The work thus licensed is called the contributor's "contributor version". A contributor's "essential patent claims" are all patent claims owned or controlled by the contributor, whether already acquired or hereafter acquired, that would be infringed by some manner, permitted by this License, of making, using, or selling its contributor version, but do not include claims that would be infringed only as a consequence of further modification of the contributor version. For purposes of this definition, "control" includes the right to grant patent sublicenses in a manner consistent with the requirements of this License. Each contributor grants you a non-exclusive, worldwide, royalty-free patent license under the contributor's essential patent claims, to make, use, sell, offer for sale, import and otherwise run, modify and propagate the contents of its contributor version. In the following three paragraphs, a "patent license" is any express agreement or commitment, however denominated, not to enforce a patent (such as an express permission to practice a patent or covenant not to sue for patent infringement). To "grant" such a patent license to a party means to make such an agreement or commitment not to enforce a patent against the party. If you convey a covered work, knowingly relying on a patent license, and the Corresponding Source of the work is not available for anyone to copy, free of charge and under the terms of this License, through a publicly available network server or other readily accessible means, then you must either (1) cause the Corresponding Source to be so available, or (2) arrange to deprive yourself of the benefit of the patent license for this particular work, or (3) arrange, in a manner consistent with the requirements of this License, to extend the patent license to downstream recipients. "Knowingly relying" means you have actual knowledge that, but for the patent license, your conveying the covered work in a country, or your recipient's use of the covered work in a country, would infringe one or more identifiable patents in that country that you have reason to believe are valid. If, pursuant to or in connection with a single transaction or arrangement, you convey, or propagate by procuring conveyance of, a covered work, and grant a patent license to some of the parties receiving the covered work authorizing them to use, propagate, modify or convey a specific copy of the covered work, then the patent license you grant is automatically extended to all recipients of the covered work and works based on it. A patent license is "discriminatory" if it does not include within the scope of its coverage, prohibits the exercise of, or is conditioned on the non-exercise of one or more of the rights that are specifically granted under this License. You may not convey a covered work if you are a party to an arrangement with a third party that is in the business of distributing software, under which you make payment to the third party based on the extent of your activity of conveying the work, and under which the third party grants, to any of the parties who would receive the covered work from you, a discriminatory patent license (a) in connection with copies of the covered work conveyed by you (or copies made from those copies), or (b) primarily for and in connection with specific products or compilations that contain the covered work, unless you entered into that arrangement, or that patent license was granted, prior to 28 March 2007. Nothing in this License shall be construed as excluding or limiting any implied license or other defenses to infringement that may otherwise be available to you under applicable patent law. 12. No Surrender of Others' Freedom. If 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 convey a covered work so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not convey it at all. For example, if you agree to terms that obligate you to collect a royalty for further conveying from those to whom you convey the Program, the only way you could satisfy both those terms and this License would be to refrain entirely from conveying the Program. 13. Use with the GNU Affero General Public License. Notwithstanding any other provision of this License, you have permission to link or combine any covered work with a work licensed under version 3 of the GNU Affero General Public License into a single combined work, and to convey the resulting work. The terms of this License will continue to apply to the part which is the covered work, but the special requirements of the GNU Affero General Public License, section 13, concerning interaction through a network will apply to the combination as such. 14. Revised Versions of this License. The Free Software Foundation may publish revised and/or new versions of the GNU 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 that a certain numbered version of the GNU General Public License "or any later version" applies to it, you have the option of following the terms and conditions either of that numbered version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of the GNU General Public License, you may choose any version ever published by the Free Software Foundation. If the Program specifies that a proxy can decide which future versions of the GNU General Public License can be used, that proxy's public statement of acceptance of a version permanently authorizes you to choose that version for the Program. Later license versions may give you additional or different permissions. However, no additional obligations are imposed on any author or copyright holder as a result of your choosing to follow a later version. 15. Disclaimer of Warranty. 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. 16. Limitation of Liability. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 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. 17. Interpretation of Sections 15 and 16. If the disclaimer of warranty and limitation of liability provided above cannot be given local legal effect according to their terms, reviewing courts shall apply local law that most closely approximates an absolute waiver of all civil liability in connection with the Program, unless a warranty or assumption of liability accompanies a copy of the Program in return for a fee. END OF TERMS AND CONDITIONS How to Apply These Terms to Your New Programs If you develop a new program, and you want it to be of the greatest possible use to the public, the best way to achieve this is to make it free software which everyone can redistribute and change under these terms. To do so, attach the following notices to the program. It is safest to attach them to the start of each source file to most effectively state the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. Copyright (C) This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see . Also add information on how to contact you by electronic and paper mail. If the program does terminal interaction, make it output a short notice like this when it starts in an interactive mode: Copyright (C) This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. This is free software, and you are welcome to redistribute it under certain conditions; type `show c' for details. The hypothetical commands `show w' and `show c' should show the appropriate parts of the General Public License. Of course, your program's commands might be different; for a GUI interface, you would use an "about box". You should also get your employer (if you work as a programmer) or school, if any, to sign a "copyright disclaimer" for the program, if necessary. For more information on this, and how to apply and follow the GNU GPL, see . The GNU General Public License does not permit incorporating your program into proprietary programs. If your program is a subroutine library, you may consider it more useful to permit linking proprietary applications with the library. If this is what you want to do, use the GNU Lesser General Public License instead of this License. But first, please read . bruteforce-salted-openssl-1.3.3/ChangeLog000066400000000000000000000022631301655731600203750ustar00rootroot000000000000002016-11-27 Guillaume LE VAILLANT Version 1.3.3 Add bruteforcing speed and last tried password to progress info. 2016-09-26 Guillaume LE VAILLANT Version 1.3.2 Fixes for OpenSSL 1.1.0 API changes. Add man page. 2016-09-25 Guillaume LE VAILLANT Version 1.3.1 Consider space characters (new lines, tabs, etc.) as valid data in the decrypted text. 2016-06-06 Guillaume LE VAILLANT Version 1.3.0 Print progress info when sending a USR1 signal to the process. Support all the characters of the current locale (e.g. utf-8). Add the possibility to get the passwords from a file. 2015-03-11 Guillaume LE VAILLANT Version 1.2 Add the options developped by Simon WOOD (binary passwords, magic string, limit number of tests). 2014-07-04 Guillaume LE VAILLANT Version 1.1 Add the possibility to specify the beginning and the end of the password (-b and -e options). 2014-06-19 Guillaume LE VAILLANT Version 1.0 bruteforce-salted-openssl-1.3.3/INSTALL000066400000000000000000000366101301655731600176570ustar00rootroot00000000000000Installation Instructions ************************* Copyright (C) 1994-1996, 1999-2002, 2004-2013 Free Software Foundation, Inc. Copying and distribution of this file, with or without modification, are permitted in any medium without royalty provided the copyright notice and this notice are preserved. This file is offered as-is, without warranty of any kind. Basic Installation ================== Briefly, the shell command `./configure && make && make install' should configure, build, and install this package. The following more-detailed instructions are generic; see the `README' file for instructions specific to this package. Some packages provide this `INSTALL' file but do not implement all of the features documented below. The lack of an optional feature in a given package is not necessarily a bug. More recommendations for GNU packages can be found in *note Makefile Conventions: (standards)Makefile Conventions. The `configure' shell script attempts to guess correct values for various system-dependent variables used during compilation. It uses those values to create a `Makefile' in each directory of the package. It may also create one or more `.h' files containing system-dependent definitions. Finally, it creates a shell script `config.status' that you can run in the future to recreate the current configuration, and a file `config.log' containing compiler output (useful mainly for debugging `configure'). It can also use an optional file (typically called `config.cache' and enabled with `--cache-file=config.cache' or simply `-C') that saves the results of its tests to speed up reconfiguring. Caching is disabled by default to prevent problems with accidental use of stale cache files. If you need to do unusual things to compile the package, please try to figure out how `configure' could check whether to do them, and mail diffs or instructions to the address given in the `README' so they can be considered for the next release. If you are using the cache, and at some point `config.cache' contains results you don't want to keep, you may remove or edit it. The file `configure.ac' (or `configure.in') is used to create `configure' by a program called `autoconf'. You need `configure.ac' if you want to change it or regenerate `configure' using a newer version of `autoconf'. The simplest way to compile this package is: 1. `cd' to the directory containing the package's source code and type `./configure' to configure the package for your system. Running `configure' might take a while. While running, it prints some messages telling which features it is checking for. 2. Type `make' to compile the package. 3. Optionally, type `make check' to run any self-tests that come with the package, generally using the just-built uninstalled binaries. 4. Type `make install' to install the programs and any data files and documentation. When installing into a prefix owned by root, it is recommended that the package be configured and built as a regular user, and only the `make install' phase executed with root privileges. 5. Optionally, type `make installcheck' to repeat any self-tests, but this time using the binaries in their final installed location. This target does not install anything. Running this target as a regular user, particularly if the prior `make install' required root privileges, verifies that the installation completed correctly. 6. You can remove the program binaries and object files from the source code directory by typing `make clean'. To also remove the files that `configure' created (so you can compile the package for a different kind of computer), type `make distclean'. There is also a `make maintainer-clean' target, but that is intended mainly for the package's developers. If you use it, you may have to get all sorts of other programs in order to regenerate files that came with the distribution. 7. Often, you can also type `make uninstall' to remove the installed files again. In practice, not all packages have tested that uninstallation works correctly, even though it is required by the GNU Coding Standards. 8. Some packages, particularly those that use Automake, provide `make distcheck', which can by used by developers to test that all other targets like `make install' and `make uninstall' work correctly. This target is generally not run by end users. Compilers and Options ===================== Some systems require unusual options for compilation or linking that the `configure' script does not know about. Run `./configure --help' for details on some of the pertinent environment variables. You can give `configure' initial values for configuration parameters by setting variables in the command line or in the environment. Here is an example: ./configure CC=c99 CFLAGS=-g LIBS=-lposix *Note Defining Variables::, for more details. Compiling For Multiple Architectures ==================================== You can compile the package for more than one kind of computer at the same time, by placing the object files for each architecture in their own directory. To do this, you can use GNU `make'. `cd' to the directory where you want the object files and executables to go and run the `configure' script. `configure' automatically checks for the source code in the directory that `configure' is in and in `..'. This is known as a "VPATH" build. With a non-GNU `make', it is safer to compile the package for one architecture at a time in the source code directory. After you have installed the package for one architecture, use `make distclean' before reconfiguring for another architecture. On MacOS X 10.5 and later systems, you can create libraries and executables that work on multiple system types--known as "fat" or "universal" binaries--by specifying multiple `-arch' options to the compiler but only a single `-arch' option to the preprocessor. Like this: ./configure CC="gcc -arch i386 -arch x86_64 -arch ppc -arch ppc64" \ CXX="g++ -arch i386 -arch x86_64 -arch ppc -arch ppc64" \ CPP="gcc -E" CXXCPP="g++ -E" This is not guaranteed to produce working output in all cases, you may have to build one architecture at a time and combine the results using the `lipo' tool if you have problems. Installation Names ================== By default, `make install' installs the package's commands under `/usr/local/bin', include files under `/usr/local/include', etc. You can specify an installation prefix other than `/usr/local' by giving `configure' the option `--prefix=PREFIX', where PREFIX must be an absolute file name. You can specify separate installation prefixes for architecture-specific files and architecture-independent files. If you pass the option `--exec-prefix=PREFIX' to `configure', the package uses PREFIX as the prefix for installing programs and libraries. Documentation and other data files still use the regular prefix. In addition, if you use an unusual directory layout you can give options like `--bindir=DIR' to specify different values for particular kinds of files. Run `configure --help' for a list of the directories you can set and what kinds of files go in them. In general, the default for these options is expressed in terms of `${prefix}', so that specifying just `--prefix' will affect all of the other directory specifications that were not explicitly provided. The most portable way to affect installation locations is to pass the correct locations to `configure'; however, many packages provide one or both of the following shortcuts of passing variable assignments to the `make install' command line to change installation locations without having to reconfigure or recompile. The first method involves providing an override variable for each affected directory. For example, `make install prefix=/alternate/directory' will choose an alternate location for all directory configuration variables that were expressed in terms of `${prefix}'. Any directories that were specified during `configure', but not in terms of `${prefix}', must each be overridden at install time for the entire installation to be relocated. The approach of makefile variable overrides for each directory variable is required by the GNU Coding Standards, and ideally causes no recompilation. However, some platforms have known limitations with the semantics of shared libraries that end up requiring recompilation when using this method, particularly noticeable in packages that use GNU Libtool. The second method involves providing the `DESTDIR' variable. For example, `make install DESTDIR=/alternate/directory' will prepend `/alternate/directory' before all installation names. The approach of `DESTDIR' overrides is not required by the GNU Coding Standards, and does not work on platforms that have drive letters. On the other hand, it does better at avoiding recompilation issues, and works well even when some directory options were not specified in terms of `${prefix}' at `configure' time. Optional Features ================= If the package supports it, you can cause programs to be installed with an extra prefix or suffix on their names by giving `configure' the option `--program-prefix=PREFIX' or `--program-suffix=SUFFIX'. Some packages pay attention to `--enable-FEATURE' options to `configure', where FEATURE indicates an optional part of the package. They may also pay attention to `--with-PACKAGE' options, where PACKAGE is something like `gnu-as' or `x' (for the X Window System). The `README' should mention any `--enable-' and `--with-' options that the package recognizes. For packages that use the X Window System, `configure' can usually find the X include and library files automatically, but if it doesn't, you can use the `configure' options `--x-includes=DIR' and `--x-libraries=DIR' to specify their locations. Some packages offer the ability to configure how verbose the execution of `make' will be. For these packages, running `./configure --enable-silent-rules' sets the default to minimal output, which can be overridden with `make V=1'; while running `./configure --disable-silent-rules' sets the default to verbose, which can be overridden with `make V=0'. Particular systems ================== On HP-UX, the default C compiler is not ANSI C compatible. If GNU CC is not installed, it is recommended to use the following options in order to use an ANSI C compiler: ./configure CC="cc -Ae -D_XOPEN_SOURCE=500" and if that doesn't work, install pre-built binaries of GCC for HP-UX. HP-UX `make' updates targets which have the same time stamps as their prerequisites, which makes it generally unusable when shipped generated files such as `configure' are involved. Use GNU `make' instead. On OSF/1 a.k.a. Tru64, some versions of the default C compiler cannot parse its `' header file. The option `-nodtk' can be used as a workaround. If GNU CC is not installed, it is therefore recommended to try ./configure CC="cc" and if that doesn't work, try ./configure CC="cc -nodtk" On Solaris, don't put `/usr/ucb' early in your `PATH'. This directory contains several dysfunctional programs; working variants of these programs are available in `/usr/bin'. So, if you need `/usr/ucb' in your `PATH', put it _after_ `/usr/bin'. On Haiku, software installed for all users goes in `/boot/common', not `/usr/local'. It is recommended to use the following options: ./configure --prefix=/boot/common Specifying the System Type ========================== There may be some features `configure' cannot figure out automatically, but needs to determine by the type of machine the package will run on. Usually, assuming the package is built to be run on the _same_ architectures, `configure' can figure that out, but if it prints a message saying it cannot guess the machine type, give it the `--build=TYPE' option. TYPE can either be a short name for the system type, such as `sun4', or a canonical name which has the form: CPU-COMPANY-SYSTEM where SYSTEM can have one of these forms: OS KERNEL-OS See the file `config.sub' for the possible values of each field. If `config.sub' isn't included in this package, then this package doesn't need to know the machine type. If you are _building_ compiler tools for cross-compiling, you should use the option `--target=TYPE' to select the type of system they will produce code for. If you want to _use_ a cross compiler, that generates code for a platform different from the build platform, you should specify the "host" platform (i.e., that on which the generated programs will eventually be run) with `--host=TYPE'. Sharing Defaults ================ If you want to set default values for `configure' scripts to share, you can create a site shell script called `config.site' that gives default values for variables like `CC', `cache_file', and `prefix'. `configure' looks for `PREFIX/share/config.site' if it exists, then `PREFIX/etc/config.site' if it exists. Or, you can set the `CONFIG_SITE' environment variable to the location of the site script. A warning: not all `configure' scripts look for a site script. Defining Variables ================== Variables not defined in a site shell script can be set in the environment passed to `configure'. However, some packages may run configure again during the build, and the customized values of these variables may be lost. In order to avoid this problem, you should set them in the `configure' command line, using `VAR=value'. For example: ./configure CC=/usr/local2/bin/gcc causes the specified `gcc' to be used as the C compiler (unless it is overridden in the site shell script). Unfortunately, this technique does not work for `CONFIG_SHELL' due to an Autoconf limitation. Until the limitation is lifted, you can use this workaround: CONFIG_SHELL=/bin/bash ./configure CONFIG_SHELL=/bin/bash `configure' Invocation ====================== `configure' recognizes the following options to control how it operates. `--help' `-h' Print a summary of all of the options to `configure', and exit. `--help=short' `--help=recursive' Print a summary of the options unique to this package's `configure', and exit. The `short' variant lists options used only in the top level, while the `recursive' variant lists options also present in any nested packages. `--version' `-V' Print the version of Autoconf used to generate the `configure' script, and exit. `--cache-file=FILE' Enable the cache: use and save the results of the tests in FILE, traditionally `config.cache'. FILE defaults to `/dev/null' to disable caching. `--config-cache' `-C' Alias for `--cache-file=config.cache'. `--quiet' `--silent' `-q' Do not print messages saying which checks are being made. To suppress all normal output, redirect it to `/dev/null' (any error messages will still be shown). `--srcdir=DIR' Look for the package's source code in directory DIR. Usually `configure' can determine that directory automatically. `--prefix=DIR' Use DIR as the installation prefix. *note Installation Names:: for more details, including other options available for fine-tuning the installation locations. `--no-create' `-n' Run the configure checks, but stop before creating any output files. `configure' also accepts some other, not widely useful, options. Run `configure --help' for more details. bruteforce-salted-openssl-1.3.3/Makefile.am000066400000000000000000000002721301655731600206550ustar00rootroot00000000000000AUTOMAKE_OPTIONS = subdir-objects bin_PROGRAMS = bruteforce-salted-openssl bruteforce_salted_openssl_SOURCES = src/bruteforce-salted-openssl.c man_MANS = doc/bruteforce-salted-openssl.1 bruteforce-salted-openssl-1.3.3/NEWS000066400000000000000000000002751301655731600173230ustar00rootroot00000000000000Version 1.3.3 2016-11-27 Version 1.3.2 2016-09-26 Version 1.3.1 2016-09-25 Version 1.3.0 2016-06-06 Version 1.2 2015-03-11 Version 1.1 2014-07-04 Version 1.0 2014-06-19 bruteforce-salted-openssl-1.3.3/README000066400000000000000000000123461301655731600175060ustar00rootroot00000000000000bruteforce-salted-openssl ========================= The purpose of this program is to try to find the password of a file that was encrypted with the 'openssl' command (e.g.: openssl enc -aes256 -salt -in clear.file -out encrypted.file). It can be used in two ways: - try all the possible passwords given a charset - try all the passwords in a file There is a command line option to specify the number of threads to use. The program should be able to use all the digests and symmetric ciphers available with the OpenSSL libraries installed on your system. Sending a USR1 signal to a running bruteforce-salted-openssl process makes it print progress and continue. ## Exhaustive mode The program tries to decrypt the file by trying all the possible passwords. It is especially useful if you know something about the password (i.e. you forgot a part of your password but still remember most of it). Finding the password of the file without knowing anything about it would take way too much time (unless the password is really short and/or weak). There are command line options to specify: - the minimum password length to try - the maximum password length to try - the beginning of the password - the end of the password - the character set to use (among the characters of the current locale) ## Dictionary mode The program tries to decrypt the file by trying all the passwords contained in a file. The file must have one password per line. ## Dependencies The program requires the OpenSSL libraries. ## Compilation If you are building from the raw sources, you must first generate the configuration script: ./autogen.sh Then, build the program with the commands: ./configure make To install it on your system, use the command: make install ## Available options -1 Stop the program after finding the first password candidate. -a List the available cipher and digest algorithms. -B Search using binary passwords (instead of character passwords). Write candidates to . -b Beginning of the password. default: "" -c Cipher for decryption. default: aes-256-cbc -d Digest for key and initialization vector generation. default: md5 -e End of the password. default: "" -f Read the passwords from a file instead of generating them. -h Show help and quit. -L Limit the maximum number of tested passwords to . -l Minimum password length (beginning and end included). default: 1 -M Consider the decryption as successful when the data starts with . Without this option, the decryption is considered as successful when the data contains mostly printable ASCII characters (at least 90%). -m Maximum password length (beginning and end included). default: 8 -N Ignore decryption errors (similar to openssl -nopad). -p Print a message every passwords tested. -s Password character set. default: "0123456789ABCDEFGHIJKLMNOPQRSTU VWXYZabcdefghijklmnopqrstuvwxyz" -t Number of threads to use. default: 1 ## Limitations The program considers decrypted data as correct if it is mainly composed of printable ASCII characters (at least 90%). If the file you want to decrypt doesn't contain plain text, you will have to either use the -M option, or modify the 'valid_data' function in the source code to match your needs. If the file you want to decrypt is big, you should use the -N option on a truncated version of the file (to avoid decrypting the whole file with each password). ## Examples Try to find the password of an aes256 encrypted file using 4 threads, trying only passwords with 5 characters: bruteforce-salted-openssl -t 4 -l 5 -m 5 -c aes256 encrypted.file Try to find the password of an aes256 encrypted file using 4 threads, trying only passwords with 5 characters and print the password currently tried every 100000 attempts: bruteforce-salted-openssl -t 4 -l 5 -m 5 -c aes256 -p 100000 encrypted.file Try to find the password of a des3 encrypted file using 8 threads, trying only passwords with 9 to 11 characters, beginning with "AbCD", ending with "Ef", and containing only letters: bruteforce-salted-openssl -t 8 -l 9 -m 11 -c des3 -b "AbCD" -e "Ef" \ -s "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz" encrypted.file Try to find the password of an aes256 encrypted file using 6 threads, trying the passwords contained in a dictionary file: bruteforce-salted-openssl -t 6 -f dictionary.txt -c aes256 encrypted-file Show the list of available algorithms: bruteforce-salted-openssl -a If the program finds a candidate password 'pwd', you can decrypt the data using the 'openssl' command: openssl enc -d -aes256 -salt -in encrypted.file -out decrypted.file -k pwd ## Donations If you find this program useful and want to make a donation, you can send coins to one of the following addresses: - Peercoin: PWFNV1Cvq7nQBRyRueuYzwmDNXUGpgNkBC - Bitcoin: 1F1ZfM7XtggHsShK4vwuy9zv98a9wt7nXx bruteforce-salted-openssl-1.3.3/README.md000077700000000000000000000000001301655731600207522READMEustar00rootroot00000000000000bruteforce-salted-openssl-1.3.3/autogen.sh000077500000000000000000000001251301655731600206170ustar00rootroot00000000000000#!/bin/sh set -e SRCDIR="$(dirname $0)" cd "${SRCDIR}" autoreconf --install --force bruteforce-salted-openssl-1.3.3/configure.ac000066400000000000000000000023101301655731600211020ustar00rootroot00000000000000dnl Process this file with autoconf AC_INIT(bruteforce_salted_openssl, 1.3.3) AM_INIT_AUTOMAKE AC_CONFIG_SRCDIR(src/bruteforce-salted-openssl.c) dnl Check for toolchain and install components AC_PROG_CC AC_PROG_INSTALL dnl Check for standard headers AC_CHECK_HEADERS([ctype.h fcntl.h locale.h math.h stdio.h stdlib.h string.h sys/stat.h sys/types.h time.h unistd.h wchar.h]) dnl Check for functions AC_CHECK_FUNCS([calloc malloc realloc free]) AC_CHECK_FUNCS([perror printf fprintf]) AC_CHECK_FUNCS([atoi atol isprint isspace]) AC_CHECK_FUNCS([memset strcasecmp strlen strncmp strncpy]) AC_CHECK_FUNCS([setlocale mbstowcs wcsncpy wcstombs]) AC_CHECK_FUNCS([open fstat read close]) AC_CHECK_FUNCS([getopt]) AC_CHECK_FUNCS([signal]) AC_CHECK_FUNCS([time]) dnl Check for libraries AC_CHECK_LIB(m, pow, [], AC_MSG_ERROR([math library required])) AC_CHECK_LIB(pthread, pthread_create, [], AC_MSG_ERROR([POSIX threads library required])) AC_CHECK_HEADERS(pthread.h, [], AC_MSG_ERROR([POSIX threads headers required])) AC_CHECK_LIB(crypto, EVP_get_cipherbyname, [], AC_MSG_ERROR([OpenSSL libraries required])) AC_CHECK_HEADERS(openssl/evp.h, [], AC_MSG_ERROR([OpenSSL headers required])) AC_CONFIG_FILES(Makefile) AC_OUTPUT bruteforce-salted-openssl-1.3.3/contrib/000077500000000000000000000000001301655731600202605ustar00rootroot00000000000000bruteforce-salted-openssl-1.3.3/contrib/gentoo/000077500000000000000000000000001301655731600215535ustar00rootroot00000000000000bruteforce-salted-openssl-1.3.3/contrib/gentoo/app-crypt/000077500000000000000000000000001301655731600234725ustar00rootroot00000000000000bruteforce-salted-openssl-1.3.3/contrib/gentoo/app-crypt/bruteforce-salted-openssl/000077500000000000000000000000001301655731600305655ustar00rootroot00000000000000bruteforce-salted-openssl-1.0.ebuild000066400000000000000000000010641301655731600372640ustar00rootroot00000000000000bruteforce-salted-openssl-1.3.3/contrib/gentoo/app-crypt/bruteforce-salted-openssl# Copyright 2014 Guillaume LE VAILLANT # Distributed under the terms of the GNU General Public License v3 EAPI="5" inherit eutils autotools DESCRIPTION="A bruteforce cracker for openssl encrypted files." HOMEPAGE="https://github.com/glv2/${PN}" SRC_URI="https://github.com/glv2/${PN}/archive/${PV}.tar.gz -> ${P}.tar.gz" LICENSE="GPL-3" SLOT="0" KEYWORDS="~amd64 ~arm ~x86" DEPEND="dev-libs/openssl" RDEPEND="${DEPEND}" src_prepare() { eautoreconf } src_configure() { econf } src_install() { dobin "${PN}" dodoc AUTHORS ChangeLog COPYING NEWS README } bruteforce-salted-openssl-1.1.ebuild000066400000000000000000000010641301655731600372650ustar00rootroot00000000000000bruteforce-salted-openssl-1.3.3/contrib/gentoo/app-crypt/bruteforce-salted-openssl# Copyright 2014 Guillaume LE VAILLANT # Distributed under the terms of the GNU General Public License v3 EAPI="5" inherit eutils autotools DESCRIPTION="A bruteforce cracker for openssl encrypted files." HOMEPAGE="https://github.com/glv2/${PN}" SRC_URI="https://github.com/glv2/${PN}/archive/${PV}.tar.gz -> ${P}.tar.gz" LICENSE="GPL-3" SLOT="0" KEYWORDS="~amd64 ~arm ~x86" DEPEND="dev-libs/openssl" RDEPEND="${DEPEND}" src_prepare() { eautoreconf } src_configure() { econf } src_install() { dobin "${PN}" dodoc AUTHORS ChangeLog COPYING NEWS README } bruteforce-salted-openssl-1.2.ebuild000066400000000000000000000010711301655731600372640ustar00rootroot00000000000000bruteforce-salted-openssl-1.3.3/contrib/gentoo/app-crypt/bruteforce-salted-openssl# Copyright 2014-2015 Guillaume LE VAILLANT # Distributed under the terms of the GNU General Public License v3 EAPI="5" inherit eutils autotools DESCRIPTION="A bruteforce cracker for openssl encrypted files." HOMEPAGE="https://github.com/glv2/${PN}" SRC_URI="https://github.com/glv2/${PN}/archive/${PV}.tar.gz -> ${P}.tar.gz" LICENSE="GPL-3" SLOT="0" KEYWORDS="~amd64 ~arm ~x86" DEPEND="dev-libs/openssl" RDEPEND="${DEPEND}" src_prepare() { eautoreconf } src_configure() { econf } src_install() { dobin "${PN}" dodoc AUTHORS ChangeLog COPYING NEWS README } bruteforce-salted-openssl-1.3.0.ebuild000066400000000000000000000010711301655731600374230ustar00rootroot00000000000000bruteforce-salted-openssl-1.3.3/contrib/gentoo/app-crypt/bruteforce-salted-openssl# Copyright 2014-2015 Guillaume LE VAILLANT # Distributed under the terms of the GNU General Public License v3 EAPI="5" inherit eutils autotools DESCRIPTION="A bruteforce cracker for openssl encrypted files." HOMEPAGE="https://github.com/glv2/${PN}" SRC_URI="https://github.com/glv2/${PN}/archive/${PV}.tar.gz -> ${P}.tar.gz" LICENSE="GPL-3" SLOT="0" KEYWORDS="~amd64 ~arm ~x86" DEPEND="dev-libs/openssl" RDEPEND="${DEPEND}" src_prepare() { eautoreconf } src_configure() { econf } src_install() { dobin "${PN}" dodoc AUTHORS ChangeLog COPYING NEWS README } bruteforce-salted-openssl-1.3.1.ebuild000066400000000000000000000010711301655731600374240ustar00rootroot00000000000000bruteforce-salted-openssl-1.3.3/contrib/gentoo/app-crypt/bruteforce-salted-openssl# Copyright 2014-2016 Guillaume LE VAILLANT # Distributed under the terms of the GNU General Public License v3 EAPI="5" inherit eutils autotools DESCRIPTION="A bruteforce cracker for openssl encrypted files." HOMEPAGE="https://github.com/glv2/${PN}" SRC_URI="https://github.com/glv2/${PN}/archive/${PV}.tar.gz -> ${P}.tar.gz" LICENSE="GPL-3" SLOT="0" KEYWORDS="~amd64 ~arm ~x86" DEPEND="dev-libs/openssl" RDEPEND="${DEPEND}" src_prepare() { eautoreconf } src_configure() { econf } src_install() { dobin "${PN}" dodoc AUTHORS ChangeLog COPYING NEWS README } bruteforce-salted-openssl-1.3.2.ebuild000066400000000000000000000010641301655731600374270ustar00rootroot00000000000000bruteforce-salted-openssl-1.3.3/contrib/gentoo/app-crypt/bruteforce-salted-openssl# Copyright 2014-2016 Guillaume LE VAILLANT # Distributed under the terms of the GNU General Public License v3 EAPI="5" inherit eutils autotools DESCRIPTION="A bruteforce cracker for openssl encrypted files." HOMEPAGE="https://github.com/glv2/${PN}" SRC_URI="https://github.com/glv2/${PN}/archive/${PV}.tar.gz -> ${P}.tar.gz" LICENSE="GPL-3" SLOT="0" KEYWORDS="~amd64 ~arm ~x86" DEPEND="dev-libs/openssl" RDEPEND="${DEPEND}" src_prepare() { eautoreconf } src_configure() { econf } src_install() { einstall dodoc AUTHORS ChangeLog COPYING NEWS README } bruteforce-salted-openssl-1.3.3.ebuild000066400000000000000000000010641301655731600374300ustar00rootroot00000000000000bruteforce-salted-openssl-1.3.3/contrib/gentoo/app-crypt/bruteforce-salted-openssl# Copyright 2014-2016 Guillaume LE VAILLANT # Distributed under the terms of the GNU General Public License v3 EAPI="5" inherit eutils autotools DESCRIPTION="A bruteforce cracker for openssl encrypted files." HOMEPAGE="https://github.com/glv2/${PN}" SRC_URI="https://github.com/glv2/${PN}/archive/${PV}.tar.gz -> ${P}.tar.gz" LICENSE="GPL-3" SLOT="0" KEYWORDS="~amd64 ~arm ~x86" DEPEND="dev-libs/openssl" RDEPEND="${DEPEND}" src_prepare() { eautoreconf } src_configure() { econf } src_install() { einstall dodoc AUTHORS ChangeLog COPYING NEWS README } bruteforce-salted-openssl-1.3.3/doc/000077500000000000000000000000001301655731600173655ustar00rootroot00000000000000bruteforce-salted-openssl-1.3.3/doc/bruteforce-salted-openssl.1000066400000000000000000000140421301655731600245430ustar00rootroot00000000000000.\" Text automatically generated by txt2man .TH bruteforce-salted-openssl 1 "25 Sep 2016" "bruteforced-salted-openssl-1.3.1" "try to find the passphrase for files encrypted with OpenSSL" .SH NAME \fBbruteforce-salted-openssl \fP- try to find the passphrase for files encrypted with OpenSSL \fB .SH SYNOPSIS .nf .fam C \fBbruteforce-salted-openssl\fP [\fIoptions\fP] .fam T .fi .fam T .fi .SH DESCRIPTION \fBbruteforce-salted-openssl\fP tries to find the passphrase or password of a file that was encrypted with the openssl command. It can be used in two ways: .RS .IP \(bu 3 Try all the possible passwords given a charset. .IP \(bu 3 Try all the passwords in a file (dictionary). .RE .PP \fBbruteforce-salted-openssl\fP has the following features: .RS .IP \(bu 3 You can specify the number of threads to use when cracking a file. .IP \(bu 3 The program should be able to use all the digests and symmetric ciphers available with the OpenSSL libraries installed on your system. .IP \(bu 3 Sending a USR1 signal to a running \fBbruteforce-salted-openssl\fP process makes it print progress and continue. .IP \(bu 3 There are an exhaustive mode and a dictionary mode. .RE .PP In the exhaustive mode the program tries to decrypt the file by trying all possible passwords. It is especially useful if you know something about the password (i.e. you forgot a part of your password but still remember most of it). Finding the password of the file without knowing anything about it would take way too much time (unless the password is really short and/or weak). There are some command line \fIoptions\fP to specify: .RS .IP \(bu 3 The minimum password length to try. .IP \(bu 3 The maximum password length to try. .IP \(bu 3 The beginning of the password. .IP \(bu 3 The end of the password. .IP \(bu 3 The character set to use (among the characters of the current locale). .RE .PP In dictionary mode the program tries to decrypt the file by trying all the passwords contained in a file. The file must have one password per line. .SH OPTIONS .TP .B \fB-1\fP Stop the program after finding the first password candidate. .TP .B \fB-a\fP List the available cipher and digest algorithms. .TP .B \fB-B\fP Search using binary passwords (instead of character passwords). Write candidates to . .TP .B \fB-b\fP Beginning of the password. The default value is "". .TP .B \fB-c\fP Cipher for decryption. The default value is aes-256-cbc. .TP .B \fB-d\fP Digest for key and initialization vector generation. Default: md5. .TP .B \fB-e\fP End of the password. Default: "". .TP .B \fB-f\fP Read the passwords from a file instead of generating them. .TP .B \fB-h\fP Show help and quit. .TP .B \fB-L\fP Limit the maximum number of tested passwords to . .TP .B \fB-l\fP Minimum password length (beginning and end included). Default: 1. .TP .B \fB-M\fP Consider the decryption as successful when the data starts with . Without this option, the decryption is considered as successful when the data contains mostly printable ASCII characters (at least 90%). .TP .B \fB-m\fP Maximum password length (beginning and end included). Default: 8. .TP .B \fB-N\fP Ignore decryption errors (similar to openssl \fB-nopad\fP). .TP .B \fB-p\fP Print a message every passwords tested. .TP .B \fB-s\fP Password character set. Default value is "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz" .TP .B \fB-t\fP Number of threads to use. Default: 1. .PP Note: Sending a USR1 signal to a running \fBbruteforce-salted-openssl\fP process makes it print progress info to standard error and continue. .SH LIMITATIONS The program considers decrypted data as correct if it is mainly composed of printable ASCII characters (at least 90%). If the file you want to decrypt doesn't contain plain text, you will have to either use the \fB-M\fP option, or modify the 'valid_data' function in the source code to match your needs. .PP If the file you want to decrypt is big, you should use the \fB-N\fP option on a truncated version of the file (to avoid decrypting the whole file with each password). .SH EXAMPLES Try to find the password of an aes256 encrypted file using 4 threads, trying only passwords with 5 characters: .PP .nf .fam C $ bruteforce-salted-openssl -t 4 -l 5 -m 5 -c aes256 encrypted.file .fam T .fi Try to find the password of an aes256 encrypted file using 4 threads, trying only passwords with 5 characters and print the password currently tried every 100000 attempts: .PP .nf .fam C $ bruteforce-salted-openssl -t 4 -l 5 -m 5 -c aes256 -p 100000 encrypted.file .fam T .fi Try to find the password of a des3 encrypted file using 8 threads, trying only passwords with 9 to 11 characters, beginning with "AbCD", ending with "Ef", and containing only letters: .PP .nf .fam C $ bruteforce-salted-openssl -t 8 -l 9 -m 11 -c des3 -b "AbCD" -e "Ef" -s "ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz" encrypted.file .fam T .fi Try to find the password of an aes256 encrypted file using 6 threads, trying the passwords contained in a dictionary file: .PP .nf .fam C $ bruteforce-salted-openssl -t 6 -f dictionary.txt -c aes256 encrypted-file .fam T .fi Show the list of available algorithms: .PP .nf .fam C $ bruteforce-salted-openssl -a .fam T .fi If the program finds a candidate password 'pwd', you can decrypt the data using the 'openssl' command: .PP .nf .fam C $ openssl enc -d -aes256 -salt -in encrypted.file -out decrypted.file -k pwd .fam T .fi .SH DONATIONS If you find this program useful and want to make a donation, you can send coins to one of the following addresses: .IP \(bu 3 Peercoin: PWFNV1Cvq7nQBRyRueuYzwmDNXUGpgNkBC .IP \(bu 3 Bitcoin: 1F1ZfM7XtggHsShK4vwuy9zv98a9wt7nXx .SH AUTHOR \fBbruteforce-salted-openssl\fP was written by Guillaume LE VAILLANT. For contact, use the email or go to https://github.com/glv2/\fBbruteforce-salted-openssl\fP. .PP This manual page was written by Joao Eriberto Mota Filho for the Debian project (but may be used by others). bruteforce-salted-openssl-1.3.3/src/000077500000000000000000000000001301655731600174075ustar00rootroot00000000000000bruteforce-salted-openssl-1.3.3/src/bruteforce-salted-openssl.c000066400000000000000000001017201301655731600246470ustar00rootroot00000000000000/* This file is part of bruteforce-salted-openssl, a program trying to bruteforce a file encrypted (with salt) by openssl. Copyright 2014-2016 Guillaume LE VAILLANT This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see . Additional permission under GNU GPL version 3 section 7 If you modify this program, or any covered work, by linking or combining it with the OpenSSL library (or a modified version of that library), containing parts covered by the terms of the OpenSSL license, the licensors of this program grant you additional permission to convey the resulting work. Corresponding source for a non-source form of such a combination shall include the source code for the parts of the OpenSSL library used as well as that of the covered work. */ #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include "version.h" #define LAST_PASS_MAX_SHOWN_LENGTH 256 unsigned char *default_charset = "0123456789ABCDEFGHIJKLMNOPQRSTUVWXYZabcdefghijklmnopqrstuvwxyz"; /* 0x00 is not included as passwords are null terminated */ unsigned char *binary_charset = "\x01\x02\x03\x04\x05\x06\x07\x08\x09\x0A\x0B\x0C\x0D\x0E\x0F" "\x10\x11\x12\x13\x14\x15\x16\x17\x18\x19\x1A\x1B\x1C\x1D\x1E\x1F" "\x20\x21\x22\x23\x24\x25\x26\x27\x28\x29\x2A\x2B\x2C\x2D\x2E\x2F" "\x30\x31\x32\x33\x34\x35\x36\x37\x38\x39\x3A\x3B\x3C\x3D\x3E\x3F" "\x40\x41\x42\x43\x44\x45\x46\x47\x48\x49\x4A\x4B\x4C\x4D\x4E\x4F" "\x50\x51\x52\x53\x54\x55\x56\x57\x58\x59\x5A\x5B\x5C\x5D\x5E\x5F" "\x60\x61\x62\x63\x64\x65\x66\x67\x68\x69\x6A\x6B\x6C\x6D\x6E\x6F" "\x70\x71\x72\x73\x74\x75\x76\x77\x78\x79\x7A\x7B\x7C\x7D\x7E\x7F" "\x80\x81\x82\x83\x84\x85\x86\x87\x88\x89\x8A\x8B\x8C\x8D\x8E\x8F" "\x90\x91\x92\x93\x94\x95\x96\x97\x98\x99\x9A\x9B\x9C\x9D\x9E\x9F" "\xA0\xA1\xA2\xA3\xA4\xA5\xA6\xA7\xA8\xA9\xAA\xAB\xAC\xAD\xAE\xAF" "\xB0\xB1\xB2\xB3\xB4\xB5\xB6\xB7\xB8\xB9\xBA\xBB\xBC\xBD\xBE\xBF" "\xC0\xC1\xC2\xC3\xC4\xC5\xC6\xC7\xC8\xC9\xCA\xCB\xCC\xCD\xCE\xCF" "\xD0\xD1\xD2\xD3\xD4\xD5\xD6\xD7\xD8\xD9\xDA\xDB\xDC\xDD\xDE\xDF" "\xE0\xE1\xE2\xE3\xE4\xE5\xE6\xE7\xE8\xE9\xEA\xEB\xEC\xED\xEE\xEF" "\xF0\xF1\xF2\xF3\xF4\xF5\xF6\xF7\xF8\xF9\xFA\xFB\xFC\xFD\xFE\xFF"; unsigned char *path = NULL, *data = NULL, salt[8], *binary = NULL, *magic = NULL; wchar_t *charset = NULL, *prefix = NULL, *suffix = NULL; unsigned int charset_len, data_len = 0, min_len = 1, max_len = 8, prefix_len = 0, suffix_len = 0; FILE *dictionary = NULL; const EVP_CIPHER *cipher = NULL; const EVP_MD *digest = NULL; pthread_mutex_t found_password_lock, dictionary_lock; char stop = 0, only_one_password = 0, found_password = 0, no_error = 0; unsigned int nb_threads = 1; unsigned long long int limit = 0, print = 0, count_limit = 0, count_print = 0; unsigned char last_pass[LAST_PASS_MAX_SHOWN_LENGTH]; time_t start_time; struct decryption_func_locals { unsigned int index_start; unsigned int index_end; unsigned long long int counter; } *thread_locals; /* * Statistics */ void handle_signal(int signo) { unsigned long long int total_ops = 0; unsigned int i, l; unsigned int l_full = max_len - suffix_len - prefix_len; unsigned int l_skip = min_len - suffix_len - prefix_len; double space = 0; time_t current_time; current_time = time(NULL); if(dictionary == NULL) for(l = l_skip; l <= l_full; l++) space += pow(charset_len, l); for(i = 0; i < nb_threads; i++) total_ops += thread_locals[i].counter; fprintf(stderr, "Tried passwords: %llu\n", total_ops); fprintf(stderr, "Tried passwords per second: %lf\n", (double) total_ops / (current_time - start_time)); fprintf(stderr, "Last tried password: %s\n", last_pass); if(dictionary == NULL) fprintf(stderr, "Total space searched: %lf%%\n", (total_ops / space) * 100); } /* * Decryption */ int valid_data(unsigned char *data, unsigned int len) { unsigned int i, trigger; unsigned char c; unsigned int bad = 0; /* Consider the decrypted data as invalid if there is more than 10% of not printable characters */ trigger = len / 10; /* Count the number of not printable characters */ for(i = 0; i < len; i++) { c = data[i]; if(!isprint(c) && !isspace(c)) { bad++; if(bad > trigger) return(0); } } return(1); } /* The decryption_func thread function tests all the passwords of the form: * prefix + x + combination + suffix * where x is a character in the range charset[dfargs.index_start] -> charset[dfargs.index_end]. */ void * decryption_func(void *arg) { struct decryption_func_locals *dfargs; wchar_t *password; unsigned char *pwd, *key, *iv, *out; unsigned int password_len, pwd_len, index_start, index_end, len, out_len1, out_len2, i, j, k; int ret, found; unsigned int *tab; EVP_CIPHER_CTX *ctx; dfargs = (struct decryption_func_locals *) arg; index_start = dfargs->index_start; index_end = dfargs->index_end; key = (unsigned char *) malloc(EVP_CIPHER_key_length(cipher)); iv = (unsigned char *) malloc(EVP_CIPHER_iv_length(cipher)); out = (unsigned char *) malloc(data_len + EVP_CIPHER_block_size(cipher)); ctx = EVP_CIPHER_CTX_new(); if((key == NULL) || (iv == NULL) || (out == NULL) || (ctx == NULL)) { fprintf(stderr, "Error: memory allocation failed.\n\n"); exit(EXIT_FAILURE); } /* For every possible length */ for(len = min_len - prefix_len - 1 - suffix_len; len + 1 <= max_len - prefix_len - suffix_len; len++) { /* For every first character in the range we were given */ for(k = index_start; k <= index_end; k++) { password_len = prefix_len + 1 + len + suffix_len; password = (wchar_t *) calloc(password_len + 1, sizeof(wchar_t)); tab = (unsigned int *) calloc(len + 1, sizeof(unsigned int)); if((password == NULL) || (tab == NULL)) { fprintf(stderr, "Error: memory allocation failed.\n\n"); exit(EXIT_FAILURE); } wcsncpy(password, prefix, prefix_len); password[prefix_len] = charset[k]; wcsncpy(password + prefix_len + 1 + len, suffix, suffix_len); password[password_len] = '\0'; for(i = 0; i <= len; i++) tab[i] = 0; /* Test all the combinations */ while((tab[len] == 0) && (stop == 0)) { for(i = 0; i < len; i++) password[prefix_len + 1 + i] = charset[tab[len - 1 - i]]; pwd_len = wcstombs(NULL, password, 0); pwd = (unsigned char *) malloc(pwd_len + 1); if(pwd == NULL) { fprintf(stderr, "Error: memory allocation failed.\n\n"); exit(EXIT_FAILURE); } wcstombs(pwd, password, pwd_len + 1); snprintf(last_pass, LAST_PASS_MAX_SHOWN_LENGTH, "%s", pwd); /* Decrypt data with password */ EVP_BytesToKey(cipher, digest, salt, pwd, pwd_len, 1, key, iv); EVP_DecryptInit(ctx, cipher, key, iv); EVP_DecryptUpdate(ctx, out, &out_len1, data, data_len); ret = EVP_DecryptFinal(ctx, out + out_len1, &out_len2); dfargs->counter++; if(no_error || (ret == 1)) { if(magic == NULL) found = valid_data(out, out_len1 + out_len2); else found = !strncmp(out, magic, strlen(magic)); } else found = 0; if(found) { /* We have a positive result */ handle_signal(SIGUSR1); /* Print some stats */ pthread_mutex_lock(&found_password_lock); found_password++; printf("Password candidate: %ls\n", password); if(only_one_password) stop = 1; pthread_mutex_unlock(&found_password_lock); } EVP_CIPHER_CTX_cleanup(ctx); if(print > 0) { pthread_mutex_lock(&found_password_lock); count_print++; if(count_print >= print) { fprintf(stderr, "Just tested password: %ls\n", password); count_print = 0; } pthread_mutex_unlock(&found_password_lock); } if(limit > 0) { pthread_mutex_lock(&found_password_lock); count_limit++; if(count_limit >= limit) { fprintf(stderr, "Maximum number of passphrases tested, aborting.\n"); stop = 1; } pthread_mutex_unlock(&found_password_lock); } free(pwd); if(len == 0) break; tab[0]++; if(tab[0] == charset_len) tab[0] = 0; j = 0; while(tab[j] == 0) { j++; tab[j]++; if((j < len) && (tab[j] == charset_len)) tab[j] = 0; } } free(tab); free(password); } } EVP_CIPHER_CTX_free(ctx); free(out); free(iv); free(key); pthread_exit(NULL); } void * decryption_func_binary(void *arg) { struct decryption_func_locals *dfargs; unsigned char *pwd, *key, *iv, *out; unsigned int pwd_len, index_start, index_end, len, out_len1, out_len2, i, j, k; int ret, found; unsigned int *tab; EVP_CIPHER_CTX *ctx; int fd; char outfile[128]; dfargs = (struct decryption_func_locals *) arg; index_start = dfargs->index_start; index_end = dfargs->index_end; key = (unsigned char *) malloc(EVP_CIPHER_key_length(cipher)); iv = (unsigned char *) malloc(EVP_CIPHER_iv_length(cipher)); out = (unsigned char *) malloc(data_len + EVP_CIPHER_block_size(cipher)); ctx = EVP_CIPHER_CTX_new(); if((key == NULL) || (iv == NULL) || (out == NULL) || (ctx == NULL)) { fprintf(stderr, "Error: memory allocation failed.\n\n"); exit(EXIT_FAILURE); } /* For every possible length */ for(len = min_len - prefix_len - 1 - suffix_len; len + 1 <= max_len - prefix_len - suffix_len; len++) { /* For every first character in the range we were given */ for(k = index_start; k <= index_end; k++) { pwd_len = prefix_len + 1 + len + suffix_len; pwd = (unsigned char *) calloc(pwd_len + 1, sizeof(unsigned char)); tab = (unsigned int *) calloc(len + 1, sizeof(unsigned int)); if((pwd == NULL) || (tab == NULL)) { fprintf(stderr, "Error: memory allocation failed.\n\n"); exit(EXIT_FAILURE); } wcstombs(pwd, prefix, prefix_len); pwd[prefix_len] = binary_charset[k]; wcstombs(pwd + prefix_len + 1 + len, suffix, suffix_len); pwd[pwd_len] = '\0'; for(i = 0; i <= len; i++) tab[i] = 0; /* Test all the combinations */ while((tab[len] == 0) && (stop == 0)) { for(i = 0; i < len; i++) pwd[prefix_len + 1 + i] = binary_charset[tab[len - 1 - i]]; /* Decrypt data with password */ EVP_BytesToKey(cipher, digest, salt, pwd, pwd_len, 1, key, iv); EVP_DecryptInit(ctx, cipher, key, iv); EVP_DecryptUpdate(ctx, out, &out_len1, data, data_len); ret = EVP_DecryptFinal(ctx, out + out_len1, &out_len2); dfargs->counter++; if(no_error || (ret == 1)) { if(magic == NULL) found = valid_data(out, out_len1 + out_len2); else found = !strncmp(out, magic, strlen(magic)); } else found = 0; if(found) { /* We have a positive result */ handle_signal(SIGUSR1); /* Print some stats */ pthread_mutex_lock(&found_password_lock); sprintf(outfile, "%s-%d", binary, found_password); found_password++; fd = open(outfile, O_WRONLY | O_CREAT | O_TRUNC, S_IRUSR | S_IWUSR); if(fd == -1) perror("open file"); else { printf("Password candidate saved to file: %s\n", outfile); ret = write(fd, pwd, pwd_len); close(fd); } if(only_one_password) stop = 1; pthread_mutex_unlock(&found_password_lock); } EVP_CIPHER_CTX_cleanup(ctx); if(limit > 0) { pthread_mutex_lock(&found_password_lock); count_limit++; if(count_limit >= limit) { fprintf(stderr, "Maximum number of passwords tested, aborting.\n"); stop = 1; } pthread_mutex_unlock(&found_password_lock); } if(len == 0) break; tab[0]++; if(tab[0] == charset_len) tab[0] = 0; j = 0; while(tab[j] == 0) { j++; tab[j]++; if((j < len) && (tab[j] == charset_len)) tab[j] = 0; } } free(tab); free(pwd); } } EVP_CIPHER_CTX_free(ctx); free(out); free(iv); free(key); pthread_exit(NULL); } int read_dictionary_line(unsigned char **line, unsigned int *n) { unsigned int size; int ret; *n = 0; size = 32; *line = (unsigned char *) malloc(size); if(*line == NULL) { fprintf(stderr, "Error: memory allocation failed.\n\n"); exit(EXIT_FAILURE); } pthread_mutex_lock(&dictionary_lock); while(1) { ret = fgetc(dictionary); if(ret == EOF) { if(*n == 0) { free(*line); *line = NULL; pthread_mutex_unlock(&dictionary_lock); return(0); } else break; } if((ret == '\r') || (ret == '\n')) { if(*n == 0) continue; else break; } (*line)[*n] = (unsigned char) ret; (*n)++; if(*n == size) { size *= 2; *line = (unsigned char *) realloc(*line, size); if(*line == NULL) { fprintf(stderr, "Error: memory allocation failed.\n\n"); pthread_mutex_unlock(&dictionary_lock); exit(EXIT_FAILURE); } } } pthread_mutex_unlock(&dictionary_lock); (*line)[*n] = '\0'; return(1); } void * decryption_func_dictionary(void *arg) { struct decryption_func_locals *dfargs; unsigned char *pwd, *key, *iv, *out; unsigned int pwd_len, len, out_len1, out_len2; int ret, found; EVP_CIPHER_CTX *ctx; dfargs = (struct decryption_func_locals *) arg; key = (unsigned char *) malloc(EVP_CIPHER_key_length(cipher)); iv = (unsigned char *) malloc(EVP_CIPHER_iv_length(cipher)); out = (unsigned char *) malloc(data_len + EVP_CIPHER_block_size(cipher)); ctx = EVP_CIPHER_CTX_new(); if((key == NULL) || (iv == NULL) || (out == NULL) || (ctx == NULL)) { fprintf(stderr, "Error: memory allocation failed.\n\n"); exit(EXIT_FAILURE); } do { ret = read_dictionary_line(&pwd, &pwd_len); if(ret == 0) break; snprintf(last_pass, LAST_PASS_MAX_SHOWN_LENGTH, "%s", pwd); /* Decrypt data with password */ EVP_BytesToKey(cipher, digest, salt, pwd, pwd_len, 1, key, iv); EVP_DecryptInit(ctx, cipher, key, iv); EVP_DecryptUpdate(ctx, out, &out_len1, data, data_len); ret = EVP_DecryptFinal(ctx, out + out_len1, &out_len2); dfargs->counter++; if(no_error || (ret == 1)) { if(magic == NULL) found = valid_data(out, out_len1 + out_len2); else found = !strncmp(out, magic, strlen(magic)); } else found = 0; if(found) { /* We have a positive result */ handle_signal(SIGUSR1); /* Print some stats */ pthread_mutex_lock(&found_password_lock); found_password++; printf("Password candidate: %s\n", pwd); if(only_one_password) stop = 1; pthread_mutex_unlock(&found_password_lock); } EVP_CIPHER_CTX_cleanup(ctx); if(print > 0) { pthread_mutex_lock(&found_password_lock); count_print++; if(count_print >= print) { fprintf(stderr, "Just tested password: %s\n", pwd); count_print = 0; } pthread_mutex_unlock(&found_password_lock); } if(limit > 0) { pthread_mutex_lock(&found_password_lock); count_limit++; if(count_limit >= limit) { fprintf(stderr, "Maximum number of passphrases tested, aborting.\n"); stop = 1; } pthread_mutex_unlock(&found_password_lock); } free(pwd); } while(stop == 0); EVP_CIPHER_CTX_free(ctx); free(out); free(iv); free(key); pthread_exit(NULL); } /* * Main */ void list_ciphers(const EVP_CIPHER *c, const char *from, const char *to, void *arg) { static char *last = NULL; char *current; if(c) { current = (char *) EVP_CIPHER_name(c); if(last == NULL) last = current; else if(strcasecmp(last, current) >= 0) return; else last = current; fprintf(stderr, " %s\n", current); } else if(from && to) { current = (char *) from; if(last == NULL) last = current; else if(strcasecmp(last, from) >= 0) return; else last = (char *) from; fprintf(stderr, " %s => %s\n", from, to); } } void list_digests(const EVP_MD *d, const char *from, const char *to, void *arg) { static char *last = NULL; char *current; if(d) { current = (char *) EVP_MD_name(d); if(last == NULL) last = current; else if(strcasecmp(last, current) >= 0) return; else last = current; fprintf(stderr, " %s\n", current); } else if(from && to) { current = (char *) from; if(last == NULL) last = current; else if(strcasecmp(last, from) >= 0) return; else last = (char *) from; fprintf(stderr, " %s => %s\n", from, to); } } void usage(char *progname) { fprintf(stderr, "\nbruteforce-salted-openssl %s\n\n", VERSION_NUMBER); fprintf(stderr, "Usage: %s [options] \n\n", progname); fprintf(stderr, "Options:\n"); fprintf(stderr, " -1 Stop the program after finding the first password candidate.\n\n"); fprintf(stderr, " -a List the available cipher and digest algorithms.\n\n"); fprintf(stderr, " -B Search using binary passwords (instead of character passwords).\n"); fprintf(stderr, " Write candidates to .\n\n"); fprintf(stderr, " -b Beginning of the password.\n"); fprintf(stderr, " default: \"\"\n\n"); fprintf(stderr, " -c Cipher for decryption.\n"); fprintf(stderr, " default: aes-256-cbc\n\n"); fprintf(stderr, " -d Digest for key and initialization vector generation.\n"); fprintf(stderr, " default: md5\n\n"); fprintf(stderr, " -e End of the password.\n"); fprintf(stderr, " default: \"\"\n\n"); fprintf(stderr, " -f Read the passwords from a file instead of generating them.\n\n"); fprintf(stderr, " -h Show help and quit.\n\n"); fprintf(stderr, " -L Limit the maximum number of tested passwords to .\n\n"); fprintf(stderr, " -l Minimum password length (beginning and end included).\n"); fprintf(stderr, " default: 1\n\n"); fprintf(stderr, " -M Consider the decryption as successful when the data starts\n"); fprintf(stderr, " with . Without this option, the decryption is considered\n"); fprintf(stderr, " as successful when the data contains mostly printable ASCII\n"); fprintf(stderr, " characters (at least 90%%).\n\n"); fprintf(stderr, " -m Maximum password length (beginning and end included).\n"); fprintf(stderr, " default: 8\n\n"); fprintf(stderr, " -N Ignore decryption errors (similar to openssl -nopad).\n\n"); fprintf(stderr, " -p Print a message every passwords tested.\n\n"); fprintf(stderr, " -s Password character set.\n"); fprintf(stderr, " default: \"0123456789ABCDEFGHIJKLMNOPQRSTU\n"); fprintf(stderr, " VWXYZabcdefghijklmnopqrstuvwxyz\"\n\n"); fprintf(stderr, " -t Number of threads to use.\n"); fprintf(stderr, " default: 1\n\n"); fprintf(stderr, "\n"); fprintf(stderr, "Sending a USR1 signal to a running bruteforce-salted-openssl process\n"); fprintf(stderr, "makes it print progress info to standard error and continue.\n"); fprintf(stderr, "\n"); } void list_algorithms(void) { fprintf(stderr, "Available ciphers:\n"); EVP_CIPHER_do_all_sorted(list_ciphers, NULL); fprintf(stderr, "\nAvailable digests:\n"); EVP_MD_do_all_sorted(list_digests, NULL); fprintf(stderr, "\n"); } int main(int argc, char **argv) { pthread_t *decryption_threads; char *filename; int fd, i, ret, c; struct stat file_stats; setlocale(LC_ALL, ""); OpenSSL_add_all_algorithms(); /* Get options and parameters */ opterr = 0; while((c = getopt(argc, argv, "1aB:b:c:d:e:f:hL:l:M:m:Np:s:t:")) != -1) switch(c) { case '1': only_one_password = 1; break; case 'a': list_algorithms(); exit(EXIT_FAILURE); break; case 'B': binary = optarg; break; case 'b': prefix_len = mbstowcs(NULL, optarg, 0); if(prefix_len == (unsigned int) -1) { fprintf(stderr, "Error: invalid character in prefix.\n\n"); exit(EXIT_FAILURE); } prefix = (wchar_t *) calloc(prefix_len + 1, sizeof(wchar_t)); if(prefix == NULL) { fprintf(stderr, "Error: memory allocation failed.\n\n"); exit(EXIT_FAILURE); } mbstowcs(prefix, optarg, prefix_len + 1); break; case 'c': cipher = EVP_get_cipherbyname(optarg); if(cipher == NULL) { fprintf(stderr, "Error: unknown cipher: %s.\n\n", optarg); exit(EXIT_FAILURE); } break; case 'd': digest = EVP_get_digestbyname(optarg); if(digest == NULL) { fprintf(stderr, "Error: unknown digest: %s.\n\n", optarg); exit(EXIT_FAILURE); } break; case 'e': suffix_len = mbstowcs(NULL, optarg, 0); if(suffix_len == (unsigned int) -1) { fprintf(stderr, "Error: invalid character in suffix.\n\n"); exit(EXIT_FAILURE); } suffix = (wchar_t *) calloc(suffix_len + 1, sizeof(wchar_t)); if(suffix == NULL) { fprintf(stderr, "Error: memory allocation failed.\n\n"); exit(EXIT_FAILURE); } mbstowcs(suffix, optarg, suffix_len + 1); break; case 'f': dictionary = fopen(optarg, "r"); if(dictionary == NULL) { fprintf(stderr, "Error: can't open dictionary file.\n\n"); exit(EXIT_FAILURE); } break; case 'h': usage(argv[0]); exit(EXIT_FAILURE); break; case 'L': limit = (long unsigned int) atol(optarg); break; case 'l': min_len = (unsigned int) atoi(optarg); break; case 'M': magic = optarg; break; case 'm': max_len = (unsigned int) atoi(optarg); break; case 'N': no_error = 1; break; case 'p': print = (long unsigned int) atol(optarg); break; case 's': charset_len = mbstowcs(NULL, optarg, 0); if(charset_len == 0) { fprintf(stderr, "Error: charset must have at least one character.\n\n"); exit(EXIT_FAILURE); } if(charset_len == (unsigned int) -1) { fprintf(stderr, "Error: invalid character in charset.\n\n"); exit(EXIT_FAILURE); } charset = (wchar_t *) calloc(charset_len + 1, sizeof(wchar_t)); if(charset == NULL) { fprintf(stderr, "Error: memory allocation failed.\n\n"); exit(EXIT_FAILURE); } mbstowcs(charset, optarg, charset_len + 1); break; case 't': nb_threads = (unsigned int) atoi(optarg); if(nb_threads == 0) nb_threads = 1; break; default: usage(argv[0]); switch(optopt) { case 'B': case 'b': case 'c': case 'd': case 'e': case 'f': case 'L': case 'l': case 'M': case 'm': case 'p': case 's': case 't': fprintf(stderr, "Error: missing argument for option: '-%c'.\n\n", optopt); break; default: fprintf(stderr, "Error: unknown option: '%c'.\n\n", optopt); break; } exit(EXIT_FAILURE); break; } if(optind >= argc) { usage(argv[0]); fprintf(stderr, "Error: missing filename.\n\n"); exit(EXIT_FAILURE); } filename = argv[optind]; /* Check variables */ if(cipher == NULL) cipher = EVP_aes_256_cbc(); if(digest == NULL) digest = EVP_md5(); if(dictionary != NULL) { fprintf(stderr, "Warning: using dictionary mode, ignoring options -b, -e, -l, -m and -s.\n\n"); } else { if(prefix == NULL) { prefix_len = mbstowcs(NULL, "", 0); prefix = (wchar_t *) calloc(prefix_len + 1, sizeof(wchar_t)); if(prefix == NULL) { fprintf(stderr, "Error: memory allocation failed.\n\n"); exit(EXIT_FAILURE); } mbstowcs(prefix, "", prefix_len + 1); } if(suffix == NULL) { suffix_len = mbstowcs(NULL, "", 0); suffix = (wchar_t *) calloc(suffix_len + 1, sizeof(wchar_t)); if(suffix == NULL) { fprintf(stderr, "Error: memory allocation failed.\n\n"); exit(EXIT_FAILURE); } mbstowcs(suffix, "", suffix_len + 1); } if(charset && binary) { fprintf(stderr, "Error: options -B and -s can't be both set.\n\n"); exit(EXIT_FAILURE); } else if(binary) { charset_len = strlen(binary_charset); prefix_len = wcstombs(NULL, prefix, 0); suffix_len = wcstombs(NULL, suffix, 0); } else if(charset == NULL) { charset_len = mbstowcs(NULL, default_charset, 0); charset = (wchar_t *) calloc(charset_len + 1, sizeof(wchar_t)); if(charset == NULL) { fprintf(stderr, "Error: memory allocation failed.\n\n"); exit(EXIT_FAILURE); } mbstowcs(charset, default_charset, charset_len + 1); } if(charset_len == 0) { fprintf(stderr, "Error: charset must have at least one character.\n\n"); exit(EXIT_FAILURE); } if(nb_threads > charset_len) { fprintf(stderr, "Warning: number of threads (%u) bigger than character set length (%u). Only using %u threads.\n\n", nb_threads, charset_len, charset_len); nb_threads = charset_len; } if(min_len < prefix_len + suffix_len + 1) { fprintf(stderr, "Warning: minimum length (%u) isn't bigger than the length of specified password characters (%u). Setting minimum length to %u.\n\n", min_len, prefix_len + suffix_len, prefix_len + suffix_len + 1); min_len = prefix_len + suffix_len + 1; } if(max_len < min_len) { fprintf(stderr, "Warning: maximum length (%u) is smaller than minimum length (%u). Setting maximum length to %u.\n\n", max_len, min_len, min_len); max_len = min_len; } if(binary && print) { fprintf(stderr, "Warning: option -p in not available in binary mode.\n\n"); } } last_pass[0] = '\0'; signal(SIGUSR1, handle_signal); /* Check header */ fd = open(filename, O_RDONLY); if(fd == -1) { perror("open file"); exit(EXIT_FAILURE); } memset(salt, 0, sizeof(salt)); ret = read(fd, salt, 8); if(strncmp(salt, "Salted__", 8) != 0) { close(fd); fprintf(stderr, "Error: %s is not a salted openssl file.\n\n", filename); exit(EXIT_FAILURE); } /* Read salt */ ret = read(fd, salt, 8); if(ret != 8) { close(fd); fprintf(stderr, "Error: could not read salt.\n\n"); exit(EXIT_FAILURE); } /* Read encrypted data */ ret = fstat(fd, &file_stats); data_len = file_stats.st_size - 16; data = (char *) malloc(data_len); if(data == NULL) { fprintf(stderr, "Error: memory allocation failed.\n\n"); exit(EXIT_FAILURE); } for(i = 0; i < data_len;) { ret = read(fd, data + i, data_len - i); if(ret == -1) { close(fd); fprintf(stderr, "Error: could not read data.\n\n"); exit(EXIT_FAILURE); } else if(ret > 0) i += ret; } close(fd); pthread_mutex_init(&found_password_lock, NULL); pthread_mutex_init(&dictionary_lock, NULL); /* Start decryption threads */ decryption_threads = (pthread_t *) malloc(nb_threads * sizeof(pthread_t)); thread_locals = (struct decryption_func_locals *) calloc(nb_threads, sizeof(struct decryption_func_locals)); if((decryption_threads == NULL) || (thread_locals == NULL)) { fprintf(stderr, "Error: memory allocation failed.\n\n"); exit(EXIT_FAILURE); } start_time = time(NULL); for(i = 0; i < nb_threads; i++) { if(dictionary == NULL) { thread_locals[i].index_start = i * (charset_len / nb_threads); if(i == nb_threads - 1) thread_locals[i].index_end = charset_len - 1; else thread_locals[i].index_end = (i + 1) * (charset_len / nb_threads) - 1; if(binary == NULL) ret = pthread_create(&decryption_threads[i], NULL, &decryption_func, &thread_locals[i]); else ret = pthread_create(&decryption_threads[i], NULL, &decryption_func_binary, &thread_locals[i]); } else { thread_locals[i].index_start = i; ret = pthread_create(&decryption_threads[i], NULL, &decryption_func_dictionary, &thread_locals[i]); } if(ret != 0) { perror("Error: decryption thread"); exit(EXIT_FAILURE); } } for(i = 0; i < nb_threads; i++) { pthread_join(decryption_threads[i], NULL); } if(found_password == 0) { handle_signal(SIGUSR1); /* Print some stats */ fprintf(stderr, "Password not found\n"); } free(thread_locals); free(decryption_threads); pthread_mutex_destroy(&found_password_lock); pthread_mutex_destroy(&dictionary_lock); free(data); EVP_cleanup(); exit(EXIT_SUCCESS); } bruteforce-salted-openssl-1.3.3/src/version.h000066400000000000000000000025551301655731600212540ustar00rootroot00000000000000/* This file is part of bruteforce-salted-openssl, a program trying to bruteforce a file encrypted (with salt) by openssl. Copyright 2014-2016 Guillaume LE VAILLANT This program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version. This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program. If not, see . Additional permission under GNU GPL version 3 section 7 If you modify this program, or any covered work, by linking or combining it with the OpenSSL library (or a modified version of that library), containing parts covered by the terms of the OpenSSL license, the licensors of this program grant you additional permission to convey the resulting work. Corresponding source for a non-source form of such a combination shall include the source code for the parts of the OpenSSL library used as well as that of the covered work. */ #ifndef VERSION_H #define VERSION_H 1 #define VERSION_NUMBER "1.3.3" #endif