From fe267bf317e3f22c65904c85810f7e6192429d5e Mon Sep 17 00:00:00 2001 From: lhahn Date: Sat, 19 Aug 2023 23:36:57 +0200 Subject: [PATCH] Git initial commit --- LICENSE | 674 ++++++++++++++++++ README.md | 11 + lib-cp/aes.cpp | 101 +++ lib-cp/aes.hpp | 41 ++ lib-cp/aesbase.cpp | 156 ++++ lib-cp/aesbase.hpp | 24 + lib-cp/main.cpp | 26 + lib-py/aes.py | 292 ++++++++ lib-py/sample.dat | 2 + lib-py/sample_folder/sample.dat | 2 + lib-py/sample_folder/sample2.dat | 2 + .../sample_folder/sample2_folder/sample.dat | 2 + .../sample_folder/sample2_folder/sample2.dat | 2 + 13 files changed, 1335 insertions(+) create mode 100755 LICENSE create mode 100755 README.md create mode 100755 lib-cp/aes.cpp create mode 100755 lib-cp/aes.hpp create mode 100755 lib-cp/aesbase.cpp create mode 100755 lib-cp/aesbase.hpp create mode 100755 lib-cp/main.cpp create mode 100755 lib-py/aes.py create mode 100755 lib-py/sample.dat create mode 100755 lib-py/sample_folder/sample.dat create mode 100755 lib-py/sample_folder/sample2.dat create mode 100755 lib-py/sample_folder/sample2_folder/sample.dat create mode 100755 lib-py/sample_folder/sample2_folder/sample2.dat diff --git a/LICENSE b/LICENSE new file mode 100755 index 0000000..94a9ed0 --- /dev/null +++ b/LICENSE @@ -0,0 +1,674 @@ + GNU GENERAL PUBLIC LICENSE + Version 3, 29 June 2007 + + Copyright (C) 2007 Free Software Foundation, Inc. + Everyone is permitted to copy and distribute verbatim copies + of this license document, but changing it is not allowed. + + Preamble + + The GNU General Public License is a free, copyleft license for +software and other kinds of works. + + The licenses for most software and other practical works are designed +to take away your freedom to share and change the works. By contrast, +the GNU General Public License is intended to guarantee your freedom to +share and change all versions of a program--to make sure it remains free +software for all its users. We, the Free Software Foundation, use the +GNU General Public License for most of our software; it applies also to +any other work released this way by its authors. You can apply it to +your programs, too. + + When we speak of free software, we are referring to freedom, not +price. Our General Public Licenses are designed to make sure that you +have the freedom to distribute copies of free software (and charge for +them if you wish), that you receive source code or can get it if you +want it, that you can change the software or use pieces of it in new +free programs, and that you know you can do these things. + + To protect your rights, we need to prevent others from denying you +these rights or asking you to surrender the rights. Therefore, you have +certain responsibilities if you distribute copies of the software, or if +you modify it: responsibilities to respect the freedom of others. + + For example, if you distribute copies of such a program, whether +gratis or for a fee, you must pass on to the recipients the same +freedoms that you received. You must make sure that they, too, receive +or can get the source code. And you must show them these terms so they +know their rights. + + Developers that use the GNU GPL protect your rights with two steps: +(1) assert copyright on the software, and (2) offer you this License +giving you legal permission to copy, distribute and/or modify it. + + For the developers' and authors' protection, the GPL clearly explains +that there is no warranty for this free software. For both users' and +authors' sake, the GPL requires that modified versions be marked as +changed, so that their problems will not be attributed erroneously to +authors of previous versions. + + Some devices are designed to deny users access to install or run +modified versions of the software inside them, although the manufacturer +can do so. This is fundamentally incompatible with the aim of +protecting users' freedom to change the software. The systematic +pattern of such abuse occurs in the area of products for individuals to +use, which is precisely where it is most unacceptable. Therefore, we +have designed this version of the GPL to prohibit the practice for those +products. If such problems arise substantially in other domains, we +stand ready to extend this provision to those domains in future versions +of the GPL, as needed to protect the freedom of users. + + Finally, every program is threatened constantly by software patents. +States should not allow patents to restrict development and use of +software on general-purpose computers, but in those that do, we wish to +avoid the special danger that patents applied to a free program could +make it effectively proprietary. To prevent this, the GPL assures that +patents cannot be used to render the program non-free. + + The precise terms and conditions for copying, distribution and +modification follow. + + TERMS AND CONDITIONS + + 0. Definitions. + + "This License" refers to version 3 of the GNU General Public License. + + "Copyright" also means copyright-like laws that apply to other kinds of +works, such as semiconductor masks. + + "The Program" refers to any copyrightable work licensed under this +License. Each licensee is addressed as "you". "Licensees" and +"recipients" may be individuals or organizations. + + To "modify" a work means to copy from or adapt all or part of the work +in a fashion requiring copyright permission, other than the making of an +exact copy. The resulting work is called a "modified version" of the +earlier work or a work "based on" the earlier work. + + A "covered work" means either the unmodified Program or a work based +on the Program. + + To "propagate" a work means to do anything with it that, without +permission, would make you directly or secondarily liable for +infringement under applicable copyright law, except executing it on a +computer or modifying a private copy. Propagation includes copying, +distribution (with or without modification), making available to the +public, and in some countries other activities as well. + + To "convey" a work means any kind of propagation that enables other +parties to make or receive copies. Mere interaction with a user through +a computer network, with no transfer of a copy, is not conveying. + + An interactive user interface displays "Appropriate Legal Notices" +to the extent that it includes a convenient and prominently visible +feature that (1) displays an appropriate copyright notice, and (2) +tells the user that there is no warranty for the work (except to the +extent that warranties are provided), that licensees may convey the +work under this License, and how to view a copy of this License. If +the interface presents a list of user commands or options, such as a +menu, a prominent item in the list meets this criterion. + + 1. Source Code. + + The "source code" for a work means the preferred form of the work +for making modifications to it. "Object code" means any non-source +form of a work. + + A "Standard Interface" means an interface that either is an official +standard defined by a recognized standards body, or, in the case of +interfaces specified for a particular programming language, one that +is widely used among developers working in that language. + + The "System Libraries" of an executable work include anything, other +than the work as a whole, that (a) is included in the normal form of +packaging a Major Component, but which is not part of that Major +Component, and (b) serves only to enable use of the work with that +Major Component, or to implement a Standard Interface for which an +implementation is available to the public in source code form. A +"Major Component", in this context, means a major essential component +(kernel, window system, and so on) of the specific operating system +(if any) on which the executable work runs, or a compiler used to +produce the work, or an object code interpreter used to run it. + + The "Corresponding Source" for a work in object code form means all +the source code needed to generate, install, and (for an executable +work) run the object code and to modify the work, including scripts to +control those activities. However, it does not include the work's +System Libraries, or general-purpose tools or generally available free +programs which are used unmodified in performing those activities but +which are not part of the work. For example, Corresponding Source +includes interface definition files associated with source files for +the work, and the source code for shared libraries and dynamically +linked subprograms that the work is specifically designed to require, +such as by intimate data communication or control flow between those +subprograms and other parts of the work. + + The Corresponding Source need not include anything that users +can regenerate automatically from other parts of the Corresponding +Source. + + The Corresponding Source for a work in source code form is that +same work. + + 2. Basic Permissions. + + All rights granted under this License are granted for the term of +copyright on the Program, and are irrevocable provided the stated +conditions are met. This License explicitly affirms your unlimited +permission to run the unmodified Program. The output from running a +covered work is covered by this License only if the output, given its +content, constitutes a covered work. This License acknowledges your +rights of fair use or other equivalent, as provided by copyright law. + + You may make, run and propagate covered works that you do not +convey, without conditions so long as your license otherwise remains +in force. You may convey covered works to others for the sole purpose +of having them make modifications exclusively for you, or provide you +with facilities for running those works, provided that you comply with +the terms of this License in conveying all material for which you do +not control copyright. Those thus making or running the covered works +for you must do so exclusively on your behalf, under your direction +and control, on terms that prohibit them from making any copies of +your copyrighted material outside their relationship with you. + + Conveying under any other circumstances is permitted solely under +the conditions stated below. Sublicensing is not allowed; section 10 +makes it unnecessary. + + 3. Protecting Users' Legal Rights From Anti-Circumvention Law. + + No covered work shall be deemed part of an effective technological +measure under any applicable law fulfilling obligations under article +11 of the WIPO copyright treaty adopted on 20 December 1996, or +similar laws prohibiting or restricting circumvention of such +measures. + + When you convey a covered work, you waive any legal power to forbid +circumvention of technological measures to the extent such circumvention +is effected by exercising rights under this License with respect to +the covered work, and you disclaim any intention to limit operation or +modification of the work as a means of enforcing, against the work's +users, your or third parties' legal rights to forbid circumvention of +technological measures. + + 4. Conveying Verbatim Copies. + + You may convey verbatim copies of the Program's source code as you +receive it, in any medium, provided that you conspicuously and +appropriately publish on each copy an appropriate copyright notice; +keep intact all notices stating that this License and any +non-permissive terms added in accord with section 7 apply to the code; +keep intact all notices of the absence of any warranty; and give all +recipients a copy of this License along with the Program. + + You may charge any price or no price for each copy that you convey, +and you may offer support or warranty protection for a fee. + + 5. Conveying Modified Source Versions. + + You may convey a work based on the Program, or the modifications to +produce it from the Program, in the form of source code under the +terms of section 4, provided that you also meet all of these conditions: + + a) The work must carry prominent notices stating that you modified + it, and giving a relevant date. + + b) The work must carry prominent notices stating that it is + released under this License and any conditions added under section + 7. This requirement modifies the requirement in section 4 to + "keep intact all notices". + + c) You must license the entire work, as a whole, under this + License to anyone who comes into possession of a copy. This + License will therefore apply, along with any applicable section 7 + additional terms, to the whole of the work, and all its parts, + regardless of how they are packaged. This License gives no + permission to license the work in any other way, but it does not + invalidate such permission if you have separately received it. + + d) If the work has interactive user interfaces, each must display + Appropriate Legal Notices; however, if the Program has interactive + interfaces that do not display Appropriate Legal Notices, your + work need not make them do so. + + A compilation of a covered work with other separate and independent +works, which are not by their nature extensions of the covered work, +and which are not combined with it such as to form a larger program, +in or on a volume of a storage or distribution medium, is called an +"aggregate" if the compilation and its resulting copyright are not +used to limit the access or legal rights of the compilation's users +beyond what the individual works permit. Inclusion of a covered work +in an aggregate does not cause this License to apply to the other +parts of the aggregate. + + 6. Conveying Non-Source Forms. + + You may convey a covered work in object code form under the terms +of sections 4 and 5, provided that you also convey the +machine-readable Corresponding Source under the terms of this License, +in one of these ways: + + a) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by the + Corresponding Source fixed on a durable physical medium + customarily used for software interchange. + + b) Convey the object code in, or embodied in, a physical product + (including a physical distribution medium), accompanied by a + written offer, valid for at least three years and valid for as + long as you offer spare parts or customer support for that product + model, to give anyone who possesses the object code either (1) a + copy of the Corresponding Source for all the software in the + product that is covered by this License, on a durable physical + medium customarily used for software interchange, for a price no + more than your reasonable cost of physically performing this + conveying of source, or (2) access to copy the + Corresponding Source from a network server at no charge. + + c) Convey individual copies of the object code with a copy of the + written offer to provide the Corresponding Source. This + alternative is allowed only occasionally and noncommercially, and + only if you received the object code with such an offer, in accord + with subsection 6b. + + d) Convey the object code by offering access from a designated + place (gratis or for a charge), and offer equivalent access to the + Corresponding Source in the same way through the same place at no + further charge. You need not require recipients to copy the + Corresponding Source along with the object code. If the place to + copy the object code is a network server, the Corresponding Source + may be on a different server (operated by you or a third party) + that supports equivalent copying facilities, provided you maintain + clear directions next to the object code saying where to find the + Corresponding Source. Regardless of what server hosts the + Corresponding Source, you remain obligated to ensure that it is + available for as long as needed to satisfy these requirements. + + e) Convey the object code using peer-to-peer transmission, provided + you inform other peers where the object code and Corresponding + Source of the work are being offered to the general public at no + charge under subsection 6d. + + A separable portion of the object code, whose source code is excluded +from the Corresponding Source as a System Library, need not be +included in conveying the object code work. + + A "User Product" is either (1) a "consumer product", which means any +tangible personal property which is normally used for personal, family, +or household purposes, or (2) anything designed or sold for incorporation +into a dwelling. In determining whether a product is a consumer product, +doubtful cases shall be resolved in favor of coverage. For a particular +product received by a particular user, "normally used" refers to a +typical or common use of that class of product, regardless of the status +of the particular user or of the way in which the particular user +actually uses, or expects or is expected to use, the product. A product +is a consumer product regardless of whether the product has substantial +commercial, industrial or non-consumer uses, unless such uses represent +the only significant mode of use of the product. + + "Installation Information" for a User Product means any methods, +procedures, authorization keys, or other information required to install +and execute modified versions of a covered work in that User Product from +a modified version of its Corresponding Source. The information must +suffice to ensure that the continued functioning of the modified object +code is in no case prevented or interfered with solely because +modification has been made. + + If you convey an object code work under this section in, or with, or +specifically for use in, a User Product, and the conveying occurs as +part of a transaction in which the right of possession and use of the +User Product is transferred to the recipient in perpetuity or for a +fixed term (regardless of how the transaction is characterized), the +Corresponding Source conveyed under this section must be accompanied +by the Installation Information. But this requirement does not apply +if neither you nor any third party retains the ability to install +modified object code on the User Product (for example, the work has +been installed in ROM). + + The requirement to provide Installation Information does not include a +requirement to continue to provide support service, warranty, or updates +for a work that has been modified or installed by the recipient, or for +the User Product in which it has been modified or installed. Access to a +network may be denied when the modification itself materially and +adversely affects the operation of the network or violates the rules and +protocols for communication across the network. + + Corresponding Source conveyed, and Installation Information provided, +in accord with this section must be in a format that is publicly +documented (and with an implementation available to the public in +source code form), and must require no special password or key for +unpacking, reading or copying. + + 7. Additional Terms. + + "Additional permissions" are terms that supplement the terms of this +License by making exceptions from one or more of its conditions. +Additional permissions that are applicable to the entire Program shall +be treated as though they were included in this License, to the extent +that they are valid under applicable law. If additional permissions +apply only to part of the Program, that part may be used separately +under those permissions, but the entire Program remains governed by +this License without regard to the additional permissions. + + When you convey a copy of a covered work, you may at your option +remove any additional permissions from that copy, or from any part of +it. (Additional permissions may be written to require their own +removal in certain cases when you modify the work.) You may place +additional permissions on material, added by you to a covered work, +for which you have or can give appropriate copyright permission. + + Notwithstanding any other provision of this License, for material you +add to a covered work, you may (if authorized by the copyright holders of +that material) supplement the terms of this License with terms: + + a) Disclaiming warranty or limiting liability differently from the + terms of sections 15 and 16 of this License; or + + b) Requiring preservation of specified reasonable legal notices or + author attributions in that material or in the Appropriate Legal + Notices displayed by works containing it; or + + c) Prohibiting misrepresentation of the origin of that material, or + requiring that modified versions of such material be marked in + reasonable ways as different from the original version; or + + d) Limiting the use for publicity purposes of names of licensors or + authors of the material; or + + e) Declining to grant rights under trademark law for use of some + trade names, trademarks, or service marks; or + + f) Requiring indemnification of licensors and authors of that + material by anyone who conveys the material (or modified versions of + it) with contractual assumptions of liability to the recipient, for + any liability that these contractual assumptions directly impose on + those licensors and authors. + + All other non-permissive additional terms are considered "further +restrictions" within the meaning of section 10. If the Program as you +received it, or any part of it, contains a notice stating that it is +governed by this License along with a term that is a further +restriction, you may remove that term. If a license document contains +a further restriction but permits relicensing or conveying under this +License, you may add to a covered work material governed by the terms +of that license document, provided that the further restriction does +not survive such relicensing or conveying. + + If you add terms to a covered work in accord with this section, you +must place, in the relevant source files, a statement of the +additional terms that apply to those files, or a notice indicating +where to find the applicable terms. + + Additional terms, permissive or non-permissive, may be stated in the +form of a separately written license, or stated as exceptions; +the above requirements apply either way. + + 8. Termination. + + You may not propagate or modify a covered work except as expressly +provided under this License. Any attempt otherwise to propagate or +modify it is void, and will automatically terminate your rights under +this License (including any patent licenses granted under the third +paragraph of section 11). + + However, if you cease all violation of this License, then your +license from a particular copyright holder is reinstated (a) +provisionally, unless and until the copyright holder explicitly and +finally terminates your license, and (b) permanently, if the copyright +holder fails to notify you of the violation by some reasonable means +prior to 60 days after the cessation. + + Moreover, your license from a particular copyright holder is +reinstated permanently if the copyright holder notifies you of the +violation by some reasonable means, this is the first time you have +received notice of violation of this License (for any work) from that +copyright holder, and you cure the violation prior to 30 days after +your receipt of the notice. + + Termination of your rights under this section does not terminate the +licenses of parties who have received copies or rights from you under +this License. If your rights have been terminated and not permanently +reinstated, you do not qualify to receive new licenses for the same +material under section 10. + + 9. Acceptance Not Required for Having Copies. + + You are not required to accept this License in order to receive or +run a copy of the Program. Ancillary propagation of a covered work +occurring solely as a consequence of using peer-to-peer transmission +to receive a copy likewise does not require acceptance. However, +nothing other than this License grants you permission to propagate or +modify any covered work. These actions infringe copyright if you do +not accept this License. Therefore, by modifying or propagating a +covered work, you indicate your acceptance of this License to do so. + + 10. Automatic Licensing of Downstream Recipients. + + Each time you convey a covered work, the recipient automatically +receives a license from the original licensors, to run, modify and +propagate that work, subject to this License. You are not responsible +for enforcing compliance by third parties with this License. + + An "entity transaction" is a transaction transferring control of an +organization, or substantially all assets of one, or subdividing an +organization, or merging organizations. If propagation of a covered +work results from an entity transaction, each party to that +transaction who receives a copy of the work also receives whatever +licenses to the work the party's predecessor in interest had or could +give under the previous paragraph, plus a right to possession of the +Corresponding Source of the work from the predecessor in interest, if +the predecessor has it or can get it with reasonable efforts. + + You may not impose any further restrictions on the exercise of the +rights granted or affirmed under this License. For example, you may +not impose a license fee, royalty, or other charge for exercise of +rights granted under this License, and you may not initiate litigation +(including a cross-claim or counterclaim in a lawsuit) alleging that +any patent claim is infringed by making, using, selling, offering for +sale, or importing the Program or any portion of it. + + 11. Patents. + + A "contributor" is a copyright holder who authorizes use under this +License of the Program or a work on which the Program is based. The +work thus licensed is called the contributor's "contributor version". + + A contributor's "essential patent claims" are all patent claims +owned or controlled by the contributor, whether already acquired or +hereafter acquired, that would be infringed by some manner, permitted +by this License, of making, using, or selling its contributor version, +but do not include claims that would be infringed only as a +consequence of further modification of the contributor version. For +purposes of this definition, "control" includes the right to grant +patent sublicenses in a manner consistent with the requirements of +this License. + + Each contributor grants you a non-exclusive, worldwide, royalty-free +patent license under the contributor's essential patent claims, to +make, use, sell, offer for sale, import and otherwise run, modify and +propagate the contents of its contributor version. + + In the following three paragraphs, a "patent license" is any express +agreement or commitment, however denominated, not to enforce a patent +(such as an express permission to practice a patent or covenant not to +sue for patent infringement). To "grant" such a patent license to a +party means to make such an agreement or commitment not to enforce a +patent against the party. + + If you convey a covered work, knowingly relying on a patent license, +and the Corresponding Source of the work is not available for anyone +to copy, free of charge and under the terms of this License, through a +publicly available network server or other readily accessible means, +then you must either (1) cause the Corresponding Source to be so +available, or (2) arrange to deprive yourself of the benefit of the +patent license for this particular work, or (3) arrange, in a manner +consistent with the requirements of this License, to extend the patent +license to downstream recipients. "Knowingly relying" means you have +actual knowledge that, but for the patent license, your conveying the +covered work in a country, or your recipient's use of the covered work +in a country, would infringe one or more identifiable patents in that +country that you have reason to believe are valid. + + If, pursuant to or in connection with a single transaction or +arrangement, you convey, or propagate by procuring conveyance of, a +covered work, and grant a patent license to some of the parties +receiving the covered work authorizing them to use, propagate, modify +or convey a specific copy of the covered work, then the patent license +you grant is automatically extended to all recipients of the covered +work and works based on it. + + A patent license is "discriminatory" if it does not include within +the scope of its coverage, prohibits the exercise of, or is +conditioned on the non-exercise of one or more of the rights that are +specifically granted under this License. You may not convey a covered +work if you are a party to an arrangement with a third party that is +in the business of distributing software, under which you make payment +to the third party based on the extent of your activity of conveying +the work, and under which the third party grants, to any of the +parties who would receive the covered work from you, a discriminatory +patent license (a) in connection with copies of the covered work +conveyed by you (or copies made from those copies), or (b) primarily +for and in connection with specific products or compilations that +contain the covered work, unless you entered into that arrangement, +or that patent license was granted, prior to 28 March 2007. + + Nothing in this License shall be construed as excluding or limiting +any implied license or other defenses to infringement that may +otherwise be available to you under applicable patent law. + + 12. No Surrender of Others' Freedom. + + If conditions are imposed on you (whether by court order, agreement or +otherwise) that contradict the conditions of this License, they do not +excuse you from the conditions of this License. If you cannot convey a +covered work so as to satisfy simultaneously your obligations under this +License and any other pertinent obligations, then as a consequence you may +not convey it at all. For example, if you agree to terms that obligate you +to collect a royalty for further conveying from those to whom you convey +the Program, the only way you could satisfy both those terms and this +License would be to refrain entirely from conveying the Program. + + 13. Use with the GNU Affero General Public License. + + Notwithstanding any other provision of this License, you have +permission to link or combine any covered work with a work licensed +under version 3 of the GNU Affero General Public License into a single +combined work, and to convey the resulting work. The terms of this +License will continue to apply to the part which is the covered work, +but the special requirements of the GNU Affero General Public License, +section 13, concerning interaction through a network will apply to the +combination as such. + + 14. Revised Versions of this License. + + The Free Software Foundation may publish revised and/or new versions of +the GNU General Public License from time to time. Such new versions will +be similar in spirit to the present version, but may differ in detail to +address new problems or concerns. + + Each version is given a distinguishing version number. If the +Program specifies that a certain numbered version of the GNU General +Public License "or any later version" applies to it, you have the +option of following the terms and conditions either of that numbered +version or of any later version published by the Free Software +Foundation. If the Program does not specify a version number of the +GNU General Public License, you may choose any version ever published +by the Free Software Foundation. + + If the Program specifies that a proxy can decide which future +versions of the GNU General Public License can be used, that proxy's +public statement of acceptance of a version permanently authorizes you +to choose that version for the Program. + + Later license versions may give you additional or different +permissions. However, no additional obligations are imposed on any +author or copyright holder as a result of your choosing to follow a +later version. + + 15. Disclaimer of Warranty. + + THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY +APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT +HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY +OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, +THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR +PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM +IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF +ALL NECESSARY SERVICING, REPAIR OR CORRECTION. + + 16. Limitation of Liability. + + IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING +WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS +THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY +GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE +USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF +DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD +PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), +EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF +SUCH DAMAGES. + + 17. Interpretation of Sections 15 and 16. + + If the disclaimer of warranty and limitation of liability provided +above cannot be given local legal effect according to their terms, +reviewing courts shall apply local law that most closely approximates +an absolute waiver of all civil liability in connection with the +Program, unless a warranty or assumption of liability accompanies a +copy of the Program in return for a fee. + + END OF TERMS AND CONDITIONS + + How to Apply These Terms to Your New Programs + + If you develop a new program, and you want it to be of the greatest +possible use to the public, the best way to achieve this is to make it +free software which everyone can redistribute and change under these terms. + + To do so, attach the following notices to the program. It is safest +to attach them to the start of each source file to most effectively +state the exclusion of warranty; and each file should have at least +the "copyright" line and a pointer to where the full notice is found. + + + Copyright (C) + + This program is free software: you can redistribute it and/or modify + it under the terms of the GNU General Public License as published by + the Free Software Foundation, either version 3 of the License, or + (at your option) any later version. + + This program is distributed in the hope that it will be useful, + but WITHOUT ANY WARRANTY; without even the implied warranty of + MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the + GNU General Public License for more details. + + You should have received a copy of the GNU General Public License + along with this program. If not, see . + +Also add information on how to contact you by electronic and paper mail. + + If the program does terminal interaction, make it output a short +notice like this when it starts in an interactive mode: + + Copyright (C) + This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. + This is free software, and you are welcome to redistribute it + under certain conditions; type `show c' for details. + +The hypothetical commands `show w' and `show c' should show the appropriate +parts of the General Public License. Of course, your program's commands +might be different; for a GUI interface, you would use an "about box". + + You should also get your employer (if you work as a programmer) or school, +if any, to sign a "copyright disclaimer" for the program, if necessary. +For more information on this, and how to apply and follow the GNU GPL, see +. + + The GNU General Public License does not permit incorporating your program +into proprietary programs. If your program is a subroutine library, you +may consider it more useful to permit linking proprietary applications with +the library. If this is what you want to do, use the GNU Lesser General +Public License instead of this License. But first, please read +. diff --git a/README.md b/README.md new file mode 100755 index 0000000..9c74d46 --- /dev/null +++ b/README.md @@ -0,0 +1,11 @@ +# py_aes +Visited successfully the cryptography lecture and now experimenting a bit with AES in C++ and python. + +This short script/library is an approach to understand and implement the AES-128 en-/decryption not only to bit-lists, but also to typical files on your system. +At the moment, files can be en-/decrypted using only the 'electronic-code-book' mode (ECB), with a low security level in python. +Files of each type can be read, since files are opened binary. + +Future aspects/goals: + -more modes, like CBC etc. + -additional to files, take whole folders/paths for en-/decryption + -speed up the python script (xx-08-2017: ~10KB/sec) diff --git a/lib-cp/aes.cpp b/lib-cp/aes.cpp new file mode 100755 index 0000000..a634055 --- /dev/null +++ b/lib-cp/aes.cpp @@ -0,0 +1,101 @@ +#include "aes.hpp" +#include + +aes::aes(std::string && KeyWord){ + set_key(std::vector(KeyWord.begin(),KeyWord.end())); +} +aes::aes(std::string & KeyWord){ + set_key(std::vector(KeyWord.begin(),KeyWord.end())); +} +aes::aes(std::vector && KeyWord){ + set_key(std::vector(KeyWord.begin(),KeyWord.end())); +} +aes::aes(std::vector & KeyWord){ + set_key(std::vector(KeyWord.begin(),KeyWord.end())); +} +aes::aes(std::vector && KeyWord){ + set_key(KeyWord); +} +aes::aes(std::vector & KeyWord){ + set_key(KeyWord); +} + +void aes::set_key(std::vector && KeyWord){ + set_key(KeyWord); +} + +void aes::set_key(std::vector & KeyWord){ + _adjust_key_length(KeyWord); + std::vector< std::vector > KeyMatrix; + for(unsigned i = 0; i < MatDim; i++){ + std::vector NewCol; + for(unsigned j = 0; j < MatDim; j++){ + NewCol.push_back(KeyWord[j*4+i]); + } + KeyMatrix.push_back(NewCol); + } + for(unsigned i = 0; i < ((RoundNumber+1)*MatDim); i++){ + if(i%MatDim != 0){ + std::vector NewCol; + std::vector::iterator Prev = KeyMatrix[KeyMatrix.size()-1].begin(); + std::transform(KeyMatrix[i].begin(),KeyMatrix[i].end(),std::back_inserter(NewCol),[&Prev](const unsigned char Value){ + return Value^*(Prev++); + }); + KeyMatrix.push_back(NewCol); + } + else{ + std::vector NewCol; + std::vector< std::vector > _SBox = aes_base::_SBox; + std::transform(KeyMatrix[KeyMatrix.size()-1].begin(),KeyMatrix[KeyMatrix.size()-1].end(),std::back_inserter(NewCol),[_SBox](unsigned char & Value){ + return aes_base::_SBox[((Value&240) >> 4)][(Value&15)]; + }); + std::rotate(NewCol.begin(),NewCol.end()-1,NewCol.end()); + NewCol[1] ^= _RoundConst[(int)i/MatDim]; + + std::vector::iterator Prev = KeyMatrix[i].begin(); + std::transform(NewCol.begin(),NewCol.end(),NewCol.begin(),[&Prev](unsigned char & Value){ + return Value^*(Prev++); + }); + KeyMatrix.push_back(NewCol); + } + } + std::vector< std::vector > KeyRoundMatrix; + for(unsigned i = 0; i < (RoundNumber+2); i++){ + std::vector RoundKey; + for(unsigned j = 0; j < MatDim; j++){ + RoundKey.push_back(KeyMatrix[(i*MatDim)][j]); + RoundKey.push_back(KeyMatrix[(i*MatDim+1)][j]); + RoundKey.push_back(KeyMatrix[(i*MatDim+2)][j]); + RoundKey.push_back(KeyMatrix[(i*MatDim+3)][j]); + } + KeyRoundMatrix.push_back(RoundKey); + } + _KeyRoundMatrix = KeyRoundMatrix; + _InvKeyRoundMat = KeyRoundMatrix; + std::reverse(_InvKeyRoundMat.begin(),_InvKeyRoundMat.end()); +} +std::vector< std::vector > aes::key(){ + return _KeyRoundMatrix; +} +std::vector< std::vector > aes::key_inverse(){ + return _InvKeyRoundMat; +} + +unsigned aes::value(){ + return _Value; +} + +void aes::_adjust_key_length(std::vector & KeyWord){ + if(KeyWord.size() > ByteSize){ + KeyWord = std::vector(KeyWord.begin(),KeyWord.begin()+ByteSize); + } + else{ + unsigned LeftBitsSide = 240, RightBitsSide = 15, Idx = 0, Row, Col; + while(KeyWord.size() < ByteSize){ + Row = ((KeyWord[Idx]^LeftBitsSide) >> MatDim)%ByteSize; + Col = (KeyWord[Idx]^RightBitsSide)%ByteSize; + KeyWord.push_back(aes_base::_SBox[Row][Col]); + Idx = (Row+Col+KeyWord[KeyWord.size()-1])%ByteSize; + } + } +} \ No newline at end of file diff --git a/lib-cp/aes.hpp b/lib-cp/aes.hpp new file mode 100755 index 0000000..12d7398 --- /dev/null +++ b/lib-cp/aes.hpp @@ -0,0 +1,41 @@ +#ifndef AES_HPP_ +#define AES_HPP_ + +#include +#include +#include +#include + +#include "aesbase.hpp" + +class aes{ + public: + aes(std::string && KeyWord); + aes(std::string & KeyWord); + aes(std::vector && KeyWord); + aes(std::vector & KeyWord); + aes(std::vector && KeyWord); + aes(std::vector & KeyWord); + + std::vector< std::vector > key(); + std::vector< std::vector > key_inverse(); + void set_key(std::vector && KeyWord); + void set_key(std::vector & KeyWord); + bool Init; + unsigned value(); + + private: + void _adjust_key_length(std::vector & KeyWord); + + std::vector< std::vector > _KeyRoundMatrix; + std::vector< std::vector > _InvKeyRoundMat; + const std::vector _RoundConst = {0x01,0x02,0x04,0x08,0x10,0x20,0x40,0x80,0x1B,0x36}; + const unsigned MatDim = 4; + const unsigned Byte = 8; + const unsigned RoundNumber = 9; + const unsigned ByteSize = 16; + const unsigned BitSize = 128; + unsigned _Value; +}; + +#endif \ No newline at end of file diff --git a/lib-cp/aesbase.cpp b/lib-cp/aesbase.cpp new file mode 100755 index 0000000..03e9002 --- /dev/null +++ b/lib-cp/aesbase.cpp @@ -0,0 +1,156 @@ +#include "aesbase.hpp" + +std::vector aes_base::encrypt(std::vector PlainMatrix, std::vector & RoundKeyMatrix){ + bool Inverse = false; + std::vector Matrix = PlainMatrix; + _add_round_key(Matrix,RoundKeyMatrix.begin()); + for(unsigned i = 1; i <= _RoundNumber; i++){ + _byte_sub(Matrix,Inverse); + _shift_row(Matrix,Inverse); + _mix_columns(Matrix,Inverse); + _add_round_key(Matrix,RoundKeyMatrix.begin()+(i*_MatDim)); + } + _byte_sub(Matrix,Inverse); + _shift_row(Matrix,Inverse); + _add_round_key(Matrix,RoundKeyMatrix.begin()+(_RoundNumber*_MatDim)); + return Matrix; +} + +std::vector aes_base::decrypt(std::vector CipherMatrix, std::vector & RoundKeyMatrix){ + bool Inverse = true; + std::vector Matrix = CipherMatrix; + _add_round_key(Matrix,RoundKeyMatrix.begin()); + _shift_row(Matrix,Inverse); + _byte_sub(Matrix,Inverse); + for(unsigned i = 1; i <= _RoundNumber; i++){ + _add_round_key(Matrix,RoundKeyMatrix.begin()+(i*_MatDim)); + _mix_columns(Matrix,Inverse); + _shift_row(Matrix,Inverse); + _byte_sub(Matrix,Inverse); + } + _add_round_key(Matrix,RoundKeyMatrix.begin()+(_RoundNumber*_MatDim)); + return Matrix; +} + +void aes_base::_byte_sub(std::vector & Matrix, bool Inverse){ + unsigned Left = 240, Right = 15; + if(Inverse == false){ + std::transform(Matrix.begin(),Matrix.end(),Matrix.begin(),[Left,Right](unsigned char & Value){ + return _SBox[(Value^Left) >> _MatDim][(Value^Right)]; + }); + } + else{ + std::transform(Matrix.begin(),Matrix.end(),Matrix.begin(),[Left,Right](unsigned char & Value){ + return _SBoxInv[(Value^Left) >> _MatDim][(Value^Right)]; + }); + } +} + +void aes_base::_shift_row(std::vector & Matrix, bool Inverse){ + unsigned _MatDim = 4; + if(Inverse == false){ + for(unsigned i = 1; i < _MatDim; i++){ + std::rotate(Matrix.begin()+(i*_MatDim),Matrix.begin()+(i*_MatDim)+i,Matrix.begin()+((i+1)*_MatDim)); + } + } + else{ + for(unsigned i = 1; i < _MatDim; i++){ + std::rotate(Matrix.begin()+(i*_MatDim),Matrix.begin()+((i+1)*_MatDim)-i,Matrix.begin()+((i+1)*_MatDim)); + } + } +} + +void aes_base::_mix_columns(std::vector & Matrix, bool Inverse){ + if(Inverse == false){ + for(unsigned i = 0; i < _MatDim; i++){ + Matrix[i*_MatDim+0] = _g_mul(Matrix[i*_MatDim+0],2)^_g_mul(Matrix[i*_MatDim+1],3)^_g_mul(Matrix[i*_MatDim+2],1)^_g_mul(Matrix[i*_MatDim+3],1); + Matrix[i*_MatDim+1] = _g_mul(Matrix[i*_MatDim+0],1)^_g_mul(Matrix[i*_MatDim+1],2)^_g_mul(Matrix[i*_MatDim+2],3)^_g_mul(Matrix[i*_MatDim+3],1); + Matrix[i*_MatDim+2] = _g_mul(Matrix[i*_MatDim+0],1)^_g_mul(Matrix[i*_MatDim+1],1)^_g_mul(Matrix[i*_MatDim+2],2)^_g_mul(Matrix[i*_MatDim+3],3); + Matrix[i*_MatDim+3] = _g_mul(Matrix[i*_MatDim+0],1)^_g_mul(Matrix[i*_MatDim+1],1)^_g_mul(Matrix[i*_MatDim+2],1)^_g_mul(Matrix[i*_MatDim+3],2); + } + } + else{ + for(unsigned i = 0; i < _MatDim; i++){ + Matrix[i*_MatDim+0] = _g_mul(Matrix[i*_MatDim+0],14)^_g_mul(Matrix[i*_MatDim+1],11)^_g_mul(Matrix[i*_MatDim+2],13)^_g_mul(Matrix[i*_MatDim+3],9); + Matrix[i*_MatDim+1] = _g_mul(Matrix[i*_MatDim+0],9)^_g_mul(Matrix[i*_MatDim+1],14)^_g_mul(Matrix[i*_MatDim+2],11)^_g_mul(Matrix[i*_MatDim+3],13); + Matrix[i*_MatDim+2] = _g_mul(Matrix[i*_MatDim+0],13)^_g_mul(Matrix[i*_MatDim+1],9)^_g_mul(Matrix[i*_MatDim+2],14)^_g_mul(Matrix[i*_MatDim+3],11); + Matrix[i*_MatDim+3] = _g_mul(Matrix[i*_MatDim+0],11)^_g_mul(Matrix[i*_MatDim+1],13)^_g_mul(Matrix[i*_MatDim+2],9)^_g_mul(Matrix[i*_MatDim+3],14); + } + } +} + +void aes_base::_add_round_key(std::vector & Matrix, std::vector::iterator MatBegin){ + std::transform(Matrix.begin(),Matrix.end(),Matrix.begin(),[&MatBegin](unsigned char & Value){ + return Value^*(MatBegin++); + }); +} + +unsigned char aes_base::_g_mul(unsigned char Value, unsigned char Factor){ + if(Factor == 1){ + return Value; + } + else if(Factor == 2){ + if(Value < 128){ + return 2*Value; + } + else{ + return (2*Value)^(0x11b); + } + } + else if(Factor == 3){ + return _g_mul(Value,2)^Value; + } + else if(Factor == 9){ + return _g_mul(_g_mul(_g_mul(Value,2),2),2)^Value; + } + else if(Factor == 11){ + return _g_mul(_g_mul(_g_mul(Value,2),2)^Value,2)^Value; + } + else if(Factor == 13){ + return _g_mul(_g_mul(_g_mul(Value,2)^Value,2),2)^Value; + } + else if(Factor == 14){ + return _g_mul(_g_mul(_g_mul(Value,2)^Value,2)^Value,2); + } +} + +const std::vector< std::vector > aes_base::_SBox = { + {0x63, 0x7C, 0x77, 0x7B, 0xF2, 0x6B, 0x6F, 0xC5, 0x30, 0x01, 0x67, 0x2B, 0xFE, 0xD7, 0xAB, 0x76}, + {0xCA, 0x82, 0xC9, 0x7D, 0xFA, 0x59, 0x47, 0xF0, 0xAD, 0xD4, 0xA2, 0xAF, 0x9C, 0xA4, 0x72, 0xC0}, + {0xB7, 0xFD, 0x93, 0x26, 0x36, 0x3F, 0xF7, 0xCC, 0x34, 0xA5, 0xE5, 0xF1, 0x71, 0xD8, 0x31, 0x15}, + {0x04, 0xC7, 0x23, 0xC3, 0x18, 0x96, 0x05, 0x9A, 0x07, 0x12, 0x80, 0xE2, 0xEB, 0x27, 0xB2, 0x75}, + {0x09, 0x83, 0x2C, 0x1A, 0x1B, 0x6E, 0x5A, 0xA0, 0x52, 0x3B, 0xD6, 0xB3, 0x29, 0xE3, 0x2F, 0x84}, + {0x53, 0xD1, 0x00, 0xED, 0x20, 0xFC, 0xB1, 0x5B, 0x6A, 0xCB, 0xBE, 0x39, 0x4A, 0x4C, 0x58, 0xCF}, + {0xD0, 0xEF, 0xAA, 0xFB, 0x43, 0x4D, 0x33, 0x85, 0x45, 0xF9, 0x02, 0x7F, 0x50, 0x3C, 0x9F, 0xA8}, + {0x51, 0xA3, 0x40, 0x8F, 0x92, 0x9D, 0x38, 0xF5, 0xBC, 0xB6, 0xDA, 0x21, 0x10, 0xFF, 0xF3, 0xD2}, + {0xCD, 0x0C, 0x13, 0xEC, 0x5F, 0x97, 0x44, 0x17, 0xC4, 0xA7, 0x7E, 0x3D, 0x64, 0x5D, 0x19, 0x73}, + {0x60, 0x81, 0x4F, 0xDC, 0x22, 0x2A, 0x90, 0x88, 0x46, 0xEE, 0xB8, 0x14, 0xDE, 0x5E, 0x0B, 0xDB}, + {0xE0, 0x32, 0x3A, 0x0A, 0x49, 0x06, 0x24, 0x5C, 0xC2, 0xD3, 0xAC, 0x62, 0x91, 0x95, 0xE4, 0x79}, + {0xE7, 0xC8, 0x37, 0x6D, 0x8D, 0xD5, 0x4E, 0xA9, 0x6C, 0x56, 0xF4, 0xEA, 0x65, 0x7A, 0xAE, 0x08}, + {0xBA, 0x78, 0x25, 0x2E, 0x1C, 0xA6, 0xB4, 0xC6, 0xE8, 0xDD, 0x74, 0x1F, 0x4B, 0xBD, 0x8B, 0x8A}, + {0x70, 0x3E, 0xB5, 0x66, 0x48, 0x03, 0xF6, 0x0E, 0x61, 0x35, 0x57, 0xB9, 0x86, 0xC1, 0x1D, 0x9E}, + {0xE1, 0xF8, 0x98, 0x11, 0x69, 0xD9, 0x8E, 0x94, 0x9B, 0x1E, 0x87, 0xE9, 0xCE, 0x55, 0x28, 0xDF}, + {0x8C, 0xA1, 0x89, 0x0D, 0xBF, 0xE6, 0x42, 0x68, 0x41, 0x99, 0x2D, 0x0F, 0xB0, 0x54, 0xBB, 0x16} +}; +const std::vector< std::vector > aes_base::_SBoxInv = { + {0x52, 0x09, 0x6A, 0xD5, 0x30, 0x36, 0xA5, 0x38, 0xBF, 0x40, 0xA3, 0x9E, 0x81, 0xF3, 0xD7, 0xFB}, + {0x7C, 0xE3, 0x39, 0x82, 0x9B, 0x2F, 0xFF, 0x87, 0x34, 0x8E, 0x43, 0x44, 0xC4, 0xDE, 0xE9, 0xCB}, + {0x54, 0x7B, 0x94, 0x32, 0xA6, 0xC2, 0x23, 0x3D, 0xEE, 0x4C, 0x95, 0x0B, 0x42, 0xFA, 0xC3, 0x4E}, + {0x08, 0x2E, 0xA1, 0x66, 0x28, 0xD9, 0x24, 0xB2, 0x76, 0x5B, 0xA2, 0x49, 0x6D, 0x8B, 0xD1, 0x25}, + {0x72, 0xF8, 0xF6, 0x64, 0x86, 0x68, 0x98, 0x16, 0xD4, 0xA4, 0x5C, 0xCC, 0x5D, 0x65, 0xB6, 0x92}, + {0x6C, 0x70, 0x48, 0x50, 0xFD, 0xED, 0xB9, 0xDA, 0x5E, 0x15, 0x46, 0x57, 0xA7, 0x8D, 0x9D, 0x84}, + {0x90, 0xD8, 0xAB, 0x00, 0x8C, 0xBC, 0xD3, 0x0A, 0xF7, 0xE4, 0x58, 0x05, 0xB8, 0xB3, 0x45, 0x06}, + {0xD0, 0x2C, 0x1E, 0x8F, 0xCA, 0x3F, 0x0F, 0x02, 0xC1, 0xAF, 0xBD, 0x03, 0x01, 0x13, 0x8A, 0x6B}, + {0x3A, 0x91, 0x11, 0x41, 0x4F, 0x67, 0xDC, 0xEA, 0x97, 0xF2, 0xCF, 0xCE, 0xF0, 0xB4, 0xE6, 0x73}, + {0x96, 0xAC, 0x74, 0x22, 0xE7, 0xAD, 0x35, 0x85, 0xE2, 0xF9, 0x37, 0xE8, 0x1C, 0x75, 0xDF, 0x6E}, + {0x47, 0xF1, 0x1A, 0x71, 0x1D, 0x29, 0xC5, 0x89, 0x6F, 0xB7, 0x62, 0x0E, 0xAA, 0x18, 0xBE, 0x1B}, + {0xFC, 0x56, 0x3E, 0x4B, 0xC6, 0xD2, 0x79, 0x20, 0x9A, 0xDB, 0xC0, 0xFE, 0x78, 0xCD, 0x5A, 0xF4}, + {0x1F, 0xDD, 0xA8, 0x33, 0x88, 0x07, 0xC7, 0x31, 0xB1, 0x12, 0x10, 0x59, 0x27, 0x80, 0xEC, 0x5F}, + {0x60, 0x51, 0x7F, 0xA9, 0x19, 0xB5, 0x4A, 0x0D, 0x2D, 0xE5, 0x7A, 0x9F, 0x93, 0xC9, 0x9C, 0xEF}, + {0xA0, 0xE0, 0x3B, 0x4D, 0xAE, 0x2A, 0xF5, 0xB0, 0xC8, 0xEB, 0xBB, 0x3C, 0x83, 0x53, 0x99, 0x61}, + {0x17, 0x2B, 0x04, 0x7E, 0xBA, 0x77, 0xD6, 0x26, 0xE1, 0x69, 0x14, 0x63, 0x55, 0x21, 0x0C, 0x7D} +}; +const unsigned aes_base::_MatDim = 4; +const unsigned aes_base::_ByteSize = 16; +const unsigned aes_base::_RoundNumber = 9; +const unsigned aes_base::_BlockSize = 128; diff --git a/lib-cp/aesbase.hpp b/lib-cp/aesbase.hpp new file mode 100755 index 0000000..35209d5 --- /dev/null +++ b/lib-cp/aesbase.hpp @@ -0,0 +1,24 @@ +#ifndef AESBASE_CPP_ +#define AESBASE_CPP_ +#include +#include + +namespace aes_base{ + std::vector encrypt(std::vector PlainMatrix, std::vector & RoundKeyMatrix); + std::vector decrypt(std::vector CipherMatrix, std::vector & RoundKeyMatrix); + void _byte_sub(std::vector & Matrix, bool Inverse); + void _shift_row(std::vector & Matrix, bool Inverse); + void _mix_columns(std::vector & Matrix, bool Inverse); + void _add_round_key(std::vector & Matrix, std::vector::iterator MatBegin); + + unsigned char _g_mul(unsigned char Value, unsigned char Factor); + + extern const std::vector< std::vector > _SBox; + extern const std::vector< std::vector > _SBoxInv; + extern const unsigned _MatDim; + extern const unsigned _ByteSize; + extern const unsigned _RoundNumber; + extern const unsigned _BlockSize; +}; + +#endif \ No newline at end of file diff --git a/lib-cp/main.cpp b/lib-cp/main.cpp new file mode 100755 index 0000000..f1b41de --- /dev/null +++ b/lib-cp/main.cpp @@ -0,0 +1,26 @@ +#include +#include +#include + +#include "aes.hpp" + +int main(){ + std::vector Key = {0x1a,0x58,0x2a,0x1b,0xa1,0x0e,0xa0,0x18,0xf1,0x4a,0xc3,0x11,0xaa,0x2a,0xc1,0xff}; + aes CryptoSystem(Key); + + std::vector< std::vector > AES_Key = CryptoSystem.key(); + for(auto RoundKey : AES_Key){ + for(auto Value: RoundKey){ + std::cout << (char)(Value+'A') << ' '; + } + std::cout << std::endl; + } + + AES_Key = CryptoSystem.key_inverse(); + for(auto RoundKey : AES_Key){ + for(auto Value: RoundKey){ + std::cout << (char)(Value+'A') << ' '; + } + std::cout << std::endl; + } +} \ No newline at end of file diff --git a/lib-py/aes.py b/lib-py/aes.py new file mode 100755 index 0000000..6e934b5 --- /dev/null +++ b/lib-py/aes.py @@ -0,0 +1,292 @@ +import argparse, itertools, os +from copy import deepcopy +from os import path + +class aes_base: + _SBox = [ + [0x63, 0x7C, 0x77, 0x7B, 0xF2, 0x6B, 0x6F, 0xC5, 0x30, 0x01, 0x67, 0x2B, 0xFE, 0xD7, 0xAB, 0x76], + [0xCA, 0x82, 0xC9, 0x7D, 0xFA, 0x59, 0x47, 0xF0, 0xAD, 0xD4, 0xA2, 0xAF, 0x9C, 0xA4, 0x72, 0xC0], + [0xB7, 0xFD, 0x93, 0x26, 0x36, 0x3F, 0xF7, 0xCC, 0x34, 0xA5, 0xE5, 0xF1, 0x71, 0xD8, 0x31, 0x15], + [0x04, 0xC7, 0x23, 0xC3, 0x18, 0x96, 0x05, 0x9A, 0x07, 0x12, 0x80, 0xE2, 0xEB, 0x27, 0xB2, 0x75], + [0x09, 0x83, 0x2C, 0x1A, 0x1B, 0x6E, 0x5A, 0xA0, 0x52, 0x3B, 0xD6, 0xB3, 0x29, 0xE3, 0x2F, 0x84], + [0x53, 0xD1, 0x00, 0xED, 0x20, 0xFC, 0xB1, 0x5B, 0x6A, 0xCB, 0xBE, 0x39, 0x4A, 0x4C, 0x58, 0xCF], + [0xD0, 0xEF, 0xAA, 0xFB, 0x43, 0x4D, 0x33, 0x85, 0x45, 0xF9, 0x02, 0x7F, 0x50, 0x3C, 0x9F, 0xA8], + [0x51, 0xA3, 0x40, 0x8F, 0x92, 0x9D, 0x38, 0xF5, 0xBC, 0xB6, 0xDA, 0x21, 0x10, 0xFF, 0xF3, 0xD2], + [0xCD, 0x0C, 0x13, 0xEC, 0x5F, 0x97, 0x44, 0x17, 0xC4, 0xA7, 0x7E, 0x3D, 0x64, 0x5D, 0x19, 0x73], + [0x60, 0x81, 0x4F, 0xDC, 0x22, 0x2A, 0x90, 0x88, 0x46, 0xEE, 0xB8, 0x14, 0xDE, 0x5E, 0x0B, 0xDB], + [0xE0, 0x32, 0x3A, 0x0A, 0x49, 0x06, 0x24, 0x5C, 0xC2, 0xD3, 0xAC, 0x62, 0x91, 0x95, 0xE4, 0x79], + [0xE7, 0xC8, 0x37, 0x6D, 0x8D, 0xD5, 0x4E, 0xA9, 0x6C, 0x56, 0xF4, 0xEA, 0x65, 0x7A, 0xAE, 0x08], + [0xBA, 0x78, 0x25, 0x2E, 0x1C, 0xA6, 0xB4, 0xC6, 0xE8, 0xDD, 0x74, 0x1F, 0x4B, 0xBD, 0x8B, 0x8A], + [0x70, 0x3E, 0xB5, 0x66, 0x48, 0x03, 0xF6, 0x0E, 0x61, 0x35, 0x57, 0xB9, 0x86, 0xC1, 0x1D, 0x9E], + [0xE1, 0xF8, 0x98, 0x11, 0x69, 0xD9, 0x8E, 0x94, 0x9B, 0x1E, 0x87, 0xE9, 0xCE, 0x55, 0x28, 0xDF], + [0x8C, 0xA1, 0x89, 0x0D, 0xBF, 0xE6, 0x42, 0x68, 0x41, 0x99, 0x2D, 0x0F, 0xB0, 0x54, 0xBB, 0x16] + ] + _SBoxInv = [ + [0x52, 0x09, 0x6A, 0xD5, 0x30, 0x36, 0xA5, 0x38, 0xBF, 0x40, 0xA3, 0x9E, 0x81, 0xF3, 0xD7, 0xFB], + [0x7C, 0xE3, 0x39, 0x82, 0x9B, 0x2F, 0xFF, 0x87, 0x34, 0x8E, 0x43, 0x44, 0xC4, 0xDE, 0xE9, 0xCB], + [0x54, 0x7B, 0x94, 0x32, 0xA6, 0xC2, 0x23, 0x3D, 0xEE, 0x4C, 0x95, 0x0B, 0x42, 0xFA, 0xC3, 0x4E], + [0x08, 0x2E, 0xA1, 0x66, 0x28, 0xD9, 0x24, 0xB2, 0x76, 0x5B, 0xA2, 0x49, 0x6D, 0x8B, 0xD1, 0x25], + [0x72, 0xF8, 0xF6, 0x64, 0x86, 0x68, 0x98, 0x16, 0xD4, 0xA4, 0x5C, 0xCC, 0x5D, 0x65, 0xB6, 0x92], + [0x6C, 0x70, 0x48, 0x50, 0xFD, 0xED, 0xB9, 0xDA, 0x5E, 0x15, 0x46, 0x57, 0xA7, 0x8D, 0x9D, 0x84], + [0x90, 0xD8, 0xAB, 0x00, 0x8C, 0xBC, 0xD3, 0x0A, 0xF7, 0xE4, 0x58, 0x05, 0xB8, 0xB3, 0x45, 0x06], + [0xD0, 0x2C, 0x1E, 0x8F, 0xCA, 0x3F, 0x0F, 0x02, 0xC1, 0xAF, 0xBD, 0x03, 0x01, 0x13, 0x8A, 0x6B], + [0x3A, 0x91, 0x11, 0x41, 0x4F, 0x67, 0xDC, 0xEA, 0x97, 0xF2, 0xCF, 0xCE, 0xF0, 0xB4, 0xE6, 0x73], + [0x96, 0xAC, 0x74, 0x22, 0xE7, 0xAD, 0x35, 0x85, 0xE2, 0xF9, 0x37, 0xE8, 0x1C, 0x75, 0xDF, 0x6E], + [0x47, 0xF1, 0x1A, 0x71, 0x1D, 0x29, 0xC5, 0x89, 0x6F, 0xB7, 0x62, 0x0E, 0xAA, 0x18, 0xBE, 0x1B], + [0xFC, 0x56, 0x3E, 0x4B, 0xC6, 0xD2, 0x79, 0x20, 0x9A, 0xDB, 0xC0, 0xFE, 0x78, 0xCD, 0x5A, 0xF4], + [0x1F, 0xDD, 0xA8, 0x33, 0x88, 0x07, 0xC7, 0x31, 0xB1, 0x12, 0x10, 0x59, 0x27, 0x80, 0xEC, 0x5F], + [0x60, 0x51, 0x7F, 0xA9, 0x19, 0xB5, 0x4A, 0x0D, 0x2D, 0xE5, 0x7A, 0x9F, 0x93, 0xC9, 0x9C, 0xEF], + [0xA0, 0xE0, 0x3B, 0x4D, 0xAE, 0x2A, 0xF5, 0xB0, 0xC8, 0xEB, 0xBB, 0x3C, 0x83, 0x53, 0x99, 0x61], + [0x17, 0x2B, 0x04, 0x7E, 0xBA, 0x77, 0xD6, 0x26, 0xE1, 0x69, 0x14, 0x63, 0x55, 0x21, 0x0C, 0x7D] + ] + ByteSize = 8 + RoundNumber = 9 + BlockSize = 128 + def encrypt(PlainTextMatrix,KeyRoundMatrix): + Inverse = False + ARK = aes_base._add_round_key(PlainTextMatrix,aes_base._get_round_key(KeyRoundMatrix,0)) + for i in range(aes_base.RoundNumber): + BSB = aes_base._byte_sub(ARK,Inverse) + SR = aes_base._shift_row(BSB,Inverse) + MC = aes_base._mix_columns(SR,Inverse) + ARK = aes_base._add_round_key(MC,aes_base._get_round_key(KeyRoundMatrix,i+1)) + BSB = aes_base._byte_sub(ARK,Inverse) + SR = aes_base._shift_row(BSB,Inverse) + ARK = aes_base._add_round_key(SR,aes_base._get_round_key(KeyRoundMatrix,aes_base.RoundNumber+1)) + return ARK + def decrypt(CipherTextMatrix,KeyRoundMatrix): + Inverse = True + ARK = aes_base._add_round_key(CipherTextMatrix,aes_base._get_round_key(KeyRoundMatrix,0)) + SR = aes_base._shift_row(ARK,Inverse) + BSB = aes_base._byte_sub(SR,Inverse) + for i in range(aes_base.RoundNumber): + ARK = aes_base._add_round_key(BSB,aes_base._get_round_key(KeyRoundMatrix,i+1)) + MC = aes_base._mix_columns(ARK,Inverse) + SR = aes_base._shift_row(MC,Inverse) + BSB = aes_base._byte_sub(SR,Inverse) + ARK = aes_base._add_round_key(BSB,aes_base._get_round_key(KeyRoundMatrix,aes_base.RoundNumber+1)) + return ARK + def _byte_sub(Matrix,Inverse = False): + if Inverse == False: + return [[aes_base._SBox[int(bin(Value)[2:].zfill(8)[:aes_base.ByteSize//2],2)][int(bin(Value)[2:].zfill(8)[aes_base.ByteSize//2:],2)] for Value in Row] for Row in Matrix] + else: + return [[aes_base._SBoxInv[int(bin(Value)[2:].zfill(8)[:aes_base.ByteSize//2],2)][int(bin(Value)[2:].zfill(8)[aes_base.ByteSize//2:],2)] for Value in Row] for Row in Matrix] + def _shift_row(Matrix,Inverse = False): + if Inverse == False: + return [aes_base._row_rotate(Row,Idx) for Idx,Row in enumerate(Matrix)] + else: + return [aes_base._row_rotate(Row,Idx,True) for Idx,Row in enumerate(Matrix)] + def _mix_columns(Matrix,Inverse = False): + MC = deepcopy(Matrix) + if Inverse == False: + for i in range(aes_base.ByteSize//2): + MC[0][i] = aes_base._g_mul(Matrix[0][i],2)^aes_base._g_mul(Matrix[1][i],3)^aes_base._g_mul(Matrix[2][i],1)^aes_base._g_mul(Matrix[3][i],1) + MC[1][i] = aes_base._g_mul(Matrix[0][i],1)^aes_base._g_mul(Matrix[1][i],2)^aes_base._g_mul(Matrix[2][i],3)^aes_base._g_mul(Matrix[3][i],1) + MC[2][i] = aes_base._g_mul(Matrix[0][i],1)^aes_base._g_mul(Matrix[1][i],1)^aes_base._g_mul(Matrix[2][i],2)^aes_base._g_mul(Matrix[3][i],3) + MC[3][i] = aes_base._g_mul(Matrix[0][i],3)^aes_base._g_mul(Matrix[1][i],1)^aes_base._g_mul(Matrix[2][i],1)^aes_base._g_mul(Matrix[3][i],2) + else: + for i in range(aes_base.ByteSize//2): + MC[0][i] = aes_base._g_mul(Matrix[0][i],14)^aes_base._g_mul(Matrix[1][i],11)^aes_base._g_mul(Matrix[2][i],13)^aes_base._g_mul(Matrix[3][i],9) + MC[1][i] = aes_base._g_mul(Matrix[0][i],9)^aes_base._g_mul(Matrix[1][i],14)^aes_base._g_mul(Matrix[2][i],11)^aes_base._g_mul(Matrix[3][i],13) + MC[2][i] = aes_base._g_mul(Matrix[0][i],13)^aes_base._g_mul(Matrix[1][i],9)^aes_base._g_mul(Matrix[2][i],14)^aes_base._g_mul(Matrix[3][i],11) + MC[3][i] = aes_base._g_mul(Matrix[0][i],11)^aes_base._g_mul(Matrix[1][i],13)^aes_base._g_mul(Matrix[2][i],9)^aes_base._g_mul(Matrix[3][i],14) + return MC + def _add_round_key(Matrix,KeyRoundMatrix): + return [[Value^KeyRoundMatrix[Idx][Jdx] for Jdx,Value in enumerate(Row)] for Idx,Row in enumerate(Matrix)] + def _row_rotate(OldRow,Rotation,Inverse = False): + Row = deepcopy(OldRow) + if Inverse == False: #to left + for i in range(Rotation): + Row.append(Row.pop(0)) + else: + for i in range(Rotation): + Row.insert(0,Row.pop()) + return Row + def _g_mul(Value,Factor): + if Factor == 1: + return Value + elif Factor == 2: + if Value < 2**7: + return 2*Value + else: + return (2*Value)^(0x11b) + elif Factor == 3: + return aes_base._g_mul(Value,2)^Value + elif Factor == 9: + return aes_base._g_mul(aes_base._g_mul(aes_base._g_mul(Value,2),2),2)^Value + elif Factor == 11: + return aes_base._g_mul(aes_base._g_mul(aes_base._g_mul(Value,2),2)^Value,2)^Value + elif Factor == 13: + return aes_base._g_mul(aes_base._g_mul(aes_base._g_mul(Value,2)^Value,2),2)^Value + elif Factor == 14: + return aes_base._g_mul(aes_base._g_mul(aes_base._g_mul(Value,2)^Value,2)^Value,2) + def _get_round_key(KeyRoundMatrix,Round): + return [[Col[i] for Col in KeyRoundMatrix[Round*(aes_base.ByteSize//2):(Round+1)*aes_base.ByteSize]] for i in range(aes_base.ByteSize//2)] + + +class aes: + MatDim = 4 + Byte = 8 + ByteSize = 16 + BitSize = 128 + RoundConst = [0x01,0x02,0x04,0x08,0x10,0x20,0x40,0x80,0x1B,0x36] + def __init__(self,Key,OpMode = 'ECB'): + self._OpMode = OpMode + self._KeyRoundMatrix = aes._key_expansion(Key) + self._InvKeyRoundMat = aes._key_inversion(self._KeyRoundMatrix) + self._Format = list + def encrypt(self,TextString): + ByteMatrix = self._format_input(TextString) + EncryptMatrix = aes_base.encrypt(ByteMatrix,self._KeyRoundMatrix) + Encryption = self._format_output(EncryptMatrix) + return Encryption + def encrypt_file(self,FileName): + File = open(FileName,'r+b') + Block = 'EMPTY' + TextLeng = 0 + while len(Block) != 0: + WritePos = File.tell() + Block = File.read(aes.ByteSize) + TextLeng += len(Block) + if len(Block) != 0: + File.seek(WritePos) + File.write(self.encrypt(Block)) + File.write(self.encrypt(aes._size_to_bytes(TextLeng))) + File.close() + def encrypt_folder(self,FolderName): + Files = [] + Folders = [] + for Item in os.listdir(FolderName): + PathName = path.join(FolderName,Item) + if path.isfile(PathName): + Files.append(PathName) + elif path.isdir(PathName): + Folders.append(PathName) + for File in Files: + self.encrypt_file(File) + File = [] + for Folder in Folders: + self.encrypt_folder(Folder) + def decrypt(self,TextString): + ByteMatrix = self._format_input(TextString) + DecryptMatrix = aes_base.decrypt(ByteMatrix,self._InvKeyRoundMat) + Decryption = self._format_output(DecryptMatrix) + return Decryption + def decrypt_file(self,FileName): + File = open(FileName,'r+b') + Block = 'EMPTY' + while len(Block) != 0: + WritePos = File.tell() + Block = File.read(aes.ByteSize) + if len(Block) != 0: + File.seek(WritePos) + File.write(self.decrypt(Block)) + File.seek(WritePos-aes.ByteSize) + TextLeng = aes._bytes_to_size(File.read(aes.ByteSize)) + if(TextLeng < (2**64-1)): + File.seek(0) + File.truncate(TextLeng) + File.close() + def decrypt_folder(self,FolderName): + Files = [] + Folders = [] + for Item in os.listdir(FolderName): + PathName = path.join(FolderName,Item) + if path.isfile(PathName): + Files.append(PathName) + elif path.isdir(PathName): + Folders.append(PathName) + for File in Files: + self.decrypt_file(File) + File = [] + for Folder in Folders: + self.decrypt_folder(Folder) + def _key_expansion(Key): + KeyMatrix = list(bytes(Key.encode())) + LeftBitsSide = 2**aes.Byte-2**(aes.Byte//2) + RightBitsSide = 2**aes.Byte-1 + Idx = 0 + while(len(KeyMatrix) != aes.ByteSize): + Row = ((KeyMatrix[Idx]&LeftBitsSide) >> aes.Byte//2)%aes.ByteSize + Col = ((KeyMatrix[Idx]&RightBitsSide))%aes.ByteSize + KeyMatrix.append(aes_base._SBox[Row][Col]) + Idx = (Row+Col+KeyMatrix[-1])%aes.ByteSize + KeyRoundMatrix = [KeyMatrix[i*aes.MatDim:(i+1)*aes.MatDim] for i in range(aes.MatDim)] + for i in range(aes.MatDim*(aes_base.RoundNumber+1)): + if i%(aes.MatDim) != 0: + KeyRoundMatrix.append([KeyRoundMatrix[i][Idx]^Value for Idx,Value in enumerate(KeyRoundMatrix[-1])]) + else: + KeyTrafo = aes._key_col_trafo(KeyRoundMatrix[-1],i) + KeyRoundMatrix.append([KeyRoundMatrix[i][Idx]^Value for Idx,Value in enumerate(KeyTrafo)]) + return KeyRoundMatrix + def _key_col_trafo(Col,Round): + return [aes._key_sbox_trafo(Col[3]), aes._key_sbox_trafo(Col[0])^aes.RoundConst[Round//aes.MatDim], aes._key_sbox_trafo(Col[1]), aes._key_sbox_trafo(Col[2])] + def _key_sbox_trafo(Value): + return aes_base._SBox[((Value^(2**aes.Byte-2**(aes.Byte//2))) >> aes.Byte//2)%aes.ByteSize][((Value^(2**aes.Byte-1)))%aes.ByteSize] + def _key_inversion(KeyMatrix): + return list(itertools.chain.from_iterable(reversed([KeyMatrix[(i*aes.MatDim):(i+1)*aes.MatDim] for i in range(aes_base.RoundNumber+2)]))) + def _8bit_to_byte(Bits): + Byte = 0 + for Idx,Bit in enumerate(reversed(Bits)): + Byte |= (Bit << Idx) + return Byte + def _size_to_bytes(Size): + BitList = list(map(int,list(bin(Size)[2:].zfill(aes.BitSize)))) + return bytes([ aes._8bit_to_byte(BitList[i*aes.Byte:(i+1)*aes.Byte]) for i in range(aes.ByteSize)]) + def _bytes_to_size(Bytes): + return int(''.join([ bin(Block)[2:].zfill(aes.Byte) for Block in list(Bytes)]),2) + def _format_input(self,TextString): + ByteList = [] + ByteMatrix = [] + if type(TextString) is str: + ByteList = list(TextString.encode()) + ByteList.extend([255]*(aes.ByteSize-len(ByteList))) + self._Format = bytes + elif type(TextString) is bytes: + ByteList = list(TextString) + ByteList.extend([255]*(aes.ByteSize-len(ByteList))) + self._Format = bytes + elif type(TextString) is list: + ByteList = [int(Sig) for Sig in TextString]+[255]*(aes.ByteSize-len(TextString)) + self._Format = list + else: + raise TypeError('Input must be either String, Bytes or List') + if len(ByteList) == aes.ByteSize: + ByteMatrix = [ByteList[i*aes.MatDim:(i+1)*aes.MatDim] for i in range(aes.MatDim)] + elif len(ByteList) == aes.BitSize: + pass #TODO 128-BitList to 16Byte Matrix + else: + raise ValueError('Input must contain 16 Bytes or 128 Bits') + return ByteMatrix + def _format_output(self,ByteMatrix): + TextString = list(itertools.chain.from_iterable(ByteMatrix)) + if self._Format is bytes: + TextString = bytes(TextString) + return TextString + + + +Parser = argparse.ArgumentParser(description='En-/Decryption for Strings,Files and Folders') +Parser.add_argument('--file', metavar='', type=str, nargs=1, help='File that should be en-/decrypted.', required = False) +Parser.add_argument('--folder', metavar='', type=str, nargs=1, help='Folder with files that should be en-/decrypted; recursive.', required = False) +Parser.add_argument('--text', metavar='', type=str, nargs=1, help='File that should be en-/decrypted.', required = False) +Parser.add_argument('--key', metavar='', type=str, nargs=1, help='asdf', required = True) +Parser.add_argument('--decrypt', help='Enable input file decryption', action='store_true', required = False) +Args = Parser.parse_args() + +KeyWord = Args.key[0] +Decryption = Args.decrypt +CryptoSystem = aes(KeyWord) +if not (Args.file or Args.folder or Args.text): + Parser.error('one of the following arguments is requested: --file, --folder, --text') + +if Decryption == False: + if Args.file: + CryptoSystem.encrypt_file(Args.file[0]) + elif Args.folder: + CryptoSystem.encrypt_folder(Args.folder[0]) +else: + if Args.file: + CryptoSystem.decrypt_file(Args.file[0]) + elif Args.folder: + CryptoSystem.decrypt_folder(Args.folder[0]) \ No newline at end of file diff --git a/lib-py/sample.dat b/lib-py/sample.dat new file mode 100755 index 0000000..0dc2dd3 --- /dev/null +++ b/lib-py/sample.dat @@ -0,0 +1,2 @@ +This is my textfile and I like it very much! +\\Herro!!$$@@ \ No newline at end of file diff --git a/lib-py/sample_folder/sample.dat b/lib-py/sample_folder/sample.dat new file mode 100755 index 0000000..0dc2dd3 --- /dev/null +++ b/lib-py/sample_folder/sample.dat @@ -0,0 +1,2 @@ +This is my textfile and I like it very much! +\\Herro!!$$@@ \ No newline at end of file diff --git a/lib-py/sample_folder/sample2.dat b/lib-py/sample_folder/sample2.dat new file mode 100755 index 0000000..e59e1c2 --- /dev/null +++ b/lib-py/sample_folder/sample2.dat @@ -0,0 +1,2 @@ +This is my textfile and I like it very much! +\\Herro!!$$@@ This is another FILE \ No newline at end of file diff --git a/lib-py/sample_folder/sample2_folder/sample.dat b/lib-py/sample_folder/sample2_folder/sample.dat new file mode 100755 index 0000000..0dc2dd3 --- /dev/null +++ b/lib-py/sample_folder/sample2_folder/sample.dat @@ -0,0 +1,2 @@ +This is my textfile and I like it very much! +\\Herro!!$$@@ \ No newline at end of file diff --git a/lib-py/sample_folder/sample2_folder/sample2.dat b/lib-py/sample_folder/sample2_folder/sample2.dat new file mode 100755 index 0000000..e59e1c2 --- /dev/null +++ b/lib-py/sample_folder/sample2_folder/sample2.dat @@ -0,0 +1,2 @@ +This is my textfile and I like it very much! +\\Herro!!$$@@ This is another FILE \ No newline at end of file