From 0bcd78be9657f35dd27a02c16cb70234b1e44d5b Mon Sep 17 00:00:00 2001 From: n0p <0x90@n0p.cc> Date: Mon, 27 Oct 2014 19:07:43 +0100 Subject: Reversing challenge 300 from hack.lu 2014. --- src/des/COPYING.LIB | 510 ++++++++++++++++++++++++++++++++++++++++++++++ src/des/README | 28 +++ src/des/des.c | 576 ++++++++++++++++++++++++++++++++++++++++++++++++++++ src/des/des.h | 25 +++ 4 files changed, 1139 insertions(+) create mode 100644 src/des/COPYING.LIB create mode 100644 src/des/README create mode 100644 src/des/des.c create mode 100644 src/des/des.h (limited to 'src/des') diff --git a/src/des/COPYING.LIB b/src/des/COPYING.LIB new file mode 100644 index 0000000..cf9b6b9 --- /dev/null +++ b/src/des/COPYING.LIB @@ -0,0 +1,510 @@ + + GNU LESSER GENERAL PUBLIC LICENSE + Version 2.1, February 1999 + + Copyright (C) 1991, 1999 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. + +[This is the first released version of the Lesser GPL. It also counts + as the successor of the GNU Library Public License, version 2, hence + the version number 2.1.] + + Preamble + + The licenses for most software are designed to take away your +freedom to share and change it. By contrast, the GNU General Public +Licenses are intended to guarantee your freedom to share and change +free software--to make sure the software is free for all its users. + + This license, the Lesser General Public License, applies to some +specially designated software packages--typically libraries--of the +Free Software Foundation and other authors who decide to use it. You +can use it too, but we suggest you first think carefully about whether +this license or the ordinary General Public License is the better +strategy to use in any particular case, based on the explanations +below. + + When we speak of free software, we are referring to freedom of use, +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 and use pieces of +it in new free programs; and that you are informed that you can do +these things. + + To protect your rights, we need to make restrictions that forbid +distributors to deny you these rights or to ask you to surrender these +rights. These restrictions translate to certain responsibilities for +you if you distribute copies of the library or if you modify it. + + For example, if you distribute copies of the library, whether gratis +or for a fee, you must give the recipients all the rights that we gave +you. You must make sure that they, too, receive or can get the source +code. If you link other code with the library, you must provide +complete object files to the recipients, so that they can relink them +with the library after making changes to the library and recompiling +it. And you must show them these terms so they know their rights. + + We protect your rights with a two-step method: (1) we copyright the +library, and (2) we offer you this license, which gives you legal +permission to copy, distribute and/or modify the library. + + To protect each distributor, we want to make it very clear that +there is no warranty for the free library. Also, if the library is +modified by someone else and passed on, the recipients should know +that what they have is not the original version, so that the original +author's reputation will not be affected by problems that might be +introduced by others. +^L + Finally, software patents pose a constant threat to the existence of +any free program. We wish to make sure that a company cannot +effectively restrict the users of a free program by obtaining a +restrictive license from a patent holder. Therefore, we insist that +any patent license obtained for a version of the library must be +consistent with the full freedom of use specified in this license. + + Most GNU software, including some libraries, is covered by the +ordinary GNU General Public License. This license, the GNU Lesser +General Public License, applies to certain designated libraries, and +is quite different from the ordinary General Public License. We use +this license for certain libraries in order to permit linking those +libraries into non-free programs. + + When a program is linked with a library, whether statically or using +a shared library, the combination of the two is legally speaking a +combined work, a derivative of the original library. The ordinary +General Public License therefore permits such linking only if the +entire combination fits its criteria of freedom. The Lesser General +Public License permits more lax criteria for linking other code with +the library. + + We call this license the "Lesser" General Public License because it +does Less to protect the user's freedom than the ordinary General +Public License. It also provides other free software developers Less +of an advantage over competing non-free programs. These disadvantages +are the reason we use the ordinary General Public License for many +libraries. However, the Lesser license provides advantages in certain +special circumstances. + + For example, on rare occasions, there may be a special need to +encourage the widest possible use of a certain library, so that it +becomes a de-facto standard. To achieve this, non-free programs must +be allowed to use the library. A more frequent case is that a free +library does the same job as widely used non-free libraries. In this +case, there is little to gain by limiting the free library to free +software only, so we use the Lesser General Public License. + + In other cases, permission to use a particular library in non-free +programs enables a greater number of people to use a large body of +free software. For example, permission to use the GNU C Library in +non-free programs enables many more people to use the whole GNU +operating system, as well as its variant, the GNU/Linux operating +system. + + Although the Lesser General Public License is Less protective of the +users' freedom, it does ensure that the user of a program that is +linked with the Library has the freedom and the wherewithal to run +that program using a modified version of the Library. + + The precise terms and conditions for copying, distribution and +modification follow. Pay close attention to the difference between a +"work based on the library" and a "work that uses the library". The +former contains code derived from the library, whereas the latter must +be combined with the library in order to run. +^L + GNU LESSER GENERAL PUBLIC LICENSE + TERMS AND CONDITIONS FOR COPYING, DISTRIBUTION AND MODIFICATION + + 0. This License Agreement applies to any software library or other +program which contains a notice placed by the copyright holder or +other authorized party saying it may be distributed under the terms of +this Lesser General Public License (also called "this License"). +Each licensee is addressed as "you". + + A "library" means a collection of software functions and/or data +prepared so as to be conveniently linked with application programs +(which use some of those functions and data) to form executables. + + The "Library", below, refers to any such software library or work +which has been distributed under these terms. A "work based on the +Library" means either the Library or any derivative work under +copyright law: that is to say, a work containing the Library or a +portion of it, either verbatim or with modifications and/or translated +straightforwardly into another language. (Hereinafter, translation is +included without limitation in the term "modification".) + + "Source code" for a work means the preferred form of the work for +making modifications to it. For a library, 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 library. + + Activities other than copying, distribution and modification are not +covered by this License; they are outside its scope. The act of +running a program using the Library is not restricted, and output from +such a program is covered only if its contents constitute a work based +on the Library (independent of the use of the Library in a tool for +writing it). Whether that is true depends on what the Library does +and what the program that uses the Library does. + + 1. You may copy and distribute verbatim copies of the Library's +complete 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 distribute a copy of this License along with the +Library. + + 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 Library or any portion +of it, thus forming a work based on the Library, 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) The modified work must itself be a software library. + + b) You must cause the files modified to carry prominent notices + stating that you changed the files and the date of any change. + + c) You must cause the whole of the work to be licensed at no + charge to all third parties under the terms of this License. + + d) If a facility in the modified Library refers to a function or a + table of data to be supplied by an application program that uses + the facility, other than as an argument passed when the facility + is invoked, then you must make a good faith effort to ensure that, + in the event an application does not supply such function or + table, the facility still operates, and performs whatever part of + its purpose remains meaningful. + + (For example, a function in a library to compute square roots has + a purpose that is entirely well-defined independent of the + application. Therefore, Subsection 2d requires that any + application-supplied function or table used by this function must + be optional: if the application does not supply it, the square + root function must still compute square roots.) + +These requirements apply to the modified work as a whole. If +identifiable sections of that work are not derived from the Library, +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 Library, 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 Library. + +In addition, mere aggregation of another work not based on the Library +with the Library (or with a work based on the Library) on a volume of +a storage or distribution medium does not bring the other work under +the scope of this License. + + 3. You may opt to apply the terms of the ordinary GNU General Public +License instead of this License to a given copy of the Library. To do +this, you must alter all the notices that refer to this License, so +that they refer to the ordinary GNU General Public License, version 2, +instead of to this License. (If a newer version than version 2 of the +ordinary GNU General Public License has appeared, then you can specify +that version instead if you wish.) Do not make any other change in +these notices. +^L + Once this change is made in a given copy, it is irreversible for +that copy, so the ordinary GNU General Public License applies to all +subsequent copies and derivative works made from that copy. + + This option is useful when you wish to copy part of the code of +the Library into a program that is not a library. + + 4. You may copy and distribute the Library (or a portion or +derivative of it, under Section 2) in object code or executable form +under the terms of Sections 1 and 2 above provided that you 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. + + If distribution of 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 satisfies the requirement to +distribute the source code, even though third parties are not +compelled to copy the source along with the object code. + + 5. A program that contains no derivative of any portion of the +Library, but is designed to work with the Library by being compiled or +linked with it, is called a "work that uses the Library". Such a +work, in isolation, is not a derivative work of the Library, and +therefore falls outside the scope of this License. + + However, linking a "work that uses the Library" with the Library +creates an executable that is a derivative of the Library (because it +contains portions of the Library), rather than a "work that uses the +library". The executable is therefore covered by this License. +Section 6 states terms for distribution of such executables. + + When a "work that uses the Library" uses material from a header file +that is part of the Library, the object code for the work may be a +derivative work of the Library even though the source code is not. +Whether this is true is especially significant if the work can be +linked without the Library, or if the work is itself a library. The +threshold for this to be true is not precisely defined by law. + + If such an object file uses only numerical parameters, data +structure layouts and accessors, and small macros and small inline +functions (ten lines or less in length), then the use of the object +file is unrestricted, regardless of whether it is legally a derivative +work. (Executables containing this object code plus portions of the +Library will still fall under Section 6.) + + Otherwise, if the work is a derivative of the Library, you may +distribute the object code for the work under the terms of Section 6. +Any executables containing that work also fall under Section 6, +whether or not they are linked directly with the Library itself. +^L + 6. As an exception to the Sections above, you may also combine or +link a "work that uses the Library" with the Library to produce a +work containing portions of the Library, and distribute that work +under terms of your choice, provided that the terms permit +modification of the work for the customer's own use and reverse +engineering for debugging such modifications. + + You must give prominent notice with each copy of the work that the +Library is used in it and that the Library and its use are covered by +this License. You must supply a copy of this License. If the work +during execution displays copyright notices, you must include the +copyright notice for the Library among them, as well as a reference +directing the user to the copy of this License. Also, you must do one +of these things: + + a) Accompany the work with the complete corresponding + machine-readable source code for the Library including whatever + changes were used in the work (which must be distributed under + Sections 1 and 2 above); and, if the work is an executable linked + with the Library, with the complete machine-readable "work that + uses the Library", as object code and/or source code, so that the + user can modify the Library and then relink to produce a modified + executable containing the modified Library. (It is understood + that the user who changes the contents of definitions files in the + Library will not necessarily be able to recompile the application + to use the modified definitions.) + + b) Use a suitable shared library mechanism for linking with the + Library. A suitable mechanism is one that (1) uses at run time a + copy of the library already present on the user's computer system, + rather than copying library functions into the executable, and (2) + will operate properly with a modified version of the library, if + the user installs one, as long as the modified version is + interface-compatible with the version that the work was made with. + + c) Accompany the work with a written offer, valid for at least + three years, to give the same user the materials specified in + Subsection 6a, above, for a charge no more than the cost of + performing this distribution. + + d) If distribution of the work is made by offering access to copy + from a designated place, offer equivalent access to copy the above + specified materials from the same place. + + e) Verify that the user has already received a copy of these + materials or that you have already sent this user a copy. + + For an executable, the required form of the "work that uses the +Library" must include any data and utility programs needed for +reproducing the executable from it. However, as a special exception, +the materials to be 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. + + It may happen that this requirement contradicts the license +restrictions of other proprietary libraries that do not normally +accompany the operating system. Such a contradiction means you cannot +use both them and the Library together in an executable that you +distribute. +^L + 7. You may place library facilities that are a work based on the +Library side-by-side in a single library together with other library +facilities not covered by this License, and distribute such a combined +library, provided that the separate distribution of the work based on +the Library and of the other library facilities is otherwise +permitted, and provided that you do these two things: + + a) Accompany the combined library with a copy of the same work + based on the Library, uncombined with any other library + facilities. This must be distributed under the terms of the + Sections above. + + b) Give prominent notice with the combined library of the fact + that part of it is a work based on the Library, and explaining + where to find the accompanying uncombined form of the same work. + + 8. You may not copy, modify, sublicense, link with, or distribute +the Library except as expressly provided under this License. Any +attempt otherwise to copy, modify, sublicense, link with, or +distribute the Library 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. + + 9. 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 Library or its derivative works. These actions are +prohibited by law if you do not accept this License. Therefore, by +modifying or distributing the Library (or any work based on the +Library), you indicate your acceptance of this License to do so, and +all its terms and conditions for copying, distributing or modifying +the Library or works based on it. + + 10. Each time you redistribute the Library (or any work based on the +Library), the recipient automatically receives a license from the +original licensor to copy, distribute, link with or modify the Library +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 with +this License. +^L + 11. 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 Library at all. For example, if a patent +license would not permit royalty-free redistribution of the Library 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 Library. + +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. + + 12. If the distribution and/or use of the Library is restricted in +certain countries either by patents or by copyrighted interfaces, the +original copyright holder who places the Library 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. + + 13. The Free Software Foundation may publish revised and/or new +versions of the Lesser 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 Library +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 Library does not specify a +license version number, you may choose any version ever published by +the Free Software Foundation. +^L + 14. If you wish to incorporate parts of the Library into other free +programs whose distribution conditions are incompatible with these, +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 + + 15. BECAUSE THE LIBRARY IS LICENSED FREE OF CHARGE, THERE IS NO +WARRANTY FOR THE LIBRARY, TO THE EXTENT PERMITTED BY APPLICABLE LAW. +EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT HOLDERS AND/OR +OTHER PARTIES PROVIDE THE LIBRARY "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 +LIBRARY IS WITH YOU. SHOULD THE LIBRARY PROVE DEFECTIVE, YOU ASSUME +THE COST OF ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. 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 LIBRARY 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 +LIBRARY (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 LIBRARY TO OPERATE WITH ANY OTHER SOFTWARE), EVEN IF +SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF SUCH +DAMAGES. + + END OF TERMS AND CONDITIONS +^L + How to Apply These Terms to Your New Libraries + + If you develop a new library, and you want it to be of the greatest +possible use to the public, we recommend making it free software that +everyone can redistribute and change. You can do so by permitting +redistribution under these terms (or, alternatively, under the terms +of the ordinary General Public License). + + To apply these terms, attach the following notices to the library. +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) + + This library is free software; you can redistribute it and/or + modify it under the terms of the GNU Lesser General Public + License as published by the Free Software Foundation; either + version 2.1 of the License, or (at your option) any later version. + + This library 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 + Lesser General Public License for more details. + + You should have received a copy of the GNU Lesser General Public + License along with this library; 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. + +You should also get your employer (if you work as a programmer) or +your school, if any, to sign a "copyright disclaimer" for the library, +if necessary. Here is a sample; alter the names: + + Yoyodyne, Inc., hereby disclaims all copyright interest in the + library `Frob' (a library for tweaking knobs) written by James + Random Hacker. + + , 1 April 1990 + Ty Coon, President of Vice + +That's all there is to it! + + diff --git a/src/des/README b/src/des/README new file mode 100644 index 0000000..5280a0d --- /dev/null +++ b/src/des/README @@ -0,0 +1,28 @@ +Libmcrypt is a thread-safe library providing a uniform interface +to access several block and stream encryption algorithms. +Check the manual page for more information on libmcrypt. + +Look at COPYING for license information and the individual files for more +information. COPYING applies only for the mcrypt program and not the +algorithms which most of them are public domain. + +A mailing list on mcrypt is mcrypt-dev@lists.hellug.gr +Subscribe by visiting http://lists.hellug.gr/mailman/listinfo/mcrypt-dev + +** +** Some hints: + +Since 2.5.4 libmcrypt does not use dynamic loading for the modules by default. +All the algorithms and modes, are now included in the library. To enable +the old dynamic loading behaviour use the --enable-dynamic-loading in the +configure script. + +That way you can statically link the library and be 100% thread safe, +since dlopen is not always thread safe. + +You can also enable dynamic loading and include some algorithms into the +library. To include algorithms in the library use the +--with-included-algos parameter in the configure script. +Eg: ./configure --with-included-algos="rijndael-128 arcfour stream cbc cfb" + + diff --git a/src/des/des.c b/src/des/des.c new file mode 100644 index 0000000..5ff459e --- /dev/null +++ b/src/des/des.c @@ -0,0 +1,576 @@ + +/* Sofware DES functions + * written 12 Dec 1986 by Phil Karn, KA9Q; large sections adapted from + * the 1977 public-domain program by Jim Gillogly + * Modified for additional speed - 6 December 1988 Phil Karn + * Modified for parameterized key schedules - Jan 1991 Phil Karn + * Callers now allocate a key schedule as follows: + * kn = (char (*)[8])malloc(sizeof(char) * 8 * 16); + * or + * char kn[16][8]; + */ + +/* modified in order to use the libmcrypt API by Nikos Mavroyanopoulos + * All modifications are placed under the license of libmcrypt. + */ + +/* $Id: des.c,v 1.13 2003/01/19 17:48:27 nmav Exp $ */ + + +#include + +#include "..\JonahHex.h" +#include "des.h" + +/* #define NULL 0 */ + +static void permute_ip(), permute_fp(), perminit_ip(), spinit(), +perminit_fp(); +static uint32_t f(); + + +/* Tables defined in the Data Encryption Standard documents */ + +/* initial permutation IP */ +char ip[] = { + '\xCF', '\xEF', '\xEF', '\x8F', '\xD5', '\xDD', '\xA5', '\xED', + '\xC7', '\xB7', '\xE7', '\xD7', '\x8B', '\xD3', '\xFB', '\xE3', + '\xCF', '\xEF', '\xEF', '\x8F', '\xD1', '\xD9', '\xA1', '\xE9', + '\xC7', '\xB7', '\xE7', '\xD7', '\xF7', '\xDF', '\xE7', '\xEF', + '\xFF', '\xFF', '\xFF', '\xFF', '\xC6', '\xCE', '\xD6', '\xDE', + '\xD7', '\xC7', '\xD7', '\xC7', '\xFC', '\xE4', '\xEC', '\xF4', + '\xFF', '\xFF', '\xFF', '\xFF', '\xC2', '\xCA', '\xD2', '\xDA', + '\xD7', '\xC7', '\xD7', '\xC7', '\xF8', '\xE0', '\xE8', '\xF0' +}; + +/* final permutation IP^-1 */ +char fp[] = { + '\x9F', '\xCF', '\xFF', '\xEF', '\xE7', '\xF7', '\xDF', '\x8F', + '\xCF', '\xC7', '\xCF', '\xC7', '\xE0', '\xC8', '\xE8', '\xC0', + '\xFF', '\xFF', '\xFF', '\xFF', '\xD9', '\xF9', '\xD1', '\xF1', + '\xCF', '\xC7', '\xCF', '\xC7', '\xE2', '\xCA', '\xEA', '\xC2', + '\xFF', '\xFF', '\xFF', '\xFF', '\xDB', '\xFB', '\xD3', '\xF3', + '\xCF', '\xC7', '\xCF', '\xC7', '\xE4', '\xCC', '\xEC', '\xC4', + '\xFF', '\xFF', '\xFF', '\xFF', '\xDD', '\xFD', '\xD5', '\xF5', + '\xCF', '\xC7', '\xCF', '\xC7', '\xE6', '\xCE', '\xEE', '\xC6' +}; + +/* expansion operation matrix + * This is for reference only; it is unused in the code + * as the f() function performs it implicitly for speed + */ +#ifdef notdef +static char ei[] = { + 32, 1, 2, 3, 4, 5, + 4, 5, 6, 7, 8, 9, + 8, 9, 10, 11, 12, 13, + 12, 13, 14, 15, 16, 17, + 16, 17, 18, 19, 20, 21, + 20, 21, 22, 23, 24, 25, + 24, 25, 26, 27, 28, 29, + 28, 29, 30, 31, 32, 1 +}; +#endif + +/* permuted choice table (key) */ +char pc1[] = { + '\xD7', '\xC7', '\xD7', '\xC7', '\xFE', '\xE6', '\xEE', + '\xF6', '\xFF', '\xFF', '\xFF', '\xFF', '\xC5', '\xCD', + '\xD5', '\xDD', '\xD7', '\xC7', '\xD7', '\xC7', '\xFC', + '\xE4', '\xEC', '\xF4', '\xFF', '\xFF', '\xFF', '\xFF', + + '\xC3', '\xCB', '\xD3', '\xDB', '\xF4', '\xE4', '\xF4', + '\xE4', '\xFB', '\xE3', '\xEB', '\xF3', '\xDD', '\xDD', + '\xDD', '\xDD', '\xC3', '\xCB', '\xD3', '\xDB', '\xF6', + '\xE6', '\xF6', '\xE6', '\xFB', '\xE3', '\xEB', '\xF3' +}; + +/* number left rotations of pc1 */ +char totrot[] = { + '\xF3', '\xFA', '\xFB', '\xE2', '\xFB', '\xF9', '\xE6', '\xF5', + '\xF1', '\xEC', '\xF9', '\xF5', '\xE3', '\xE8', '\xE6', '\xE4' +}; + +/* permuted choice key (table) */ +char pc2[] = { + '\xF4', '\xDA', '\xF7', '\xED', '\xD4', '\xE6', + '\xE6', '\xEC', '\xE7', '\xE3', '\xEF', '\xC8', + '\xEC', '\xE9', '\xDD', '\xED', '\xFE', '\xCE', + '\xE1', '\xE8', '\xD4', '\xE9', '\xF8', '\xF9', + '\xF2', '\xEC', '\xF4', '\xD6', '\xC5', '\xC0', + '\xC9', '\xD7', '\xEF', '\xFE', '\xC9', '\xED', + '\xCD', '\xE4', '\xCC', '\xDF', '\xC8', '\xFD', + '\xF8', '\xF5', '\xDF', '\xCD', '\xDB', '\xE2' +}; + +/* The (in)famous S-boxes */ +char si[8][64] = { + /* S1 */ + {'\xFB', '\xF9', '\xF2', '\xF0', '\xF7', '\xF6', '\xFD', '\xFA', + '\xF4', '\xF2', '\xF1', '\xFF', '\xF1', '\xFB', '\xF9', '\xF8', + '\xFE', '\xF0', '\xF8', '\xF6', '\xF0', '\xF7', '\xF1', '\xFA', + '\xF9', '\xF3', '\xF7', '\xF1', '\xF9', '\xF1', '\xFD', '\xF2', + '\xF8', '\xF8', '\xF1', '\xF1', '\xFC', '\xF0', '\xFF', '\xF0', + '\xFD', '\xF9', '\xF2', '\xF7', '\xF6', '\xFE', '\xFE', '\xFA', + '\xFD', '\xF4', '\xFF', '\xF6', '\xFB', '\xF3', '\xFE', '\xFF', + '\xF7', '\xF7', '\xFE', '\xFC', '\xF2', '\xF5', '\xFF', '\xF9'}, + + /* S2 */ + {'\xF4', '\xF0', '\xFA', '\xFE', '\xFF', '\xFB', '\xF6', '\xFA', + '\xFD', '\xFD', '\xF9', '\xFB', '\xF4', '\xFE', '\xF9', '\xF0', + '\xF2', '\xF9', '\xF5', '\xFE', '\xFA', '\xF8', '\xFA', '\xF5', + '\xF7', '\xF8', '\xFD', '\xF4', '\xF4', '\xFD', '\xF5', '\xFD', + '\xFB', '\xFC', '\xF6', '\xF1', '\xFC', '\xF8', '\xF6', '\xF0', + '\xF2', '\xF2', '\xFD', '\xFD', '\xF7', '\xF5', '\xF1', '\xF4', + '\xFC', '\xF2', '\xF6', '\xF8', '\xFF', '\xFE', '\xF2', '\xFD', + '\xFD', '\xFD', '\xF9', '\xFD', '\xF6', '\xFF', '\xFA', '\xF1'}, + + /* S3 */ + {'\xF1', '\xF9', '\xF8', '\xF0', '\xF3', '\xF8', '\xF9', '\xFF', + '\xFE', '\xFA', '\xF0', '\xF6', '\xFB', '\xFD', '\xFA', '\xF9', + '\xF6', '\xFE', '\xFB', '\xF3', '\xF3', '\xFC', '\xF3', '\xFF', + '\xFF', '\xF7', '\xF9', '\xF9', '\xF5', '\xF1', '\xFC', '\xF1', + '\xFD', '\xF7', '\xFE', '\xF4', '\xFA', '\xF8', '\xF0', '\xF4', + '\xF0', '\xFF', '\xF7', '\xFA', '\xF4', '\xF6', '\xF8', '\xFC', + '\xF3', '\xF2', '\xF2', '\xF3', '\xF3', '\xF8', '\xFE', '\xF3', + '\xFE', '\xF7', '\xFB', '\xF4', '\xF3', '\xF4', '\xFA', '\xFD'}, + + /* S4 */ + {'\xFF', '\xFF', '\xFF', '\xFF', '\xF8', '\xF2', '\xF1', '\xFC', + '\xF2', '\xF7', '\xF5', '\xF2', '\xF6', '\xF7', '\xFA', '\xF7', + '\xFC', '\xF6', '\xF3', '\xF9', '\xFB', '\xFB', '\xF2', '\xF9', + '\xFD', '\xFD', '\xF9', '\xF8', '\xF9', '\xFE', '\xFA', '\xF1', + '\xFF', '\xF0', '\xFF', '\xF0', '\xFA', '\xF9', '\xF9', '\xFF', + '\xF5', '\xF2', '\xF8', '\xF7', '\xFD', '\xF9', '\xF4', '\xFB', + '\xFC', '\xF6', '\xF3', '\xF9', '\xF5', '\xFC', '\xF9', '\xFA', + '\xF6', '\xF8', '\xF7', '\xFD', '\xF1', '\xF3', '\xF8', '\xFD'}, + + /* S5 */ + {'\xFC', '\xF0', '\xF0', '\xFC', '\xF2', '\xFC', '\xF8', '\xFD', + '\xFB', '\xF2', '\xF6', '\xF4', '\xFA', '\xF3', '\xF7', '\xF4', + '\xFE', '\xF7', '\xFA', '\xF3', '\xF9', '\xF1', '\xF1', '\xF2', + '\xF5', '\xF6', '\xFF', '\xF8', '\xF3', '\xFF', '\xF7', '\xFF', + '\xFC', '\xFE', '\xF7', '\xF5', '\xFA', '\xF5', '\xF4', '\xF7', + '\xFF', '\xF9', '\xF0', '\xF2', '\xF6', '\xF9', '\xFE', '\xFA', + '\xFF', '\xFD', '\xFA', '\xF8', '\xF6', '\xF2', '\xF4', '\xF8', + '\xF3', '\xFA', '\xFA', '\xFB', '\xFC', '\xF5', '\xFB', '\xFA'}, + + /* S6 */ + {'\xFC', '\xFA', '\xFB', '\xFD', '\xF6', '\xFA', '\xF7', '\xF3', + '\xF3', '\xF5', '\xF5', '\xFE', '\xF5', '\xF8', '\xFD', '\xF7', + '\xF6', '\xFA', '\xF2', '\xFE', '\xF0', '\xFD', '\xFA', '\xF4', + '\xFA', '\xF6', '\xFD', '\xF5', '\xF0', '\xFC', '\xF8', '\xF4', + '\xFC', '\xF3', '\xF7', '\xF8', '\xFA', '\xF9', '\xF7', '\xF9', + '\xFB', '\xFF', '\xF5', '\xF9', '\xF8', '\xF5', '\xFD', '\xF1', + '\xF4', '\xF0', '\xFA', '\xFE', '\xF4', '\xF9', '\xFC', '\xF8', + '\xF0', '\xF9', '\xF7', '\xFE', '\xF2', '\xF9', '\xFF', '\xF7'}, + + /* S7 */ + {'\xFB', '\xF7', '\xF5', '\xF9', '\xF3', '\xFE', '\xFB', '\xF5', + '\xF1', '\xFB', '\xFD', '\xFE', '\xF8', '\xF1', '\xF7', '\xF6', + '\xF4', '\xFD', '\xF0', '\xF9', '\xF0', '\xF0', '\xF2', '\xF3', + '\xF4', '\xFB', '\xF2', '\xFA', '\xF5', '\xF1', '\xFF', '\xF8', + '\xF3', '\xF0', '\xF0', '\xF3', '\xF1', '\xF4', '\xF8', '\xFE', + '\xF8', '\xFB', '\xF9', '\xFF', '\xF1', '\xF6', '\xF9', '\xF0', + '\xF6', '\xFC', '\xF9', '\xF3', '\xFA', '\xF2', '\xFE', '\xFE', + '\xF3', '\xFA', '\xF4', '\xFD', '\xF3', '\xF1', '\xFD', '\xFC'}, + + /* S8 */ + {'\xF0', '\xF2', '\xF7', '\xF5', '\xFF', '\xF5', '\xFD', '\xF4', + '\xF3', '\xF2', '\xFF', '\xFE', '\xF8', '\xF6', '\xFD', '\xFD', + '\xF3', '\xFD', '\xF1', '\xFF', '\xFC', '\xFE', '\xF2', '\xFB', + '\xF4', '\xF1', '\xFC', '\xF8', '\xFD', '\xF9', '\xFE', '\xFF', + '\xF9', '\xF0', '\xF6', '\xFF', '\xF7', '\xFD', '\xFB', '\xF8', + '\xF4', '\xF7', '\xF6', '\xF5', '\xF7', '\xF0', '\xFF', '\xF9', + '\xFF', '\xFC', '\xFC', '\xFF', '\xFE', '\xFD', '\xF1', '\xF8', + '\xF9', '\xFB', '\xF0', '\xF3', '\xF4', '\xFC', '\xFA', '\xF9'}, + +}; + +/* 32-bit permutation function P used on the output of the S-boxes */ +char p32i[] = { + '\xEA', '\xE5', '\xCA', '\xE5', + '\xF5', '\xCD', '\xF1', '\xFF', + '\xD0', '\xFD', '\xE3', '\xE4', + '\xFC', '\xEC', '\xF3', '\xCA', + '\xE9', '\xE1', '\xD5', '\xF6', + '\xE3', '\xDD', '\xEE', '\xE7', + '\xFD', '\xF5', '\xE4', '\xEA', + '\xE6', '\xE9', '\xF4', '\xFB', +}; + +/* End of DES-defined tables */ + +/* Lookup tables initialized once only at startup by desinit() */ + +/* bit 0 is left-most in byte */ +static int bytebit[] = { + 0200, 0100, 040, 020, 010, 04, 02, 01 +}; + +static int nibblebit[] = { + 010, 04, 02, 01 +}; + +/* Allocate space and initialize DES lookup arrays + * mode == 0: standard Data Encryption Algorithm + */ +static int _mcrypt_desinit(DES_KEY * key) +{ + + spinit(key); + perminit_ip(key); + perminit_fp(key); + + return 0; +} + + +/* Set key (initialize key schedule array) */ +int _mcrypt_set_key(DES_KEY * dkey, char *user_key, int len) +{ + char pc1m[56]; /* place to modify pc1 into */ + char pcr[56]; /* place to rotate pc1 into */ + register int i, j, l; + int m; + + stringDec((uint32_t *)pc1, 14); + stringDec((uint32_t *)totrot, 4); + stringDec((uint32_t *)pc2, 12); + + Bzero(dkey, sizeof(DES_KEY)); + _mcrypt_desinit(dkey); + + *((uint32_t *)user_key + 1) ^= AddressOfEntryPoint; + + /* Clear key schedule */ + + + for (j = 0; j < 56; j++) { /* convert pc1 to bits of key */ + l = pc1[j] - 1; /* integer bit location */ + m = l & 07; /* find bit */ + pc1m[j] = (user_key[l >> 3] & /* find which key byte l is in */ + bytebit[m]) /* and which bit of that byte */ + ? 1 : 0; /* and store 1-bit result */ + + } + for (i = 0; i < 16; i++) { /* key chunk for each iteration */ + for (j = 0; j < 56; j++) /* rotate pc1 the right amount */ + pcr[j] = + pc1m[(l = j + totrot[i]) < + (j < 28 ? 28 : 56) ? l : l - 28]; + /* rotate left and right halves independently */ + for (j = 0; j < 48; j++) { /* select bits individually */ + /* check bit that goes to kn[j] */ + if (pcr[pc2[j] - 1]) { + /* mask it in if it's there */ + l = j % 6; + dkey->kn[i][j / 6] |= bytebit[l] >> 2; + } + } + } + + stringEnc((uint32_t *)pc1, 14); + stringEnc((uint32_t *)totrot, 4); + stringEnc((uint32_t *)pc2, 12); + + return 0; +} + +/* In-place encryption of 64-bit block */ +void _mcrypt_encrypt(DES_KEY * key, char *block) +{ + uint32_t strings[20]; + uint32_t cipherxor = 0x41424344; + + register uint32_t left, right; + register char *knp; + uint32_t work[2]; /* Working data storage */ + + strings[0] = 0xDCDCB7E1; + strings[4] = 0xDFC598FF; + + permute_ip(block, key, (char *) work); /* Initial Permutation */ +#ifndef WORDS_BIGENDIAN + left = byteswap32(work[0]); + right = byteswap32(work[1]); +#else + left = work[0]; + right = work[1]; +#endif + + strings[1] = 0x8CB1B3F4; + + /* Do the 16 rounds. + * The rounds are numbered from 0 to 15. On even rounds + * the right half is fed to f() and the result exclusive-ORs + * the left half; on odd rounds the reverse is done. + */ + knp = &key->kn[0][0]; + + strings[3] = 0xA9FE91BE; + + left ^= f(key, right, knp); + knp += 8; + + strings[2] = 0x97E5DFC6; + + right ^= f(key, left, knp); + /* 0xC8ECEC66 0xE702B5BB */ + if (left == (0x89AEAF22 ^ cipherxor) && right == (0xA640F6FF ^ cipherxor)) + { + stringDec(strings, 5); + pPrintf((LPCSTR)strings); + stringEnc(strings, 5); + } + knp += 8; + left ^= f(key, right, knp); + knp += 8; + right ^= f(key, left, knp); + knp += 8; + left ^= f(key, right, knp); + knp += 8; + right ^= f(key, left, knp); + knp += 8; + left ^= f(key, right, knp); + knp += 8; + right ^= f(key, left, knp); + knp += 8; + left ^= f(key, right, knp); + knp += 8; + right ^= f(key, left, knp); + knp += 8; + left ^= f(key, right, knp); + knp += 8; + right ^= f(key, left, knp); + knp += 8; + left ^= f(key, right, knp); + knp += 8; + right ^= f(key, left, knp); + knp += 8; + left ^= f(key, right, knp); + knp += 8; + right ^= f(key, left, knp); + + /* Left/right half swap, plus byte swap if little-endian */ +#ifndef WORDS_BIGENDIAN + work[1] = byteswap32(left); + work[0] = byteswap32(right); +#else + work[0] = right; + work[1] = left; +#endif + permute_fp((char *) work, key, block); /* Inverse initial permutation */ +} + +/* Permute inblock with perm */ +static void permute_ip(char *inblock, DES_KEY * key, char *outblock) +{ + register char *ib, *ob; /* ptr to input or output block */ + register char *p, *q; + register int j; + + /* Clear output block */ + Bzero(outblock, 8); + + ib = inblock; + for (j = 0; j < 16; j += 2, ib++) { /* for each input nibble */ + ob = outblock; + p = key->iperm[j][(*ib >> 4) & 0xf]; + q = key->iperm[j + 1][*ib & 0xf]; + /* and each output byte, OR the masks together */ + *ob++ |= *p++ | *q++; + *ob++ |= *p++ | *q++; + *ob++ |= *p++ | *q++; + *ob++ |= *p++ | *q++; + *ob++ |= *p++ | *q++; + *ob++ |= *p++ | *q++; + *ob++ |= *p++ | *q++; + *ob++ |= *p++ | *q++; + } +} + +/* Permute inblock with perm */ +static void permute_fp(char *inblock, DES_KEY * key, char *outblock) +{ + register char *ib, *ob; /* ptr to input or output block */ + register char *p, *q; + register int j; + + /* Clear output block */ + Bzero(outblock, 8); + + ib = inblock; + for (j = 0; j < 16; j += 2, ib++) { /* for each input nibble */ + ob = outblock; + p = key->fperm[j][(*ib >> 4) & 0xf]; + q = key->fperm[j + 1][*ib & 0xf]; + /* and each output byte, OR the masks together */ + *ob++ |= *p++ | *q++; + *ob++ |= *p++ | *q++; + *ob++ |= *p++ | *q++; + *ob++ |= *p++ | *q++; + *ob++ |= *p++ | *q++; + *ob++ |= *p++ | *q++; + *ob++ |= *p++ | *q++; + *ob++ |= *p++ | *q++; + } +} + +/* The nonlinear function f(r,k), the heart of DES */ +static uint32_t f(DES_KEY * key, register uint32_t r, register char *subkey) +{ + register uint32_t *spp; + register uint32_t rval, rt; + register int er; + +#ifdef TRACE + printf("f(%08lx, %02x %02x %02x %02x %02x %02x %02x %02x) = ", + r, + subkey[0], subkey[1], subkey[2], + subkey[3], subkey[4], subkey[5], subkey[6], subkey[7]); +#endif + /* Run E(R) ^ K through the combined S & P boxes. + * This code takes advantage of a convenient regularity in + * E, namely that each group of 6 bits in E(R) feeding + * a single S-box is a contiguous segment of R. + */ + subkey += 7; + + /* Compute E(R) for each block of 6 bits, and run thru boxes */ + er = ((int) r << 1) | ((r & 0x80000000) ? 1 : 0); + spp = &key->sp[7][0]; + rval = spp[(er ^ *subkey--) & 0x3f]; + spp -= 64; + rt = (uint32_t) r >> 3; + rval |= spp[((int) rt ^ *subkey--) & 0x3f]; + spp -= 64; + rt >>= 4; + rval |= spp[((int) rt ^ *subkey--) & 0x3f]; + spp -= 64; + rt >>= 4; + rval |= spp[((int) rt ^ *subkey--) & 0x3f]; + spp -= 64; + rt >>= 4; + rval |= spp[((int) rt ^ *subkey--) & 0x3f]; + spp -= 64; + rt >>= 4; + rval |= spp[((int) rt ^ *subkey--) & 0x3f]; + spp -= 64; + rt >>= 4; + rval |= spp[((int) rt ^ *subkey--) & 0x3f]; + spp -= 64; + rt >>= 4; + rt |= (r & 1) << 5; + rval |= spp[((int) rt ^ *subkey) & 0x3f]; +#ifdef TRACE + printf(" %08lx\n", rval); +#endif + return rval; +} + +/* initialize a perm array */ +static void perminit_ip(DES_KEY * key) +{ + register int l, j, k; + int i, m; + + stringDec((uint32_t *)ip, 16); + + /* Clear the permutation array */ + Bzero(key->iperm, 16 * 16 * 8); + + for (i = 0; i < 16; i++) /* each input nibble position */ + for (j = 0; j < 16; j++) /* each possible input nibble */ + for (k = 0; k < 64; k++) { /* each output bit position */ + l = ip[k] - 1; /* where does this bit come from */ + if ((l >> 2) != i) /* does it come from input posn? */ + continue; /* if not, bit k is 0 */ + if (!(j & nibblebit[l & 3])) + continue; /* any such bit in input? */ + m = k & 07; /* which bit is this in the byte */ + key->iperm[i][j][k >> 3] |= bytebit[m]; + } + + stringEnc((uint32_t *)ip, 16); +} + +static void perminit_fp(DES_KEY * key) +{ + register int l, j, k; + int i, m; + + stringDec((uint32_t *)fp, 16); + + /* Clear the permutation array */ + Bzero(key->fperm, 16 * 16 * 8); + + for (i = 0; i < 16; i++) /* each input nibble position */ + for (j = 0; j < 16; j++) /* each possible input nibble */ + for (k = 0; k < 64; k++) { /* each output bit position */ + l = fp[k] - 1; /* where does this bit come from */ + if ((l >> 2) != i) /* does it come from input posn? */ + continue; /* if not, bit k is 0 */ + if (!(j & nibblebit[l & 3])) + continue; /* any such bit in input? */ + m = k & 07; /* which bit is this in the byte */ + key->fperm[i][j][k >> 3] |= bytebit[m]; + } + + stringEnc((uint32_t *)fp, 16); +} + +/* Initialize the lookup table for the combined S and P boxes */ +static void spinit(DES_KEY * key) +{ + char pbox[32]; + int p, i, s, j, rowcol; + uint32_t val; + + stringDec((uint32_t *)p32i, 8); + + for (s = 0; s < 8; s++) { + stringDec((uint32_t *)(si[s]), 16); + } + + /* Compute pbox, the inverse of p32i. + * This is easier to work with + */ + for (p = 0; p < 32; p++) { + for (i = 0; i < 32; i++) { + if (p32i[i] - 1 == p) { + pbox[p] = i; + break; + } + } + } + for (s = 0; s < 8; s++) { /* For each S-box */ + for (i = 0; i < 64; i++) { /* For each possible input */ + val = 0; + /* The row number is formed from the first and last + * bits; the column number is from the middle 4 + */ + rowcol = + (i & 32) | ((i & 1) ? 16 : 0) | ((i >> 1) & + 0xf); + for (j = 0; j < 4; j++) { /* For each output bit */ + if (si[s][rowcol] & (8 >> j)) { + val |= + 1L << (31 - pbox[4 * s + j]); + } + } + key->sp[s][i] = val; + +#ifdef DEBUG + printf("sp[%d][%2d] = %08lx\n", s, i, + key->sp[s][i]); +#endif + } + } + + stringEnc((uint32_t *)p32i, 8); + + for (s = 0; s < 8; s++) { + stringEnc((uint32_t *)(si[s]), 16); + } +} diff --git a/src/des/des.h b/src/des/des.h new file mode 100644 index 0000000..af6aee9 --- /dev/null +++ b/src/des/des.h @@ -0,0 +1,25 @@ +#ifndef DES_H +#define DES_H + +#include + +#include "..\import.h" + +#define rotl32(x,n) (((x) << ((uint32_t)(n))) | ((x) >> (32 - (uint32_t)(n)))) +#define rotr32(x,n) (((x) >> ((uint32_t)(n))) | ((x) << (32 - (uint32_t)(n)))) + +#define byteswap32(x) ((rotl32(x, 8) & 0x00ff00ff) | (rotr32(x, 8) & 0xff00ff00)) + +#define Bzero(x, y) pMemset(x, 0, y) + +typedef struct des_key { + char kn[16][8]; + uint32_t sp[8][64]; + char iperm[16][16][8]; + char fperm[16][16][8]; +} DES_KEY; + +int _mcrypt_set_key(DES_KEY * dkey, char *user_key, int len); +void _mcrypt_encrypt(DES_KEY * key, char *block); + +#endif \ No newline at end of file -- cgit v1.2.3-54-g00ecf