├── LICENSE ├── README.md ├── dnslib ├── __init__.py ├── __init__.pyc ├── bimap.py ├── bimap.pyc ├── bit.py ├── bit.pyc ├── buffer.py ├── buffer.pyc ├── client.py ├── digparser.py ├── dns.py ├── dns.pyc ├── fixedresolver.py ├── intercept.py ├── label.py ├── label.pyc ├── lex.py ├── lex.pyc ├── proxy.py ├── ranges.py ├── ranges.pyc ├── server.py ├── shellresolver.py ├── test_decode.py └── zoneresolver.py ├── names.txt ├── names_small.txt ├── resolvers.txt ├── subbrute.py ├── windows ├── LICENSE ├── _bz2.pyd ├── _ctypes.pyd ├── _hashlib.pyd ├── _lzma.pyd ├── _multiprocessing.pyd ├── _socket.pyd ├── _ssl.pyd ├── library.zip ├── names.txt ├── names_large.txt ├── names_small.txt ├── pyexpat.pyd ├── python34.dll ├── resolvers.txt ├── select.pyd ├── subbrute.exe └── unicodedata.pyd └── windows_setup.py /LICENSE: -------------------------------------------------------------------------------- 1 | 2 | 3 | GNU GENERAL PUBLIC LICENSE 4 | Version 3, 29 June 2007 5 | 6 | Copyright (C) 2007 Free Software Foundation, Inc. 7 | Everyone is permitted to copy and distribute verbatim copies 8 | of this license document, but changing it is not allowed. 9 | 10 | Preamble 11 | 12 | The GNU General Public License is a free, copyleft license for 13 | software and other kinds of works. 14 | 15 | The licenses for most software and other practical works are designed 16 | to take away your freedom to share and change the works. By contrast, 17 | the GNU General Public License is intended to guarantee your freedom to 18 | share and change all versions of a program--to make sure it remains free 19 | software for all its users. We, the Free Software Foundation, use the 20 | GNU General Public License for most of our software; it applies also to 21 | any other work released this way by its authors. You can apply it to 22 | your programs, too. 23 | 24 | When we speak of free software, we are referring to freedom, not 25 | price. Our General Public Licenses are designed to make sure that you 26 | have the freedom to distribute copies of free software (and charge for 27 | them if you wish), that you receive source code or can get it if you 28 | want it, that you can change the software or use pieces of it in new 29 | free programs, and that you know you can do these things. 30 | 31 | To protect your rights, we need to prevent others from denying you 32 | these rights or asking you to surrender the rights. Therefore, you have 33 | certain responsibilities if you distribute copies of the software, or if 34 | you modify it: responsibilities to respect the freedom of others. 35 | 36 | For example, if you distribute copies of such a program, whether 37 | gratis or for a fee, you must pass on to the recipients the same 38 | freedoms that you received. You must make sure that they, too, receive 39 | or can get the source code. And you must show them these terms so they 40 | know their rights. 41 | 42 | Developers that use the GNU GPL protect your rights with two steps: 43 | (1) assert copyright on the software, and (2) offer you this License 44 | giving you legal permission to copy, distribute and/or modify it. 45 | 46 | For the developers' and authors' protection, the GPL clearly explains 47 | that there is no warranty for this free software. For both users' and 48 | authors' sake, the GPL requires that modified versions be marked as 49 | changed, so that their problems will not be attributed erroneously to 50 | authors of previous versions. 51 | 52 | Some devices are designed to deny users access to install or run 53 | modified versions of the software inside them, although the manufacturer 54 | can do so. This is fundamentally incompatible with the aim of 55 | protecting users' freedom to change the software. The systematic 56 | pattern of such abuse occurs in the area of products for individuals to 57 | use, which is precisely where it is most unacceptable. Therefore, we 58 | have designed this version of the GPL to prohibit the practice for those 59 | products. If such problems arise substantially in other domains, we 60 | stand ready to extend this provision to those domains in future versions 61 | of the GPL, as needed to protect the freedom of users. 62 | 63 | Finally, every program is threatened constantly by software patents. 64 | States should not allow patents to restrict development and use of 65 | software on general-purpose computers, but in those that do, we wish to 66 | avoid the special danger that patents applied to a free program could 67 | make it effectively proprietary. To prevent this, the GPL assures that 68 | patents cannot be used to render the program non-free. 69 | 70 | The precise terms and conditions for copying, distribution and 71 | modification follow. 72 | 73 | TERMS AND CONDITIONS 74 | 75 | 0. Definitions. 76 | 77 | "This License" refers to version 3 of the GNU General Public License. 78 | 79 | "Copyright" also means copyright-like laws that apply to other kinds of 80 | works, such as semiconductor masks. 81 | 82 | "The Program" refers to any copyrightable work licensed under this 83 | License. Each licensee is addressed as "you". "Licensees" and 84 | "recipients" may be individuals or organizations. 85 | 86 | To "modify" a work means to copy from or adapt all or part of the work 87 | in a fashion requiring copyright permission, other than the making of an 88 | exact copy. The resulting work is called a "modified version" of the 89 | earlier work or a work "based on" the earlier work. 90 | 91 | A "covered work" means either the unmodified Program or a work based 92 | on the Program. 93 | 94 | To "propagate" a work means to do anything with it that, without 95 | permission, would make you directly or secondarily liable for 96 | infringement under applicable copyright law, except executing it on a 97 | computer or modifying a private copy. Propagation includes copying, 98 | distribution (with or without modification), making available to the 99 | public, and in some countries other activities as well. 100 | 101 | To "convey" a work means any kind of propagation that enables other 102 | parties to make or receive copies. Mere interaction with a user through 103 | a computer network, with no transfer of a copy, is not conveying. 104 | 105 | An interactive user interface displays "Appropriate Legal Notices" 106 | to the extent that it includes a convenient and prominently visible 107 | feature that (1) displays an appropriate copyright notice, and (2) 108 | tells the user that there is no warranty for the work (except to the 109 | extent that warranties are provided), that licensees may convey the 110 | work under this License, and how to view a copy of this License. If 111 | the interface presents a list of user commands or options, such as a 112 | menu, a prominent item in the list meets this criterion. 113 | 114 | 1. Source Code. 115 | 116 | The "source code" for a work means the preferred form of the work 117 | for making modifications to it. "Object code" means any non-source 118 | form of a work. 119 | 120 | A "Standard Interface" means an interface that either is an official 121 | standard defined by a recognized standards body, or, in the case of 122 | interfaces specified for a particular programming language, one that 123 | is widely used among developers working in that language. 124 | 125 | The "System Libraries" of an executable work include anything, other 126 | than the work as a whole, that (a) is included in the normal form of 127 | packaging a Major Component, but which is not part of that Major 128 | Component, and (b) serves only to enable use of the work with that 129 | Major Component, or to implement a Standard Interface for which an 130 | implementation is available to the public in source code form. A 131 | "Major Component", in this context, means a major essential component 132 | (kernel, window system, and so on) of the specific operating system 133 | (if any) on which the executable work runs, or a compiler used to 134 | produce the work, or an object code interpreter used to run it. 135 | 136 | The "Corresponding Source" for a work in object code form means all 137 | the source code needed to generate, install, and (for an executable 138 | work) run the object code and to modify the work, including scripts to 139 | control those activities. However, it does not include the work's 140 | System Libraries, or general-purpose tools or generally available free 141 | programs which are used unmodified in performing those activities but 142 | which are not part of the work. For example, Corresponding Source 143 | includes interface definition files associated with source files for 144 | the work, and the source code for shared libraries and dynamically 145 | linked subprograms that the work is specifically designed to require, 146 | such as by intimate data communication or control flow between those 147 | subprograms and other parts of the work. 148 | 149 | The Corresponding Source need not include anything that users 150 | can regenerate automatically from other parts of the Corresponding 151 | Source. 152 | 153 | The Corresponding Source for a work in source code form is that 154 | same work. 155 | 156 | 2. Basic Permissions. 157 | 158 | All rights granted under this License are granted for the term of 159 | copyright on the Program, and are irrevocable provided the stated 160 | conditions are met. This License explicitly affirms your unlimited 161 | permission to run the unmodified Program. The output from running a 162 | covered work is covered by this License only if the output, given its 163 | content, constitutes a covered work. This License acknowledges your 164 | rights of fair use or other equivalent, as provided by copyright law. 165 | 166 | You may make, run and propagate covered works that you do not 167 | convey, without conditions so long as your license otherwise remains 168 | in force. You may convey covered works to others for the sole purpose 169 | of having them make modifications exclusively for you, or provide you 170 | with facilities for running those works, provided that you comply with 171 | the terms of this License in conveying all material for which you do 172 | not control copyright. Those thus making or running the covered works 173 | for you must do so exclusively on your behalf, under your direction 174 | and control, on terms that prohibit them from making any copies of 175 | your copyrighted material outside their relationship with you. 176 | 177 | Conveying under any other circumstances is permitted solely under 178 | the conditions stated below. Sublicensing is not allowed; section 10 179 | makes it unnecessary. 180 | 181 | 3. Protecting Users' Legal Rights From Anti-Circumvention Law. 182 | 183 | No covered work shall be deemed part of an effective technological 184 | measure under any applicable law fulfilling obligations under article 185 | 11 of the WIPO copyright treaty adopted on 20 December 1996, or 186 | similar laws prohibiting or restricting circumvention of such 187 | measures. 188 | 189 | When you convey a covered work, you waive any legal power to forbid 190 | circumvention of technological measures to the extent such circumvention 191 | is effected by exercising rights under this License with respect to 192 | the covered work, and you disclaim any intention to limit operation or 193 | modification of the work as a means of enforcing, against the work's 194 | users, your or third parties' legal rights to forbid circumvention of 195 | technological measures. 196 | 197 | 4. Conveying Verbatim Copies. 198 | 199 | You may convey verbatim copies of the Program's source code as you 200 | receive it, in any medium, provided that you conspicuously and 201 | appropriately publish on each copy an appropriate copyright notice; 202 | keep intact all notices stating that this License and any 203 | non-permissive terms added in accord with section 7 apply to the code; 204 | keep intact all notices of the absence of any warranty; and give all 205 | recipients a copy of this License along with the Program. 206 | 207 | You may charge any price or no price for each copy that you convey, 208 | and you may offer support or warranty protection for a fee. 209 | 210 | 5. Conveying Modified Source Versions. 211 | 212 | You may convey a work based on the Program, or the modifications to 213 | produce it from the Program, in the form of source code under the 214 | terms of section 4, provided that you also meet all of these conditions: 215 | 216 | a) The work must carry prominent notices stating that you modified 217 | it, and giving a relevant date. 218 | 219 | b) The work must carry prominent notices stating that it is 220 | released under this License and any conditions added under section 221 | 7. This requirement modifies the requirement in section 4 to 222 | "keep intact all notices". 223 | 224 | c) You must license the entire work, as a whole, under this 225 | License to anyone who comes into possession of a copy. This 226 | License will therefore apply, along with any applicable section 7 227 | additional terms, to the whole of the work, and all its parts, 228 | regardless of how they are packaged. This License gives no 229 | permission to license the work in any other way, but it does not 230 | invalidate such permission if you have separately received it. 231 | 232 | d) If the work has interactive user interfaces, each must display 233 | Appropriate Legal Notices; however, if the Program has interactive 234 | interfaces that do not display Appropriate Legal Notices, your 235 | work need not make them do so. 236 | 237 | A compilation of a covered work with other separate and independent 238 | works, which are not by their nature extensions of the covered work, 239 | and which are not combined with it such as to form a larger program, 240 | in or on a volume of a storage or distribution medium, is called an 241 | "aggregate" if the compilation and its resulting copyright are not 242 | used to limit the access or legal rights of the compilation's users 243 | beyond what the individual works permit. Inclusion of a covered work 244 | in an aggregate does not cause this License to apply to the other 245 | parts of the aggregate. 246 | 247 | 6. Conveying Non-Source Forms. 248 | 249 | You may convey a covered work in object code form under the terms 250 | of sections 4 and 5, provided that you also convey the 251 | machine-readable Corresponding Source under the terms of this License, 252 | in one of these ways: 253 | 254 | a) Convey the object code in, or embodied in, a physical product 255 | (including a physical distribution medium), accompanied by the 256 | Corresponding Source fixed on a durable physical medium 257 | customarily used for software interchange. 258 | 259 | b) Convey the object code in, or embodied in, a physical product 260 | (including a physical distribution medium), accompanied by a 261 | written offer, valid for at least three years and valid for as 262 | long as you offer spare parts or customer support for that product 263 | model, to give anyone who possesses the object code either (1) a 264 | copy of the Corresponding Source for all the software in the 265 | product that is covered by this License, on a durable physical 266 | medium customarily used for software interchange, for a price no 267 | more than your reasonable cost of physically performing this 268 | conveying of source, or (2) access to copy the 269 | Corresponding Source from a network server at no charge. 270 | 271 | c) Convey individual copies of the object code with a copy of the 272 | written offer to provide the Corresponding Source. This 273 | alternative is allowed only occasionally and noncommercially, and 274 | only if you received the object code with such an offer, in accord 275 | with subsection 6b. 276 | 277 | d) Convey the object code by offering access from a designated 278 | place (gratis or for a charge), and offer equivalent access to the 279 | Corresponding Source in the same way through the same place at no 280 | further charge. You need not require recipients to copy the 281 | Corresponding Source along with the object code. If the place to 282 | copy the object code is a network server, the Corresponding Source 283 | may be on a different server (operated by you or a third party) 284 | that supports equivalent copying facilities, provided you maintain 285 | clear directions next to the object code saying where to find the 286 | Corresponding Source. Regardless of what server hosts the 287 | Corresponding Source, you remain obligated to ensure that it is 288 | available for as long as needed to satisfy these requirements. 289 | 290 | e) Convey the object code using peer-to-peer transmission, provided 291 | you inform other peers where the object code and Corresponding 292 | Source of the work are being offered to the general public at no 293 | charge under subsection 6d. 294 | 295 | A separable portion of the object code, whose source code is excluded 296 | from the Corresponding Source as a System Library, need not be 297 | included in conveying the object code work. 298 | 299 | A "User Product" is either (1) a "consumer product", which means any 300 | tangible personal property which is normally used for personal, family, 301 | or household purposes, or (2) anything designed or sold for incorporation 302 | into a dwelling. In determining whether a product is a consumer product, 303 | doubtful cases shall be resolved in favor of coverage. For a particular 304 | product received by a particular user, "normally used" refers to a 305 | typical or common use of that class of product, regardless of the status 306 | of the particular user or of the way in which the particular user 307 | actually uses, or expects or is expected to use, the product. A product 308 | is a consumer product regardless of whether the product has substantial 309 | commercial, industrial or non-consumer uses, unless such uses represent 310 | the only significant mode of use of the product. 311 | 312 | "Installation Information" for a User Product means any methods, 313 | procedures, authorization keys, or other information required to install 314 | and execute modified versions of a covered work in that User Product from 315 | a modified version of its Corresponding Source. The information must 316 | suffice to ensure that the continued functioning of the modified object 317 | code is in no case prevented or interfered with solely because 318 | modification has been made. 319 | 320 | If you convey an object code work under this section in, or with, or 321 | specifically for use in, a User Product, and the conveying occurs as 322 | part of a transaction in which the right of possession and use of the 323 | User Product is transferred to the recipient in perpetuity or for a 324 | fixed term (regardless of how the transaction is characterized), the 325 | Corresponding Source conveyed under this section must be accompanied 326 | by the Installation Information. But this requirement does not apply 327 | if neither you nor any third party retains the ability to install 328 | modified object code on the User Product (for example, the work has 329 | been installed in ROM). 330 | 331 | The requirement to provide Installation Information does not include a 332 | requirement to continue to provide support service, warranty, or updates 333 | for a work that has been modified or installed by the recipient, or for 334 | the User Product in which it has been modified or installed. Access to a 335 | network may be denied when the modification itself materially and 336 | adversely affects the operation of the network or violates the rules and 337 | protocols for communication across the network. 338 | 339 | Corresponding Source conveyed, and Installation Information provided, 340 | in accord with this section must be in a format that is publicly 341 | documented (and with an implementation available to the public in 342 | source code form), and must require no special password or key for 343 | unpacking, reading or copying. 344 | 345 | 7. Additional Terms. 346 | 347 | "Additional permissions" are terms that supplement the terms of this 348 | License by making exceptions from one or more of its conditions. 349 | Additional permissions that are applicable to the entire Program shall 350 | be treated as though they were included in this License, to the extent 351 | that they are valid under applicable law. If additional permissions 352 | apply only to part of the Program, that part may be used separately 353 | under those permissions, but the entire Program remains governed by 354 | this License without regard to the additional permissions. 355 | 356 | When you convey a copy of a covered work, you may at your option 357 | remove any additional permissions from that copy, or from any part of 358 | it. (Additional permissions may be written to require their own 359 | removal in certain cases when you modify the work.) You may place 360 | additional permissions on material, added by you to a covered work, 361 | for which you have or can give appropriate copyright permission. 362 | 363 | Notwithstanding any other provision of this License, for material you 364 | add to a covered work, you may (if authorized by the copyright holders of 365 | that material) supplement the terms of this License with terms: 366 | 367 | a) Disclaiming warranty or limiting liability differently from the 368 | terms of sections 15 and 16 of this License; or 369 | 370 | b) Requiring preservation of specified reasonable legal notices or 371 | author attributions in that material or in the Appropriate Legal 372 | Notices displayed by works containing it; or 373 | 374 | c) Prohibiting misrepresentation of the origin of that material, or 375 | requiring that modified versions of such material be marked in 376 | reasonable ways as different from the original version; or 377 | 378 | d) Limiting the use for publicity purposes of names of licensors or 379 | authors of the material; or 380 | 381 | e) Declining to grant rights under trademark law for use of some 382 | trade names, trademarks, or service marks; or 383 | 384 | f) Requiring indemnification of licensors and authors of that 385 | material by anyone who conveys the material (or modified versions of 386 | it) with contractual assumptions of liability to the recipient, for 387 | any liability that these contractual assumptions directly impose on 388 | those licensors and authors. 389 | 390 | All other non-permissive additional terms are considered "further 391 | restrictions" within the meaning of section 10. If the Program as you 392 | received it, or any part of it, contains a notice stating that it is 393 | governed by this License along with a term that is a further 394 | restriction, you may remove that term. If a license document contains 395 | a further restriction but permits relicensing or conveying under this 396 | License, you may add to a covered work material governed by the terms 397 | of that license document, provided that the further restriction does 398 | not survive such relicensing or conveying. 399 | 400 | If you add terms to a covered work in accord with this section, you 401 | must place, in the relevant source files, a statement of the 402 | additional terms that apply to those files, or a notice indicating 403 | where to find the applicable terms. 404 | 405 | Additional terms, permissive or non-permissive, may be stated in the 406 | form of a separately written license, or stated as exceptions; 407 | the above requirements apply either way. 408 | 409 | 8. Termination. 410 | 411 | You may not propagate or modify a covered work except as expressly 412 | provided under this License. Any attempt otherwise to propagate or 413 | modify it is void, and will automatically terminate your rights under 414 | this License (including any patent licenses granted under the third 415 | paragraph of section 11). 416 | 417 | However, if you cease all violation of this License, then your 418 | license from a particular copyright holder is reinstated (a) 419 | provisionally, unless and until the copyright holder explicitly and 420 | finally terminates your license, and (b) permanently, if the copyright 421 | holder fails to notify you of the violation by some reasonable means 422 | prior to 60 days after the cessation. 423 | 424 | Moreover, your license from a particular copyright holder is 425 | reinstated permanently if the copyright holder notifies you of the 426 | violation by some reasonable means, this is the first time you have 427 | received notice of violation of this License (for any work) from that 428 | copyright holder, and you cure the violation prior to 30 days after 429 | your receipt of the notice. 430 | 431 | Termination of your rights under this section does not terminate the 432 | licenses of parties who have received copies or rights from you under 433 | this License. If your rights have been terminated and not permanently 434 | reinstated, you do not qualify to receive new licenses for the same 435 | material under section 10. 436 | 437 | 9. Acceptance Not Required for Having Copies. 438 | 439 | You are not required to accept this License in order to receive or 440 | run a copy of the Program. Ancillary propagation of a covered work 441 | occurring solely as a consequence of using peer-to-peer transmission 442 | to receive a copy likewise does not require acceptance. However, 443 | nothing other than this License grants you permission to propagate or 444 | modify any covered work. These actions infringe copyright if you do 445 | not accept this License. Therefore, by modifying or propagating a 446 | covered work, you indicate your acceptance of this License to do so. 447 | 448 | 10. Automatic Licensing of Downstream Recipients. 449 | 450 | Each time you convey a covered work, the recipient automatically 451 | receives a license from the original licensors, to run, modify and 452 | propagate that work, subject to this License. You are not responsible 453 | for enforcing compliance by third parties with this License. 454 | 455 | An "entity transaction" is a transaction transferring control of an 456 | organization, or substantially all assets of one, or subdividing an 457 | organization, or merging organizations. If propagation of a covered 458 | work results from an entity transaction, each party to that 459 | transaction who receives a copy of the work also receives whatever 460 | licenses to the work the party's predecessor in interest had or could 461 | give under the previous paragraph, plus a right to possession of the 462 | Corresponding Source of the work from the predecessor in interest, if 463 | the predecessor has it or can get it with reasonable efforts. 464 | 465 | You may not impose any further restrictions on the exercise of the 466 | rights granted or affirmed under this License. For example, you may 467 | not impose a license fee, royalty, or other charge for exercise of 468 | rights granted under this License, and you may not initiate litigation 469 | (including a cross-claim or counterclaim in a lawsuit) alleging that 470 | any patent claim is infringed by making, using, selling, offering for 471 | sale, or importing the Program or any portion of it. 472 | 473 | 11. Patents. 474 | 475 | A "contributor" is a copyright holder who authorizes use under this 476 | License of the Program or a work on which the Program is based. The 477 | work thus licensed is called the contributor's "contributor version". 478 | 479 | A contributor's "essential patent claims" are all patent claims 480 | owned or controlled by the contributor, whether already acquired or 481 | hereafter acquired, that would be infringed by some manner, permitted 482 | by this License, of making, using, or selling its contributor version, 483 | but do not include claims that would be infringed only as a 484 | consequence of further modification of the contributor version. For 485 | purposes of this definition, "control" includes the right to grant 486 | patent sublicenses in a manner consistent with the requirements of 487 | this License. 488 | 489 | Each contributor grants you a non-exclusive, worldwide, royalty-free 490 | patent license under the contributor's essential patent claims, to 491 | make, use, sell, offer for sale, import and otherwise run, modify and 492 | propagate the contents of its contributor version. 493 | 494 | In the following three paragraphs, a "patent license" is any express 495 | agreement or commitment, however denominated, not to enforce a patent 496 | (such as an express permission to practice a patent or covenant not to 497 | sue for patent infringement). To "grant" such a patent license to a 498 | party means to make such an agreement or commitment not to enforce a 499 | patent against the party. 500 | 501 | If you convey a covered work, knowingly relying on a patent license, 502 | and the Corresponding Source of the work is not available for anyone 503 | to copy, free of charge and under the terms of this License, through a 504 | publicly available network server or other readily accessible means, 505 | then you must either (1) cause the Corresponding Source to be so 506 | available, or (2) arrange to deprive yourself of the benefit of the 507 | patent license for this particular work, or (3) arrange, in a manner 508 | consistent with the requirements of this License, to extend the patent 509 | license to downstream recipients. "Knowingly relying" means you have 510 | actual knowledge that, but for the patent license, your conveying the 511 | covered work in a country, or your recipient's use of the covered work 512 | in a country, would infringe one or more identifiable patents in that 513 | country that you have reason to believe are valid. 514 | 515 | If, pursuant to or in connection with a single transaction or 516 | arrangement, you convey, or propagate by procuring conveyance of, a 517 | covered work, and grant a patent license to some of the parties 518 | receiving the covered work authorizing them to use, propagate, modify 519 | or convey a specific copy of the covered work, then the patent license 520 | you grant is automatically extended to all recipients of the covered 521 | work and works based on it. 522 | 523 | A patent license is "discriminatory" if it does not include within 524 | the scope of its coverage, prohibits the exercise of, or is 525 | conditioned on the non-exercise of one or more of the rights that are 526 | specifically granted under this License. You may not convey a covered 527 | work if you are a party to an arrangement with a third party that is 528 | in the business of distributing software, under which you make payment 529 | to the third party based on the extent of your activity of conveying 530 | the work, and under which the third party grants, to any of the 531 | parties who would receive the covered work from you, a discriminatory 532 | patent license (a) in connection with copies of the covered work 533 | conveyed by you (or copies made from those copies), or (b) primarily 534 | for and in connection with specific products or compilations that 535 | contain the covered work, unless you entered into that arrangement, 536 | or that patent license was granted, prior to 28 March 2007. 537 | 538 | Nothing in this License shall be construed as excluding or limiting 539 | any implied license or other defenses to infringement that may 540 | otherwise be available to you under applicable patent law. 541 | 542 | 12. No Surrender of Others' Freedom. 543 | 544 | If conditions are imposed on you (whether by court order, agreement or 545 | otherwise) that contradict the conditions of this License, they do not 546 | excuse you from the conditions of this License. If you cannot convey a 547 | covered work so as to satisfy simultaneously your obligations under this 548 | License and any other pertinent obligations, then as a consequence you may 549 | not convey it at all. For example, if you agree to terms that obligate you 550 | to collect a royalty for further conveying from those to whom you convey 551 | the Program, the only way you could satisfy both those terms and this 552 | License would be to refrain entirely from conveying the Program. 553 | 554 | 13. Use with the GNU Affero General Public License. 555 | 556 | Notwithstanding any other provision of this License, you have 557 | permission to link or combine any covered work with a work licensed 558 | under version 3 of the GNU Affero General Public License into a single 559 | combined work, and to convey the resulting work. The terms of this 560 | License will continue to apply to the part which is the covered work, 561 | but the special requirements of the GNU Affero General Public License, 562 | section 13, concerning interaction through a network will apply to the 563 | combination as such. 564 | 565 | 14. Revised Versions of this License. 566 | 567 | The Free Software Foundation may publish revised and/or new versions of 568 | the GNU General Public License from time to time. Such new versions will 569 | be similar in spirit to the present version, but may differ in detail to 570 | address new problems or concerns. 571 | 572 | Each version is given a distinguishing version number. If the 573 | Program specifies that a certain numbered version of the GNU General 574 | Public License "or any later version" applies to it, you have the 575 | option of following the terms and conditions either of that numbered 576 | version or of any later version published by the Free Software 577 | Foundation. If the Program does not specify a version number of the 578 | GNU General Public License, you may choose any version ever published 579 | by the Free Software Foundation. 580 | 581 | If the Program specifies that a proxy can decide which future 582 | versions of the GNU General Public License can be used, that proxy's 583 | public statement of acceptance of a version permanently authorizes you 584 | to choose that version for the Program. 585 | 586 | Later license versions may give you additional or different 587 | permissions. However, no additional obligations are imposed on any 588 | author or copyright holder as a result of your choosing to follow a 589 | later version. 590 | 591 | 15. Disclaimer of Warranty. 592 | 593 | THERE IS NO WARRANTY FOR THE PROGRAM, TO THE EXTENT PERMITTED BY 594 | APPLICABLE LAW. EXCEPT WHEN OTHERWISE STATED IN WRITING THE COPYRIGHT 595 | HOLDERS AND/OR OTHER PARTIES PROVIDE THE PROGRAM "AS IS" WITHOUT WARRANTY 596 | OF ANY KIND, EITHER EXPRESSED OR IMPLIED, INCLUDING, BUT NOT LIMITED TO, 597 | THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR 598 | PURPOSE. THE ENTIRE RISK AS TO THE QUALITY AND PERFORMANCE OF THE PROGRAM 599 | IS WITH YOU. SHOULD THE PROGRAM PROVE DEFECTIVE, YOU ASSUME THE COST OF 600 | ALL NECESSARY SERVICING, REPAIR OR CORRECTION. 601 | 602 | 16. Limitation of Liability. 603 | 604 | IN NO EVENT UNLESS REQUIRED BY APPLICABLE LAW OR AGREED TO IN WRITING 605 | WILL ANY COPYRIGHT HOLDER, OR ANY OTHER PARTY WHO MODIFIES AND/OR CONVEYS 606 | THE PROGRAM AS PERMITTED ABOVE, BE LIABLE TO YOU FOR DAMAGES, INCLUDING ANY 607 | GENERAL, SPECIAL, INCIDENTAL OR CONSEQUENTIAL DAMAGES ARISING OUT OF THE 608 | USE OR INABILITY TO USE THE PROGRAM (INCLUDING BUT NOT LIMITED TO LOSS OF 609 | DATA OR DATA BEING RENDERED INACCURATE OR LOSSES SUSTAINED BY YOU OR THIRD 610 | PARTIES OR A FAILURE OF THE PROGRAM TO OPERATE WITH ANY OTHER PROGRAMS), 611 | EVEN IF SUCH HOLDER OR OTHER PARTY HAS BEEN ADVISED OF THE POSSIBILITY OF 612 | SUCH DAMAGES. 613 | 614 | 17. Interpretation of Sections 15 and 16. 615 | 616 | If the disclaimer of warranty and limitation of liability provided 617 | above cannot be given local legal effect according to their terms, 618 | reviewing courts shall apply local law that most closely approximates 619 | an absolute waiver of all civil liability in connection with the 620 | Program, unless a warranty or assumption of liability accompanies a 621 | copy of the Program in return for a fee. 622 | 623 | END OF TERMS AND CONDITIONS 624 | 625 | How to Apply These Terms to Your New Programs 626 | 627 | If you develop a new program, and you want it to be of the greatest 628 | possible use to the public, the best way to achieve this is to make it 629 | free software which everyone can redistribute and change under these terms. 630 | 631 | To do so, attach the following notices to the program. It is safest 632 | to attach them to the start of each source file to most effectively 633 | state the exclusion of warranty; and each file should have at least 634 | the "copyright" line and a pointer to where the full notice is found. 635 | 636 | {one line to give the program's name and a brief idea of what it does.} 637 | Copyright (C) {year} {name of author} 638 | 639 | This program is free software: you can redistribute it and/or modify 640 | it under the terms of the GNU General Public License as published by 641 | the Free Software Foundation, either version 3 of the License, or 642 | (at your option) any later version. 643 | 644 | This program is distributed in the hope that it will be useful, 645 | but WITHOUT ANY WARRANTY; without even the implied warranty of 646 | MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the 647 | GNU General Public License for more details. 648 | 649 | You should have received a copy of the GNU General Public License 650 | along with this program. If not, see . 651 | 652 | Also add information on how to contact you by electronic and paper mail. 653 | 654 | If the program does terminal interaction, make it output a short 655 | notice like this when it starts in an interactive mode: 656 | 657 | {project} Copyright (C) {year} {fullname} 658 | This program comes with ABSOLUTELY NO WARRANTY; for details type `show w'. 659 | This is free software, and you are welcome to redistribute it 660 | under certain conditions; type `show c' for details. 661 | 662 | The hypothetical commands `show w' and `show c' should show the appropriate 663 | parts of the General Public License. Of course, your program's commands 664 | might be different; for a GUI interface, you would use an "about box". 665 | 666 | You should also get your employer (if you work as a programmer) or school, 667 | if any, to sign a "copyright disclaimer" for the program, if necessary. 668 | For more information on this, and how to apply and follow the GNU GPL, see 669 | . 670 | 671 | The GNU General Public License does not permit incorporating your program 672 | into proprietary programs. If your program is a subroutine library, you 673 | may consider it more useful to permit linking proprietary applications with 674 | the library. If this is what you want to do, use the GNU Lesser General 675 | Public License instead of this License. But first, please read 676 | . 677 | 678 | Copy license text to clipboard 679 | How to apply this license 680 | 681 | Create a text file (typically named LICENSE or LICENSE.txt) in the root of your source code and copy the text of the license into the file. 682 | 683 | Note: The Free Software Foundation recommends taking the additional step of adding a boilerplate notice to the top of each file. The boilerplate can be found at the end of the license. 684 | Source 685 | Required 686 | 687 | Disclose Source 688 | License and copyright notice 689 | State Changes 690 | 691 | Permitted 692 | 693 | Commercial Use 694 | Distribution 695 | Modification 696 | Patent Grant 697 | Private Use 698 | 699 | Forbidden 700 | 701 | Hold Liable 702 | Sublicensing 703 | 704 | 705 | -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | 2 | subdomain-bruteforcer (SubBrute) 3 | ===================== 4 | SubBrute is a community driven project with the goal of creating the fastest, and most accurate subdomain enumeration tool. Some of the magic behind SubBrute is that it uses open resolvers as a kind of proxy to circumvent DNS rate-limiting (https://www.us-cert.gov/ncas/alerts/TA13-088A). This design also provides a layer of anonymity, as SubBrute does not send traffic directly to the target's name servers. 5 | 6 | Whats new in v2.1? 7 | ===================== 8 | Better stablity. Better support for testing cloudflare domains. 9 | 10 | Thank you for the bug posts! 11 | 12 | 13 | Whats new in v1.2.1? 14 | ===================== 15 | The big news in this version is that SubBrute is now a recursive DNS-spider, and also a library, more on this later. SubBrute should be easy to use, so the interface should be intuitive (like nmap!), if you would like the interface to change, let us know. In this version we are opening up SubBrute's fast DNS resolution pipeline for any DNS record type. Additionally, SubBrute now has a feature to detect subdomains were their resolution is intentionally blocked, which sometimes happens when a subdomain is intended for for use on an internal network. 16 | - SubBrute is now a DNS spider that recursively crawls enumerated DNS records. This feature boosted *.google.com from 123 to 162 subdomains. (Always enabled) 17 | - --type enumerate an arbitrary record type (AAAA, CNAME, SOA, TXT, MX...) 18 | - -s can now read subdomains from result files. 19 | - New useage - The subdomains enumerated from previous scans can now be used as input to enumerate other DNS records. The following commands demonstrate this new functionality: 20 | ``` 21 | ./subbrute.py google.com -o google.names 22 | ...162 subdomains found... 23 | 24 | ./subbrute.py -s google.names google.com --type TXT 25 | google.com,"v=spf1 include:_spf.google.com ip4:216.73.93.70/31 ip4:216.73.93.72/31 ~all" 26 | adwords.google.com,"v=spf1 redirect=google.com" 27 | ... 28 | 29 | ./subbrute.py -s google.names google.com --type CNAME 30 | blog.google.com,www.blogger.com,blogger.l.google.com 31 | groups.google.com,groups.l.google.com 32 | ... 33 | ``` 34 | - SubBrute is now a subdomain enumeration library with a python interface: subbrute.run() 35 | Do you want to use SubBrute in your python projects? Consider the following: 36 | ``` 37 | import subbrute 38 | 39 | for d in subbrute.run("google.com"): 40 | print d 41 | ``` 42 | Feedback welcome. 43 | 44 | Whats new in v1.1? 45 | ===================== 46 | This version merges pull requests from the community; changes from JordanMilne, KxCode and rc0r is in this release. In SubBrute 1.1 we fixed bugs, improved accuracy, and efficiency. As requested, this project is now GPLv3. 47 | 48 | Accuracy and better wildcard detection: 49 | - A new filter that can pickup geolocation aware wildcards. 50 | - Filter misbehaving nameservers 51 | 52 | Faster: 53 | - More than 2,000 high quality nameservers were added to resolvers.txt, these servers will resolve multiple queries in under 1 sec. 54 | - Nameservers are verified when they are needed. A seperate thread is responsible creating a feed of nameservers, and corresponding wildcard blacklist. 55 | 56 | New output: 57 | - -a will list all addresses associated with a subdomain. 58 | - -v debug output, to help developers/hackers debug subbrute. 59 | - -o output results to file. 60 | 61 | More Information 62 | ===================== 63 | 64 | names.txt contains 101,010 subdomains. subs_small.txt was stolen from fierce2 which contains 1896 subdomains. If you find more subdomains to add, open a bug report or pull request and I'll be happy to add them. 65 | 66 | No install required for Windows, just cd into the 'windows' folder: 67 | 68 | - subbrute.exe google.com 69 | 70 | Easy to install: 71 | You just need http://www.dnspython.org/ and python2.7 or python3. This tool should work under any operating system: bsd, osx, windows, linux... 72 | 73 | (On a side note giving a makefile root always bothers me, it would be a great way to install a backdoor...) 74 | 75 | Under Ubuntu/Debian all you need is: 76 | 77 | - sudo apt-get install python-dnspython 78 | 79 | On other operating systems you may have to install dnspython manually: 80 | 81 | http://www.dnspython.org/ 82 | 83 | Easy to use: 84 | 85 | - ./subbrute.py google.com 86 | 87 | Tests multiple domains: 88 | - ./subbrute.py google.com gmail.com blogger.com 89 | 90 | or a newline delimited list of domains: 91 | - ./subbrute.py -t list.txt 92 | 93 | Also keep in mind that subdomains can have subdomains (example: _xmpp-server._tcp.gmail.com): 94 | 95 | - ./subbrute.py gmail.com > gmail.out 96 | 97 | - ./subbrute.py -t gmail.out 98 | 99 | Cheers! -------------------------------------------------------------------------------- /dnslib/__init__.py: -------------------------------------------------------------------------------- 1 | # -*- coding: utf-8 -*- 2 | 3 | """ 4 | dnslib 5 | ------ 6 | 7 | A library to encode/decode DNS wire-format packets supporting both 8 | Python 2.7 and Python 3.2+. 9 | 10 | The library provides: 11 | 12 | * Support for encoding/decoding DNS packets between wire format, 13 | python objects, and Zone/DiG textual representation (dnslib.dns) 14 | 15 | * A server framework allowing the simple creation of custom DNS 16 | resolvers (dnslib.server) and a number of example servers 17 | created using this framework 18 | 19 | * A number of utilities for testing (dnslib.client, dnslib.proxy, 20 | dnslib.intercept) 21 | 22 | Python 3 support was added in Version 0.9.0 which represented a fairly 23 | major update to the library - the key changes include: 24 | 25 | * Python 2.7/3.2+ support (the last version supporting Python 2.6 26 | or earlier was version 0.8.3) 27 | 28 | * The 'Bimap' interface was changed significantly to explicitly 29 | split forward (value->text) lookups via __getitem__ and 30 | reverse (text->value) lookups via __getattr__. Applications 31 | using the old interface will need to be updated. 32 | 33 | * Hostnames are now returned with a trailing dot by default (in 34 | line with RFC) 35 | 36 | * Most object attributes are now typed in line with the record 37 | definitions to make it harder to generate invalid packets 38 | 39 | * Support for encoding/decoding resource records in 'Zone' (BIND) 40 | file format 41 | 42 | * Support for encoding/decoding packets in 'DiG' format 43 | 44 | * Server framework allowing (in most cases) custom resolvers to 45 | be created by just subclassing the DNSResolver class and 46 | overriding the 'resolve' method 47 | 48 | * A lot of fixes to error detection/handling which should make 49 | the library much more robust to invalid/unsupported data. The 50 | library should now either return a valid DNSRecord instance 51 | when parsing a packet or raise DNSError (tested via fuzzing) 52 | 53 | * Improved utilities (dnslib.client, dnslib.proxy, dnslib.intercept) 54 | 55 | * Improvements to encoding/decoding tests including the ability 56 | to generate test data automatically in test_decode.py (comparing 57 | outputs against DiG) 58 | 59 | * Ability to compare and diff DNSRecords 60 | 61 | Classes 62 | ------- 63 | 64 | The key DNS packet handling classes are in dnslib.dns and map to the 65 | standard DNS packet sections: 66 | 67 | * DNSRecord - container for DNS packet. Contains: 68 | - DNSHeader 69 | - Question section containing zero or more DNSQuestion objects 70 | - Answer section containing zero or more RR objects 71 | - Authority section containing zero or more RR objects 72 | - Additional section containing zero or more RR objects 73 | * DNS RRs (resource records) contain an RR header and an RD object) 74 | * Specific RD types are implemented as subclasses of RD 75 | * DNS labels are represented by a DNSLabel class - in most cases 76 | this handles conversion to/from textual representation however 77 | does support arbitatry labels via a tuple of bytes objects 78 | 79 | Usage 80 | ----- 81 | 82 | To decode a DNS packet: 83 | 84 | >>> packet = binascii.unhexlify(b'd5ad818000010005000000000377777706676f6f676c6503636f6d0000010001c00c0005000100000005000803777777016cc010c02c0001000100000005000442f95b68c02c0001000100000005000442f95b63c02c0001000100000005000442f95b67c02c0001000100000005000442f95b93') 85 | >>> d = DNSRecord.parse(packet) 86 | >>> d 87 | 88 | 89 | 90 | 91 | 92 | 93 | 94 | 95 | The default text representation of the DNSRecord is in zone file format: 96 | 97 | >>> print(d) 98 | ;; ->>HEADER<<- opcode: QUERY, status: NOERROR, id: 54701 99 | ;; flags: qr rd ra; QUERY: 1, ANSWER: 5, AUTHORITY: 0, ADDITIONAL: 0 100 | ;; QUESTION SECTION: 101 | ;www.google.com. IN A 102 | ;; ANSWER SECTION: 103 | www.google.com. 5 IN CNAME www.l.google.com. 104 | www.l.google.com. 5 IN A 66.249.91.104 105 | www.l.google.com. 5 IN A 66.249.91.99 106 | www.l.google.com. 5 IN A 66.249.91.103 107 | www.l.google.com. 5 IN A 66.249.91.147 108 | 109 | To create a DNS Request Packet: 110 | 111 | >>> d = DNSRecord.question("google.com") 112 | 113 | (This is equivalent to: d = DNSRecord(q=DNSQuestion("google.com") ) 114 | 115 | >>> d 116 | 117 | 118 | 119 | >>> str(DNSRecord.parse(d.pack())) == str(d) 120 | True 121 | 122 | >>> print(d) 123 | ;; ->>HEADER<<- opcode: QUERY, status: NOERROR, id: ... 124 | ;; flags: rd; QUERY: 1, ANSWER: 0, AUTHORITY: 0, ADDITIONAL: 0 125 | ;; QUESTION SECTION: 126 | ;google.com. IN A 127 | 128 | >>> d = DNSRecord.question("google.com","MX") 129 | 130 | (This is equivalent to: d = DNSRecord(q=DNSQuestion("google.com",QTYPE.MX) ) 131 | 132 | >>> str(DNSRecord.parse(d.pack())) == str(d) 133 | True 134 | 135 | >>> print(d) 136 | ;; ->>HEADER<<- opcode: QUERY, status: NOERROR, id: ... 137 | ;; flags: rd; QUERY: 1, ANSWER: 0, AUTHORITY: 0, ADDITIONAL: 0 138 | ;; QUESTION SECTION: 139 | ;google.com. IN MX 140 | 141 | To create a DNS Response Packet: 142 | 143 | >>> d = DNSRecord(DNSHeader(qr=1,aa=1,ra=1), 144 | ... q=DNSQuestion("abc.com"), 145 | ... a=RR("abc.com",rdata=A("1.2.3.4"))) 146 | >>> d 147 | 148 | 149 | 150 | >>> str(DNSRecord.parse(d.pack())) == str(d) 151 | True 152 | 153 | >>> print(d) 154 | ;; ->>HEADER<<- opcode: QUERY, status: NOERROR, id: ... 155 | ;; flags: qr aa rd ra; QUERY: 1, ANSWER: 1, AUTHORITY: 0, ADDITIONAL: 0 156 | ;; QUESTION SECTION: 157 | ;abc.com. IN A 158 | ;; ANSWER SECTION: 159 | abc.com. 0 IN A 1.2.3.4 160 | 161 | It is also possible to create RRs from a string in zone file format 162 | 163 | >>> RR.fromZone("abc.com IN A 1.2.3.4") 164 | [] 165 | 166 | (Note: this produces a list of RRs which should be unpacked if being 167 | passed to add_answer/add_auth/add_ar etc) 168 | 169 | >>> q = DNSRecord.question("abc.com") 170 | >>> a = q.reply() 171 | >>> a.add_answer(*RR.fromZone("abc.com 60 A 1.2.3.4")) 172 | >>> print(a) 173 | ;; ->>HEADER<<- opcode: QUERY, status: NOERROR, id: ... 174 | ;; flags: qr aa rd ra; QUERY: 1, ANSWER: 1, AUTHORITY: 0, ADDITIONAL: 0 175 | ;; QUESTION SECTION: 176 | ;abc.com. IN A 177 | ;; ANSWER SECTION: 178 | abc.com. 60 IN A 1.2.3.4 179 | 180 | The zone file can contain multiple entries and supports most of the normal 181 | format defined in RFC1035 (specifically not $INCLUDE) 182 | 183 | >>> z = ''' 184 | ... $TTL 300 185 | ... $ORIGIN abc.com 186 | ... 187 | ... @ IN MX 10 mail.abc.com. 188 | ... www IN A 1.2.3.4 189 | ... IN TXT "Some Text" 190 | ... mail IN CNAME www.abc.com. 191 | ... ''' 192 | >>> for rr in RR.fromZone(textwrap.dedent(z)): 193 | ... print(rr) 194 | abc.com. 300 IN MX 10 mail.abc.com. 195 | www.abc.com. 300 IN A 1.2.3.4 196 | www.abc.com. 300 IN TXT "Some Text" 197 | mail.abc.com. 300 IN CNAME www.abc.com. 198 | 199 | To create a skeleton reply to a DNS query: 200 | 201 | >>> q = DNSRecord(q=DNSQuestion("abc.com",QTYPE.ANY)) 202 | >>> a = q.reply() 203 | >>> a.add_answer(RR("abc.com",QTYPE.A,rdata=A("1.2.3.4"),ttl=60)) 204 | >>> str(DNSRecord.parse(a.pack())) == str(a) 205 | True 206 | >>> print(a) 207 | ;; ->>HEADER<<- opcode: QUERY, status: NOERROR, id: ... 208 | ;; flags: qr aa rd ra; QUERY: 1, ANSWER: 1, AUTHORITY: 0, ADDITIONAL: 0 209 | ;; QUESTION SECTION: 210 | ;abc.com. IN ANY 211 | ;; ANSWER SECTION: 212 | abc.com. 60 IN A 1.2.3.4 213 | 214 | Add additional RRs: 215 | 216 | >>> a.add_answer(RR("xxx.abc.com",QTYPE.A,rdata=A("1.2.3.4"))) 217 | >>> a.add_answer(RR("xxx.abc.com",QTYPE.AAAA,rdata=AAAA("1234:5678::1"))) 218 | >>> str(DNSRecord.parse(a.pack())) == str(a) 219 | True 220 | >>> print(a) 221 | ;; ->>HEADER<<- opcode: QUERY, status: NOERROR, id: ... 222 | ;; flags: qr aa rd ra; QUERY: 1, ANSWER: 3, AUTHORITY: 0, ADDITIONAL: 0 223 | ;; QUESTION SECTION: 224 | ;abc.com. IN ANY 225 | ;; ANSWER SECTION: 226 | abc.com. 60 IN A 1.2.3.4 227 | xxx.abc.com. 0 IN A 1.2.3.4 228 | xxx.abc.com. 0 IN AAAA 1234:5678::1 229 | 230 | 231 | It is also possible to create a reply from a string in zone file format: 232 | 233 | >>> q = DNSRecord(q=DNSQuestion("abc.com",QTYPE.ANY)) 234 | >>> a = q.replyZone("abc.com 60 IN CNAME xxx.abc.com") 235 | >>> print(a) 236 | ;; ->>HEADER<<- opcode: QUERY, status: NOERROR, id: ... 237 | ;; flags: qr aa rd ra; QUERY: 1, ANSWER: 1, AUTHORITY: 0, ADDITIONAL: 0 238 | ;; QUESTION SECTION: 239 | ;abc.com. IN ANY 240 | ;; ANSWER SECTION: 241 | abc.com. 60 IN CNAME xxx.abc.com. 242 | 243 | >>> str(DNSRecord.parse(a.pack())) == str(a) 244 | True 245 | 246 | >>> q = DNSRecord(q=DNSQuestion("abc.com",QTYPE.ANY)) 247 | >>> a = q.replyZone(textwrap.dedent(z)) 248 | >>> print(a) 249 | ;; ->>HEADER<<- opcode: QUERY, status: NOERROR, id: ... 250 | ;; flags: qr aa rd ra; QUERY: 1, ANSWER: 4, AUTHORITY: 0, ADDITIONAL: 0 251 | ;; QUESTION SECTION: 252 | ;abc.com. IN ANY 253 | ;; ANSWER SECTION: 254 | abc.com. 300 IN MX 10 mail.abc.com. 255 | www.abc.com. 300 IN A 1.2.3.4 256 | www.abc.com. 300 IN TXT "Some Text" 257 | mail.abc.com. 300 IN CNAME www.abc.com. 258 | 259 | 260 | The library also includes a simple framework for generating custom DNS 261 | resolvers in dnslib.server (see module docs). In post cases this just 262 | requires implementing a custom 'resolve' method which receives a question 263 | object and returns a response. 264 | 265 | A number of sample resolvers are provided as examples (see CLI --help): 266 | 267 | * dnslib.fixedresolver - Respond to all requests with fixed response 268 | * dnslib.zoneresolver - Respond from Zone file 269 | * dnslib.shellresolver - Call shell script to generate response 270 | 271 | The library includes a number of client utilities: 272 | 273 | * DiG like client library 274 | 275 | # python -m dnslib.client --help 276 | 277 | * DNS Proxy Server 278 | 279 | # python -m dnslib.proxy --help 280 | 281 | * Intercepting DNS Proxy Server (replace proxy responses for specified domains) 282 | 283 | # python -m dnslib.intercept --help 284 | 285 | 286 | Changelog: 287 | ---------- 288 | 289 | * 0.1 2010-09-19 Initial Release 290 | * 0.2 2010-09-22 Minor fixes 291 | * 0.3 2010-10-02 Add DNSLabel class to support arbitrary labels (embedded '.') 292 | * 0.4 2012-02-26 Merge with dbslib-circuits 293 | * 0.5 2012-09-13 Add support for RFC2136 DDNS updates 294 | Patch provided by Wesley Shields - thanks 295 | * 0.6 2012-10-20 Basic AAAA support 296 | * 0.7 2012-10-20 Add initial EDNS0 support (untested) 297 | * 0.8 2012-11-04 Add support for NAPTR, Authority RR and additional RR 298 | Patch provided by Stefan Andersson (https://bitbucket.org/norox) - thanks 299 | * 0.8.1 2012-11-05 Added NAPTR test case and fixed logic error 300 | Patch provided by Stefan Andersson (https://bitbucket.org/norox) - thanks 301 | * 0.8.2 2012-11-11 Patch to fix IPv6 formatting 302 | Patch provided by Torbjörn Lönnemark (https://bitbucket.org/tobbezz) - thanks 303 | * 0.8.3 2013-04-27 Don't parse rdata if rdlength is 0 304 | Patch provided by Wesley Shields - thanks 305 | * 0.9.0 2014-05-05 Major update including Py3 support (see docs) 306 | * 0.9.1 2014-05-05 Minor fixes 307 | * 0.9.2 2014-08-26 Fix Bimap handling of unknown mappings to avoid exception in printing 308 | Add typed attributes to classes 309 | Misc fixes from James Mills - thanks 310 | * 0.9.3 2014-08-26 Workaround for argparse bug which raises AssertionError if [] is 311 | present in option text (really?) 312 | * 0.9.4 2015-04-10 Fix to support multiple strings in TXT record 313 | Patch provided by James Cherry (https://bitbucket.org/james_cherry) - thanks 314 | NOTE: For consistency this patch changes the 'repr' output for 315 | TXT records to always be quoted 316 | * 0.9.5 2015-10-27 Add threading & timeout handling to DNSServer 317 | * 0.9.6 2015-10-28 Replace strftime in RRSIG formatting to avoid possible locale issues 318 | Identified by Bryan Everly - thanks 319 | * 0.9.7 2017-01-15 Sort out CAA/TYPE257 DiG parsing mismatch 320 | 321 | 322 | License: 323 | -------- 324 | 325 | BSD 326 | 327 | Author: 328 | ------- 329 | 330 | * Paul Chakravarti (paul.chakravarti@gmail.com) 331 | 332 | Master Repository/Issues: 333 | ------------------------- 334 | 335 | * https://bitbucket.org/paulc/dnslib 336 | (Cloned on GitHub: https://github.com/paulchakravarti/dnslib) 337 | 338 | """ 339 | 340 | from dnslib.dns import * 341 | 342 | version = "0.9.7" 343 | 344 | if __name__ == '__main__': 345 | import doctest,textwrap 346 | doctest.testmod(optionflags=doctest.ELLIPSIS) 347 | 348 | -------------------------------------------------------------------------------- /dnslib/__init__.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/TheRook/subbrute/07d29259c337787bf33626ddc1a713275cf9bc9b/dnslib/__init__.pyc -------------------------------------------------------------------------------- /dnslib/bimap.py: -------------------------------------------------------------------------------- 1 | # -*- coding: utf-8 -*- 2 | 3 | """ 4 | Bimap - bidirectional mapping between code/value 5 | """ 6 | 7 | class BimapError(Exception): 8 | pass 9 | 10 | class Bimap(object): 11 | 12 | """ 13 | Bi-directional mapping between code/text. 14 | 15 | Initialised using: 16 | 17 | name: Used for exceptions 18 | dict: Dict mapping from code (numeric) to text 19 | error: Error type to raise if key not found 20 | 21 | The class provides: 22 | 23 | * A 'forward' map (code->text) which is accessed through 24 | __getitem__ (bimap[code]) 25 | * A 'reverse' map (code>value) which is accessed through 26 | __getattr__ (bimap.text) 27 | * A 'get' method which does a forward lookup (code->text) 28 | and returns a textual version of code if there is no 29 | explicit mapping (or default provided) 30 | 31 | >>> class TestError(Exception): 32 | ... pass 33 | 34 | >>> TEST = Bimap('TEST',{1:'A', 2:'B', 3:'C'},TestError) 35 | >>> TEST[1] 36 | 'A' 37 | >>> TEST.A 38 | 1 39 | >>> TEST.X 40 | Traceback (most recent call last): 41 | ... 42 | TestError: TEST: Invalid reverse lookup: [X] 43 | >>> TEST[99] 44 | Traceback (most recent call last): 45 | ... 46 | TestError: TEST: Invalid forward lookup: [99] 47 | >>> TEST.get(99) 48 | '99' 49 | 50 | """ 51 | 52 | def __init__(self,name,forward,error=KeyError): 53 | self.name = name 54 | self.error = error 55 | self.forward = forward.copy() 56 | self.reverse = dict([(v,k) for (k,v) in list(forward.items())]) 57 | 58 | def get(self,k,default=None): 59 | try: 60 | return self.forward[k] 61 | except KeyError as e: 62 | return default or str(k) 63 | 64 | def __getitem__(self,k): 65 | try: 66 | return self.forward[k] 67 | except KeyError as e: 68 | raise self.error("%s: Invalid forward lookup: [%s]" % (self.name,k)) 69 | 70 | def __getattr__(self,k): 71 | try: 72 | return self.reverse[k] 73 | except KeyError as e: 74 | raise self.error("%s: Invalid reverse lookup: [%s]" % (self.name,k)) 75 | 76 | if __name__ == '__main__': 77 | import doctest 78 | doctest.testmod() 79 | -------------------------------------------------------------------------------- /dnslib/bimap.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/TheRook/subbrute/07d29259c337787bf33626ddc1a713275cf9bc9b/dnslib/bimap.pyc -------------------------------------------------------------------------------- /dnslib/bit.py: -------------------------------------------------------------------------------- 1 | # -*- coding: utf-8 -*- 2 | 3 | """ 4 | Some basic bit mainpulation utilities 5 | """ 6 | from __future__ import print_function 7 | 8 | FILTER = bytearray([ (i < 32 or i > 127) and 46 or i for i in range(256) ]) 9 | 10 | def hexdump(src, length=16, prefix=''): 11 | """ 12 | Print hexdump of string 13 | 14 | >>> print(hexdump(b"abcd" * 4)) 15 | 0000 61 62 63 64 61 62 63 64 61 62 63 64 61 62 63 64 abcdabcd abcdabcd 16 | 17 | >>> print(hexdump(bytearray(range(48)))) 18 | 0000 00 01 02 03 04 05 06 07 08 09 0a 0b 0c 0d 0e 0f ........ ........ 19 | 0010 10 11 12 13 14 15 16 17 18 19 1a 1b 1c 1d 1e 1f ........ ........ 20 | 0020 20 21 22 23 24 25 26 27 28 29 2a 2b 2c 2d 2e 2f !"#$%&' ()*+,-./ 21 | 22 | """ 23 | n = 0 24 | left = length // 2 25 | right = length - left 26 | result= [] 27 | src = bytearray(src) 28 | while src: 29 | s,src = src[:length],src[length:] 30 | l,r = s[:left],s[left:] 31 | hexa = "%-*s" % (left*3,' '.join(["%02x"%x for x in l])) 32 | hexb = "%-*s" % (right*3,' '.join(["%02x"%x for x in r])) 33 | lf = l.translate(FILTER) 34 | rf = r.translate(FILTER) 35 | result.append("%s%04x %s %s %s %s" % (prefix, n, hexa, hexb, 36 | lf.decode(), rf.decode())) 37 | n += length 38 | return "\n".join(result) 39 | 40 | def get_bits(data,offset,bits=1): 41 | """ 42 | Get specified bits from integer 43 | 44 | >>> bin(get_bits(0b0011100,2)) 45 | '0b1' 46 | >>> bin(get_bits(0b0011100,0,4)) 47 | '0b1100' 48 | 49 | """ 50 | mask = ((1 << bits) - 1) << offset 51 | return (data & mask) >> offset 52 | 53 | def set_bits(data,value,offset,bits=1): 54 | """ 55 | Set specified bits in integer 56 | 57 | >>> bin(set_bits(0,0b1010,0,4)) 58 | '0b1010' 59 | >>> bin(set_bits(0,0b1010,3,4)) 60 | '0b1010000' 61 | """ 62 | mask = ((1 << bits) - 1) << offset 63 | clear = 0xffff ^ mask 64 | data = (data & clear) | ((value << offset) & mask) 65 | return data 66 | 67 | def binary(n,count=16,reverse=False): 68 | """ 69 | Display n in binary (only difference from built-in `bin` is 70 | that this function returns a fixed width string and can 71 | optionally be reversed 72 | 73 | >>> binary(6789) 74 | '0001101010000101' 75 | >>> binary(6789,8) 76 | '10000101' 77 | >>> binary(6789,reverse=True) 78 | '1010000101011000' 79 | 80 | """ 81 | bits = [str((n >> y) & 1) for y in range(count-1, -1, -1)] 82 | if reverse: 83 | bits.reverse() 84 | return "".join(bits) 85 | 86 | if __name__ == '__main__': 87 | import doctest 88 | doctest.testmod() 89 | 90 | -------------------------------------------------------------------------------- /dnslib/bit.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/TheRook/subbrute/07d29259c337787bf33626ddc1a713275cf9bc9b/dnslib/bit.pyc -------------------------------------------------------------------------------- /dnslib/buffer.py: -------------------------------------------------------------------------------- 1 | # -*- coding: utf-8 -*- 2 | 3 | """ 4 | Buffer - simple data buffer 5 | """ 6 | 7 | import binascii,struct 8 | 9 | class BufferError(Exception): 10 | pass 11 | 12 | class Buffer(object): 13 | 14 | """ 15 | A simple data buffer - supports packing/unpacking in struct format 16 | 17 | # Needed for Python 2/3 doctest compatibility 18 | >>> def p(s): 19 | ... if not isinstance(s,str): 20 | ... return s.decode() 21 | ... return s 22 | 23 | >>> b = Buffer() 24 | >>> b.pack("!BHI",1,2,3) 25 | >>> b.offset 26 | 7 27 | >>> b.append(b"0123456789") 28 | >>> b.offset 29 | 17 30 | >>> p(b.hex()) 31 | '0100020000000330313233343536373839' 32 | >>> b.offset = 0 33 | >>> b.unpack("!BHI") 34 | (1, 2, 3) 35 | >>> bytearray(b.get(5)) 36 | bytearray(b'01234') 37 | >>> bytearray(b.get(5)) 38 | bytearray(b'56789') 39 | >>> b.update(7,"2s",b"xx") 40 | >>> b.offset = 7 41 | >>> bytearray(b.get(5)) 42 | bytearray(b'xx234') 43 | """ 44 | 45 | def __init__(self,data=b''): 46 | """ 47 | Initialise Buffer from data 48 | """ 49 | self.data = bytearray(data) 50 | self.offset = 0 51 | 52 | def remaining(self): 53 | """ 54 | Return bytes remaining 55 | """ 56 | return len(self.data) - self.offset 57 | 58 | def get(self,length): 59 | """ 60 | Gen len bytes at current offset (& increment offset) 61 | """ 62 | if length > self.remaining(): 63 | raise BufferError("Not enough bytes [offset=%d,remaining=%d,requested=%d]" % 64 | (self.offset,self.remaining(),length)) 65 | start = self.offset 66 | end = self.offset + length 67 | self.offset += length 68 | return bytes(self.data[start:end]) 69 | 70 | def hex(self): 71 | """ 72 | Return data as hex string 73 | """ 74 | return binascii.hexlify(self.data) 75 | 76 | def pack(self,fmt,*args): 77 | """ 78 | Pack data at end of data according to fmt (from struct) & increment 79 | offset 80 | """ 81 | self.offset += struct.calcsize(fmt) 82 | self.data += struct.pack(fmt,*args) 83 | 84 | def append(self,s): 85 | """ 86 | Append s to end of data & increment offset 87 | """ 88 | self.offset += len(s) 89 | self.data += s 90 | 91 | def update(self,ptr,fmt,*args): 92 | """ 93 | Modify data at offset `ptr` 94 | """ 95 | s = struct.pack(fmt,*args) 96 | self.data[ptr:ptr+len(s)] = s 97 | 98 | def unpack(self,fmt): 99 | """ 100 | Unpack data at current offset according to fmt (from struct) 101 | """ 102 | try: 103 | data = self.get(struct.calcsize(fmt)) 104 | return struct.unpack(fmt,data) 105 | except struct.error as e: 106 | raise BufferError("Error unpacking struct '%s' <%s>" % 107 | (fmt,binascii.hexlify(data).decode())) 108 | 109 | def __len__(self): 110 | return len(self.data) 111 | 112 | if __name__ == '__main__': 113 | import doctest 114 | doctest.testmod() 115 | -------------------------------------------------------------------------------- /dnslib/buffer.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/TheRook/subbrute/07d29259c337787bf33626ddc1a713275cf9bc9b/dnslib/buffer.pyc -------------------------------------------------------------------------------- /dnslib/client.py: -------------------------------------------------------------------------------- 1 | # -*- coding: utf-8 -*- 2 | 3 | """ 4 | DNS Client - DiG-like CLI utility. 5 | 6 | Mostly useful for testing. Can optionally compare results from two 7 | nameservers (--diff) or compare results against DiG (--dig). 8 | 9 | Usage: python -m dnslib.client [options|--help] 10 | 11 | See --help for usage. 12 | """ 13 | 14 | from __future__ import print_function 15 | 16 | try: 17 | from subprocess import getoutput 18 | except ImportError: 19 | from commands import getoutput 20 | 21 | import binascii,code,pprint 22 | 23 | from dnslib.dns import DNSRecord,DNSHeader,DNSQuestion,QTYPE 24 | from dnslib.digparser import DigParser 25 | 26 | if __name__ == '__main__': 27 | 28 | import argparse,sys,time 29 | 30 | p = argparse.ArgumentParser(description="DNS Client") 31 | p.add_argument("--server","-s",default="8.8.8.8", 32 | metavar="", 33 | help="Server address:port (default:8.8.8.8:53) (port is optional)") 34 | p.add_argument("--query",action='store_true',default=False, 35 | help="Show query (default: False)") 36 | p.add_argument("--hex",action='store_true',default=False, 37 | help="Dump packet in hex (default: False)") 38 | p.add_argument("--tcp",action='store_true',default=False, 39 | help="Use TCP (default: UDP)") 40 | p.add_argument("--noretry",action='store_true',default=False, 41 | help="Don't retry query using TCP if truncated (default: false)") 42 | p.add_argument("--diff",default="", 43 | help="Compare response from alternate nameserver (format: address:port / default: false)") 44 | p.add_argument("--dig",action='store_true',default=False, 45 | help="Compare result with DiG - if ---diff also specified use alternative nameserver for DiG request (default: false)") 46 | p.add_argument("--short",action='store_true',default=False, 47 | help="Short output - rdata only (default: false)") 48 | p.add_argument("--debug",action='store_true',default=False, 49 | help="Drop into CLI after request (default: false)") 50 | p.add_argument("domain",metavar="", 51 | help="Query domain") 52 | p.add_argument("qtype",metavar="",default="A",nargs="?", 53 | help="Query type (default: A)") 54 | args = p.parse_args() 55 | 56 | # Construct request 57 | q = DNSRecord(q=DNSQuestion(args.domain,getattr(QTYPE,args.qtype))) 58 | 59 | address,_,port = args.server.partition(':') 60 | port = int(port or 53) 61 | 62 | if args.query: 63 | print(";; Sending%s:" % (" (TCP)" if args.tcp else "")) 64 | if args.hex: 65 | print(";; QUERY:",binascii.hexlify(q.pack()).decode()) 66 | print(q) 67 | print() 68 | 69 | a_pkt = q.send(address,port,tcp=args.tcp) 70 | a = DNSRecord.parse(a_pkt) 71 | 72 | if a.header.tc and args.noretry == False: 73 | # Truncated - retry in TCP mode 74 | a_pkt = q.send(address,port,tcp=True) 75 | a = DNSRecord.parse(a_pkt) 76 | 77 | if args.dig or args.diff: 78 | if args.diff: 79 | address,_,port = args.diff.partition(':') 80 | port = int(port or 53) 81 | 82 | if args.dig: 83 | dig = getoutput("dig +qr -p %d %s %s @%s" % ( 84 | port, args.domain, args.qtype, address)) 85 | dig_reply = list(iter(DigParser(dig))) 86 | # DiG might have retried in TCP mode so get last q/a 87 | q_diff = dig_reply[-2] 88 | a_diff = dig_reply[-1] 89 | else: 90 | q_diff = DNSRecord(header=DNSHeader(id=q.header.id), 91 | q=DNSQuestion(args.domain, 92 | getattr(QTYPE,args.qtype))) 93 | q_diff = q 94 | diff = q_diff.send(address,port,tcp=args.tcp) 95 | a_diff = DNSRecord.parse(diff) 96 | if a_diff.header.tc and args.noretry == False: 97 | diff = q_diff.send(address,port,tcp=True) 98 | a_diff = DNSRecord.parse(diff) 99 | 100 | if args.short: 101 | print(a.short()) 102 | else: 103 | print(";; Got answer:") 104 | if args.hex: 105 | print(";; RESPONSE:",binascii.hexlify(a_pkt).decode()) 106 | if args.diff and not args.dig: 107 | print(";; DIFF :",binascii.hexlify(diff).decode()) 108 | print(a) 109 | print() 110 | 111 | if args.dig or args.diff: 112 | if q != q_diff: 113 | print(";;; ERROR: Diff Question differs") 114 | for (d1,d2) in q.diff(q_diff): 115 | if d1: 116 | print(";; - %s" % d1) 117 | if d2: 118 | print(";; + %s" % d2) 119 | if a != a_diff: 120 | print(";;; ERROR: Diff Response differs") 121 | for (d1,d2) in a.diff(a_diff): 122 | if d1: 123 | print(";; - %s" % d1) 124 | if d2: 125 | print(";; + %s" % d2) 126 | 127 | if args.debug: 128 | code.interact(local=locals()) 129 | 130 | -------------------------------------------------------------------------------- /dnslib/digparser.py: -------------------------------------------------------------------------------- 1 | # -*- coding: utf-8 -*- 2 | """ 3 | 4 | digparser 5 | --------- 6 | 7 | Encode/decode DNS packets from DiG textual representation. Parses 8 | question (if present: +qr flag) & answer sections and returns list 9 | of DNSRecord objects. 10 | 11 | Unsupported RR types are skipped (this is different from the packet 12 | parser which will store and encode the RDATA as a binary blob) 13 | 14 | >>> dig = os.path.join(os.path.dirname(__file__),"test","dig","google.com-A.dig") 15 | >>> with open(dig) as f: 16 | ... l = DigParser(f) 17 | ... for record in l: 18 | ... print('---') 19 | ... print(repr(record)) 20 | --- 21 | 22 | 23 | --- 24 | 25 | 26 | 27 | 28 | 29 | 30 | 31 | 32 | 33 | 34 | 35 | 36 | 37 | 38 | 39 | 40 | 41 | 42 | 43 | >>> dig = os.path.join(os.path.dirname(__file__),"test","dig","google.com-ANY.dig") 44 | >>> with open(dig) as f: 45 | ... l = DigParser(f) 46 | ... for record in l: 47 | ... print('---') 48 | ... print(repr(record)) 49 | --- 50 | 51 | 52 | --- 53 | 54 | 55 | 56 | 57 | 58 | 59 | 60 | 61 | 62 | 63 | 64 | 65 | 66 | 67 | 68 | 69 | 70 | """ 71 | 72 | from __future__ import print_function 73 | 74 | import glob,os.path,string 75 | 76 | from dnslib.lex import WordLexer 77 | from dnslib.dns import (DNSRecord,DNSHeader,DNSQuestion,DNSError, 78 | RR,RD,RDMAP,QR,RCODE,CLASS,QTYPE) 79 | 80 | class DigParser: 81 | 82 | """ 83 | Parse Dig output 84 | """ 85 | 86 | def __init__(self,dig,debug=False): 87 | self.debug = debug 88 | self.l = WordLexer(dig) 89 | self.l.commentchars = ';' 90 | self.l.nltok = ('NL',None) 91 | self.i = iter(self.l) 92 | 93 | def parseHeader(self,l1,l2): 94 | _,_,_,opcode,_,status,_,_id = l1.split() 95 | _,flags,_ = l2.split(';') 96 | header = DNSHeader(id=int(_id),bitmap=0) 97 | header.opcode = getattr(QR,opcode.rstrip(',')) 98 | header.rcode = getattr(RCODE,status.rstrip(',')) 99 | for f in ('qr','aa','tc','rd','ra'): 100 | if f in flags: 101 | setattr(header,f,1) 102 | return header 103 | 104 | def expect(self,expect): 105 | t,val = next(self.i) 106 | if t != expect: 107 | raise ValueError("Invalid Token: %s (expecting: %s)" % (t,expect)) 108 | return val 109 | 110 | def parseQuestions(self,q,dns): 111 | for qname,qclass,qtype in q: 112 | dns.add_question(DNSQuestion(qname, 113 | getattr(QTYPE,qtype), 114 | getattr(CLASS,qclass))) 115 | 116 | def parseAnswers(self,a,auth,ar,dns): 117 | sect_map = {'a':'add_answer','auth':'add_auth','ar':'add_ar'} 118 | for sect in 'a','auth','ar': 119 | f = getattr(dns,sect_map[sect]) 120 | for rr in locals()[sect]: 121 | rname,ttl,rclass,rtype = rr[:4] 122 | rdata = rr[4:] 123 | rd = RDMAP.get(rtype,RD) 124 | try: 125 | if rd == RD and \ 126 | any([ x not in string.hexdigits for x in rdata[-1]]): 127 | # Only support hex encoded data for fallback RD 128 | pass 129 | else: 130 | f(RR(rname=rname, 131 | ttl=int(ttl), 132 | rtype=getattr(QTYPE,rtype), 133 | rclass=getattr(CLASS,rclass), 134 | rdata=rd.fromZone(rdata))) 135 | except DNSError as e: 136 | if self.debug: 137 | print("DNSError:",e,rr) 138 | else: 139 | # Skip records we dont understand 140 | pass 141 | 142 | def __iter__(self): 143 | return self.parse() 144 | 145 | def parse(self): 146 | dns = None 147 | section = None 148 | paren = False 149 | rr = [] 150 | try: 151 | while True: 152 | tok,val = next(self.i) 153 | if tok == 'COMMENT': 154 | if 'Sending:' in val or 'Got answer:' in val: 155 | if dns: 156 | self.parseQuestions(q,dns) 157 | self.parseAnswers(a,auth,ar,dns) 158 | yield(dns) 159 | dns = DNSRecord() 160 | q,a,auth,ar = [],[],[],[] 161 | elif val.startswith('; ->>HEADER<<-'): 162 | self.expect('NL') 163 | val2 = self.expect('COMMENT') 164 | dns.header = self.parseHeader(val,val2) 165 | elif val.startswith('; QUESTION'): 166 | section = q 167 | elif val.startswith('; ANSWER'): 168 | section = a 169 | elif val.startswith('; AUTHORITY'): 170 | section = auth 171 | elif val.startswith('; ADDITIONAL'): 172 | section = ar 173 | elif val.startswith(';') or tok[1].startswith('<<>>'): 174 | pass 175 | elif dns and section == q: 176 | q.append(val.split()) 177 | elif tok == 'ATOM': 178 | if val == '(': 179 | paren = True 180 | elif val == ')': 181 | paren = False 182 | else: 183 | rr.append(val) 184 | elif tok == 'NL' and not paren and rr: 185 | if self.debug: 186 | print(">>",rr) 187 | section.append(rr) 188 | rr = [] 189 | except StopIteration: 190 | if rr: 191 | self.section.append(rr) 192 | if dns: 193 | self.parseQuestions(q,dns) 194 | self.parseAnswers(a,auth,ar,dns) 195 | yield(dns) 196 | 197 | if __name__ == '__main__': 198 | 199 | import argparse,doctest,sys 200 | 201 | p = argparse.ArgumentParser(description="DigParser Test") 202 | p.add_argument("--dig",action='store_true',default=False, 203 | help="Parse DiG output (stdin)") 204 | p.add_argument("--debug",action='store_true',default=False, 205 | help="Debug output") 206 | 207 | args = p.parse_args() 208 | 209 | if args.dig: 210 | l = DigParser(sys.stdin,args.debug) 211 | for record in l: 212 | print(repr(record)) 213 | else: 214 | doctest.testmod() 215 | -------------------------------------------------------------------------------- /dnslib/dns.pyc: -------------------------------------------------------------------------------- https://raw.githubusercontent.com/TheRook/subbrute/07d29259c337787bf33626ddc1a713275cf9bc9b/dnslib/dns.pyc -------------------------------------------------------------------------------- /dnslib/fixedresolver.py: -------------------------------------------------------------------------------- 1 | # -*- coding: utf-8 -*- 2 | 3 | """ 4 | FixedResolver - example resolver which responds with fixed response 5 | to all requests 6 | """ 7 | 8 | from __future__ import print_function 9 | 10 | import copy 11 | 12 | from dnslib import RR 13 | from dnslib.server import DNSServer,DNSHandler,BaseResolver,DNSLogger 14 | 15 | class FixedResolver(BaseResolver): 16 | """ 17 | Respond with fixed response to all requests 18 | """ 19 | def __init__(self,zone): 20 | # Parse RRs 21 | self.rrs = RR.fromZone(zone) 22 | 23 | def resolve(self,request,handler): 24 | reply = request.reply() 25 | qname = request.q.qname 26 | # Replace labels with request label 27 | for rr in self.rrs: 28 | a = copy.copy(rr) 29 | a.rname = qname 30 | reply.add_answer(a) 31 | return reply 32 | 33 | if __name__ == '__main__': 34 | 35 | import argparse,sys,time 36 | 37 | p = argparse.ArgumentParser(description="Fixed DNS Resolver") 38 | p.add_argument("--response","-r",default=". 60 IN A 127.0.0.1", 39 | metavar="", 40 | help="DNS response (zone format) (default: 127.0.0.1)") 41 | p.add_argument("--zonefile","-f", 42 | metavar="", 43 | help="DNS response (zone file, '-' for stdin)") 44 | p.add_argument("--port","-p",type=int,default=53, 45 | metavar="", 46 | help="Server port (default:53)") 47 | p.add_argument("--address","-a",default="", 48 | metavar="
", 49 | help="Listen address (default:all)") 50 | p.add_argument("--udplen","-u",type=int,default=0, 51 | metavar="", 52 | help="Max UDP packet length (default:0)") 53 | p.add_argument("--tcp",action='store_true',default=False, 54 | help="TCP server (default: UDP only)") 55 | p.add_argument("--log",default="request,reply,truncated,error", 56 | help="Log hooks to enable (default: +request,+reply,+truncated,+error,-recv,-send,-data)") 57 | p.add_argument("--log-prefix",action='store_true',default=False, 58 | help="Log prefix (timestamp/handler/resolver) (default: False)") 59 | args = p.parse_args() 60 | 61 | if args.zonefile: 62 | if args.zonefile == '-': 63 | args.response = sys.stdin 64 | else: 65 | args.response = open(args.zonefile) 66 | 67 | resolver = FixedResolver(args.response) 68 | logger = DNSLogger(args.log,args.log_prefix) 69 | 70 | print("Starting Fixed Resolver (%s:%d) [%s]" % ( 71 | args.address or "*", 72 | args.port, 73 | "UDP/TCP" if args.tcp else "UDP")) 74 | 75 | for rr in resolver.rrs: 76 | print(" | ",rr.toZone().strip(),sep="") 77 | print() 78 | 79 | if args.udplen: 80 | DNSHandler.udplen = args.udplen 81 | 82 | udp_server = DNSServer(resolver, 83 | port=args.port, 84 | address=args.address, 85 | logger=logger) 86 | udp_server.start_thread() 87 | 88 | if args.tcp: 89 | tcp_server = DNSServer(resolver, 90 | port=args.port, 91 | address=args.address, 92 | tcp=True, 93 | logger=logger) 94 | tcp_server.start_thread() 95 | 96 | while udp_server.isAlive(): 97 | time.sleep(1) 98 | 99 | -------------------------------------------------------------------------------- /dnslib/intercept.py: -------------------------------------------------------------------------------- 1 | # -*- coding: utf-8 -*- 2 | 3 | """ 4 | InterceptResolver - proxy requests to upstream server 5 | (optionally intercepting) 6 | 7 | """ 8 | from __future__ import print_function 9 | 10 | import binascii,copy,socket,struct,sys 11 | 12 | from dnslib import DNSRecord,RR,QTYPE,RCODE,parse_time 13 | from dnslib.server import DNSServer,DNSHandler,BaseResolver,DNSLogger 14 | from dnslib.label import DNSLabel 15 | 16 | class InterceptResolver(BaseResolver): 17 | 18 | """ 19 | Intercepting resolver 20 | 21 | Proxy requests to upstream server optionally intercepting requests 22 | matching local records 23 | """ 24 | 25 | def __init__(self,address,port,ttl,intercept,skip,nxdomain,timeout=0): 26 | """ 27 | address/port - upstream server 28 | ttl - default ttl for intercept records 29 | intercept - list of wildcard RRs to respond to (zone format) 30 | skip - list of wildcard labels to skip 31 | nxdomain - list of wildcard labels to retudn NXDOMAIN 32 | timeout - timeout for upstream server 33 | """ 34 | self.address = address 35 | self.port = port 36 | self.ttl = parse_time(ttl) 37 | self.skip = skip 38 | self.nxdomain = nxdomain 39 | self.timeout = timeout 40 | self.zone = [] 41 | for i in intercept: 42 | if i == '-': 43 | i = sys.stdin.read() 44 | for rr in RR.fromZone(i,ttl=self.ttl): 45 | self.zone.append((rr.rname,QTYPE[rr.rtype],rr)) 46 | 47 | def resolve(self,request,handler): 48 | reply = request.reply() 49 | qname = request.q.qname 50 | qtype = QTYPE[request.q.qtype] 51 | # Try to resolve locally unless on skip list 52 | if not any([qname.matchGlob(s) for s in self.skip]): 53 | for name,rtype,rr in self.zone: 54 | if qname.matchGlob(name) and (qtype in (rtype,'ANY','CNAME')): 55 | a = copy.copy(rr) 56 | a.rname = qname 57 | reply.add_answer(a) 58 | # Check for NXDOMAIN 59 | if any([qname.matchGlob(s) for s in self.nxdomain]): 60 | reply.header.rcode = getattr(RCODE,'NXDOMAIN') 61 | return reply 62 | # Otherwise proxy 63 | if not reply.rr: 64 | try: 65 | if handler.protocol == 'udp': 66 | proxy_r = request.send(self.address,self.port, 67 | timeout=self.timeout) 68 | else: 69 | proxy_r = request.send(self.address,self.port, 70 | tcp=True,timeout=self.timeout) 71 | reply = DNSRecord.parse(proxy_r) 72 | except socket.timeout: 73 | reply.header.rcode = getattr(RCODE,'NXDOMAIN') 74 | 75 | return reply 76 | 77 | if __name__ == '__main__': 78 | 79 | import argparse,sys,time 80 | 81 | p = argparse.ArgumentParser(description="DNS Intercept Proxy") 82 | p.add_argument("--port","-p",type=int,default=53, 83 | metavar="", 84 | help="Local proxy port (default:53)") 85 | p.add_argument("--address","-a",default="", 86 | metavar="
", 87 | help="Local proxy listen address (default:all)") 88 | p.add_argument("--upstream","-u",default="8.8.8.8:53", 89 | metavar="", 90 | help="Upstream DNS server:port (default:8.8.8.8:53)") 91 | p.add_argument("--tcp",action='store_true',default=False, 92 | help="TCP proxy (default: UDP only)") 93 | p.add_argument("--intercept","-i",action="append", 94 | metavar="", 95 | help="Intercept requests matching zone record (glob) ('-' for stdin)") 96 | p.add_argument("--skip","-s",action="append", 97 | metavar="