├── .gitignore ├── FileSafe.pro ├── LICENSE ├── QAESEncryption ├── QAESEncryption.pri ├── aesni │ ├── aesni-enc-cbc.h │ ├── aesni-enc-ecb.h │ └── aesni-key-exp.h ├── qaesencryption.cpp └── qaesencryption.h ├── README.assets ├── image-20211212145456668.png ├── image-20211212145538922.png └── image-20211212145809841.png ├── README.md ├── Safe.ico ├── fileencryption.cpp ├── fileencryption.h ├── image.qrc ├── image ├── Safe.ico ├── Safe.png ├── close.png └── min.png ├── main.cpp ├── widget.cpp ├── widget.h └── widget.ui /.gitignore: -------------------------------------------------------------------------------- 1 | ### Qt ### 2 | # C++ objects and libs 3 | *.slo 4 | *.lo 5 | *.o 6 | *.a 7 | *.la 8 | *.lai 9 | *.so 10 | *.dylib 11 | 12 | # Qt-es 13 | object_script.*.Release 14 | object_script.*.Debug 15 | *_plugin_import.cpp 16 | /.qmake.cache 17 | /.qmake.stash 18 | *.pro.user 19 | *.pro.user.* 20 | *.qbs.user 21 | *.qbs.user.* 22 | *.moc 23 | moc_*.cpp 24 | moc_*.h 25 | qrc_*.cpp 26 | ui_*.h 27 | *.qmlc 28 | *.jsc 29 | Makefile* 30 | *build-* 31 | 32 | # Qt unit tests 33 | target_wrapper.* 34 | 35 | # QtCreator 36 | *.autosave 37 | 38 | # QtCreator Qml 39 | *.qmlproject.user 40 | *.qmlproject.user.* 41 | 42 | # QtCreator CMake 43 | CMakeLists.txt.user* 44 | 45 | # QtCreator 4.8< compilation database 46 | compile_commands.json 47 | 48 | # QtCreator local machine specific files for imported projects 49 | *creator.user* 50 | -------------------------------------------------------------------------------- /FileSafe.pro: -------------------------------------------------------------------------------- 1 | QT += core gui 2 | 3 | greaterThan(QT_MAJOR_VERSION, 4): QT += widgets 4 | 5 | CONFIG += c++11 6 | DESTDIR = $$PWD/../bin/ # 指定可执行程序路径 7 | 8 | VERSION = 1.1.1 9 | RC_ICONS = Safe.ico # 设置图标，必须放在工程路径下 10 | # You can make your code fail to compile if it uses deprecated APIs. 11 | # In order to do so, uncomment the following line. 12 | #DEFINES += QT_DISABLE_DEPRECATED_BEFORE=0x060000 # disables all the APIs deprecated before Qt 6.0.0 13 | 14 | SOURCES += \ 15 | fileencryption.cpp \ 16 | main.cpp \ 17 | widget.cpp 18 | 19 | HEADERS += \ 20 | fileencryption.h \ 21 | widget.h 22 | 23 | FORMS += \ 24 | widget.ui 25 | 26 | # Default rules for deployment. 27 | qnx: target.path = /tmp/$${TARGET}/bin 28 | else: unix:!android: target.path = /opt/$${TARGET}/bin 29 | !isEmpty(target.path): INSTALLS += target 30 | 31 | RESOURCES += \ 32 | image.qrc 33 | 34 | 35 | include(QAESEncryption/QAESEncryption.pri) 36 | INCLUDEPATH += $$PWD/QAESEncryption/ 37 | -------------------------------------------------------------------------------- /LICENSE: -------------------------------------------------------------------------------- 1 | GNU GENERAL PUBLIC LICENSE 2 | Version 3, 29 June 2007 3 | 4 | Copyright (C) 2007 Free Software Foundation, Inc. 5 | Everyone is permitted to copy and distribute verbatim copies 6 | of this license document, but changing it is not allowed. 7 | 8 | Preamble 9 | 10 | The GNU General Public License is a free, copyleft license for 11 | software and other kinds of works. 12 | 13 | The licenses for most software and other practical works are designed 14 | to take away your freedom to share and change the works. By contrast, 15 | the GNU General Public License is intended to guarantee your freedom to 16 | share and change all versions of a program--to make sure it remains free 17 | software for all its users. We, the Free Software Foundation, use the 18 | GNU General Public License for most of our software; it applies also to 19 | any other work released this way by its authors. You can apply it to 20 | your programs, too. 21 | 22 | When we speak of free software, we are referring to freedom, not 23 | price. Our General Public Licenses are designed to make sure that you 24 | have the freedom to distribute copies of free software (and charge for 25 | them if you wish), that you receive source code or can get it if you 26 | want it, that you can change the software or use pieces of it in new 27 | free programs, and that you know you can do these things. 28 | 29 | To protect your rights, we need to prevent others from denying you 30 | these rights or asking you to surrender the rights. Therefore, you have 31 | certain responsibilities if you distribute copies of the software, or if 32 | you modify it: responsibilities to respect the freedom of others. 33 | 34 | For example, if you distribute copies of such a program, whether 35 | gratis or for a fee, you must pass on to the recipients the same 36 | freedoms that you received. You must make sure that they, too, receive 37 | or can get the source code. And you must show them these terms so they 38 | know their rights. 39 | 40 | Developers that use the GNU GPL protect your rights with two steps: 41 | (1) assert copyright on the software, and (2) offer you this License 42 | giving you legal permission to copy, distribute and/or modify it. 43 | 44 | For the developers' and authors' protection, the GPL clearly explains 45 | that there is no warranty for this free software. For both users' and 46 | authors' sake, the GPL requires that modified versions be marked as 47 | changed, so that their problems will not be attributed erroneously to 48 | authors of previous versions. 49 | 50 | Some devices are designed to deny users access to install or run 51 | modified versions of the software inside them, although the manufacturer 52 | can do so. This is fundamentally incompatible with the aim of 53 | protecting users' freedom to change the software. The systematic 54 | pattern of such abuse occurs in the area of products for individuals to 55 | use, which is precisely where it is most unacceptable. Therefore, we 56 | have designed this version of the GPL to prohibit the practice for those 57 | products. If such problems arise substantially in other domains, we 58 | stand ready to extend this provision to those domains in future versions 59 | of the GPL, as needed to protect the freedom of users. 60 | 61 | Finally, every program is threatened constantly by software patents. 62 | States should not allow patents to restrict development and use of 63 | software on general-purpose computers, but in those that do, we wish to 64 | avoid the special danger that patents applied to a free program could 65 | make it effectively proprietary. To prevent this, the GPL assures that 66 | patents cannot be used to render the program non-free. 67 | 68 | The precise terms and conditions for copying, distribution and 69 | modification follow. 70 | 71 | TERMS AND CONDITIONS 72 | 73 | 0. Definitions. 74 | 75 | "This License" refers to version 3 of the GNU General Public License. 76 | 77 | "Copyright" also means copyright-like laws that apply to other kinds of 78 | works, such as semiconductor masks. 79 | 80 | "The Program" refers to any copyrightable work licensed under this 81 | License. Each licensee is addressed as "you". "Licensees" and 82 | "recipients" may be individuals or organizations. 83 | 84 | To "modify" a work means to copy from or adapt all or part of the work 85 | in a fashion requiring copyright permission, other than the making of an 86 | exact copy. The resulting work is called a "modified version" of the 87 | earlier work or a work "based on" the earlier work. 88 | 89 | A "covered work" means either the unmodified Program or a work based 90 | on the Program. 91 | 92 | To "propagate" a work means to do anything with it that, without 93 | permission, would make you directly or secondarily liable for 94 | infringement under applicable copyright law, except executing it on a 95 | computer or modifying a private copy. Propagation includes copying, 96 | distribution (with or without modification), making available to the 97 | public, and in some countries other activities as well. 98 | 99 | To "convey" a work means any kind of propagation that enables other 100 | parties to make or receive copies. Mere interaction with a user through 101 | a computer network, with no transfer of a copy, is not conveying. 102 | 103 | An interactive user interface displays "Appropriate Legal Notices" 104 | to the extent that it includes a convenient and prominently visible 105 | feature that (1) displays an appropriate copyright notice, and (2) 106 | tells the user that there is no warranty for the work (except to the 107 | extent that warranties are provided), that licensees may convey the 108 | work under this License, and how to view a copy of this License. If 109 | the interface presents a list of user commands or options, such as a 110 | menu, a prominent item in the list meets this criterion. 111 | 112 | 1. Source Code. 113 | 114 | The "source code" for a work means the preferred form of the work 115 | for making modifications to it. "Object code" means any non-source 116 | form of a work. 117 | 118 | A "Standard Interface" means an interface that either is an official 119 | standard defined by a recognized standards body, or, in the case of 120 | interfaces specified for a particular programming language, one that 121 | is widely used among developers working in that language. 122 | 123 | The "System Libraries" of an executable work include anything, other 124 | than the work as a whole, that (a) is included in the normal form of 125 | packaging a Major Component, but which is not part of that Major 126 | Component, and (b) serves only to enable use of the work with that 127 | Major Component, or to implement a Standard Interface for which an 128 | implementation is available to the public in source code form. A 129 | "Major Component", in this context, means a major essential component 130 | (kernel, window system, and so on) of the specific operating system 131 | (if any) on which the executable work runs, or a compiler used to 132 | produce the work, or an object code interpreter used to run it. 133 | 134 | The "Corresponding Source" for a work in object code form means all 135 | the source code needed to generate, install, and (for an executable 136 | work) run the object code and to modify the work, including scripts to 137 | control those activities. However, it does not include the work's 138 | System Libraries, or general-purpose tools or generally available free 139 | programs which are used unmodified in performing those activities but 140 | which are not part of the work. For example, Corresponding Source 141 | includes interface definition files associated with source files for 142 | the work, and the source code for shared libraries and dynamically 143 | linked subprograms that the work is specifically designed to require, 144 | such as by intimate data communication or control flow between those 145 | subprograms and other parts of the work. 146 | 147 | The Corresponding Source need not include anything that users 148 | can regenerate automatically from other parts of the Corresponding 149 | Source. 150 | 151 | The Corresponding Source for a work in source code form is that 152 | same work. 153 | 154 | 2. Basic Permissions. 155 | 156 | All rights granted under this License are granted for the term of 157 | copyright on the Program, and are irrevocable provided the stated 158 | conditions are met. This License explicitly affirms your unlimited 159 | permission to run the unmodified Program. The output from running a 160 | covered work is covered by this License only if the output, given its 161 | content, constitutes a covered work. This License acknowledges your 162 | rights of fair use or other equivalent, as provided by copyright law. 163 | 164 | You may make, run and propagate covered works that you do not 165 | convey, without conditions so long as your license otherwise remains 166 | in force. You may convey covered works to others for the sole purpose 167 | of having them make modifications exclusively for you, or provide you 168 | with facilities for running those works, provided that you comply with 169 | the terms of this License in conveying all material for which you do 170 | not control copyright. Those thus making or running the covered works 171 | for you must do so exclusively on your behalf, under your direction 172 | and control, on terms that prohibit them from making any copies of 173 | your copyrighted material outside their relationship with you. 174 | 175 | Conveying under any other circumstances is permitted solely under 176 | the conditions stated below. Sublicensing is not allowed; section 10 177 | makes it unnecessary. 178 | 179 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 180 | 181 | No covered work shall be deemed part of an effective technological 182 | measure under any applicable law fulfilling obligations under article 183 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 184 | similar laws prohibiting or restricting circumvention of such 185 | measures. 186 | 187 | When you convey a covered work, you waive any legal power to forbid 188 | circumvention of technological measures to the extent such circumvention 189 | is effected by exercising rights under this License with respect to 190 | the covered work, and you disclaim any intention to limit operation or 191 | modification of the work as a means of enforcing, against the work's 192 | users, your or third parties' legal rights to forbid circumvention of 193 | technological measures. 194 | 195 | 4. Conveying Verbatim Copies. 196 | 197 | You may convey verbatim copies of the Program's source code as you 198 | receive it, in any medium, provided that you conspicuously and 199 | appropriately publish on each copy an appropriate copyright notice; 200 | keep intact all notices stating that this License and any 201 | non-permissive terms added in accord with section 7 apply to the code; 202 | keep intact all notices of the absence of any warranty; and give all 203 | recipients a copy of this License along with the Program. 204 | 205 | You may charge any price or no price for each copy that you convey, 206 | and you may offer support or warranty protection for a fee. 207 | 208 | 5. Conveying Modified Source Versions. 209 | 210 | You may convey a work based on the Program, or the modifications to 211 | produce it from the Program, in the form of source code under the 212 | terms of section 4, provided that you also meet all of these conditions: 213 | 214 | a) The work must carry prominent notices stating that you modified 215 | it, and giving a relevant date. 216 | 217 | b) The work must carry prominent notices stating that it is 218 | released under this License and any conditions added under section 219 | 7. This requirement modifies the requirement in section 4 to 220 | "keep intact all notices". 221 | 222 | c) You must license the entire work, as a whole, under this 223 | License to anyone who comes into possession of a copy. This 224 | License will therefore apply, along with any applicable section 7 225 | additional terms, to the whole of the work, and all its parts, 226 | regardless of how they are packaged. This License gives no 227 | permission to license the work in any other way, but it does not 228 | invalidate such permission if you have separately received it. 229 | 230 | d) If the work has interactive user interfaces, each must display 231 | Appropriate Legal Notices; however, if the Program has interactive 232 | interfaces that do not display Appropriate Legal Notices, your 233 | work need not make them do so. 234 | 235 | A compilation of a covered work with other separate and independent 236 | works, which are not by their nature extensions of the covered work, 237 | and which are not combined with it such as to form a larger program, 238 | in or on a volume of a storage or distribution medium, is called an 239 | "aggregate" if the compilation and its resulting copyright are not 240 | used to limit the access or legal rights of the compilation's users 241 | beyond what the individual works permit. Inclusion of a covered work 242 | in an aggregate does not cause this License to apply to the other 243 | parts of the aggregate. 244 | 245 | 6. Conveying Non-Source Forms. 246 | 247 | You may convey a covered work in object code form under the terms 248 | of sections 4 and 5, provided that you also convey the 249 | machine-readable Corresponding Source under the terms of this License, 250 | in one of these ways: 251 | 252 | a) Convey the object code in, or embodied in, a physical product 253 | (including a physical distribution medium), accompanied by the 254 | Corresponding Source fixed on a durable physical medium 255 | customarily used for software interchange. 256 | 257 | b) Convey the object code in, or embodied in, a physical product 258 | (including a physical distribution medium), accompanied by a 259 | written offer, valid for at least three years and valid for as 260 | long as you offer spare parts or customer support for that product 261 | model, to give anyone who possesses the object code either (1) a 262 | copy of the Corresponding Source for all the software in the 263 | product that is covered by this License, on a durable physical 264 | medium customarily used for software interchange, for a price no 265 | more than your reasonable cost of physically performing this 266 | conveying of source, or (2) access to copy the 267 | Corresponding Source from a network server at no charge. 268 | 269 | c) Convey individual copies of the object code with a copy of the 270 | written offer to provide the Corresponding Source. This 271 | alternative is allowed only occasionally and noncommercially, and 272 | only if you received the object code with such an offer, in accord 273 | with subsection 6b. 274 | 275 | d) Convey the object code by offering access from a designated 276 | place (gratis or for a charge), and offer equivalent access to the 277 | Corresponding Source in the same way through the same place at no 278 | further charge. You need not require recipients to copy the 279 | Corresponding Source along with the object code. If the place to 280 | copy the object code is a network server, the Corresponding Source 281 | may be on a different server (operated by you or a third party) 282 | that supports equivalent copying facilities, provided you maintain 283 | clear directions next to the object code saying where to find the 284 | Corresponding Source. Regardless of what server hosts the 285 | Corresponding Source, you remain obligated to ensure that it is 286 | available for as long as needed to satisfy these requirements. 287 | 288 | e) Convey the object code using peer-to-peer transmission, provided 289 | you inform other peers where the object code and Corresponding 290 | Source of the work are being offered to the general public at no 291 | charge under subsection 6d. 292 | 293 | A separable portion of the object code, whose source code is excluded 294 | from the Corresponding Source as a System Library, need not be 295 | included in conveying the object code work. 296 | 297 | A "User Product" is either (1) a "consumer product", which means any 298 | tangible personal property which is normally used for personal, family, 299 | or household purposes, or (2) anything designed or sold for incorporation 300 | into a dwelling. In determining whether a product is a consumer product, 301 | doubtful cases shall be resolved in favor of coverage. For a particular 302 | product received by a particular user, "normally used" refers to a 303 | typical or common use of that class of product, regardless of the status 304 | of the particular user or of the way in which the particular user 305 | actually uses, or expects or is expected to use, the product. A product 306 | is a consumer product regardless of whether the product has substantial 307 | commercial, industrial or non-consumer uses, unless such uses represent 308 | the only significant mode of use of the product. 309 | 310 | "Installation Information" for a User Product means any methods, 311 | procedures, authorization keys, or other information required to install 312 | and execute modified versions of a covered work in that User Product from 313 | a modified version of its Corresponding Source. The information must 314 | suffice to ensure that the continued functioning of the modified object 315 | code is in no case prevented or interfered with solely because 316 | modification has been made. 317 | 318 | If you convey an object code work under this section in, or with, or 319 | specifically for use in, a User Product, and the conveying occurs as 320 | part of a transaction in which the right of possession and use of the 321 | User Product is transferred to the recipient in perpetuity or for a 322 | fixed term (regardless of how the transaction is characterized), the 323 | Corresponding Source conveyed under this section must be accompanied 324 | by the Installation Information. But this requirement does not apply 325 | if neither you nor any third party retains the ability to install 326 | modified object code on the User Product (for example, the work has 327 | been installed in ROM). 328 | 329 | The requirement to provide Installation Information does not include a 330 | requirement to continue to provide support service, warranty, or updates 331 | for a work that has been modified or installed by the recipient, or for 332 | the User Product in which it has been modified or installed. Access to a 333 | network may be denied when the modification itself materially and 334 | adversely affects the operation of the network or violates the rules and 335 | protocols for communication across the network. 336 | 337 | Corresponding Source conveyed, and Installation Information provided, 338 | in accord with this section must be in a format that is publicly 339 | documented (and with an implementation available to the public in 340 | source code form), and must require no special password or key for 341 | unpacking, reading or copying. 342 | 343 | 7. Additional Terms. 344 | 345 | "Additional permissions" are terms that supplement the terms of this 346 | License by making exceptions from one or more of its conditions. 347 | Additional permissions that are applicable to the entire Program shall 348 | be treated as though they were included in this License, to the extent 349 | that they are valid under applicable law. If additional permissions 350 | apply only to part of the Program, that part may be used separately 351 | under those permissions, but the entire Program remains governed by 352 | this License without regard to the additional permissions. 353 | 354 | When you convey a copy of a covered work, you may at your option 355 | remove any additional permissions from that copy, or from any part of 356 | it. (Additional permissions may be written to require their own 357 | removal in certain cases when you modify the work.) You may place 358 | additional permissions on material, added by you to a covered work, 359 | for which you have or can give appropriate copyright permission. 360 | 361 | Notwithstanding any other provision of this License, for material you 362 | add to a covered work, you may (if authorized by the copyright holders of 363 | that material) supplement the terms of this License with terms: 364 | 365 | a) Disclaiming warranty or limiting liability differently from the 366 | terms of sections 15 and 16 of this License; or 367 | 368 | b) Requiring preservation of specified reasonable legal notices or 369 | author attributions in that material or in the Appropriate Legal 370 | Notices displayed by works containing it; or 371 | 372 | c) Prohibiting misrepresentation of the origin of that material, or 373 | requiring that modified versions of such material be marked in 374 | reasonable ways as different from the original version; or 375 | 376 | d) Limiting the use for publicity purposes of names of licensors or 377 | authors of the material; or 378 | 379 | e) Declining to grant rights under trademark law for use of some 380 | trade names, trademarks, or service marks; or 381 | 382 | f) Requiring indemnification of licensors and authors of that 383 | material by anyone who conveys the material (or modified versions of 384 | it) with contractual assumptions of liability to the recipient, for 385 | any liability that these contractual assumptions directly impose on 386 | those licensors and authors. 387 | 388 | All other non-permissive additional terms are considered "further 389 | restrictions" within the meaning of section 10. If the Program as you 390 | received it, or any part of it, contains a notice stating that it is 391 | governed by this License along with a term that is a further 392 | restriction, you may remove that term. If a license document contains 393 | a further restriction but permits relicensing or conveying under this 394 | License, you may add to a covered work material governed by the terms 395 | of that license document, provided that the further restriction does 396 | not survive such relicensing or conveying. 397 | 398 | If you add terms to a covered work in accord with this section, you 399 | must place, in the relevant source files, a statement of the 400 | additional terms that apply to those files, or a notice indicating 401 | where to find the applicable terms. 402 | 403 | Additional terms, permissive or non-permissive, may be stated in the 404 | form of a separately written license, or stated as exceptions; 405 | the above requirements apply either way. 406 | 407 | 8. Termination. 408 | 409 | You may not propagate or modify a covered work except as expressly 410 | provided under this License. Any attempt otherwise to propagate or 411 | modify it is void, and will automatically terminate your rights under 412 | this License (including any patent licenses granted under the third 413 | paragraph of section 11). 414 | 415 | However, if you cease all violation of this License, then your 416 | license from a particular copyright holder is reinstated (a) 417 | provisionally, unless and until the copyright holder explicitly and 418 | finally terminates your license, and (b) permanently, if the copyright 419 | holder fails to notify you of the violation by some reasonable means 420 | prior to 60 days after the cessation. 421 | 422 | Moreover, your license from a particular copyright holder is 423 | reinstated permanently if the copyright holder notifies you of the 424 | violation by some reasonable means, this is the first time you have 425 | received notice of violation of this License (for any work) from that 426 | copyright holder, and you cure the violation prior to 30 days after 427 | your receipt of the notice. 428 | 429 | Termination of your rights under this section does not terminate the 430 | licenses of parties who have received copies or rights from you under 431 | this License. If your rights have been terminated and not permanently 432 | reinstated, you do not qualify to receive new licenses for the same 433 | material under section 10. 434 | 435 | 9. Acceptance Not Required for Having Copies. 436 | 437 | You are not required to accept this License in order to receive or 438 | run a copy of the Program. Ancillary propagation of a covered work 439 | occurring solely as a consequence of using peer-to-peer transmission 440 | to receive a copy likewise does not require acceptance. However, 441 | nothing other than this License grants you permission to propagate or 442 | modify any covered work. These actions infringe copyright if you do 443 | not accept this License. Therefore, by modifying or propagating a 444 | covered work, you indicate your acceptance of this License to do so. 445 | 446 | 10. Automatic Licensing of Downstream Recipients. 447 | 448 | Each time you convey a covered work, the recipient automatically 449 | receives a license from the original licensors, to run, modify and 450 | propagate that work, subject to this License. You are not responsible 451 | for enforcing compliance by third parties with this License. 452 | 453 | An "entity transaction" is a transaction transferring control of an 454 | organization, or substantially all assets of one, or subdividing an 455 | organization, or merging organizations. If propagation of a covered 456 | work results from an entity transaction, each party to that 457 | transaction who receives a copy of the work also receives whatever 458 | licenses to the work the party's predecessor in interest had or could 459 | give under the previous paragraph, plus a right to possession of the 460 | Corresponding Source of the work from the predecessor in interest, if 461 | the predecessor has it or can get it with reasonable efforts. 462 | 463 | You may not impose any further restrictions on the exercise of the 464 | rights granted or affirmed under this License. For example, you may 465 | not impose a license fee, royalty, or other charge for exercise of 466 | rights granted under this License, and you may not initiate litigation 467 | (including a cross-claim or counterclaim in a lawsuit) alleging that 468 | any patent claim is infringed by making, using, selling, offering for 469 | sale, or importing the Program or any portion of it. 470 | 471 | 11. Patents. 472 | 473 | A "contributor" is a copyright holder who authorizes use under this 474 | License of the Program or a work on which the Program is based. The 475 | work thus licensed is called the contributor's "contributor version". 476 | 477 | A contributor's "essential patent claims" are all patent claims 478 | owned or controlled by the contributor, whether already acquired or 479 | hereafter acquired, that would be infringed by some manner, permitted 480 | by this License, of making, using, or selling its contributor version, 481 | but do not include claims that would be infringed only as a 482 | consequence of further modification of the contributor version. For 483 | purposes of this definition, "control" includes the right to grant 484 | patent sublicenses in a manner consistent with the requirements of 485 | this License. 486 | 487 | Each contributor grants you a non-exclusive, worldwide, royalty-free 488 | patent license under the contributor's essential patent claims, to 489 | make, use, sell, offer for sale, import and otherwise run, modify and 490 | propagate the contents of its contributor version. 491 | 492 | In the following three paragraphs, a "patent license" is any express 493 | agreement or commitment, however denominated, not to enforce a patent 494 | (such as an express permission to practice a patent or covenant not to 495 | sue for patent infringement). To "grant" such a patent license to a 496 | party means to make such an agreement or commitment not to enforce a 497 | patent against the party. 498 | 499 | If you convey a covered work, knowingly relying on a patent license, 500 | and the Corresponding Source of the work is not available for anyone 501 | to copy, free of charge and under the terms of this License, through a 502 | publicly available network server or other readily accessible means, 503 | then you must either (1) cause the Corresponding Source to be so 504 | available, or (2) arrange to deprive yourself of the benefit of the 505 | patent license for this particular work, or (3) arrange, in a manner 506 | consistent with the requirements of this License, to extend the patent 507 | license to downstream recipients. "Knowingly relying" means you have 508 | actual knowledge that, but for the patent license, your conveying the 509 | covered work in a country, or your recipient's use of the covered work 510 | in a country, would infringe one or more identifiable patents in that 511 | country that you have reason to believe are valid. 512 | 513 | If, pursuant to or in connection with a single transaction or 514 | arrangement, you convey, or propagate by procuring conveyance of, a 515 | covered work, and grant a patent license to some of the parties 516 | receiving the covered work authorizing them to use, propagate, modify 517 | or convey a specific copy of the covered work, then the patent license 518 | you grant is automatically extended to all recipients of the covered 519 | work and works based on it. 520 | 521 | A patent license is "discriminatory" if it does not include within 522 | the scope of its coverage, prohibits the exercise of, or is 523 | conditioned on the non-exercise of one or more of the rights that are 524 | specifically granted under this License. You may not convey a covered 525 | work if you are a party to an arrangement with a third party that is 526 | in the business of distributing software, under which you make payment 527 | to the third party based on the extent of your activity of conveying 528 | the work, and under which the third party grants, to any of the 529 | parties who would receive the covered work from you, a discriminatory 530 | patent license (a) in connection with copies of the covered work 531 | conveyed by you (or copies made from those copies), or (b) primarily 532 | for and in connection with specific products or compilations that 533 | contain the covered work, unless you entered into that arrangement, 534 | or that patent license was granted, prior to 28 March 2007. 535 | 536 | Nothing in this License shall be construed as excluding or limiting 537 | any implied license or other defenses to infringement that may 538 | otherwise be available to you under applicable patent law. 539 | 540 | 12. No Surrender of Others' Freedom. 541 | 542 | If conditions are imposed on you (whether by court order, agreement or 543 | otherwise) that contradict the conditions of this License, they do not 544 | excuse you from the conditions of this License. If you cannot convey a 545 | covered work so as to satisfy simultaneously your obligations under this 546 | License and any other pertinent obligations, then as a consequence you may 547 | not convey it at all. For example, if you agree to terms that obligate you 548 | to collect a royalty for further conveying from those to whom you convey 549 | the Program, the only way you could satisfy both those terms and this 550 | License would be to refrain entirely from conveying the Program. 551 | 552 | 13. Use with the GNU Affero General Public License. 553 | 554 | Notwithstanding any other provision of this License, you have 555 | permission to link or combine any covered work with a work licensed 556 | under version 3 of the GNU Affero General Public License into a single 557 | combined work, and to convey the resulting work. The terms of this 558 | License will continue to apply to the part which is the covered work, 559 | but the special requirements of the GNU Affero General Public License, 560 | section 13, concerning interaction through a network will apply to the 561 | combination as such. 562 | 563 | 14. Revised Versions of this License. 564 | 565 | The Free Software Foundation may publish revised and/or new versions of 566 | the GNU General Public License from time to time. Such new versions will 567 | be similar in spirit to the present version, but may differ in detail to 568 | address new problems or concerns. 569 | 570 | Each version is given a distinguishing version number. If the 571 | Program specifies that a certain numbered version of the GNU General 572 | Public License "or any later version" applies to it, you have the 573 | option of following the terms and conditions either of that numbered 574 | version or of any later version published by the Free Software 575 | Foundation. If the Program does not specify a version number of the 576 | GNU General Public License, you may choose any version ever published 577 | by the Free Software Foundation. 578 | 579 | If the Program specifies that a proxy can decide which future 580 | versions of the GNU General Public License can be used, that proxy's 581 | public statement of acceptance of a version permanently authorizes you 582 | to choose that version for the Program. 583 | 584 | Later license versions may give you additional or different 585 | permissions. However, no additional obligations are imposed on any 586 | author or copyright holder as a result of your choosing to follow a 587 | later version. 588 | 589 | 15. Disclaimer of Warranty. 590 | 591 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 592 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 593 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 594 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 595 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 596 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 597 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 598 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 599 | 600 | 16. Limitation of Liability. 601 | 602 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 603 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 604 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 605 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 606 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 607 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 608 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 609 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 610 | SUCH DAMAGES. 611 | 612 | 17. Interpretation of Sections 15 and 16. 613 | 614 | If the disclaimer of warranty and limitation of liability provided 615 | above cannot be given local legal effect according to their terms, 616 | reviewing courts shall apply local law that most closely approximates 617 | an absolute waiver of all civil liability in connection with the 618 | Program, unless a warranty or assumption of liability accompanies a 619 | copy of the Program in return for a fee. 620 | 621 | END OF TERMS AND CONDITIONS 622 | 623 | How to Apply These Terms to Your New Programs 624 | 625 | If you develop a new program, and you want it to be of the greatest 626 | possible use to the public, the best way to achieve this is to make it 627 | free software which everyone can redistribute and change under these terms. 628 | 629 | To do so, attach the following notices to the program. It is safest 630 | to attach them to the start of each source file to most effectively 631 | state the exclusion of warranty; and each file should have at least 632 | the "copyright" line and a pointer to where the full notice is found. 633 | 634 | 635 | Copyright (C) 636 | 637 | This program is free software: you can redistribute it and/or modify 638 | it under the terms of the GNU General Public License as published by 639 | the Free Software Foundation, either version 3 of the License, or 640 | (at your option) any later version. 641 | 642 | This program is distributed in the hope that it will be useful, 643 | but WITHOUT ANY WARRANTY; without even the implied warranty of 644 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 645 | GNU General Public License for more details. 646 | 647 | You should have received a copy of the GNU General Public License 648 | along with this program. If not, see . 649 | 650 | Also add information on how to contact you by electronic and paper mail. 651 | 652 | If the program does terminal interaction, make it output a short 653 | notice like this when it starts in an interactive mode: 654 | 655 | Copyright (C) 656 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 657 | This is free software, and you are welcome to redistribute it 658 | under certain conditions; type `show c' for details. 659 | 660 | The hypothetical commands `show w' and `show c' should show the appropriate 661 | parts of the General Public License. Of course, your program's commands 662 | might be different; for a GUI interface, you would use an "about box". 663 | 664 | You should also get your employer (if you work as a programmer) or school, 665 | if any, to sign a "copyright disclaimer" for the program, if necessary. 666 | For more information on this, and how to apply and follow the GNU GPL, see 667 | . 668 | 669 | The GNU General Public License does not permit incorporating your program 670 | into proprietary programs. If your program is a subroutine library, you 671 | may consider it more useful to permit linking proprietary applications with 672 | the library. If this is what you want to do, use the GNU Lesser General 673 | Public License instead of this License. But first, please read 674 | . 675 | -------------------------------------------------------------------------------- /QAESEncryption/QAESEncryption.pri: -------------------------------------------------------------------------------- 1 | HEADERS += \ 2 | $$PWD/aesni/aesni-enc-cbc.h \ 3 | $$PWD/aesni/aesni-enc-ecb.h \ 4 | $$PWD/aesni/aesni-key-exp.h \ 5 | $$PWD/qaesencryption.h 6 | 7 | SOURCES += \ 8 | $$PWD/qaesencryption.cpp 9 | 10 | #DEFINES += USE_INTEL_AES_IF_AVAILABLE # 开启后出现过有些电脑异常退出情况 11 | #QMAKE_CXXFLAGS += -maes 12 | -------------------------------------------------------------------------------- /QAESEncryption/aesni/aesni-enc-cbc.h: -------------------------------------------------------------------------------- 1 | #ifndef AESNIENCCBC_H 2 | #define AESNIENCCBC_H 3 | 4 | #include 5 | 6 | namespace { 7 | 8 | void AES_CBC_encrypt(const unsigned char *in, 9 | unsigned char *out, 10 | unsigned char ivec[16], 11 | unsigned long length, 12 | const char *key, 13 | int number_of_rounds) 14 | { 15 | __m128i feedback,data; 16 | unsigned long i; 17 | int j; 18 | if (length%16) 19 | length = length/16+1; 20 | else length /=16; 21 | feedback=_mm_loadu_si128 ((__m128i*)ivec); 22 | for(i=0; i < length; i++) { 23 | data = _mm_loadu_si128 (&((__m128i*)in)[i]); 24 | feedback = _mm_xor_si128 (data,feedback); 25 | feedback = _mm_xor_si128 (feedback,((__m128i*)key)[0]); 26 | for(j=1; j 5 | 6 | namespace { 7 | 8 | /* Note – the length of the output buffer is assumed to be a multiple of 16 bytes */ 9 | void AES_ECB_encrypt(const unsigned char *in, //pointer to the PLAINTEXT 10 | unsigned char *out, //pointer to the CIPHERTEXT buffer 11 | unsigned long length, //text length in bytes 12 | const char *key, //pointer to the expanded key schedule 13 | int number_of_rounds) //number of AES rounds 10,12 or 14 14 | { 15 | __m128i tmp; 16 | unsigned long i; 17 | int j; 18 | if(length%16) 19 | length = length/16+1; 20 | else 21 | length = length/16; 22 | for(i = 0; i < length; i++) { 23 | tmp = _mm_loadu_si128 (&((__m128i*)in)[i]); 24 | tmp = _mm_xor_si128 (tmp,((__m128i*)key)[0]); 25 | for(j=1; j 5 | 6 | #define cpuid(func, ax, bx, cx, dx)\ 7 | __asm__ __volatile__("cpuid": "=a" (ax), "=b" (bx), "=c" (cx), "=d" (dx) : "a" (func)); 8 | 9 | namespace { 10 | 11 | bool check_aesni_support() 12 | { 13 | unsigned int a,b,c,d; 14 | cpuid(1, a,b,c,d); 15 | return (c & 0x2000000); 16 | } 17 | 18 | __m128i AES_128_ASSIST (__m128i temp1, __m128i temp2) 19 | { 20 | __m128i temp3; 21 | temp2 = _mm_shuffle_epi32 (temp2 ,0xff); 22 | temp3 = _mm_slli_si128 (temp1, 0x4); 23 | temp1 = _mm_xor_si128 (temp1, temp3); 24 | temp3 = _mm_slli_si128 (temp3, 0x4); 25 | temp1 = _mm_xor_si128 (temp1, temp3); 26 | temp3 = _mm_slli_si128 (temp3, 0x4); 27 | temp1 = _mm_xor_si128 (temp1, temp3); 28 | temp1 = _mm_xor_si128 (temp1, temp2); 29 | return temp1; 30 | } 31 | 32 | void AES_128_Key_Expansion (const unsigned char *userkey, 33 | unsigned char *key) 34 | { 35 | __m128i temp1, temp2; 36 | __m128i *Key_Schedule = (__m128i*)key; 37 | temp1 = _mm_loadu_si128((__m128i*)userkey); 38 | Key_Schedule[0] = temp1; 39 | temp2 = _mm_aeskeygenassist_si128 (temp1 ,0x1); 40 | temp1 = AES_128_ASSIST(temp1, temp2); 41 | Key_Schedule[1] = temp1; 42 | temp2 = _mm_aeskeygenassist_si128 (temp1,0x2); 43 | temp1 = AES_128_ASSIST(temp1, temp2); 44 | Key_Schedule[2] = temp1; 45 | temp2 = _mm_aeskeygenassist_si128 (temp1,0x4); 46 | temp1 = AES_128_ASSIST(temp1, temp2); 47 | Key_Schedule[3] = temp1; 48 | temp2 = _mm_aeskeygenassist_si128 (temp1,0x8); 49 | temp1 = AES_128_ASSIST(temp1, temp2); 50 | Key_Schedule[4] = temp1; 51 | temp2 = _mm_aeskeygenassist_si128 (temp1,0x10); 52 | temp1 = AES_128_ASSIST(temp1, temp2); 53 | Key_Schedule[5] = temp1; 54 | temp2 = _mm_aeskeygenassist_si128 (temp1,0x20); 55 | temp1 = AES_128_ASSIST(temp1, temp2); 56 | Key_Schedule[6] = temp1; 57 | temp2 = _mm_aeskeygenassist_si128 (temp1,0x40); 58 | temp1 = AES_128_ASSIST(temp1, temp2); 59 | Key_Schedule[7] = temp1; 60 | temp2 = _mm_aeskeygenassist_si128 (temp1,0x80); 61 | temp1 = AES_128_ASSIST(temp1, temp2); 62 | Key_Schedule[8] = temp1; 63 | temp2 = _mm_aeskeygenassist_si128 (temp1,0x1b); 64 | temp1 = AES_128_ASSIST(temp1, temp2); 65 | Key_Schedule[9] = temp1; 66 | temp2 = _mm_aeskeygenassist_si128 (temp1,0x36); 67 | temp1 = AES_128_ASSIST(temp1, temp2); 68 | Key_Schedule[10] = temp1; 69 | } 70 | 71 | void KEY_192_ASSIST(__m128i* temp1, __m128i * temp2, __m128i * temp3) 72 | { 73 | __m128i temp4; 74 | *temp2 = _mm_shuffle_epi32 (*temp2, 0x55); 75 | temp4 = _mm_slli_si128 (*temp1, 0x4); 76 | *temp1 = _mm_xor_si128 (*temp1, temp4); 77 | temp4 = _mm_slli_si128 (temp4, 0x4); 78 | *temp1 = _mm_xor_si128 (*temp1, temp4); 79 | temp4 = _mm_slli_si128 (temp4, 0x4); 80 | *temp1 = _mm_xor_si128 (*temp1, temp4); 81 | *temp1 = _mm_xor_si128 (*temp1, *temp2); 82 | *temp2 = _mm_shuffle_epi32(*temp1, 0xff); 83 | temp4 = _mm_slli_si128 (*temp3, 0x4); 84 | *temp3 = _mm_xor_si128 (*temp3, temp4); 85 | *temp3 = _mm_xor_si128 (*temp3, *temp2); 86 | } 87 | 88 | void AES_192_Key_Expansion (const unsigned char *userkey, unsigned char *key) 89 | { 90 | __m128i temp1, temp2, temp3; 91 | __m128i *Key_Schedule = (__m128i*)key; 92 | temp1 = _mm_loadu_si128((__m128i*)userkey); 93 | temp3 = _mm_loadu_si128((__m128i*)(userkey+16)); 94 | Key_Schedule[0]=temp1; Key_Schedule[1]=temp3; 95 | temp2=_mm_aeskeygenassist_si128 (temp3,0x1); 96 | KEY_192_ASSIST(&temp1, &temp2, &temp3); 97 | Key_Schedule[1] = (__m128i)_mm_shuffle_pd((__m128d)Key_Schedule[1], (__m128d)temp1,0); 98 | Key_Schedule[2] = (__m128i)_mm_shuffle_pd((__m128d)temp1,(__m128d)temp3,1); 99 | temp2=_mm_aeskeygenassist_si128 (temp3,0x2); 100 | KEY_192_ASSIST(&temp1, &temp2, &temp3); 101 | Key_Schedule[3]=temp1; 102 | Key_Schedule[4]=temp3; 103 | temp2=_mm_aeskeygenassist_si128 (temp3,0x4); 104 | KEY_192_ASSIST(&temp1, &temp2, &temp3); 105 | Key_Schedule[4] = (__m128i)_mm_shuffle_pd((__m128d)Key_Schedule[4], (__m128d)temp1,0); 106 | Key_Schedule[5] = (__m128i)_mm_shuffle_pd((__m128d)temp1,(__m128d)temp3,1); 107 | temp2=_mm_aeskeygenassist_si128 (temp3,0x8); 108 | KEY_192_ASSIST(&temp1, &temp2, &temp3); 109 | Key_Schedule[6]=temp1; 110 | Key_Schedule[7]=temp3; 111 | temp2=_mm_aeskeygenassist_si128 (temp3,0x10); 112 | KEY_192_ASSIST(&temp1, &temp2, &temp3); 113 | Key_Schedule[7] = (__m128i)_mm_shuffle_pd((__m128d)Key_Schedule[7], (__m128d)temp1,0); 114 | Key_Schedule[8] = (__m128i)_mm_shuffle_pd((__m128d)temp1,(__m128d)temp3,1); 115 | temp2=_mm_aeskeygenassist_si128 (temp3,0x20); 116 | KEY_192_ASSIST(&temp1, &temp2, &temp3); 117 | Key_Schedule[9]=temp1; 118 | Key_Schedule[10]=temp3; 119 | temp2=_mm_aeskeygenassist_si128 (temp3,0x40); 120 | KEY_192_ASSIST(&temp1, &temp2, &temp3); 121 | Key_Schedule[10] = (__m128i)_mm_shuffle_pd((__m128d)Key_Schedule[10], (__m128d)temp1,0); 122 | Key_Schedule[11] = (__m128i)_mm_shuffle_pd((__m128d)temp1,(__m128d)temp3,1); 123 | temp2=_mm_aeskeygenassist_si128 (temp3,0x80); 124 | KEY_192_ASSIST(&temp1, &temp2, &temp3); 125 | Key_Schedule[12]=temp1; 126 | } 127 | 128 | void KEY_256_ASSIST_1(__m128i* temp1, __m128i * temp2) 129 | { 130 | __m128i temp4; 131 | *temp2 = _mm_shuffle_epi32(*temp2, 0xff); 132 | temp4 = _mm_slli_si128 (*temp1, 0x4); 133 | *temp1 = _mm_xor_si128 (*temp1, temp4); 134 | temp4 = _mm_slli_si128 (temp4, 0x4); 135 | *temp1 = _mm_xor_si128 (*temp1, temp4); 136 | temp4 = _mm_slli_si128 (temp4, 0x4); 137 | *temp1 = _mm_xor_si128 (*temp1, temp4); 138 | *temp1 = _mm_xor_si128 (*temp1, *temp2); 139 | } 140 | 141 | void KEY_256_ASSIST_2(__m128i* temp1, __m128i * temp3) 142 | { 143 | __m128i temp2,temp4; 144 | temp4 = _mm_aeskeygenassist_si128 (*temp1, 0x0); 145 | temp2 = _mm_shuffle_epi32(temp4, 0xaa); 146 | temp4 = _mm_slli_si128 (*temp3, 0x4); 147 | *temp3 = _mm_xor_si128 (*temp3, temp4); 148 | temp4 = _mm_slli_si128 (temp4, 0x4); 149 | *temp3 = _mm_xor_si128 (*temp3, temp4); 150 | temp4 = _mm_slli_si128 (temp4, 0x4); 151 | *temp3 = _mm_xor_si128 (*temp3, temp4); 152 | *temp3 = _mm_xor_si128 (*temp3, temp2); 153 | } 154 | 155 | void AES_256_Key_Expansion (const unsigned char *userkey, unsigned char *key) 156 | { 157 | __m128i temp1, temp2, temp3; 158 | __m128i *Key_Schedule = (__m128i*)key; 159 | temp1 = _mm_loadu_si128((__m128i*)userkey); 160 | temp3 = _mm_loadu_si128((__m128i*)(userkey+16)); 161 | Key_Schedule[0] = temp1; Key_Schedule[1] = temp3; 162 | temp2 = _mm_aeskeygenassist_si128 (temp3,0x01); 163 | KEY_256_ASSIST_1(&temp1, &temp2); 164 | Key_Schedule[2]=temp1; 165 | KEY_256_ASSIST_2(&temp1, &temp3); 166 | Key_Schedule[3]=temp3; 167 | temp2 = _mm_aeskeygenassist_si128 (temp3,0x02); 168 | KEY_256_ASSIST_1(&temp1, &temp2); 169 | Key_Schedule[4]=temp1; 170 | KEY_256_ASSIST_2(&temp1, &temp3); 171 | Key_Schedule[5]=temp3; 172 | temp2 = _mm_aeskeygenassist_si128 (temp3,0x04); 173 | KEY_256_ASSIST_1(&temp1, &temp2); 174 | Key_Schedule[6]=temp1; 175 | KEY_256_ASSIST_2(&temp1, &temp3); 176 | Key_Schedule[7]=temp3; 177 | temp2 = _mm_aeskeygenassist_si128 (temp3,0x08); 178 | KEY_256_ASSIST_1(&temp1, &temp2); 179 | Key_Schedule[8]=temp1; 180 | KEY_256_ASSIST_2(&temp1, &temp3); 181 | Key_Schedule[9]=temp3; 182 | temp2 = _mm_aeskeygenassist_si128 (temp3,0x10); 183 | KEY_256_ASSIST_1(&temp1, &temp2); 184 | Key_Schedule[10]=temp1; 185 | KEY_256_ASSIST_2(&temp1, &temp3); 186 | Key_Schedule[11]=temp3; 187 | temp2 = _mm_aeskeygenassist_si128 (temp3,0x20); 188 | KEY_256_ASSIST_1(&temp1, &temp2); 189 | Key_Schedule[12]=temp1; 190 | KEY_256_ASSIST_2(&temp1, &temp3); 191 | Key_Schedule[13]=temp3; 192 | temp2 = _mm_aeskeygenassist_si128 (temp3,0x40); 193 | KEY_256_ASSIST_1(&temp1, &temp2); 194 | Key_Schedule[14]=temp1; 195 | } 196 | 197 | } 198 | 199 | #endif // AESNIKEYEXP_H 200 | -------------------------------------------------------------------------------- /QAESEncryption/qaesencryption.cpp: -------------------------------------------------------------------------------- 1 | #include "qaesencryption.h" 2 | #include 3 | #include 4 | 5 | #ifdef USE_INTEL_AES_IF_AVAILABLE 6 | #include "aesni/aesni-key-exp.h" 7 | #include "aesni/aesni-enc-ecb.h" 8 | #include "aesni/aesni-enc-cbc.h" 9 | #endif 10 | 11 | /* 12 | * Static Functions 13 | * */ 14 | QByteArray QAESEncryption::Crypt(QAESEncryption::Aes level, QAESEncryption::Mode mode, const QByteArray &rawText, 15 | const QByteArray &key, const QByteArray &iv, QAESEncryption::Padding padding) 16 | { 17 | return QAESEncryption(level, mode, padding).encode(rawText, key, iv); 18 | } 19 | 20 | QByteArray QAESEncryption::Decrypt(QAESEncryption::Aes level, QAESEncryption::Mode mode, const QByteArray &rawText, 21 | const QByteArray &key, const QByteArray &iv, QAESEncryption::Padding padding) 22 | { 23 | return QAESEncryption(level, mode, padding).decode(rawText, key, iv); 24 | } 25 | 26 | QByteArray QAESEncryption::ExpandKey(QAESEncryption::Aes level, QAESEncryption::Mode mode, const QByteArray &key) 27 | { 28 | return QAESEncryption(level, mode).expandKey(key); 29 | } 30 | 31 | QByteArray QAESEncryption::RemovePadding(const QByteArray &rawText, QAESEncryption::Padding padding) 32 | { 33 | if (rawText.isEmpty()) 34 | return rawText; 35 | 36 | QByteArray ret(rawText); 37 | switch (padding) 38 | { 39 | case Padding::ZERO: 40 | //Works only if the last byte of the decoded array is not zero 41 | while (ret.at(ret.length()-1) == 0x00) 42 | ret.remove(ret.length()-1, 1); 43 | break; 44 | case Padding::PKCS7: 45 | #if QT_VERSION >= QT_VERSION_CHECK(5, 10, 0) 46 | ret.remove(ret.length() - ret.back(), ret.back()); 47 | #else 48 | ret.remove(ret.length() - ret.at(ret.length() - 1), ret.at(ret.length() - 1)); 49 | #endif 50 | break; 51 | case Padding::ISO: 52 | { 53 | // Find the last byte which is not zero 54 | int marker_index = ret.length() - 1; 55 | for (; marker_index >= 0; --marker_index) 56 | { 57 | if (ret.at(marker_index) != 0x00) 58 | { 59 | break; 60 | } 61 | } 62 | 63 | // And check if it's the byte for marking padding 64 | if (ret.at(marker_index) == '\x80') 65 | { 66 | ret.truncate(marker_index); 67 | } 68 | break; 69 | } 70 | default: 71 | //do nothing 72 | break; 73 | } 74 | return ret; 75 | } 76 | /* 77 | * End Static function declarations 78 | * */ 79 | 80 | /* 81 | * Local Functions 82 | * */ 83 | 84 | namespace { 85 | 86 | quint8 xTime(quint8 x) 87 | { 88 | return ((x<<1) ^ (((x>>7) & 1) * 0x1b)); 89 | } 90 | 91 | quint8 multiply(quint8 x, quint8 y) 92 | { 93 | return (((y & 1) * x) ^ ((y>>1 & 1) * xTime(x)) ^ ((y>>2 & 1) * xTime(xTime(x))) ^ ((y>>3 & 1) 94 | * xTime(xTime(xTime(x)))) ^ ((y>>4 & 1) * xTime(xTime(xTime(xTime(x)))))); 95 | } 96 | 97 | } 98 | 99 | /* 100 | * End Local functions 101 | * */ 102 | 103 | QAESEncryption::QAESEncryption(Aes level, Mode mode, 104 | Padding padding) 105 | : m_nb(4), m_blocklen(16), m_level(level), m_mode(mode), m_padding(padding) 106 | , m_aesNIAvailable(false), m_state(nullptr) 107 | { 108 | #ifdef USE_INTEL_AES_IF_AVAILABLE 109 | m_aesNIAvailable = check_aesni_support(); 110 | #endif 111 | 112 | switch (level) 113 | { 114 | case AES_128: { 115 | AES128 aes; 116 | m_nk = aes.nk; 117 | m_keyLen = aes.keylen; 118 | m_nr = aes.nr; 119 | m_expandedKey = aes.expandedKey; 120 | } 121 | break; 122 | case AES_192: { 123 | AES192 aes; 124 | m_nk = aes.nk; 125 | m_keyLen = aes.keylen; 126 | m_nr = aes.nr; 127 | m_expandedKey = aes.expandedKey; 128 | } 129 | break; 130 | case AES_256: { 131 | AES256 aes; 132 | m_nk = aes.nk; 133 | m_keyLen = aes.keylen; 134 | m_nr = aes.nr; 135 | m_expandedKey = aes.expandedKey; 136 | } 137 | break; 138 | default: { 139 | AES128 aes; 140 | m_nk = aes.nk; 141 | m_keyLen = aes.keylen; 142 | m_nr = aes.nr; 143 | m_expandedKey = aes.expandedKey; 144 | } 145 | break; 146 | } 147 | 148 | } 149 | QByteArray QAESEncryption::getPadding(int currSize, int alignment) 150 | { 151 | int size = (alignment - currSize % alignment) % alignment; 152 | switch(m_padding) 153 | { 154 | case Padding::ZERO: 155 | return QByteArray(size, 0x00); 156 | break; 157 | case Padding::PKCS7: 158 | if (size == 0) 159 | size = alignment; 160 | return QByteArray(size, size); 161 | break; 162 | case Padding::ISO: 163 | if (size > 0) 164 | return QByteArray (size - 1, 0x00).prepend('\x80'); 165 | break; 166 | default: 167 | return QByteArray(size, 0x00); 168 | break; 169 | } 170 | return QByteArray(); 171 | } 172 | 173 | QByteArray QAESEncryption::expandKey(const QByteArray &key) 174 | { 175 | 176 | #ifdef USE_INTEL_AES_IF_AVAILABLE 177 | if (true){ 178 | switch(m_level) { 179 | case AES_128: { 180 | AES128 aes128; 181 | quint8 ret[aes128.expandedKey]; 182 | memset(ret, 0x00, sizeof(ret)); 183 | quint8 uchar_key[key.size()]; 184 | memcpy(uchar_key, key.data(), key.size()); 185 | AES_128_Key_Expansion(uchar_key, ret); 186 | return QByteArray((char*) ret, aes128.expandedKey); 187 | } 188 | break; 189 | case AES_192: { 190 | AES192 aes192; 191 | quint8 ret[aes192.expandedKey]; 192 | memset(ret, 0x00, sizeof(ret)); 193 | quint8 uchar_key[key.size()]; 194 | memcpy(uchar_key, key.data(), key.size()); 195 | 196 | AES_192_Key_Expansion(uchar_key, ret); 197 | return QByteArray((char*) ret, aes192.expandedKey); 198 | } 199 | break; 200 | case AES_256: { 201 | AES256 aes256; 202 | quint8 ret[aes256.expandedKey]; 203 | memset(ret, 0x00, sizeof(ret)); 204 | quint8 uchar_key[key.size()]; 205 | memcpy(uchar_key, key.data(), key.size()); 206 | 207 | AES_256_Key_Expansion(uchar_key, ret); 208 | return QByteArray((char*) ret, aes256.expandedKey); 209 | } 210 | break; 211 | default: 212 | return QByteArray(); 213 | break; 214 | } 215 | } else 216 | #endif 217 | { 218 | 219 | int i, k; 220 | quint8 tempa[4]; // Used for the column/row operations 221 | QByteArray roundKey(key); // The first round key is the key itself. 222 | 223 | // All other round keys are found from the previous round keys. 224 | //i == Nk 225 | for(i = m_nk; i < m_nb * (m_nr + 1); i++) 226 | { 227 | tempa[0] = (quint8) roundKey.at((i-1) * 4 + 0); 228 | tempa[1] = (quint8) roundKey.at((i-1) * 4 + 1); 229 | tempa[2] = (quint8) roundKey.at((i-1) * 4 + 2); 230 | tempa[3] = (quint8) roundKey.at((i-1) * 4 + 3); 231 | 232 | if (i % m_nk == 0) 233 | { 234 | // This function shifts the 4 bytes in a word to the left once. 235 | // [a0,a1,a2,a3] becomes [a1,a2,a3,a0] 236 | 237 | // Function RotWord() 238 | k = tempa[0]; 239 | tempa[0] = tempa[1]; 240 | tempa[1] = tempa[2]; 241 | tempa[2] = tempa[3]; 242 | tempa[3] = k; 243 | 244 | // Function Subword() 245 | tempa[0] = getSBoxValue(tempa[0]); 246 | tempa[1] = getSBoxValue(tempa[1]); 247 | tempa[2] = getSBoxValue(tempa[2]); 248 | tempa[3] = getSBoxValue(tempa[3]); 249 | 250 | tempa[0] = tempa[0] ^ Rcon[i/m_nk]; 251 | } 252 | 253 | if (m_level == AES_256 && i % m_nk == 4) 254 | { 255 | // Function Subword() 256 | tempa[0] = getSBoxValue(tempa[0]); 257 | tempa[1] = getSBoxValue(tempa[1]); 258 | tempa[2] = getSBoxValue(tempa[2]); 259 | tempa[3] = getSBoxValue(tempa[3]); 260 | } 261 | roundKey.insert(i * 4 + 0, (quint8) roundKey.at((i - m_nk) * 4 + 0) ^ tempa[0]); 262 | roundKey.insert(i * 4 + 1, (quint8) roundKey.at((i - m_nk) * 4 + 1) ^ tempa[1]); 263 | roundKey.insert(i * 4 + 2, (quint8) roundKey.at((i - m_nk) * 4 + 2) ^ tempa[2]); 264 | roundKey.insert(i * 4 + 3, (quint8) roundKey.at((i - m_nk) * 4 + 3) ^ tempa[3]); 265 | } 266 | return roundKey; 267 | } 268 | } 269 | 270 | // This function adds the round key to state. 271 | // The round key is added to the state by an XOR function. 272 | void QAESEncryption::addRoundKey(const quint8 round, const QByteArray &expKey) 273 | { 274 | QByteArray::iterator it = m_state->begin(); 275 | for(int i=0; i < 16; ++i) 276 | it[i] = (quint8) it[i] ^ (quint8) expKey.at(round * m_nb * 4 + (i/4) * m_nb + (i%4)); 277 | } 278 | 279 | // The SubBytes Function Substitutes the values in the 280 | // state matrix with values in an S-box. 281 | void QAESEncryption::subBytes() 282 | { 283 | QByteArray::iterator it = m_state->begin(); 284 | for(int i = 0; i < 16; i++) 285 | it[i] = getSBoxValue((quint8) it[i]); 286 | } 287 | 288 | // The ShiftRows() function shifts the rows in the state to the left. 289 | // Each row is shifted with different offset. 290 | // Offset = Row number. So the first row is not shifted. 291 | void QAESEncryption::shiftRows() 292 | { 293 | QByteArray::iterator it = m_state->begin(); 294 | quint8 temp; 295 | //Keep in mind that QByteArray is column-driven!! 296 | 297 | //Shift 1 to left 298 | temp = (quint8)it[1]; 299 | it[1] = (quint8)it[5]; 300 | it[5] = (quint8)it[9]; 301 | it[9] = (quint8)it[13]; 302 | it[13] = (quint8)temp; 303 | 304 | //Shift 2 to left 305 | temp = (quint8)it[2]; 306 | it[2] = (quint8)it[10]; 307 | it[10] = (quint8)temp; 308 | temp = (quint8)it[6]; 309 | it[6] = (quint8)it[14]; 310 | it[14] = (quint8)temp; 311 | 312 | //Shift 3 to left 313 | temp = (quint8)it[3]; 314 | it[3] = (quint8)it[15]; 315 | it[15] = (quint8)it[11]; 316 | it[11] = (quint8)it[7]; 317 | it[7] = (quint8)temp; 318 | } 319 | 320 | // MixColumns function mixes the columns of the state matrix 321 | //optimized!! 322 | void QAESEncryption::mixColumns() 323 | { 324 | QByteArray::iterator it = m_state->begin(); 325 | quint8 tmp, tm, t; 326 | 327 | for(int i = 0; i < 16; i += 4){ 328 | t = (quint8)it[i]; 329 | tmp = (quint8)it[i] ^ (quint8)it[i+1] ^ (quint8)it[i+2] ^ (quint8)it[i+3] ; 330 | 331 | tm = xTime( (quint8)it[i] ^ (quint8)it[i+1] ); 332 | it[i] = (quint8)it[i] ^ (quint8)tm ^ (quint8)tmp; 333 | 334 | tm = xTime( (quint8)it[i+1] ^ (quint8)it[i+2]); 335 | it[i+1] = (quint8)it[i+1] ^ (quint8)tm ^ (quint8)tmp; 336 | 337 | tm = xTime( (quint8)it[i+2] ^ (quint8)it[i+3]); 338 | it[i+2] =(quint8)it[i+2] ^ (quint8)tm ^ (quint8)tmp; 339 | 340 | tm = xTime((quint8)it[i+3] ^ (quint8)t); 341 | it[i+3] =(quint8)it[i+3] ^ (quint8)tm ^ (quint8)tmp; 342 | } 343 | } 344 | 345 | // MixColumns function mixes the columns of the state matrix. 346 | // The method used to multiply may be difficult to understand for the inexperienced. 347 | // Please use the references to gain more information. 348 | void QAESEncryption::invMixColumns() 349 | { 350 | QByteArray::iterator it = m_state->begin(); 351 | quint8 a,b,c,d; 352 | for(int i = 0; i < 16; i+=4){ 353 | a = (quint8) it[i]; 354 | b = (quint8) it[i+1]; 355 | c = (quint8) it[i+2]; 356 | d = (quint8) it[i+3]; 357 | 358 | it[i] = (quint8) (multiply(a, 0x0e) ^ multiply(b, 0x0b) ^ multiply(c, 0x0d) ^ multiply(d, 0x09)); 359 | it[i+1] = (quint8) (multiply(a, 0x09) ^ multiply(b, 0x0e) ^ multiply(c, 0x0b) ^ multiply(d, 0x0d)); 360 | it[i+2] = (quint8) (multiply(a, 0x0d) ^ multiply(b, 0x09) ^ multiply(c, 0x0e) ^ multiply(d, 0x0b)); 361 | it[i+3] = (quint8) (multiply(a, 0x0b) ^ multiply(b, 0x0d) ^ multiply(c, 0x09) ^ multiply(d, 0x0e)); 362 | } 363 | } 364 | 365 | // The SubBytes Function Substitutes the values in the 366 | // state matrix with values in an S-box. 367 | void QAESEncryption::invSubBytes() 368 | { 369 | QByteArray::iterator it = m_state->begin(); 370 | for(int i = 0; i < 16; ++i) 371 | it[i] = getSBoxInvert((quint8) it[i]); 372 | } 373 | 374 | void QAESEncryption::invShiftRows() 375 | { 376 | QByteArray::iterator it = m_state->begin(); 377 | uint8_t temp; 378 | 379 | //Keep in mind that QByteArray is column-driven!! 380 | 381 | //Shift 1 to right 382 | temp = (quint8)it[13]; 383 | it[13] = (quint8)it[9]; 384 | it[9] = (quint8)it[5]; 385 | it[5] = (quint8)it[1]; 386 | it[1] = (quint8)temp; 387 | 388 | //Shift 2 389 | temp = (quint8)it[10]; 390 | it[10] = (quint8)it[2]; 391 | it[2] = (quint8)temp; 392 | temp = (quint8)it[14]; 393 | it[14] = (quint8)it[6]; 394 | it[6] = (quint8)temp; 395 | 396 | //Shift 3 397 | temp = (quint8)it[7]; 398 | it[7] = (quint8)it[11]; 399 | it[11] = (quint8)it[15]; 400 | it[15] = (quint8)it[3]; 401 | it[3] = (quint8)temp; 402 | } 403 | 404 | QByteArray QAESEncryption::byteXor(const QByteArray &a, const QByteArray &b) 405 | { 406 | QByteArray::const_iterator it_a = a.begin(); 407 | QByteArray::const_iterator it_b = b.begin(); 408 | QByteArray ret; 409 | 410 | //for(int i = 0; i < m_blocklen; i++) 411 | for(int i = 0; i < std::min(a.size(), b.size()); i++) 412 | ret.insert(i,it_a[i] ^ it_b[i]); 413 | 414 | return ret; 415 | } 416 | 417 | // Cipher is the main function that encrypts the PlainText. 418 | QByteArray QAESEncryption::cipher(const QByteArray &expKey, const QByteArray &in) 419 | { 420 | 421 | //m_state is the input buffer... 422 | QByteArray output(in); 423 | m_state = &output; 424 | 425 | // Add the First round key to the state before starting the rounds. 426 | addRoundKey(0, expKey); 427 | 428 | // There will be Nr rounds. 429 | // The first Nr-1 rounds are identical. 430 | // These Nr-1 rounds are executed in the loop below. 431 | for(quint8 round = 1; round < m_nr; ++round){ 432 | subBytes(); 433 | shiftRows(); 434 | mixColumns(); 435 | addRoundKey(round, expKey); 436 | } 437 | 438 | // The last round is given below. 439 | // The MixColumns function is not here in the last round. 440 | subBytes(); 441 | shiftRows(); 442 | addRoundKey(m_nr, expKey); 443 | 444 | return output; 445 | } 446 | 447 | QByteArray QAESEncryption::invCipher(const QByteArray &expKey, const QByteArray &in) 448 | { 449 | //m_state is the input buffer.... handle it! 450 | QByteArray output(in); 451 | m_state = &output; 452 | 453 | // Add the First round key to the state before starting the rounds. 454 | addRoundKey(m_nr, expKey); 455 | 456 | // There will be Nr rounds. 457 | // The first Nr-1 rounds are identical. 458 | // These Nr-1 rounds are executed in the loop below. 459 | for(quint8 round=m_nr-1; round>0 ; round--){ 460 | invShiftRows(); 461 | invSubBytes(); 462 | addRoundKey(round, expKey); 463 | invMixColumns(); 464 | } 465 | 466 | // The last round is given below. 467 | // The MixColumns function is not here in the last round. 468 | invShiftRows(); 469 | invSubBytes(); 470 | addRoundKey(0, expKey); 471 | 472 | return output; 473 | } 474 | 475 | QByteArray QAESEncryption::printArray(uchar* arr, int size) 476 | { 477 | QByteArray print(""); 478 | for(int i=0; i= CBC && (iv.isEmpty() || iv.size() != m_blocklen)) 487 | return QByteArray(); 488 | 489 | QByteArray expandedKey = expandKey(key); 490 | QByteArray alignedText(rawText); 491 | 492 | //Fill array with padding 493 | alignedText.append(getPadding(rawText.size(), m_blocklen)); 494 | 495 | switch(m_mode) 496 | { 497 | case ECB: { 498 | #ifdef USE_INTEL_AES_IF_AVAILABLE 499 | if (m_aesNIAvailable){ 500 | unsigned char in[alignedText.size()]; 501 | memcpy(in, alignedText.data(), alignedText.size()); 502 | unsigned char out[alignedText.size()]; 503 | memcpy(out, alignedText.data(), alignedText.size()); 504 | char expKey[expandedKey.size()]; 505 | memcpy(expKey, expandedKey.data(), expandedKey.size()); 506 | AES_ECB_encrypt(in, out, alignedText.size(), 507 | expKey, m_nr); 508 | return QByteArray((char*)out, alignedText.size()); 509 | } 510 | #endif 511 | QByteArray ret; 512 | for(int i=0; i < alignedText.size(); i+= m_blocklen) 513 | ret.append(cipher(expandedKey, alignedText.mid(i, m_blocklen))); 514 | return ret; 515 | } 516 | break; 517 | case CBC: { 518 | #ifdef USE_INTEL_AES_IF_AVAILABLE 519 | if (m_aesNIAvailable){ 520 | quint8 in[alignedText.size()]; 521 | memcpy(in, alignedText.constData(), alignedText.size()); 522 | quint8 ivec[iv.size()]; 523 | memcpy(ivec, iv.data(), iv.size()); 524 | char out[alignedText.size()]; 525 | memset(out, 0x00, alignedText.size()); 526 | char expKey[expandedKey.size()]; 527 | memcpy(expKey, expandedKey.data(), expandedKey.size()); 528 | AES_CBC_encrypt(in, 529 | (unsigned char*) out, 530 | ivec, 531 | alignedText.size(), 532 | expKey, 533 | m_nr); 534 | return QByteArray(out, alignedText.size()); 535 | } 536 | #endif 537 | QByteArray ret; 538 | QByteArray ivTemp(iv); 539 | for(int i=0; i < alignedText.size(); i+= m_blocklen) { 540 | alignedText.replace(i, m_blocklen, byteXor(alignedText.mid(i, m_blocklen),ivTemp)); 541 | ret.append(cipher(expandedKey, alignedText.mid(i, m_blocklen))); 542 | ivTemp = ret.mid(i, m_blocklen); 543 | } 544 | return ret; 545 | } 546 | break; 547 | case CFB: { 548 | QByteArray ret; 549 | ret.append(byteXor(alignedText.left(m_blocklen), cipher(expandedKey, iv))); 550 | for(int i=0; i < alignedText.size(); i+= m_blocklen) { 551 | if (i+m_blocklen < alignedText.size()) 552 | ret.append(byteXor(alignedText.mid(i+m_blocklen, m_blocklen), 553 | cipher(expandedKey, ret.mid(i, m_blocklen)))); 554 | } 555 | return ret; 556 | } 557 | break; 558 | case OFB: { 559 | QByteArray ret; 560 | QByteArray ofbTemp; 561 | ofbTemp.append(cipher(expandedKey, iv)); 562 | for (int i=m_blocklen; i < alignedText.size(); i += m_blocklen){ 563 | ofbTemp.append(cipher(expandedKey, ofbTemp.right(m_blocklen))); 564 | } 565 | ret.append(byteXor(alignedText, ofbTemp)); 566 | return ret; 567 | } 568 | break; 569 | default: break; 570 | } 571 | return QByteArray(); 572 | } 573 | 574 | QByteArray QAESEncryption::decode(const QByteArray &rawText, const QByteArray &key, const QByteArray &iv) 575 | { 576 | if (m_mode >= CBC && (iv.isEmpty() || iv.size() != m_blocklen)) 577 | return QByteArray(); 578 | 579 | QByteArray ret; 580 | QByteArray expandedKey = expandKey(key); 581 | 582 | switch(m_mode) 583 | { 584 | case ECB: 585 | for(int i=0; i < rawText.size(); i+= m_blocklen) 586 | ret.append(invCipher(expandedKey, rawText.mid(i, m_blocklen))); 587 | break; 588 | case CBC: { 589 | QByteArray ivTemp(iv); 590 | for(int i=0; i < rawText.size(); i+= m_blocklen){ 591 | ret.append(invCipher(expandedKey, rawText.mid(i, m_blocklen))); 592 | ret.replace(i, m_blocklen, byteXor(ret.mid(i, m_blocklen),ivTemp)); 593 | ivTemp = rawText.mid(i, m_blocklen); 594 | } 595 | } 596 | break; 597 | case CFB: { 598 | ret.append(byteXor(rawText.mid(0, m_blocklen), cipher(expandedKey, iv))); 599 | for(int i=0; i < rawText.size(); i+= m_blocklen){ 600 | if (i+m_blocklen < rawText.size()) { 601 | ret.append(byteXor(rawText.mid(i+m_blocklen, m_blocklen), 602 | cipher(expandedKey, rawText.mid(i, m_blocklen)))); 603 | } 604 | } 605 | } 606 | break; 607 | case OFB: { 608 | QByteArray ofbTemp; 609 | ofbTemp.append(cipher(expandedKey, iv)); 610 | for (int i=m_blocklen; i < rawText.size(); i += m_blocklen){ 611 | ofbTemp.append(cipher(expandedKey, ofbTemp.right(m_blocklen))); 612 | } 613 | ret.append(byteXor(rawText, ofbTemp)); 614 | } 615 | break; 616 | default: 617 | //do nothing 618 | break; 619 | } 620 | return ret; 621 | } 622 | 623 | QByteArray QAESEncryption::removePadding(const QByteArray &rawText) 624 | { 625 | return RemovePadding(rawText, (Padding) m_padding); 626 | } 627 | -------------------------------------------------------------------------------- /QAESEncryption/qaesencryption.h: -------------------------------------------------------------------------------- 1 | #ifndef QAESENCRYPTION_H 2 | #define QAESENCRYPTION_H 3 | 4 | #ifdef QtAES_EXPORTS 5 | #include "qtaes_export.h" 6 | #else 7 | #define QTAESSHARED_EXPORT 8 | #endif 9 | 10 | #include 11 | #include 12 | 13 | #ifdef __linux__ 14 | #ifndef __LP64__ 15 | #define do_rdtsc _do_rdtsc 16 | #endif 17 | #endif 18 | 19 | class QTAESSHARED_EXPORT QAESEncryption : public QObject 20 | { 21 | Q_OBJECT 22 | public: 23 | enum Aes { 24 | AES_128, 25 | AES_192, 26 | AES_256 27 | }; 28 | 29 | enum Mode { 30 | ECB, 31 | CBC, 32 | CFB, 33 | OFB 34 | }; 35 | 36 | enum Padding { 37 | ZERO, 38 | PKCS7, 39 | ISO 40 | }; 41 | 42 | static QByteArray Crypt(QAESEncryption::Aes level, QAESEncryption::Mode mode, const QByteArray &rawText, const QByteArray &key, 43 | const QByteArray &iv = QByteArray(), QAESEncryption::Padding padding = QAESEncryption::ISO); 44 | static QByteArray Decrypt(QAESEncryption::Aes level, QAESEncryption::Mode mode, const QByteArray &rawText, const QByteArray &key, 45 | const QByteArray &iv = QByteArray(), QAESEncryption::Padding padding = QAESEncryption::ISO); 46 | static QByteArray ExpandKey(QAESEncryption::Aes level, QAESEncryption::Mode mode, const QByteArray &key); 47 | static QByteArray RemovePadding(const QByteArray &rawText, QAESEncryption::Padding padding = QAESEncryption::ISO); 48 | 49 | QAESEncryption(QAESEncryption::Aes level, QAESEncryption::Mode mode, 50 | QAESEncryption::Padding padding = QAESEncryption::ISO); 51 | 52 | QByteArray encode(const QByteArray &rawText, const QByteArray &key, const QByteArray &iv = QByteArray()); 53 | QByteArray decode(const QByteArray &rawText, const QByteArray &key, const QByteArray &iv = QByteArray()); 54 | QByteArray removePadding(const QByteArray &rawText); 55 | QByteArray expandKey(const QByteArray &key); 56 | 57 | QByteArray printArray(uchar *arr, int size); 58 | Q_SIGNALS: 59 | 60 | public Q_SLOTS: 61 | 62 | private: 63 | int m_nb; 64 | int m_blocklen; 65 | int m_level; 66 | int m_mode; 67 | int m_nk; 68 | int m_keyLen; 69 | int m_nr; 70 | int m_expandedKey; 71 | int m_padding; 72 | bool m_aesNIAvailable; 73 | QByteArray* m_state; 74 | 75 | struct AES256{ 76 | int nk = 8; 77 | int keylen = 32; 78 | int nr = 14; 79 | int expandedKey = 240; 80 | }; 81 | 82 | struct AES192{ 83 | int nk = 6; 84 | int keylen = 24; 85 | int nr = 12; 86 | int expandedKey = 209; 87 | }; 88 | 89 | struct AES128{ 90 | int nk = 4; 91 | int keylen = 16; 92 | int nr = 10; 93 | int expandedKey = 176; 94 | }; 95 | 96 | quint8 getSBoxValue(quint8 num){return sbox[num];} 97 | quint8 getSBoxInvert(quint8 num){return rsbox[num];} 98 | 99 | void addRoundKey(const quint8 round, const QByteArray &expKey); 100 | void subBytes(); 101 | void shiftRows(); 102 | void mixColumns(); 103 | void invMixColumns(); 104 | void invSubBytes(); 105 | void invShiftRows(); 106 | QByteArray getPadding(int currSize, int alignment); 107 | QByteArray cipher(const QByteArray &expKey, const QByteArray &in); 108 | QByteArray invCipher(const QByteArray &expKey, const QByteArray &in); 109 | QByteArray byteXor(const QByteArray &a, const QByteArray &b); 110 | 111 | const quint8 sbox[256] = { 112 | //0 1 2 3 4 5 6 7 8 9 A B C D E F 113 | 0x63, 0x7c, 0x77, 0x7b, 0xf2, 0x6b, 0x6f, 0xc5, 0x30, 0x01, 0x67, 0x2b, 0xfe, 0xd7, 0xab, 0x76, 114 | 0xca, 0x82, 0xc9, 0x7d, 0xfa, 0x59, 0x47, 0xf0, 0xad, 0xd4, 0xa2, 0xaf, 0x9c, 0xa4, 0x72, 0xc0, 115 | 0xb7, 0xfd, 0x93, 0x26, 0x36, 0x3f, 0xf7, 0xcc, 0x34, 0xa5, 0xe5, 0xf1, 0x71, 0xd8, 0x31, 0x15, 116 | 0x04, 0xc7, 0x23, 0xc3, 0x18, 0x96, 0x05, 0x9a, 0x07, 0x12, 0x80, 0xe2, 0xeb, 0x27, 0xb2, 0x75, 117 | 0x09, 0x83, 0x2c, 0x1a, 0x1b, 0x6e, 0x5a, 0xa0, 0x52, 0x3b, 0xd6, 0xb3, 0x29, 0xe3, 0x2f, 0x84, 118 | 0x53, 0xd1, 0x00, 0xed, 0x20, 0xfc, 0xb1, 0x5b, 0x6a, 0xcb, 0xbe, 0x39, 0x4a, 0x4c, 0x58, 0xcf, 119 | 0xd0, 0xef, 0xaa, 0xfb, 0x43, 0x4d, 0x33, 0x85, 0x45, 0xf9, 0x02, 0x7f, 0x50, 0x3c, 0x9f, 0xa8, 120 | 0x51, 0xa3, 0x40, 0x8f, 0x92, 0x9d, 0x38, 0xf5, 0xbc, 0xb6, 0xda, 0x21, 0x10, 0xff, 0xf3, 0xd2, 121 | 0xcd, 0x0c, 0x13, 0xec, 0x5f, 0x97, 0x44, 0x17, 0xc4, 0xa7, 0x7e, 0x3d, 0x64, 0x5d, 0x19, 0x73, 122 | 0x60, 0x81, 0x4f, 0xdc, 0x22, 0x2a, 0x90, 0x88, 0x46, 0xee, 0xb8, 0x14, 0xde, 0x5e, 0x0b, 0xdb, 123 | 0xe0, 0x32, 0x3a, 0x0a, 0x49, 0x06, 0x24, 0x5c, 0xc2, 0xd3, 0xac, 0x62, 0x91, 0x95, 0xe4, 0x79, 124 | 0xe7, 0xc8, 0x37, 0x6d, 0x8d, 0xd5, 0x4e, 0xa9, 0x6c, 0x56, 0xf4, 0xea, 0x65, 0x7a, 0xae, 0x08, 125 | 0xba, 0x78, 0x25, 0x2e, 0x1c, 0xa6, 0xb4, 0xc6, 0xe8, 0xdd, 0x74, 0x1f, 0x4b, 0xbd, 0x8b, 0x8a, 126 | 0x70, 0x3e, 0xb5, 0x66, 0x48, 0x03, 0xf6, 0x0e, 0x61, 0x35, 0x57, 0xb9, 0x86, 0xc1, 0x1d, 0x9e, 127 | 0xe1, 0xf8, 0x98, 0x11, 0x69, 0xd9, 0x8e, 0x94, 0x9b, 0x1e, 0x87, 0xe9, 0xce, 0x55, 0x28, 0xdf, 128 | 0x8c, 0xa1, 0x89, 0x0d, 0xbf, 0xe6, 0x42, 0x68, 0x41, 0x99, 0x2d, 0x0f, 0xb0, 0x54, 0xbb, 0x16 }; 129 | 130 | const quint8 rsbox[256] = { 131 | 0x52, 0x09, 0x6a, 0xd5, 0x30, 0x36, 0xa5, 0x38, 0xbf, 0x40, 0xa3, 0x9e, 0x81, 0xf3, 0xd7, 0xfb, 132 | 0x7c, 0xe3, 0x39, 0x82, 0x9b, 0x2f, 0xff, 0x87, 0x34, 0x8e, 0x43, 0x44, 0xc4, 0xde, 0xe9, 0xcb, 133 | 0x54, 0x7b, 0x94, 0x32, 0xa6, 0xc2, 0x23, 0x3d, 0xee, 0x4c, 0x95, 0x0b, 0x42, 0xfa, 0xc3, 0x4e, 134 | 0x08, 0x2e, 0xa1, 0x66, 0x28, 0xd9, 0x24, 0xb2, 0x76, 0x5b, 0xa2, 0x49, 0x6d, 0x8b, 0xd1, 0x25, 135 | 0x72, 0xf8, 0xf6, 0x64, 0x86, 0x68, 0x98, 0x16, 0xd4, 0xa4, 0x5c, 0xcc, 0x5d, 0x65, 0xb6, 0x92, 136 | 0x6c, 0x70, 0x48, 0x50, 0xfd, 0xed, 0xb9, 0xda, 0x5e, 0x15, 0x46, 0x57, 0xa7, 0x8d, 0x9d, 0x84, 137 | 0x90, 0xd8, 0xab, 0x00, 0x8c, 0xbc, 0xd3, 0x0a, 0xf7, 0xe4, 0x58, 0x05, 0xb8, 0xb3, 0x45, 0x06, 138 | 0xd0, 0x2c, 0x1e, 0x8f, 0xca, 0x3f, 0x0f, 0x02, 0xc1, 0xaf, 0xbd, 0x03, 0x01, 0x13, 0x8a, 0x6b, 139 | 0x3a, 0x91, 0x11, 0x41, 0x4f, 0x67, 0xdc, 0xea, 0x97, 0xf2, 0xcf, 0xce, 0xf0, 0xb4, 0xe6, 0x73, 140 | 0x96, 0xac, 0x74, 0x22, 0xe7, 0xad, 0x35, 0x85, 0xe2, 0xf9, 0x37, 0xe8, 0x1c, 0x75, 0xdf, 0x6e, 141 | 0x47, 0xf1, 0x1a, 0x71, 0x1d, 0x29, 0xc5, 0x89, 0x6f, 0xb7, 0x62, 0x0e, 0xaa, 0x18, 0xbe, 0x1b, 142 | 0xfc, 0x56, 0x3e, 0x4b, 0xc6, 0xd2, 0x79, 0x20, 0x9a, 0xdb, 0xc0, 0xfe, 0x78, 0xcd, 0x5a, 0xf4, 143 | 0x1f, 0xdd, 0xa8, 0x33, 0x88, 0x07, 0xc7, 0x31, 0xb1, 0x12, 0x10, 0x59, 0x27, 0x80, 0xec, 0x5f, 144 | 0x60, 0x51, 0x7f, 0xa9, 0x19, 0xb5, 0x4a, 0x0d, 0x2d, 0xe5, 0x7a, 0x9f, 0x93, 0xc9, 0x9c, 0xef, 145 | 0xa0, 0xe0, 0x3b, 0x4d, 0xae, 0x2a, 0xf5, 0xb0, 0xc8, 0xeb, 0xbb, 0x3c, 0x83, 0x53, 0x99, 0x61, 146 | 0x17, 0x2b, 0x04, 0x7e, 0xba, 0x77, 0xd6, 0x26, 0xe1, 0x69, 0x14, 0x63, 0x55, 0x21, 0x0c, 0x7d }; 147 | 148 | // The round constant word array, Rcon[i], contains the values given by 149 | // x to th e power (i-1) being powers of x (x is denoted as {02}) in the field GF(2^8) 150 | // Only the first 14 elements are needed 151 | const quint8 Rcon[14] = { 152 | 0x8d, 0x01, 0x02, 0x04, 0x08, 0x10, 0x20, 0x40, 0x80, 0x1b, 0x36, 0x6c, 0xd8, 0xab}; 153 | }; 154 | 155 | #endif // QAESENCRYPTION_H 156 | -------------------------------------------------------------------------------- /README.assets/image-20211212145456668.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/mahuifa/FileSafe/f3d8b6075060d5c08203292074d79d8ca3b6a536/README.assets/image-20211212145456668.png -------------------------------------------------------------------------------- /README.assets/image-20211212145538922.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/mahuifa/FileSafe/f3d8b6075060d5c08203292074d79d8ca3b6a536/README.assets/image-20211212145538922.png -------------------------------------------------------------------------------- /README.assets/image-20211212145809841.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/mahuifa/FileSafe/f3d8b6075060d5c08203292074d79d8ca3b6a536/README.assets/image-20211212145809841.png -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # 基于Qt开发的AES文件加解密工具:lock: 2 | 3 | 1. 支持所有 AES 密钥长度；:key: 4 | - AES_128 5 | - AES_192 6 | - AES_256 7 | 2. 支持ECB、CBC、CFB、OFB四种模式； 8 | 3. 支持ZERO、PKCS7、ISO三种填充方式； 9 | 4. 支持md5文件损毁检测；:bookmark_tabs: 10 | 5. 支持输入任意长度密钥进行加解密；:key: 11 | 6. 将.bmp格式图片加密后可正常打开图片，不破坏图片格式。 12 | 13 | 14 | 15 | ## 效果 16 | 17 | 1. 加密:computer: 18 | 19 | ![image-20211212145456668](README.assets/image-20211212145456668.png) 20 | 21 | 2. 解密:computer: 22 | 23 | ![image-20211212145538922](README.assets/image-20211212145538922.png) 24 | 25 | 3. bmp图片加密 26 | 27 | ![image-20211212145809841](README.assets/image-20211212145809841.png) 28 | 29 | -------------------------------------------------------------------------------- /Safe.ico: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/mahuifa/FileSafe/f3d8b6075060d5c08203292074d79d8ca3b6a536/Safe.ico -------------------------------------------------------------------------------- /fileencryption.cpp: -------------------------------------------------------------------------------- 1 | #include "fileencryption.h" 2 | 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | #include 10 | 11 | FileEncryption::FileEncryption(QObject *parent) : QObject(parent) 12 | { 13 | connect(this, &FileEncryption::start, this, &FileEncryption::startEncryption); 14 | for(int i = 0; i < 16; i++) 15 | { 16 | m_iv.append((uchar)i); 17 | } 18 | } 19 | 20 | /** 21 | * @brief 设置输入输出文件路径 22 | * @param strIn 输入文件路径 23 | * @param strOut 输出文件路径 24 | */ 25 | void FileEncryption::setFile(const QString& strIn, const QString& strOut) 26 | { 27 | if(!strIn.isEmpty() && !strOut.isEmpty()) 28 | { 29 | this->m_strIn = strIn; 30 | this->m_strOut = strOut; 31 | 32 | QFileInfo info(strIn); 33 | m_fileSuffix = info.suffix(); 34 | } 35 | } 36 | 37 | /** 38 | * @brief 设置使用的密钥 39 | * @param key 40 | */ 41 | void FileEncryption::setKey(const QByteArray &key) 42 | { 43 | this->m_key = key; 44 | } 45 | 46 | /** 47 | * @brief 设置加密或者解密 48 | * @param flag true：加密 false：解密 49 | */ 50 | void FileEncryption::setEncryption(bool flag) 51 | { 52 | this->m_encryption = flag; 53 | } 54 | 55 | /** 56 | * @brief 设置AES加解密参数 57 | * @param aes 58 | * @param mode 59 | * @param padding 60 | */ 61 | void FileEncryption::setAESParameter(QAESEncryption::Aes aes, QAESEncryption::Mode mode, QAESEncryption::Padding padding) 62 | { 63 | this->m_aes = aes; 64 | this->m_mode = mode; 65 | this->m_padding = padding; 66 | } 67 | 68 | /** 69 | * @brief 加解密操作 70 | */ 71 | void FileEncryption::startEncryption() 72 | { 73 | clear(); 74 | emit showLog("开始输入原文件！"); 75 | if(readFile(m_strIn)) 76 | { 77 | emit showLog("文件读取完成！"); 78 | if(m_encryption) 79 | { 80 | encryption(); 81 | } 82 | else 83 | { 84 | decrypt(); 85 | } 86 | if(writeFile(m_strOut)) 87 | { 88 | emit showLog("数据写入成功！"); 89 | } 90 | clear(); 91 | } 92 | else 93 | { 94 | emit showLog("输入文件读取失败！"); 95 | } 96 | } 97 | 98 | /** 99 | * @brief 加密 100 | */ 101 | void FileEncryption::encryption() 102 | { 103 | QAESEncryption encryption(m_aes, m_mode, m_padding); 104 | emit showLog("开始加密！"); 105 | 106 | if(m_mode == QAESEncryption::ECB) 107 | { 108 | m_dataOut.append(encryption.encode(m_dataIn, m_key)); 109 | } 110 | else 111 | { 112 | m_dataOut.append(encryption.encode(m_dataIn, m_key, m_iv)); 113 | } 114 | m_dataOut.insert(0, m_head); 115 | 116 | m_dataOut.append(m_md5); 117 | emit showLog("加密完成，开始写入！"); 118 | 119 | } 120 | 121 | /** 122 | * @brief 解密 123 | */ 124 | void FileEncryption::decrypt() 125 | { 126 | QAESEncryption encryption(m_aes, m_mode, m_padding); 127 | emit showLog("开始解密！"); 128 | 129 | if(m_mode == QAESEncryption::ECB) 130 | { 131 | m_dataOut.append(encryption.decode(m_dataIn, m_key)); 132 | } 133 | else 134 | { 135 | m_dataOut.append(encryption.decode(m_dataIn, m_key, m_iv)); 136 | } 137 | m_dataOut = encryption.removePadding(m_dataOut); // 移除填充数据 138 | m_dataOut.insert(0, m_head); 139 | 140 | emit showLog("解密完成，开始写入！"); 141 | check(); 142 | } 143 | 144 | /** 145 | * @brief 读取文件内容 146 | * @param fileName 147 | */ 148 | bool FileEncryption::readFile(const QString &fileName) 149 | { 150 | QFile file(fileName); 151 | if(file.open(QIODevice::ReadOnly)) 152 | { 153 | m_dataIn = file.readAll(); 154 | file.close(); 155 | dataOperation(); 156 | return true; 157 | } 158 | else 159 | { 160 | emit showLog(QString("%1打开失败！").arg(fileName)); 161 | return false; 162 | } 163 | } 164 | 165 | /** 166 | * @brief 操作数据内容 167 | */ 168 | void FileEncryption::dataOperation() 169 | { 170 | // 获取md5值 171 | if(m_encryption) 172 | { 173 | m_md5 = QCryptographicHash::hash(m_dataIn, QCryptographicHash::Md5).toHex(); 174 | } 175 | else // 解密时读取md5值 176 | { 177 | m_md5 = m_dataIn.mid(m_dataIn.count() - 32, 32); 178 | m_dataIn.remove(m_dataIn.count() - 32, 32); 179 | } 180 | 181 | // 读取bmo文件头信息 182 | if(m_fileSuffix.compare("bmp", Qt::CaseInsensitive) == 0) 183 | { 184 | m_head = m_dataIn.mid(0, 54); // bmp文件头：共14字节；位图信息头：共40字节； 185 | m_dataIn.remove(0, 54); 186 | } 187 | } 188 | 189 | /** 190 | * @brief 使用md5校验文件是否损毁 191 | */ 192 | void FileEncryption::check() 193 | { 194 | QByteArray arr = QCryptographicHash::hash(m_dataOut, QCryptographicHash::Md5).toHex(); 195 | if(arr == m_md5) 196 | { 197 | emit showLog("文件未损毁！"); 198 | } 199 | else 200 | { 201 | emit showLog("文件存在不同，可能已损毁！"); 202 | } 203 | } 204 | 205 | 206 | /** 207 | * @brief 写文件内容 208 | * @param fileName 209 | * @param data 210 | */ 211 | bool FileEncryption::writeFile(const QString &fileName) 212 | { 213 | QFileInfo info(fileName); 214 | QString filePath = info.absolutePath(); 215 | QDir dir; 216 | if(!dir.exists(filePath)) 217 | { 218 | dir.mkpath(filePath); 219 | } 220 | 221 | QFile file(fileName); 222 | if(file.open(QIODevice::WriteOnly)) 223 | { 224 | file.write(m_dataOut); 225 | file.close(); 226 | return true; 227 | } 228 | else 229 | { 230 | emit showLog(QString("%1打开失败！").arg(fileName)); 231 | return false; 232 | } 233 | } 234 | 235 | /** 236 | * @brief 清空数据 237 | */ 238 | void FileEncryption::clear() 239 | { 240 | m_dataIn.clear(); 241 | m_dataOut.clear(); 242 | m_head.clear(); 243 | m_md5.clear(); 244 | } 245 | -------------------------------------------------------------------------------- /fileencryption.h: -------------------------------------------------------------------------------- 1 | #ifndef FILEENCRYPTION_H 2 | #define FILEENCRYPTION_H 3 | 4 | #include 5 | #include "qaesencryption.h" 6 | 7 | class FileEncryption : public QObject 8 | { 9 | Q_OBJECT 10 | public: 11 | explicit FileEncryption(QObject *parent = nullptr); 12 | void setFile(const QString& strIn, const QString& strOut); 13 | void setKey(const QByteArray& key); 14 | void setEncryption(bool flag); 15 | void setAESParameter(QAESEncryption::Aes aes, QAESEncryption::Mode mode, QAESEncryption::Padding padding); 16 | void stop(); // 停止 17 | 18 | signals: 19 | void start(); // 开始 20 | void showLog(QString log); // 日志 21 | 22 | private: 23 | void startEncryption(); 24 | void encryption(); 25 | void decrypt(); 26 | bool readFile(const QString& fileName); 27 | void dataOperation(); 28 | void check(); 29 | bool writeFile(const QString& fileName); 30 | void clear(); 31 | 32 | private: 33 | QString m_strIn; // 输入文件路径 34 | QString m_strOut; // 输出文件路径 35 | QString m_fileSuffix; // 文件后缀 36 | QByteArray m_key; // 密钥 37 | QByteArray m_iv; // 偏移 38 | bool m_encryption = true; 39 | QAESEncryption::Aes m_aes; 40 | QAESEncryption::Mode m_mode; 41 | QAESEncryption::Padding m_padding; 42 | 43 | QByteArray m_dataIn; // 输入内容 44 | QByteArray m_dataOut; // 输出内容 45 | QByteArray m_md5; // MD5值 46 | 47 | QByteArray m_head; // bmp图片的文件信息 48 | }; 49 | 50 | #endif // FILEENCRYPTION_H 51 | -------------------------------------------------------------------------------- /image.qrc: -------------------------------------------------------------------------------- 1 | 2 | 3 | image/close.png 4 | image/min.png 5 | image/Safe.png 6 | image/Safe.ico 7 | 8 | 9 | -------------------------------------------------------------------------------- /image/Safe.ico: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/mahuifa/FileSafe/f3d8b6075060d5c08203292074d79d8ca3b6a536/image/Safe.ico -------------------------------------------------------------------------------- /image/Safe.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/mahuifa/FileSafe/f3d8b6075060d5c08203292074d79d8ca3b6a536/image/Safe.png -------------------------------------------------------------------------------- /image/close.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/mahuifa/FileSafe/f3d8b6075060d5c08203292074d79d8ca3b6a536/image/close.png -------------------------------------------------------------------------------- /image/min.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/mahuifa/FileSafe/f3d8b6075060d5c08203292074d79d8ca3b6a536/image/min.png -------------------------------------------------------------------------------- /main.cpp: -------------------------------------------------------------------------------- 1 | #include "widget.h" 2 | 3 | #include 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | 10 | 11 | int main(int argc, char *argv[]) 12 | { 13 | QApplication a(argc, argv); 14 | 15 | Widget w; 16 | w.show(); 17 | return a.exec(); 18 | } 19 | -------------------------------------------------------------------------------- /widget.cpp: -------------------------------------------------------------------------------- 1 | #include "widget.h" 2 | #include "ui_widget.h" 3 | 4 | #include 5 | #include 6 | #include 7 | #include 8 | #include 9 | 10 | Widget::Widget(QWidget *parent) 11 | : QWidget(parent) 12 | , ui(new Ui::Widget) 13 | { 14 | ui->setupUi(this); 15 | 16 | this->setWindowFlags(Qt::FramelessWindowHint); 17 | this->setWindowTitle(ui->label_title->text()); 18 | this->setWindowIcon(QIcon(":/new/prefix1/image/Safe.ico")); 19 | 20 | ui->widget_title->installEventFilter(this); 21 | m_pointStart = QPoint(0, 0); 22 | m_fileEncryption = new FileEncryption(); 23 | m_thread = new QThread(); 24 | m_fileEncryption->moveToThread(m_thread); 25 | m_thread->start(); 26 | 27 | ui->comboBox_Padding->setCurrentIndex(2); 28 | connect(m_fileEncryption, &FileEncryption::showLog, this, &Widget::on_showLog); 29 | } 30 | 31 | Widget::~Widget() 32 | { 33 | delete ui; 34 | } 35 | 36 | void Widget::on_but_min_clicked() 37 | { 38 | this->showMinimized(); 39 | } 40 | 41 | void Widget::on_but_close_clicked() 42 | { 43 | this->close(); 44 | } 45 | 46 | /** 47 | * @brief 鼠标移动窗口 48 | * @param watched 49 | * @param event 50 | * @return 51 | */ 52 | bool Widget::eventFilter(QObject *watched, QEvent *event) 53 | { 54 | if(watched == ui->widget_title) 55 | { 56 | QMouseEvent* e = static_cast(event); 57 | switch (e->type()) 58 | { 59 | case QEvent::MouseButtonPress: 60 | { 61 | if(e->button() == Qt::LeftButton) 62 | { 63 | m_pointStart = e->globalPos() - this->geometry().topLeft(); 64 | break; 65 | } 66 | } 67 | case QEvent::MouseMove: 68 | { 69 | if(m_pointStart != QPoint(0, 0)) 70 | { 71 | this->move(e->globalPos() - m_pointStart); 72 | } 73 | break; 74 | } 75 | case QEvent::MouseButtonRelease: 76 | { 77 | m_pointStart = QPoint(0, 0); 78 | break; 79 | } 80 | default: 81 | break; 82 | } 83 | } 84 | 85 | return QWidget::eventFilter(watched, event); 86 | } 87 | 88 | 89 | void Widget::on_but_in_clicked() 90 | { 91 | QString fileName = QFileDialog::getOpenFileName(this, "选择输入文件", "./", "输入文件(*)"); 92 | if(!fileName.isEmpty()) 93 | { 94 | ui->lineEdit_in->setText(fileName); 95 | QFileInfo info(fileName); 96 | QString name = info.fileName(); 97 | QString path = info.canonicalPath(); 98 | ui->lineEdit_out->setText(path + "/out_" + name); 99 | } 100 | } 101 | 102 | void Widget::on_but_out_clicked() 103 | { 104 | QString fileName = QFileDialog::getSaveFileName(this, "选择输出文件路径", ui->lineEdit_out->text(), "输出文件(*)"); 105 | if(!fileName.isEmpty()) 106 | { 107 | ui->lineEdit_out->setText(fileName); 108 | } 109 | } 110 | 111 | void Widget::on_but_start_clicked() 112 | { 113 | m_fileEncryption->setFile(ui->lineEdit_in->text(), ui->lineEdit_out->text()); 114 | m_fileEncryption->setEncryption(!ui->radio_de->isChecked()); 115 | QByteArray arrkey(ui->lineEdit_key->text().trimmed().toUtf8()); 116 | if(arrkey.isEmpty()) 117 | { 118 | QMessageBox::about(this, "注意！", "未输入密钥。"); 119 | return; 120 | } 121 | arrkey = QCryptographicHash::hash(arrkey, QCryptographicHash::Md5).toHex(); // 使用md5适配所有长度的密码，否则如果密码过短会导致解密失败 122 | m_fileEncryption->setKey(arrkey); 123 | m_fileEncryption->setAESParameter((QAESEncryption::Aes)ui->comboBox_len->currentIndex(), 124 | (QAESEncryption::Mode)ui->comboBox_mode->currentIndex(), 125 | (QAESEncryption::Padding)ui->comboBox_Padding->currentIndex()); 126 | emit m_fileEncryption->start(); 127 | } 128 | 129 | void Widget::on_showLog(QString log) 130 | { 131 | ui->textEdit_log->append(log); 132 | } 133 | 134 | -------------------------------------------------------------------------------- /widget.h: -------------------------------------------------------------------------------- 1 | #ifndef WIDGET_H 2 | #define WIDGET_H 3 | 4 | #include 5 | #include 6 | #include "fileencryption.h" 7 | 8 | QT_BEGIN_NAMESPACE 9 | namespace Ui { class Widget; } 10 | QT_END_NAMESPACE 11 | 12 | class Widget : public QWidget 13 | { 14 | Q_OBJECT 15 | 16 | public: 17 | Widget(QWidget *parent = nullptr); 18 | ~Widget(); 19 | 20 | protected: 21 | bool eventFilter(QObject *watched, QEvent *event); 22 | 23 | private slots: 24 | void on_but_min_clicked(); 25 | void on_but_close_clicked(); 26 | 27 | void on_but_in_clicked(); 28 | 29 | void on_but_out_clicked(); 30 | 31 | void on_but_start_clicked(); 32 | 33 | void on_showLog(QString log); 34 | 35 | private: 36 | Ui::Widget *ui; 37 | QPoint m_pointStart; // 移动窗口时鼠标初始坐标 38 | FileEncryption* m_fileEncryption = nullptr; // 文件加解密对象 39 | QThread* m_thread = nullptr; // 文件加解密线程 40 | }; 41 | #endif // WIDGET_H 42 | -------------------------------------------------------------------------------- /widget.ui: -------------------------------------------------------------------------------- 1 | 2 | 3 | Widget 4 | 5 | 6 | 7 | 0 8 | 0 9 | 645 10 | 435 11 | 12 | 13 | 14 | Widget 15 | 16 | 17 | #widget_title { 18 | background-color: rgb(220, 0, 8); 19 | } 20 | 21 | #but_close { 22 | border-image: url(:/new/prefix1/image/close.png); 23 | } 24 | 25 | #but_min{ 26 | border-image: url(:/new/prefix1/image/min.png); 27 | } 28 | 29 | 30 | #but_close:pressed { 31 | background-color: rgba(152, 152, 152, 80); 32 | } 33 | 34 | #but_min:pressed{ 35 | background-color: rgba(152, 152, 152, 80); 36 | } 37 | 38 | #label_title { 39 | color: rgb(255, 255, 255); 40 | } 41 | 42 | #label_icon { 43 | border-image: url(:/new/prefix1/image/Safe.png); 44 | } 45 | 46 | 47 | 48 | 0 49 | 50 | 51 | 0 52 | 53 | 54 | 0 55 | 56 | 57 | 0 58 | 59 | 60 | 0 61 | 62 | 63 | 64 | 65 | 66 | 16777215 67 | 32 68 | 69 | 70 | 71 | 72 | 0 73 | 74 | 75 | 0 76 | 77 | 78 | 0 79 | 80 | 81 | 0 82 | 83 | 84 | 0 85 | 86 | 87 | 88 | 89 | 5 90 | 91 | 92 | 5 93 | 94 | 95 | 96 | 97 | 98 | 30 99 | 30 100 | 101 | 102 | 103 | 104 | 30 105 | 30 106 | 107 | 108 | 109 | 110 | 111 | 112 | 113 | 114 | 115 | 116 | 文件保险柜 117 | 118 | 119 | 120 | 121 | 122 | 123 | Qt::Horizontal 124 | 125 | 126 | 127 | 612 128 | 20 129 | 130 | 131 | 132 | 133 | 134 | 135 | 136 | 137 | 30 138 | 30 139 | 140 | 141 | 142 | 143 | 30 144 | 30 145 | 146 | 147 | 148 | - 149 | 150 | 151 | 152 | 153 | 154 | 155 | 156 | 30 157 | 30 158 | 159 | 160 | 161 | 162 | 30 163 | 30 164 | 165 | 166 | 167 | × 168 | 169 | 170 | 171 | 172 | 173 | 174 | 175 | 176 | 177 | 178 | 179 | 180 | 181 | 10 182 | 160 183 | 291 184 | 181 185 | 186 | 187 | 188 | 加解密选项 189 | 190 | 191 | 192 | 193 | 10 194 | 20 195 | 191 196 | 18 197 | 198 | 199 | 200 | 201 | 202 | 203 | 加密 204 | 205 | 206 | true 207 | 208 | 209 | 210 | 211 | 212 | 213 | 解密 214 | 215 | 216 | 217 | 218 | 219 | 220 | 221 | 222 | 10 223 | 68 224 | 191 225 | 91 226 | 227 | 228 | 229 | 230 | 231 | 232 | 密钥长度： 233 | 234 | 235 | 236 | 237 | 238 | 239 | 240 | AES-128 241 | 242 | 243 | 244 | 245 | AES-192 246 | 247 | 248 | 249 | 250 | AES-256 251 | 252 | 253 | 254 | 255 | 256 | 257 | 258 | 密操作模式： 259 | 260 | 261 | 262 | 263 | 264 | 265 | 266 | ECB 267 | 268 | 269 | 270 | 271 | CBC 272 | 273 | 274 | 275 | 276 | CFB 277 | 278 | 279 | 280 | 281 | OFB 282 | 283 | 284 | 285 | 286 | 287 | 288 | 289 | 密操作模式： 290 | 291 | 292 | 293 | 294 | 295 | 296 | 297 | ZERO 298 | 299 | 300 | 301 | 302 | PKCS7 303 | 304 | 305 | 306 | 307 | ISO 308 | 309 | 310 | 311 | 312 | 313 | 314 | 315 | 316 | 317 | false 318 | 319 | 320 | 321 | 320 322 | 170 323 | 311 324 | 171 325 | 326 | 327 | 328 | 329 | 330 | 331 | 270 332 | 370 333 | 75 334 | 23 335 | 336 | 337 | 338 | 开始 339 | 340 | 341 | 342 | 343 | 344 | 10 345 | 20 346 | 621 347 | 121 348 | 349 | 350 | 351 | 352 | 353 | 354 | 输入文件： 355 | 356 | 357 | 358 | 359 | 360 | 361 | 362 | 363 | 364 | 选择文件 365 | 366 | 367 | 368 | 369 | 370 | 371 | 输出文件： 372 | 373 | 374 | 375 | 376 | 377 | 378 | 379 | 380 | 381 | 选择路径 382 | 383 | 384 | 385 | 386 | 387 | 388 | 密钥： 389 | 390 | 391 | 392 | 393 | 394 | 395 | 396 | 397 | 398 | QLineEdit::Normal 399 | 400 | 401 | 402 | 403 | 404 | 405 | 406 | 407 | 408 | 409 | 410 | 411 | --------------------------------------------------------------------------------