├── .gitattributes ├── .gitignore ├── LICENSE ├── PEACE-V0.3.py ├── b64Decoder0.4.py ├── fuzz-0.12.py ├── param-test-v0.5.py ├── reflect-v4.3.py ├── session-obsession-v0.6.py ├── simplify-v0.5.py └── xss-hunter.py /.gitattributes: -------------------------------------------------------------------------------- 1 | # Auto detect text files and perform LF normalization 2 | * text=auto 3 | -------------------------------------------------------------------------------- /.gitignore: -------------------------------------------------------------------------------- 1 | # Byte-compiled / optimized / DLL files 2 | __pycache__/ 3 | *.py[cod] 4 | *$py.class 5 | 6 | # C extensions 7 | *.so 8 | 9 | # Distribution / packaging 10 | .Python 11 | build/ 12 | develop-eggs/ 13 | dist/ 14 | downloads/ 15 | eggs/ 16 | .eggs/ 17 | lib/ 18 | lib64/ 19 | parts/ 20 | sdist/ 21 | var/ 22 | wheels/ 23 | *.egg-info/ 24 | .installed.cfg 25 | *.egg 26 | MANIFEST 27 | 28 | # PyInstaller 29 | # Usually these files are written by a python script from a template 30 | # before PyInstaller builds the exe, so as to inject date/other infos into it. 31 | *.manifest 32 | *.spec 33 | 34 | # Installer logs 35 | pip-log.txt 36 | pip-delete-this-directory.txt 37 | 38 | # Unit test / coverage reports 39 | htmlcov/ 40 | .tox/ 41 | .coverage 42 | .coverage.* 43 | .cache 44 | nosetests.xml 45 | coverage.xml 46 | *.cover 47 | .hypothesis/ 48 | .pytest_cache/ 49 | 50 | # Translations 51 | *.mo 52 | *.pot 53 | 54 | # Django stuff: 55 | *.log 56 | local_settings.py 57 | db.sqlite3 58 | 59 | # Flask stuff: 60 | instance/ 61 | .webassets-cache 62 | 63 | # Scrapy stuff: 64 | .scrapy 65 | 66 | # Sphinx documentation 67 | docs/_build/ 68 | 69 | # PyBuilder 70 | target/ 71 | 72 | # Jupyter Notebook 73 | .ipynb_checkpoints 74 | 75 | # pyenv 76 | .python-version 77 | 78 | # celery beat schedule file 79 | celerybeat-schedule 80 | 81 | # SageMath parsed files 82 | *.sage.py 83 | 84 | # Environments 85 | .env 86 | .venv 87 | env/ 88 | venv/ 89 | ENV/ 90 | env.bak/ 91 | venv.bak/ 92 | 93 | # Spyder project settings 94 | .spyderproject 95 | .spyproject 96 | 97 | # Rope project settings 98 | .ropeproject 99 | 100 | # mkdocs documentation 101 | /site 102 | 103 | # mypy 104 | .mypy_cache/ 105 | -------------------------------------------------------------------------------- /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 | . -------------------------------------------------------------------------------- /PEACE-V0.3.py: -------------------------------------------------------------------------------- 1 | from burp import IBurpExtender 2 | from burp import IIntruderPayloadGeneratorFactory 3 | from burp import IIntruderPayloadProcessor 4 | from burp import IIntruderPayloadGenerator 5 | from burp import IExtensionHelpers 6 | import base64 7 | from binascii import hexlify 8 | import random 9 | import re 10 | import gzip 11 | import StringIO 12 | import zlib 13 | import hashlib 14 | from burp import IHttpRequestResponse 15 | 16 | # hard-coded payloads 17 | # [in reality, you would use an extension for something cleverer than this] 18 | 19 | PAYLOADS = [ 20 | bytearray("URL encoded"), 21 | bytearray("Double URL encoded"), 22 | bytearray("Triple URL encoded"), 23 | bytearray("HTML encode"), 24 | bytearray("HTML encode + 1 zero"), 25 | bytearray("HTML encode + 2 zero"), 26 | bytearray("HTML encode + 3 zero"), 27 | bytearray("HTML encode + 4 zero"), 28 | bytearray("HTML encode + 5 zero"), 29 | bytearray("HTML encode with semicolon"), 30 | bytearray("HTML encode with semicolon + 1 zero"), 31 | bytearray("HTML encode with semicolon + 2 zero"), 32 | bytearray("HTML encode with semicolon + 3 zero"), 33 | bytearray("HTML encode with semicolon + 4 zero"), 34 | bytearray("HTML encode with semicolon + 5 zero"), 35 | bytearray("HTML encode capital X + 0 zero"), 36 | bytearray("HTML encode capital X + 1 zero"), 37 | bytearray("HTML encode capital X + 2 zero"), 38 | bytearray("HTML encode capital X + 3 zero"), 39 | bytearray("HTML encode capital X + 4 zero"), 40 | bytearray("HTML encode capital X + 5 zero"), 41 | bytearray("HTML encode capital X and semicolon + 0 zero"), 42 | bytearray("HTML encode capital X and semicolon + 1 zero"), 43 | bytearray("HTML encode capital X and semicolon + 2 zero"), 44 | bytearray("HTML encode capital X and semicolon + 3 zero"), 45 | bytearray("HTML encode capital X and semicolon + 4 zero"), 46 | bytearray("HTML encode capital X and semicolon + 5 zero"), 47 | bytearray("HTML encode capital hex + 0 zero"), 48 | bytearray("HTML encode capital hex + 1 zero"), 49 | bytearray("HTML encode capital hex + 2 zero"), 50 | bytearray("HTML encode capital hex + 3 zero"), 51 | bytearray("HTML encode capital hex + 4 zero"), 52 | bytearray("HTML encode capital hex + 5 zero"), 53 | bytearray("HTML encode capital hex and semicolon + 0 zero"), 54 | bytearray("HTML encode capital hex and semicolon + 1 zero"), 55 | bytearray("HTML encode capital hex and semicolon + 2 zero"), 56 | bytearray("HTML encode capital hex and semicolon + 3 zero"), 57 | bytearray("HTML encode capital hex and semicolon + 4 zero"), 58 | bytearray("HTML encode capital hex and semicolon + 5 zero"), 59 | bytearray("HTML encode capital hex, X + 0 zero"), 60 | bytearray("HTML encode capital hex, X + 1 zero"), 61 | bytearray("HTML encode capital hex, X + 2 zero"), 62 | bytearray("HTML encode capital hex, X + 3 zero"), 63 | bytearray("HTML encode capital hex, X + 4 zero"), 64 | bytearray("HTML encode capital hex, X + 5 zero"), 65 | bytearray("HTML encode capital hex, X and semicolon+ 0 zero"), 66 | bytearray("HTML encode capital hex, X and semicolon+ 1 zero"), 67 | bytearray("HTML encode capital hex, X and semicolon+ 2 zero"), 68 | bytearray("HTML encode capital hex, X and semicolon+ 3 zero"), 69 | bytearray("HTML encode capital hex, X and semicolon+ 4 zero"), 70 | bytearray("HTML encode capital hex, X and semicolon+ 5 zero"), 71 | bytearray("Unicode lowercase"), 72 | bytearray("Unicode uppercase hex"), 73 | bytearray("Unicode lowercase with 00"), 74 | bytearray("Unicode uppercase hex with 00"), 75 | bytearray("Base64 encoding"), 76 | bytearray("Null Byte"), 77 | bytearray("Carrige return string"), 78 | bytearray("Carrige return url encoded"), 79 | bytearray("HTML entities encoding"), 80 | bytearray("HTML entities encoding with semicolon"), 81 | bytearray("HTML entities encoding upper case"), 82 | bytearray("HTML entities encoding upper case with semicolon"), 83 | bytearray("Lowercase"), 84 | bytearray("Uppercase"), 85 | bytearray("Alternate case"), 86 | bytearray("reuniting payload"), 87 | bytearray("Embedded tab"), 88 | bytearray("Embedded New line"), 89 | bytearray("Embedded Carrige return"), 90 | bytearray("Buffer Overflow 1000"), 91 | bytearray("Buffer Overflow 2500"), 92 | bytearray("Buffer Overflow 5000"), 93 | bytearray("Buffer Overflow 10000"), 94 | bytearray("Carrige return inverted - AP"), 95 | bytearray("Alternative Double URL encoding - AP"), 96 | bytearray("ASCII Hex"), 97 | bytearray("Double ASCII Hex"), 98 | bytearray("Embedded payload"), 99 | bytearray("Comment out 1"), 100 | bytearray("Comment out 2"), 101 | bytearray("Comment out 3"), 102 | bytearray("Comment out 4"), 103 | bytearray("Comment out 5"), 104 | bytearray("Comment out 6"), 105 | bytearray("Comment out 7"), 106 | bytearray("Comment out 8"), 107 | bytearray("Comment out 9"), 108 | bytearray("Comment out 10"), 109 | bytearray("Comment out 11"), 110 | bytearray("Comment out 12"), 111 | bytearray("Comment out 13"), 112 | bytearray("Comment out 14"), 113 | bytearray("Comment out 15"), 114 | bytearray("Comment out 16"), 115 | bytearray("Encode to binary"), 116 | bytearray("Compression GZIP"), 117 | bytearray("Compression ZIP"), 118 | bytearray("CHOP PAYLOAD") 119 | ] 120 | 121 | 122 | 123 | class BurpExtender(IBurpExtender, IIntruderPayloadGeneratorFactory, IIntruderPayloadProcessor,IExtensionHelpers): 124 | 125 | # 126 | # implement IBurpExtender 127 | # 128 | 129 | def registerExtenderCallbacks(self, callbacks): 130 | # obtain an extension helpers object 131 | self._helpers = callbacks.getHelpers() 132 | 133 | # set our extension name 134 | callbacks.setExtensionName("Custom intruder payloads") 135 | 136 | # register ourselves as an Intruder payload generator 137 | callbacks.registerIntruderPayloadGeneratorFactory(self) 138 | 139 | # register ourselves as an Intruder payload processor 140 | callbacks.registerIntruderPayloadProcessor(self) 141 | 142 | # 143 | # implement IIntruderPayloadGeneratorFactory 144 | # 145 | 146 | def getGeneratorName(self): 147 | return "My custom payloads" 148 | 149 | def createNewInstance(self, attack): 150 | # return a new IIntruderPayloadGenerator to generate payloads for this attack 151 | return IntruderPayloadGenerator() 152 | 153 | # 154 | # implement IIntruderPayloadProcessor 155 | # 156 | 157 | def getProcessorName(self): 158 | return "Serialized input wrapper" 159 | 160 | 161 | def processPayload(baseValue): 162 | # rebuild the serialized data with the new payload 163 | dataParameter = baseValue 164 | return base64.b64encode(dataParameter) 165 | 166 | 167 | # 168 | # class to generate payloads from a simple list 169 | # 170 | 171 | class IntruderPayloadGenerator(IIntruderPayloadGenerator): 172 | def __init__(self): 173 | self._payloadIndex = 0 174 | self._chopCount = 0 175 | 176 | def hasMorePayloads(self): 177 | numPayload = len(PAYLOADS) 178 | # numPayload = numPayload + 10 179 | return self._payloadIndex < numPayload 180 | 181 | def getNextPayload(self, baseValue): 182 | payload = PAYLOADS[self._payloadIndex] 183 | self._payloadIndex = self._payloadIndex + 1 184 | 185 | 186 | # URL encode payload 187 | if self._payloadIndex == 1: 188 | s = hexlify(baseValue) 189 | s = '%'.join(s[i:i+2] for i in range(0, len(s), 2)) 190 | s = '%' + s 191 | return s 192 | 193 | # Double URL encode payload 194 | elif self._payloadIndex == 2: 195 | s = hexlify(baseValue) 196 | s = '%25'.join(s[i:i+2] for i in range(0, len(s), 2)) 197 | s = '%25' + s 198 | return s 199 | 200 | # Trible URL encode payload 201 | elif self._payloadIndex == 3: 202 | s = hexlify(baseValue) 203 | s = '%%2525'.join(s[i:i+2] for i in range(0, len(s), 2)) 204 | s = '%%2525' + s 205 | return s 206 | 207 | 208 | 209 | # HTML encode 0 zero 210 | elif self._payloadIndex == 4: 211 | s = hexlify(baseValue) 212 | s = '&#x'.join(s[i:i+2] for i in range(0, len(s), 2)) 213 | s = '&#x' + s 214 | return s 215 | 216 | 217 | # HTML encode 1 zero 218 | elif self._payloadIndex == 5: 219 | s = hexlify(baseValue) 220 | s = '�'.join(s[i:i+2] for i in range(0, len(s), 2)) 221 | s = '�' + s 222 | return s 223 | 224 | 225 | # HTML encode 2 zero 226 | elif self._payloadIndex == 6: 227 | s = hexlify(baseValue) 228 | s = '�'.join(s[i:i+2] for i in range(0, len(s), 2)) 229 | s = '�' + s 230 | return s 231 | 232 | 233 | # HTML encode 3 zero 234 | elif self._payloadIndex == 7: 235 | s = hexlify(baseValue) 236 | s = '�'.join(s[i:i+2] for i in range(0, len(s), 2)) 237 | s = '�' + s 238 | return s 239 | 240 | 241 | # HTML encode 4 zero 242 | elif self._payloadIndex == 8: 243 | s = hexlify(baseValue) 244 | s = '�'.join(s[i:i+2] for i in range(0, len(s), 2)) 245 | s = '�' + s 246 | return s 247 | 248 | 249 | # HTML encode 5 zero 250 | elif self._payloadIndex == 9: 251 | s = hexlify(baseValue) 252 | s = '�'.join(s[i:i+2] for i in range(0, len(s), 2)) 253 | s = '�' + s 254 | return s 255 | 256 | 257 | # HTML encode with semicolon 0 zero 258 | elif self._payloadIndex == 10: 259 | s = hexlify(baseValue) 260 | s = ';'.join(s[i:i+2] for i in range(0, len(s), 2)) 261 | s = s + ';' 262 | s = '&#x'.join(s[i:i+3] for i in range(0, len(s), 3)) 263 | s = '&#x' + s 264 | return s 265 | 266 | # HTML encode with semicolon 1 zero 267 | elif self._payloadIndex == 11: 268 | s = hexlify(baseValue) 269 | s = ';'.join(s[i:i+2] for i in range(0, len(s), 2)) 270 | s = s + ';' 271 | s = '�'.join(s[i:i+3] for i in range(0, len(s), 3)) 272 | s = '�' + s 273 | return s 274 | 275 | # HTML encode with semicolon 2 zero 276 | elif self._payloadIndex == 12: 277 | s = hexlify(baseValue) 278 | s = ';'.join(s[i:i+2] for i in range(0, len(s), 2)) 279 | s = s + ';' 280 | s = '�'.join(s[i:i+3] for i in range(0, len(s), 3)) 281 | s = '�' + s 282 | return s 283 | 284 | # HTML encode with semicolon 3 zero 285 | elif self._payloadIndex == 13: 286 | s = hexlify(baseValue) 287 | s = ';'.join(s[i:i+2] for i in range(0, len(s), 2)) 288 | s = s + ';' 289 | s = '�'.join(s[i:i+3] for i in range(0, len(s), 3)) 290 | s = '�' + s 291 | return s 292 | 293 | # HTML encode with semicolon 4 zero 294 | elif self._payloadIndex == 14: 295 | s = hexlify(baseValue) 296 | s = ';'.join(s[i:i+2] for i in range(0, len(s), 2)) 297 | s = s + ';' 298 | s = '�'.join(s[i:i+3] for i in range(0, len(s), 3)) 299 | s = '�' + s 300 | return s 301 | 302 | # HTML encode with semicolon 5 zero 303 | elif self._payloadIndex == 15: 304 | s = hexlify(baseValue) 305 | s = ';'.join(s[i:i+2] for i in range(0, len(s), 2)) 306 | s = s + ';' 307 | s = '�'.join(s[i:i+3] for i in range(0, len(s), 3)) 308 | s = '�' + s 309 | return s 310 | 311 | # HTML encode with capital X 0 zero 312 | elif self._payloadIndex == 16: 313 | s = hexlify(baseValue) 314 | s = '&#X'.join(s[i:i+2] for i in range(0, len(s), 2)) 315 | s = '&#X' + s 316 | return s 317 | 318 | # HTML encode with capital X 1 zero 319 | elif self._payloadIndex == 17: 320 | s = hexlify(baseValue) 321 | s = '�'.join(s[i:i+2] for i in range(0, len(s), 2)) 322 | s = '�' + s 323 | return s 324 | 325 | # HTML encode with capital X 2 zero 326 | elif self._payloadIndex == 18: 327 | s = hexlify(baseValue) 328 | s = '�'.join(s[i:i+2] for i in range(0, len(s), 2)) 329 | s = '�' + s 330 | return s 331 | 332 | 333 | # HTML encode with capital X 3 zero 334 | elif self._payloadIndex == 19: 335 | s = hexlify(baseValue) 336 | s = '�'.join(s[i:i+2] for i in range(0, len(s), 2)) 337 | s = '�' + s 338 | return s 339 | 340 | # HTML encode with capital X 4 zero 341 | elif self._payloadIndex == 20: 342 | s = hexlify(baseValue) 343 | s = '�'.join(s[i:i+2] for i in range(0, len(s), 2)) 344 | s = '�' + s 345 | return s 346 | 347 | 348 | # HTML encode with capital X 5 zero 349 | elif self._payloadIndex == 21: 350 | s = hexlify(baseValue) 351 | s = '�'.join(s[i:i+2] for i in range(0, len(s), 2)) 352 | s = '�' + s 353 | return s 354 | 355 | # HTML encode with semicolon and capital X 0 zero 356 | elif self._payloadIndex == 22: 357 | s = hexlify(baseValue) 358 | s = ';'.join(s[i:i+2] for i in range(0, len(s), 2)) 359 | s = s + ';' 360 | s = '&#X'.join(s[i:i+3] for i in range(0, len(s), 3)) 361 | s = '&#X' + s 362 | return s 363 | 364 | # HTML encode with semicolon and capital X 1 zero 365 | elif self._payloadIndex == 23: 366 | s = hexlify(baseValue) 367 | s = ';'.join(s[i:i+2] for i in range(0, len(s), 2)) 368 | s = s + ';' 369 | s = '�'.join(s[i:i+3] for i in range(0, len(s), 3)) 370 | s = '�' + s 371 | return s 372 | 373 | # HTML encode with semicolon and capital X 2 zero 374 | elif self._payloadIndex == 24: 375 | s = hexlify(baseValue) 376 | s = ';'.join(s[i:i+2] for i in range(0, len(s), 2)) 377 | s = s + ';' 378 | s = '�'.join(s[i:i+3] for i in range(0, len(s), 3)) 379 | s = '�' + s 380 | return s 381 | 382 | # HTML encode with semicolon and capital X 3 zero 383 | elif self._payloadIndex == 25: 384 | s = hexlify(baseValue) 385 | s = ';'.join(s[i:i+2] for i in range(0, len(s), 2)) 386 | s = s + ';' 387 | s = '�'.join(s[i:i+3] for i in range(0, len(s), 3)) 388 | s = '�' + s 389 | return s 390 | 391 | 392 | # HTML encode with semicolon and capital X 4 zero 393 | elif self._payloadIndex == 26: 394 | s = hexlify(baseValue) 395 | s = ';'.join(s[i:i+2] for i in range(0, len(s), 2)) 396 | s = s + ';' 397 | s = '�'.join(s[i:i+3] for i in range(0, len(s), 3)) 398 | s = '�' + s 399 | return s 400 | 401 | # HTML encode with semicolon and capital X 5 zero 402 | elif self._payloadIndex == 27: 403 | s = hexlify(baseValue) 404 | s = ';'.join(s[i:i+2] for i in range(0, len(s), 2)) 405 | s = s + ';' 406 | s = '�'.join(s[i:i+3] for i in range(0, len(s), 3)) 407 | s = '�' + s 408 | return s 409 | 410 | # HTML encode with capital hex 0 zero 411 | elif self._payloadIndex == 28: 412 | s = hexlify(baseValue).upper() 413 | s = '&#x'.join(s[i:i+2] for i in range(0, len(s), 2)) 414 | s = '&#x' + s 415 | return s 416 | 417 | # HTML encode with capital hex 1 zero 418 | elif self._payloadIndex == 29: 419 | s = hexlify(baseValue).upper() 420 | s = '�'.join(s[i:i+2] for i in range(0, len(s), 2)) 421 | s = '�' + s 422 | return s 423 | 424 | # HTML encode with capital hex 2 zero 425 | elif self._payloadIndex == 30: 426 | s = hexlify(baseValue).upper() 427 | s = '�'.join(s[i:i+2] for i in range(0, len(s), 2)) 428 | s = '�' + s 429 | return s 430 | 431 | 432 | # HTML encode with capital hex 3 zero 433 | elif self._payloadIndex == 31: 434 | s = hexlify(baseValue).upper() 435 | s = '�'.join(s[i:i+2] for i in range(0, len(s), 2)) 436 | s = '�' + s 437 | return s 438 | 439 | # HTML encode with capital hex 4 zero 440 | elif self._payloadIndex == 32: 441 | s = hexlify(baseValue).upper() 442 | s = '�'.join(s[i:i+2] for i in range(0, len(s), 2)) 443 | s = '�' + s 444 | return s 445 | 446 | # HTML encode with capital hex 5 zero 447 | elif self._payloadIndex == 33: 448 | s = hexlify(baseValue).upper() 449 | s = '�'.join(s[i:i+2] for i in range(0, len(s), 2)) 450 | s = '�' + s 451 | return s 452 | 453 | # HTML encode with semicolon and capital hex 0 zero 454 | elif self._payloadIndex == 34: 455 | s = hexlify(baseValue).upper() 456 | s = ';'.join(s[i:i+2] for i in range(0, len(s), 2)) 457 | s = s + ';' 458 | s = '&#x'.join(s[i:i+3] for i in range(0, len(s), 3)) 459 | s = '&#x' + s 460 | return s 461 | 462 | # HTML encode with semicolon and capital hex 1 zero 463 | elif self._payloadIndex == 35: 464 | s = hexlify(baseValue).upper() 465 | s = ';'.join(s[i:i+2] for i in range(0, len(s), 2)) 466 | s = s + ';' 467 | s = '�'.join(s[i:i+3] for i in range(0, len(s), 3)) 468 | s = '�' + s 469 | return s 470 | 471 | # HTML encode with semicolon and capital hex 2 zero 472 | elif self._payloadIndex == 36: 473 | s = hexlify(baseValue).upper() 474 | s = ';'.join(s[i:i+2] for i in range(0, len(s), 2)) 475 | s = s + ';' 476 | s = '�'.join(s[i:i+3] for i in range(0, len(s), 3)) 477 | s = '�' + s 478 | return s 479 | 480 | # HTML encode with semicolon and capital hex 3 zero 481 | elif self._payloadIndex == 37: 482 | s = hexlify(baseValue).upper() 483 | s = ';'.join(s[i:i+2] for i in range(0, len(s), 2)) 484 | s = s + ';' 485 | s = '�'.join(s[i:i+3] for i in range(0, len(s), 3)) 486 | s = '�' + s 487 | return s 488 | 489 | # HTML encode with semicolon and capital hex 4 zero 490 | elif self._payloadIndex == 38: 491 | s = hexlify(baseValue).upper() 492 | s = ';'.join(s[i:i+2] for i in range(0, len(s), 2)) 493 | s = s + ';' 494 | s = '�'.join(s[i:i+3] for i in range(0, len(s), 3)) 495 | s = '�' + s 496 | return s 497 | 498 | # HTML encode with semicolon and capital hex 5 zero 499 | elif self._payloadIndex == 39: 500 | s = hexlify(baseValue).upper() 501 | s = ';'.join(s[i:i+2] for i in range(0, len(s), 2)) 502 | s = s + ';' 503 | s = '�'.join(s[i:i+3] for i in range(0, len(s), 3)) 504 | s = '�' + s 505 | return s 506 | 507 | # HTML encode with capital hex, X 0 zero 508 | elif self._payloadIndex == 40: 509 | s = hexlify(baseValue).upper() 510 | s = '&#X'.join(s[i:i+2] for i in range(0, len(s), 2)) 511 | s = '&#X' + s 512 | return s 513 | 514 | # HTML encode with capital hex, X 1 zero 515 | elif self._payloadIndex == 41: 516 | s = hexlify(baseValue).upper() 517 | s = '�'.join(s[i:i+2] for i in range(0, len(s), 2)) 518 | s = '�' + s 519 | return s 520 | 521 | # HTML encode with capital hex, X 2 zero 522 | elif self._payloadIndex == 42: 523 | s = hexlify(baseValue).upper() 524 | s = '�'.join(s[i:i+2] for i in range(0, len(s), 2)) 525 | s = '�' + s 526 | return s 527 | 528 | 529 | # HTML encode with capital hex, X 3 zero 530 | elif self._payloadIndex == 43: 531 | s = hexlify(baseValue).upper() 532 | s = '�'.join(s[i:i+2] for i in range(0, len(s), 2)) 533 | s = '�' + s 534 | return s 535 | 536 | # HTML encode with capital hex, X 4 zero 537 | elif self._payloadIndex == 44: 538 | s = hexlify(baseValue).upper() 539 | s = '�'.join(s[i:i+2] for i in range(0, len(s), 2)) 540 | s = '�' + s 541 | return s 542 | 543 | # HTML encode with capital hex,X 5 zero 544 | elif self._payloadIndex == 45: 545 | s = hexlify(baseValue).upper() 546 | s = '�'.join(s[i:i+2] for i in range(0, len(s), 2)) 547 | s = '�' + s 548 | return s 549 | 550 | # HTML encode with semicolon and capital hex,X 0 zero 551 | elif self._payloadIndex == 46: 552 | s = hexlify(baseValue).upper() 553 | s = ';'.join(s[i:i+2] for i in range(0, len(s), 2)) 554 | s = s + ';' 555 | s = '&#X'.join(s[i:i+3] for i in range(0, len(s), 3)) 556 | s = '&#X' + s 557 | return s 558 | 559 | # HTML encode with semicolon and capital hex,X 1 zero 560 | elif self._payloadIndex == 47: 561 | s = hexlify(baseValue).upper() 562 | s = ';'.join(s[i:i+2] for i in range(0, len(s), 2)) 563 | s = s + ';' 564 | s = '�'.join(s[i:i+3] for i in range(0, len(s), 3)) 565 | s = '�' + s 566 | return s 567 | 568 | # HTML encode with semicolon and capital hex, X 2 zero 569 | elif self._payloadIndex == 48: 570 | s = hexlify(baseValue).upper() 571 | s = ';'.join(s[i:i+2] for i in range(0, len(s), 2)) 572 | s = s + ';' 573 | s = '�'.join(s[i:i+3] for i in range(0, len(s), 3)) 574 | s = '�' + s 575 | return s 576 | 577 | # HTML encode with semicolon and capital hex,X 3 zero 578 | elif self._payloadIndex == 49: 579 | s = hexlify(baseValue).upper() 580 | s = ';'.join(s[i:i+2] for i in range(0, len(s), 2)) 581 | s = s + ';' 582 | s = '�'.join(s[i:i+3] for i in range(0, len(s), 3)) 583 | s = '�' + s 584 | return s 585 | 586 | # HTML encode with semicolon and capital hex, X 4 zero 587 | elif self._payloadIndex == 50: 588 | s = hexlify(baseValue).upper() 589 | s = ';'.join(s[i:i+2] for i in range(0, len(s), 2)) 590 | s = s + ';' 591 | s = '�'.join(s[i:i+3] for i in range(0, len(s), 3)) 592 | s = '�' + s 593 | return s 594 | 595 | # HTML encode with semicolon and capital hex, X 5 zero 596 | elif self._payloadIndex == 51: 597 | s = hexlify(baseValue).upper() 598 | s = ';'.join(s[i:i+2] for i in range(0, len(s), 2)) 599 | s = s + ';' 600 | s = '�'.join(s[i:i+3] for i in range(0, len(s), 3)) 601 | s = '�' + s 602 | return s 603 | 604 | # Unicode lowercase 605 | elif self._payloadIndex == 52: 606 | s = hexlify(baseValue) 607 | s = '\\x'.join(s[i:i+2] for i in range(0, len(s), 2)) 608 | s = '\\x' + s 609 | return s 610 | 611 | 612 | # Unicode uppercase hex 613 | elif self._payloadIndex == 53: 614 | s = hexlify(baseValue).upper() 615 | s = '\\x'.join(s[i:i+2] for i in range(0, len(s), 2)) 616 | s = '\\x' + s 617 | return s 618 | 619 | # Unicode lowercase with 00 620 | elif self._payloadIndex == 54: 621 | s = hexlify(baseValue) 622 | s = '\\u00'.join(s[i:i+2] for i in range(0, len(s), 2)) 623 | s = '\\u00' + s 624 | return s 625 | 626 | # Unicode uppercase with 00 627 | elif self._payloadIndex == 55: 628 | s = hexlify(baseValue).upper() 629 | s = '\\u00'.join(s[i:i+2] for i in range(0, len(s), 2)) 630 | s = '\\u00' + s 631 | return s 632 | 633 | # Base64 encoding 634 | elif self._payloadIndex == 56: 635 | return base64.b64encode(baseValue) 636 | 637 | # Null byte 638 | elif self._payloadIndex == 57: 639 | s = '%00'+baseValue 640 | return s 641 | 642 | # Carrige return string 643 | elif self._payloadIndex == 58: 644 | s = '\\r\\n'+baseValue 645 | return s 646 | 647 | # Carrige return url encoded 648 | elif self._payloadIndex == 59: 649 | s = '%0A%0D'+baseValue 650 | return s 651 | 652 | # HTML entities encoding 653 | elif self._payloadIndex == 60: 654 | byte_data = baseValue 655 | s = "".join(map(chr, byte_data)) 656 | # list the changes you want 657 | s = s.replace("&","&") 658 | s = s.replace("<","<") 659 | s = s.replace(">",">") 660 | s = s.replace("\"",""") 661 | s = s.replace("'","&apos") 662 | return s 663 | 664 | # HTML entities encoding with semicolon 665 | elif self._payloadIndex == 61: 666 | byte_data = baseValue 667 | s = "".join(map(chr, byte_data)) 668 | # list the changes you want 669 | s = s.replace("&","&") 670 | s = s.replace("<","<") 671 | s = s.replace(">",">") 672 | s = s.replace("\"",""") 673 | s = s.replace("'","'") 674 | return s 675 | 676 | # HTML entities encoding uppercase 677 | elif self._payloadIndex == 62: 678 | byte_data = baseValue 679 | s = "".join(map(chr, byte_data)) 680 | # list the changes you want 681 | s = s.replace("&","&") 682 | s = s.replace("<","<") 683 | s = s.replace(">",">") 684 | s = s.replace("\"",""") 685 | s = s.replace("'","&APOS") 686 | return s 687 | 688 | # HTML entities encoding uppercase with semicolon 689 | elif self._payloadIndex == 63: 690 | byte_data = baseValue 691 | s = "".join(map(chr, byte_data)) 692 | # list the changes you want 693 | s = s.replace("&","&") 694 | s = s.replace("<","<") 695 | s = s.replace(">",">") 696 | s = s.replace("\"",""") 697 | s = s.replace("'","&APOS;") 698 | return s 699 | 700 | # Lowercase 701 | elif self._payloadIndex == 64: 702 | byte_data = baseValue 703 | s = "".join(map(chr, byte_data)) 704 | s = s.lower() 705 | return s 706 | 707 | # Uppercase 708 | elif self._payloadIndex == 65: 709 | byte_data = baseValue 710 | s = "".join(map(chr, byte_data)) 711 | s = s.upper() 712 | return s 713 | 714 | # Alternate cases 715 | elif self._payloadIndex == 66: 716 | byte_data = baseValue 717 | s = "".join(map(chr, byte_data)) 718 | temp = "" 719 | for i in s: 720 | randomNum = random.randint(0,1) 721 | if randomNum == 0: 722 | temp += i.upper() 723 | else: 724 | temp += i.lower() 725 | return temp 726 | 727 | 728 | # Reuniting payload 729 | elif self._payloadIndex == 67: 730 | byte_data = baseValue 731 | s = "".join(map(chr, byte_data)) 732 | regex = r'\b\w+\b' 733 | list1 = re.findall(regex,s) 734 | # make list unique 735 | list1 = list(set(list1)) 736 | for i in list1: 737 | if len(i) > 1: 738 | temp = i[:1] + i + i[1:] 739 | s = s.replace(i,temp) 740 | return s 741 | 742 | 743 | # Embedded tab 744 | elif self._payloadIndex == 68: 745 | byte_data = baseValue 746 | s = "".join(map(chr, byte_data)) 747 | regex = r'\b\w+\b' 748 | list1 = re.findall(regex,s) 749 | # make list unique 750 | list1 = list(set(list1)) 751 | for i in list1: 752 | if len(i) > 1: 753 | temp = i[:1] + "%09" + i[1:] 754 | s = s.replace(i,temp) 755 | return s 756 | 757 | # Embedded new line 758 | elif self._payloadIndex == 69: 759 | byte_data = baseValue 760 | s = "".join(map(chr, byte_data)) 761 | regex = r'\b\w+\b' 762 | list1 = re.findall(regex,s) 763 | # make list unique 764 | list1 = list(set(list1)) 765 | for i in list1: 766 | if len(i) > 1: 767 | temp = i[:1] + "%0a" + i[1:] 768 | s = s.replace(i,temp) 769 | return s 770 | 771 | # Embedded new line 772 | elif self._payloadIndex == 70: 773 | byte_data = baseValue 774 | s = "".join(map(chr, byte_data)) 775 | regex = r'\b\w+\b' 776 | list1 = re.findall(regex,s) 777 | # make list unique 778 | list1 = list(set(list1)) 779 | for i in list1: 780 | if len(i) > 1: 781 | temp = i[:1] + "%0a%0d" + i[1:] 782 | s = s.replace(i,temp) 783 | return s 784 | 785 | 786 | # bufferoverflow 1000 787 | elif self._payloadIndex == 71: 788 | byte_data = baseValue 789 | s = "".join(map(chr, byte_data)) 790 | o = "A" * 1000 791 | s = o + s 792 | return s 793 | 794 | 795 | 796 | # bufferoverflow 2500 797 | elif self._payloadIndex == 72: 798 | byte_data = baseValue 799 | s = "".join(map(chr, byte_data)) 800 | o = "A" * 2500 801 | s = o + s 802 | return s 803 | 804 | # bufferoverflow 5000 805 | elif self._payloadIndex == 73: 806 | byte_data = baseValue 807 | s = "".join(map(chr, byte_data)) 808 | o = "A" * 5000 809 | s = o + s 810 | return s 811 | 812 | # bufferoverflow 10000 813 | elif self._payloadIndex == 74: 814 | byte_data = baseValue 815 | s = "".join(map(chr, byte_data)) 816 | o = "A" * 10000 817 | s = o + s 818 | return s 819 | 820 | 821 | # Carrige return url encoded - AP 822 | elif self._payloadIndex == 75: 823 | s = '%0d%0a'+baseValue 824 | return s 825 | 826 | # Alternative URL encode payload - AP 827 | if self._payloadIndex == 76: 828 | s = hexlify(baseValue) 829 | s = hexlify(s) 830 | s = '%'.join(s[i:i+2] for i in range(0, len(s), 2)) 831 | s = '%' + s 832 | s = '%25'.join(s[i:i+6] for i in range(0, len(s), 6)) 833 | s = '%25' + s 834 | return s 835 | 836 | 837 | # ASCII hex 838 | if self._payloadIndex == 77: 839 | s = hexlify(baseValue) 840 | return s 841 | 842 | # Double ASCII hex 843 | if self._payloadIndex == 78: 844 | s = hexlify(baseValue) 845 | s = hexlify(s) 846 | return s 847 | 848 | # Embedded payload 849 | elif self._payloadIndex == 79: 850 | s = "blabla"+baseValue+"blabla" 851 | return s 852 | 853 | # Comment out 1 854 | elif self._payloadIndex == 80: 855 | s = "