├── .gitignore ├── ESD ├── __init__.py ├── cacert.pem ├── subs-test.esd └── subs.esd ├── LICENSE ├── README.md ├── setup.py └── tests └── test_esd.py /.gitignore: -------------------------------------------------------------------------------- 1 | .idea 2 | .cache 3 | *.pyc 4 | build/ 5 | dist/ 6 | *.egg-info 7 | *.vscode -------------------------------------------------------------------------------- /ESD/__init__.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env python 2 | # -*- coding: utf-8 -*- 3 | 4 | """ 5 | ESD 6 | ~~~ 7 | 8 | Implements enumeration sub domains 9 | 10 | :author: Feei 11 | :homepage: https://github.com/FeeiCN/ESD 12 | :license: GPL, see LICENSE for more details. 13 | :copyright: Copyright (c) 2018 Feei. All rights reserved 14 | """ 15 | import os 16 | import re 17 | import time 18 | import ssl 19 | import math 20 | import string 21 | import random 22 | import traceback 23 | import itertools 24 | import datetime 25 | import colorlog 26 | import asyncio 27 | import aiodns 28 | import aiohttp 29 | import logging 30 | import requests 31 | import backoff 32 | import socket 33 | import async_timeout 34 | import dns.query 35 | import dns.zone 36 | import dns.resolver 37 | from tqdm import tqdm 38 | from colorama import Fore 39 | from optparse import OptionParser 40 | from aiohttp.resolver import AsyncResolver 41 | from itertools import islice 42 | from difflib import SequenceMatcher 43 | 44 | __version__ = '0.0.29' 45 | 46 | handler = colorlog.StreamHandler() 47 | formatter = colorlog.ColoredFormatter( 48 | '%(log_color)s%(asctime)s [%(name)s] [%(levelname)s] %(message)s%(reset)s', 49 | datefmt=None, 50 | reset=True, 51 | log_colors={ 52 | 'DEBUG': 'cyan', 53 | 'INFO': 'green', 54 | 'WARNING': 'yellow', 55 | 'ERROR': 'red', 56 | 'CRITICAL': 'red,bg_white', 57 | }, 58 | secondary_log_colors={}, 59 | style='%' 60 | ) 61 | handler.setFormatter(formatter) 62 | 63 | logger = colorlog.getLogger('ESD') 64 | logger.addHandler(handler) 65 | logger.setLevel(logging.INFO) 66 | 67 | ssl.match_hostname = lambda cert, hostname: True 68 | 69 | 70 | # 只采用了递归，速度非常慢，在优化完成前不建议开启 71 | # TODO:优化DNS查询，递归太慢了 72 | class DNSQuery(object): 73 | def __init__(self, root_domain, subs, suffix): 74 | # root domain 75 | self.suffix = suffix 76 | self.sub_domains = [] 77 | if root_domain: 78 | self.sub_domains.append(root_domain) 79 | 80 | for sub in subs: 81 | sub = ''.join(sub.rsplit(suffix, 1)).rstrip('.') 82 | self.sub_domains.append(f'{sub}.{suffix}') 83 | 84 | def dns_query(self): 85 | final_list = [] 86 | soa = aaaa = txt = mx = [] 87 | for subdomain in self.sub_domains: 88 | try: 89 | soa = [] 90 | q_soa = dns.resolver.resolve(subdomain, 'SOA') 91 | for a in q_soa: 92 | soa.append(str(a.rname).strip('.')) 93 | soa.append(str(a.mname).strip('.')) 94 | except Exception as e: 95 | logger.warning(f'Query failed. {str(e)}') 96 | try: 97 | aaaa = [] 98 | q_aaaa = dns.resolver.resolve(subdomain, 'AAAA') 99 | aaaa = [str(a.address).strip('.') for a in q_aaaa] 100 | except Exception as e: 101 | logger.warning(f'Query failed. {str(e)}') 102 | try: 103 | txt = [] 104 | q_txt = dns.resolver.resolve(subdomain, 'TXT') 105 | txt = [t.strings[0].decode('utf-8').strip('.') for t in q_txt] 106 | except Exception as e: 107 | logger.warning(f'Query failed. {str(e)}') 108 | try: 109 | mx = [] 110 | q_mx = dns.resolver.resolve(subdomain, 'MX') 111 | mx = [str(m.exchange).strip('.') for m in q_mx] 112 | except Exception as e: 113 | logger.warning('Query failed. {e}'.format(e=str(e))) 114 | domain_set = soa + aaaa + txt + mx 115 | domain_list = [i for i in domain_set] 116 | for p in domain_set: 117 | re_domain = re.findall(r'^(([a-z0-9]+(-[a-z0-9]+)*\.)+[a-z]{2,}\.?)$', p) 118 | if len(re_domain) > 0 and subdomain in re_domain[0][0]: 119 | continue 120 | else: 121 | domain_list.remove(p) 122 | final_list = domain_list + final_list 123 | # 递归调用，在子域名的dns记录中查找新的子域名 124 | recursive = [] 125 | # print("before: {0}".format(final_list)) 126 | # print("self.sub_domain: {0}".format(self.sub_domains)) 127 | final_list = list(set(final_list).difference(set(self.sub_domains))) 128 | # print("after: {0}".format(final_list)) 129 | if final_list: 130 | d = DNSQuery('', final_list, self.suffix) 131 | recursive = d.dns_query() 132 | return final_list + recursive 133 | 134 | 135 | class DNSTransfer(object): 136 | def __init__(self, domain): 137 | self.domain = domain 138 | 139 | def transfer_info(self): 140 | ret_zones = list() 141 | try: 142 | nss = dns.resolver.resolve(self.domain, 'NS') 143 | nameservers = [str(ns) for ns in nss] 144 | ns_addr = dns.resolver.resolve(nameservers[0], 'A') 145 | # dnspython 的 bug，需要设置 lifetime 参数 146 | zones = dns.zone.from_xfr(dns.query.xfr(ns_addr, self.domain, relativize=False, timeout=2, lifetime=2), 147 | check_origin=False) 148 | names = zones.nodes.keys() 149 | for n in names: 150 | subdomain = '' 151 | for t in range(0, len(n) - 1): 152 | if subdomain != '': 153 | subdomain += '.' 154 | subdomain += str(n[t].decode()) 155 | if subdomain != self.domain: 156 | ret_zones.append(subdomain) 157 | return ret_zones 158 | except BaseException: 159 | return [] 160 | 161 | 162 | class CAInfo(object): 163 | def __init__(self, domain): 164 | self.domain = domain 165 | 166 | def dns_resolve(self): 167 | padding_domain = 'www.' + self.domain 168 | # loop = asyncio.get_event_loop() 169 | loop = asyncio.new_event_loop() 170 | asyncio.set_event_loop(loop) 171 | resolver = aiodns.DNSResolver(loop=loop) 172 | f = resolver.query(padding_domain, 'A') 173 | result = loop.run_until_complete(f) 174 | return result[0].host 175 | 176 | def get_cert_info_by_ip(self, ip): 177 | s = socket.socket() 178 | s.settimeout(2) 179 | base_dir = os.path.dirname(os.path.abspath(__file__)) 180 | cert_path = base_dir + '/cacert.pem' 181 | connect = ssl.wrap_socket(s, cert_reqs=ssl.CERT_REQUIRED, ca_certs=cert_path) 182 | connect.settimeout(2) 183 | connect.connect((ip, 443)) 184 | cert_data = connect.getpeercert().get('subjectAltName') 185 | return cert_data 186 | 187 | def get_ca_domain_info(self): 188 | domain_list = list() 189 | try: 190 | ip = self.dns_resolve() 191 | cert_data = self.get_cert_info_by_ip(ip) 192 | except Exception as e: 193 | return domain_list 194 | 195 | for domain_info in cert_data: 196 | hostname = domain_info[1] 197 | if not hostname.startswith('*') and hostname.endswith(self.domain): 198 | domain_list.append(hostname) 199 | 200 | return domain_list 201 | 202 | def get_subdomains(self): 203 | subs = list() 204 | subdomain_list = self.get_ca_domain_info() 205 | for sub in subdomain_list: 206 | subs.append(sub[:len(sub) - len(self.domain) - 1]) 207 | return subs 208 | 209 | 210 | class EnumSubDomain(object): 211 | def __init__(self, domain, response_filter=None, dns_servers=None, skip_rsc=False, debug=False, 212 | split=None, proxy=None, multiresolve=False): 213 | self.project_directory = os.path.abspath(os.path.dirname(__file__)) 214 | self.proxy = proxy 215 | self.data = {} 216 | self.domain = domain 217 | self.skip_rsc = skip_rsc 218 | self.split = split 219 | self.multiresolve = multiresolve 220 | self.stable_dns_servers = ['119.29.29.29'] 221 | if dns_servers is None: 222 | # 除了DNSPod外，其它的都不适合作为稳定的DNS 223 | # 要么并发会显著下降，要么就完全不能用 224 | dns_servers = [ 225 | # DNS对结果准确性影响非常大，部分DNS结果会和其它DNS结果不一致甚至没结果 226 | # '223.5.5.5', # AliDNS 227 | # '114.114.114.114', # 114DNS 228 | # '1.1.1.1', # Cloudflare 229 | '119.29.29.29', # DNSPod https://www.dnspod.cn/products/public.dns 230 | # '180.76.76.76', # BaiduDNS 231 | # '1.2.4.8', # sDNS 232 | # '11.1.1.1' # test DNS, not available 233 | # '8.8.8.8', # Google DNS, 延时太高了 234 | ] 235 | 236 | random.shuffle(dns_servers) 237 | self.dns_servers = dns_servers 238 | self.resolver = None 239 | self.loop = asyncio.get_event_loop() 240 | self.general_dicts = [] 241 | # Mark whether the current domain name is a pan-resolved domain name 242 | self.is_wildcard_domain = False 243 | # Use a nonexistent domain name to determine whether 244 | # there is a pan-resolve based on the DNS resolution result 245 | self.wildcard_sub = 'feei-esd-{random}'.format(random=random.randint(0, 9999)) 246 | self.wildcard_sub3 = 'feei-esd-{random}.{random}'.format(random=random.randint(0, 9999)) 247 | # There is no domain name DNS resolution IP 248 | self.wildcard_ips = [] 249 | # No domain name response HTML 250 | self.wildcard_html = None 251 | self.wildcard_html_len = 0 252 | self.wildcard_html3 = None 253 | self.wildcard_html3_len = 0 254 | # Subdomains that are consistent with IPs that do not have domain names 255 | self.wildcard_subs = [] 256 | # Wildcard domains use RSC 257 | self.wildcard_domains = {} 258 | # Corotines count 259 | self.coroutine_count = None 260 | # 并发太高DNS Server的错误会大幅增加 261 | self.coroutine_count_dns = 1000 262 | self.coroutine_count_request = 100 263 | # dnsaio resolve timeout 264 | self.resolve_timeout = 3 265 | # RSC ratio 266 | self.rsc_ratio = 0.8 267 | self.remainder = 0 268 | self.count = 0 269 | # Request Header 270 | self.request_headers = { 271 | 'Connection': 'keep-alive', 272 | 'Pragma': 'no-cache', 273 | 'Cache-Control': 'no-cache', 274 | 'Upgrade-Insecure-Requests': '1', 275 | 'User-Agent': 'Baiduspider', 276 | 'Accept': 'text/html,application/xhtml+xml,application/xml;q=0.9,image/webp,image/apng,*/*;q=0.8', 277 | 'DNT': '1', 278 | 'Referer': 'http://www.baidu.com/', 279 | 'Accept-Encoding': 'gzip, deflate', 280 | 'Accept-Language': 'zh-CN,zh;q=0.9,en;q=0.8'} 281 | # Filter the domain's response(regex) 282 | self.response_filter = response_filter 283 | # debug mode 284 | self.debug = debug 285 | if self.debug: 286 | logger.setLevel(logging.DEBUG) 287 | # collect redirecting domains and response domains 288 | self.domains_rs = [] 289 | self.domains_rs_processed = [] 290 | self.dns_query_errors = 0 291 | 292 | def generate_general_dicts(self, line): 293 | """ 294 | Generate general subdomains dicts 295 | :param line: 296 | :return: 297 | """ 298 | # 根据RFC 1034/1035规定，域名中仅允许出现字母、数字和横杠（-） 299 | letter_count = line.count('{letter}') 300 | number_count = line.count('{number}') 301 | letters = itertools.product(string.ascii_lowercase + '-', repeat=letter_count) 302 | letters = [''.join(l) for l in letters] 303 | numbers = itertools.product(string.digits, repeat=number_count) 304 | numbers = [''.join(n) for n in numbers] 305 | for l in letters: 306 | iter_line = line.replace('{letter}' * letter_count, l) 307 | # 根据RFC 1034/1035规定，子域名的头部和尾部不允许出现横杠（-），中间不允许连续出现横杠（-） 308 | iter_line = iter_line.strip('-') 309 | iter_line = re.sub(r'-+', '-', iter_line) 310 | if iter_line != '': 311 | self.general_dicts.append(iter_line) 312 | number_dicts = [] 313 | for gd in self.general_dicts: 314 | for n in numbers: 315 | iter_line = gd.replace('{number}' * number_count, n) 316 | number_dicts.append(iter_line) 317 | if len(number_dicts) > 0: 318 | return number_dicts 319 | else: 320 | return self.general_dicts 321 | 322 | def load_sub_domain_dict(self): 323 | """ 324 | Load subdomains from files and dicts 325 | :return: 326 | """ 327 | dicts = [] 328 | if self.debug: 329 | path = '{pd}/subs-test.esd'.format(pd=self.project_directory) 330 | else: 331 | path = '{pd}/subs.esd'.format(pd=self.project_directory) 332 | with open(path, encoding='utf-8') as f: 333 | for line in f: 334 | line = line.strip().lower() 335 | # skip comments and space 336 | if '#' in line or line == '': 337 | continue 338 | if '{letter}' in line or '{number}' in line: 339 | self.general_dicts = [] 340 | dicts_general = self.generate_general_dicts(line) 341 | dicts += dicts_general 342 | else: 343 | # compatibility other dicts 344 | line = line.strip('.') 345 | dicts.append(line) 346 | dicts = list(set(dicts)) 347 | 348 | # split dict 349 | if self.split is not None: 350 | s = self.split.split('/') 351 | dicts_choose = int(s[0]) 352 | dicts_count = int(s[1]) 353 | dicts_every = int(math.ceil(len(dicts) / dicts_count)) 354 | dicts = [dicts[i:i + dicts_every] for i in range(0, len(dicts), dicts_every)][dicts_choose - 1] 355 | logger.info(f'Sub domain dict split {dicts_count} and get {dicts_choose}st') 356 | 357 | # root domain 358 | dicts.append('@') 359 | 360 | return dicts 361 | 362 | async def query(self, sub): 363 | """ 364 | Query domain 365 | :param sub: 366 | :return: 367 | """ 368 | ret = None 369 | # root domain 370 | if sub == '@' or sub == '': 371 | sub_domain = self.domain 372 | else: 373 | sub = ''.join(sub.rsplit(self.domain, 1)).rstrip('.') 374 | sub_domain = f'{sub}.{self.domain}' 375 | # 如果存在特定异常则进行重试 376 | for i in range(4): 377 | try: 378 | ret = await self.resolver.query(sub_domain, 'A') 379 | except aiodns.error.DNSError as e: 380 | err_code, err_msg = e.args[0], e.args[1] 381 | # 域名确实不存在 382 | # 4: Domain name not found 383 | # 1: DNS server returned answer with no data 384 | # 其它情况都需要重试，否则存在很高的遗漏 385 | # 11: Could not contact DNS servers 386 | # 12: Timeout while contacting DNS servers 387 | if err_code not in [1, 4]: 388 | if i == 2: 389 | logger.warning(f'Try {i + 1} times, but failed. {sub_domain} {e}') 390 | self.dns_query_errors = self.dns_query_errors + 1 391 | continue 392 | except Exception as e: 393 | logger.info(sub_domain) 394 | logger.warning(traceback.format_exc()) 395 | else: 396 | ret = [r.host for r in ret] 397 | domain_ips = [s for s in ret] 398 | # It is a wildcard domain name and 399 | # the subdomain IP that is burst is consistent with the IP 400 | # that does not exist in the domain name resolution, 401 | # the response similarity is discarded for further processing. 402 | if self.is_wildcard_domain and ( 403 | sorted(self.wildcard_ips) == sorted(domain_ips) or set(domain_ips).issubset( 404 | self.wildcard_ips)): 405 | if self.skip_rsc: 406 | logger.debug( 407 | f'{sub_domain} maybe wildcard subdomain, but it is --skip-rsc mode now, it will be drop this subdomain in results') 408 | else: 409 | logger.debug(f'{self.remainder} maybe wildcard domain, continue RSC {sub_domain}') 410 | else: 411 | if sub != self.wildcard_sub: 412 | self.data[sub_domain] = sorted(domain_ips) 413 | print('', end='\n') 414 | self.count += 1 415 | logger.info(f'{self.remainder} {len(self.data)} {sub_domain} {domain_ips}') 416 | break 417 | self.remainder += -1 418 | return sub_domain, ret 419 | 420 | @staticmethod 421 | def limited_concurrency_coroutines(coros, limit): 422 | futures = [ 423 | asyncio.ensure_future(c) 424 | for c in islice(coros, 0, limit) 425 | ] 426 | 427 | async def first_to_finish(): 428 | while True: 429 | await asyncio.sleep(0) 430 | for f in futures: 431 | if f.done(): 432 | futures.remove(f) 433 | try: 434 | nf = next(coros) 435 | futures.append(asyncio.ensure_future(nf)) 436 | except StopIteration: 437 | pass 438 | return f.result() 439 | 440 | while len(futures) > 0: 441 | yield first_to_finish() 442 | 443 | async def start(self, tasks, tasks_num): 444 | """ 445 | Limit the number of coroutines for reduce memory footprint 446 | :param tasks: 447 | :return: 448 | """ 449 | for res in tqdm(self.limited_concurrency_coroutines(tasks, self.coroutine_count), 450 | bar_format="%s{l_bar}%s{bar}%s{r_bar}%s" % (Fore.YELLOW, Fore.YELLOW, Fore.YELLOW, Fore.RESET), 451 | total=tasks_num): 452 | await res 453 | 454 | @staticmethod 455 | def data_clean(data): 456 | try: 457 | html = re.sub(r'\s', '', data) 458 | html = re.sub(r'.*?', '', html) 459 | return html 460 | except BaseException: 461 | return data 462 | 463 | @staticmethod 464 | @backoff.on_exception(backoff.expo, TimeoutError, max_tries=3) 465 | async def fetch(session, url): 466 | """ 467 | Fetch url response with session 468 | :param session: 469 | :param url: 470 | :return: 471 | """ 472 | try: 473 | async with async_timeout.timeout(20): 474 | async with session.get(url) as response: 475 | return await response.text(), response.history 476 | except Exception as e: 477 | # TODO 当在随机DNS场景中只做响应相似度比对的话，如果域名没有Web服务会导致相似度比对失败从而丢弃 478 | logger.warning(f'fetch exception: {type(e).__name__} {url}') 479 | return None, None 480 | 481 | async def similarity(self, sub): 482 | """ 483 | Enumerate subdomains by responding to similarities 484 | :param sub: 485 | :return: 486 | """ 487 | # root domain 488 | if sub == '@' or sub == '': 489 | sub_domain = self.domain 490 | else: 491 | sub = ''.join(sub.rsplit(self.domain, 1)).rstrip('.') 492 | sub_domain = f'{sub}.{self.domain}' 493 | 494 | if sub_domain in self.domains_rs: 495 | self.domains_rs.remove(sub_domain) 496 | full_domain = f'http://{sub_domain}' 497 | # 如果跳转中的域名是以下情况则不加入下一轮RSC 498 | skip_domain_with_history = [ 499 | # 跳到主域名了 500 | '{domain}'.format(domain=self.domain), 501 | 'www.{domain}'.format(domain=self.domain), 502 | # 跳到自己本身了，比如HTTP跳HTTPS 503 | '{domain}'.format(domain=sub_domain), 504 | ] 505 | try: 506 | regex_domain = r"((?!\/)(?:(?:[a-z\d-]*\.)+{d}))".format(d=self.domain) 507 | resolver = AsyncResolver(nameservers=self.dns_servers) 508 | conn = aiohttp.TCPConnector(resolver=resolver) 509 | async with aiohttp.ClientSession(connector=conn, headers=self.request_headers) as session: 510 | html, history = await self.fetch(session, full_domain) 511 | html = self.data_clean(html) 512 | if history is not None and len(history) > 0: 513 | location = str(history[-1].headers['location']) 514 | if '.' in location: 515 | location_split = location.split('/') 516 | if len(location_split) > 2: 517 | location = location_split[2] 518 | else: 519 | location = location 520 | try: 521 | location = re.match(regex_domain, location).group(0) 522 | except AttributeError: 523 | location = location 524 | status = history[-1].status 525 | if location in skip_domain_with_history and len(history) >= 2: 526 | logger.debug(f'domain in skip: {sub_domain} {status} {location}') 527 | return 528 | else: 529 | # cnsuning.com suning.com 530 | if location[-len(self.domain) - 1:] == '.{d}'.format(d=self.domain): 531 | # collect redirecting's domains 532 | if sub_domain != location and location not in self.domains_rs and location not in self.domains_rs_processed: 533 | print('', end='\n') 534 | logger.info( 535 | f'[{sub_domain}] add redirect domain: {location}({len(self.domains_rs)})') 536 | self.domains_rs.append(location) 537 | self.domains_rs_processed.append(location) 538 | else: 539 | print('', end='\n') 540 | logger.info(f'not same domain: {location}') 541 | else: 542 | print('', end='\n') 543 | logger.info(f'not domain(maybe path): {location}') 544 | if html is None: 545 | print('', end='\n') 546 | logger.warning(f'domain\'s html is none: {sub_domain}') 547 | return 548 | # collect response html's domains 549 | response_domains = re.findall(regex_domain, html) 550 | response_domains = list(set(response_domains) - {sub_domain}) 551 | for rd in response_domains: 552 | rd = rd.strip().strip('.') 553 | if rd.count('.') >= sub_domain.count('.') and rd[-len(sub_domain):] == sub_domain: 554 | continue 555 | if rd not in self.domains_rs: 556 | if rd not in self.domains_rs_processed: 557 | print('', end='\n') 558 | logger.info(f'[{sub_domain}] add response domain: {rd}({len(self.domains_rs)})') 559 | self.domains_rs.append(rd) 560 | self.domains_rs_processed.append(rd) 561 | 562 | if len(html) == self.wildcard_html_len: 563 | ratio = 1 564 | else: 565 | # SPEED 4 2 1, but here is still the bottleneck 566 | # real_quick_ratio() > quick_ratio() > ratio() 567 | # TODO bottleneck 568 | if sub.count('.') == 0: # secondary sub, ex: www 569 | ratio = SequenceMatcher(None, html, self.wildcard_html).real_quick_ratio() 570 | ratio = round(ratio, 3) 571 | else: # tertiary sub, ex: home.dev 572 | ratio = SequenceMatcher(None, html, self.wildcard_html3).real_quick_ratio() 573 | ratio = round(ratio, 3) 574 | self.remainder += -1 575 | if ratio > self.rsc_ratio: 576 | # passed 577 | logger.debug(f'{self.remainder} RSC ratio: {ratio} (passed) {sub_domain}') 578 | else: 579 | # added 580 | # for def distinct func 581 | # self.wildcard_domains[sub_domain] = html 582 | if self.response_filter is not None: 583 | for resp_filter in self.response_filter.split(','): 584 | if resp_filter in html: 585 | logger.debug(f'{self.remainder} RSC filter in response (passed) {sub_domain}') 586 | return 587 | else: 588 | continue 589 | self.data[sub_domain] = self.wildcard_ips 590 | else: 591 | self.data[sub_domain] = self.wildcard_ips 592 | print('', end='\n') 593 | logger.info(f'{self.remainder} RSC ratio: {ratio} (added) {sub_domain}') 594 | except Exception as e: 595 | logger.debug(traceback.format_exc()) 596 | return 597 | 598 | def distinct(self): 599 | for domain, html in self.wildcard_domains.items(): 600 | for domain2, html2 in self.wildcard_domains.items(): 601 | ratio = SequenceMatcher(None, html, html2).real_quick_ratio() 602 | if ratio > self.rsc_ratio: 603 | # remove this domain 604 | if domain2 in self.data: 605 | del self.data[domain2] 606 | m = 'Remove' 607 | else: 608 | m = 'Stay' 609 | logger.info(f'{domain} : {domain2} {ratio} {m}') 610 | 611 | def check(self, dns): 612 | logger.info(f"Checking if DNS server {dns} is available") 613 | msg = b'\x5c\x6d\x01\x00\x00\x01\x00\x00\x00\x00\x00\x00\x03www\x05baidu\x03com\x00\x00\x01\x00\x01' 614 | sock = socket.socket(socket.AF_INET, socket.SOCK_DGRAM) 615 | sock.settimeout(3) 616 | repeat = { 617 | 1: 'first', 618 | 2: 'second', 619 | 3: 'third' 620 | } 621 | for i in range(3): 622 | logger.info(f"Sending message to DNS server a {repeat[i + 1]} time") 623 | sock.sendto(msg, (dns, 53)) 624 | try: 625 | sock.recv(4096) 626 | break 627 | except socket.timeout as e: 628 | logger.warning('check dns server timeout Failed!') 629 | if i == 2: 630 | return False 631 | return True 632 | 633 | def run(self): 634 | """ 635 | Run 636 | :return: 637 | """ 638 | logger.info(f'Version: {__version__}') 639 | logger.info('----------') 640 | logger.info(f'Start domain: {self.domain}') 641 | start_time = time.time() 642 | subs = self.load_sub_domain_dict() 643 | logger.info(f'Sub domain dict count: {len(subs)}') 644 | logger.info('Generate coroutines...') 645 | # Verify that all DNS server results are consistent 646 | stable_dns = [] 647 | wildcard_ips = None 648 | last_dns = [] 649 | only_similarity = False 650 | for dns in self.dns_servers: 651 | delay = self.check(dns) 652 | if not delay: 653 | logger.warning(f"@{dns} is not available, skip this DNS server") 654 | continue 655 | self.resolver = aiodns.DNSResolver(loop=self.loop, nameservers=[dns], timeout=self.resolve_timeout) 656 | job = self.query(self.wildcard_sub) 657 | sub, ret = self.loop.run_until_complete(job) 658 | logger.info(f'@{dns} {sub} {ret}') 659 | if ret is None: 660 | ret = None 661 | else: 662 | ret = sorted(ret) 663 | 664 | if dns in self.stable_dns_servers: 665 | wildcard_ips = ret 666 | stable_dns.append(ret) 667 | 668 | if ret: 669 | equal = [False for r in ret if r not in last_dns] 670 | if len(last_dns) != 0 and False in equal: 671 | only_similarity = self.is_wildcard_domain = True 672 | logger.info('Is a random resolve subdomain.') 673 | break 674 | else: 675 | last_dns = ret 676 | 677 | is_all_stable_dns = stable_dns.count(stable_dns[0]) == len(stable_dns) 678 | if not is_all_stable_dns: 679 | logger.info('Is all stable dns: NO, use the default dns server') 680 | self.resolver = aiodns.DNSResolver(loop=self.loop, nameservers=self.stable_dns_servers, 681 | timeout=self.resolve_timeout) 682 | # Wildcard domain 683 | is_wildcard_domain = not (stable_dns.count(None) == len(stable_dns)) 684 | if is_wildcard_domain or self.is_wildcard_domain: 685 | if not self.skip_rsc: 686 | logger.info('This is a wildcard domain, will enumeration subdomains use by DNS+RSC.') 687 | else: 688 | logger.info( 689 | 'This is a wildcard domain, but it is --skip-rsc mode now, it will be drop all random resolve subdomains in results') 690 | self.is_wildcard_domain = True 691 | if wildcard_ips is not None: 692 | self.wildcard_ips = wildcard_ips 693 | else: 694 | self.wildcard_ips = stable_dns[0] 695 | logger.info(f'Wildcard IPS: {self.wildcard_ips}') 696 | if not self.skip_rsc: 697 | try: 698 | self.wildcard_html = requests.get( 699 | f'http://{self.wildcard_sub}.{self.domain}', 700 | headers=self.request_headers, timeout=10, verify=False).text 701 | self.wildcard_html = self.data_clean(self.wildcard_html) 702 | self.wildcard_html_len = len(self.wildcard_html) 703 | self.wildcard_html3 = requests.get( 704 | f'http://{self.wildcard_sub3}.{self.domain}', 705 | headers=self.request_headers, timeout=10, verify=False).text 706 | self.wildcard_html3 = self.data_clean(self.wildcard_html3) 707 | self.wildcard_html3_len = len(self.wildcard_html3) 708 | logger.info( 709 | f'Wildcard domain response html length: {self.wildcard_html_len} 3length: {self.wildcard_html3_len}') 710 | except requests.exceptions.SSLError: 711 | logger.warning('SSL Certificate Error!') 712 | except requests.exceptions.ConnectTimeout: 713 | logger.warning('Request response content failed, check network please!') 714 | except requests.exceptions.ReadTimeout: 715 | self.wildcard_html = self.wildcard_html3 = '' 716 | self.wildcard_html_len = self.wildcard_html3_len = 0 717 | logger.warning( 718 | f'Request response content timeout, {self.wildcard_sub}.{self.domain} and {self.wildcard_sub3}.{self.domain} maybe not a http service, content will be set to blank!') 719 | except requests.exceptions.ConnectionError: 720 | logger.error('ESD can\'t get the response text so the rsc will be skipped. ') 721 | self.skip_rsc = True 722 | else: 723 | logger.info('Not a wildcard domain') 724 | 725 | if not only_similarity: 726 | self.coroutine_count = self.coroutine_count_dns 727 | tasks = (self.query(sub) for sub in subs) 728 | self.loop.run_until_complete(self.start(tasks, len(subs))) 729 | logger.info(f"Brute Force subdomain count: {self.count}") 730 | dns_time = time.time() 731 | time_consume_dns = int(dns_time - start_time) 732 | logger.info(f'DNS query errors: {self.dns_query_errors}') 733 | 734 | # CA subdomain info 735 | ca_subdomains = [] 736 | logger.info('Collect subdomains in CA...') 737 | ca_subdomains = CAInfo(self.domain).get_subdomains() 738 | if len(ca_subdomains): 739 | tasks = (self.query(sub) for sub in ca_subdomains) 740 | self.loop.run_until_complete(self.start(tasks, len(ca_subdomains))) 741 | logger.info(f'CA subdomain count: {len(ca_subdomains)}') 742 | 743 | # DNS Transfer Vulnerability 744 | transfer_info = [] 745 | logger.info(f'Check DNS Transfer Vulnerability in {self.domain}') 746 | transfer_info = DNSTransfer(self.domain).transfer_info() 747 | if len(transfer_info): 748 | logger.warning(f'DNS Transfer Vulnerability found in {self.domain}!') 749 | tasks = (self.query(sub) for sub in transfer_info) 750 | self.loop.run_until_complete(self.start(tasks, len(transfer_info))) 751 | logger.info(f'DNS Transfer subdomain count: {len(transfer_info)}') 752 | 753 | total_subs = set(subs + transfer_info + ca_subdomains) 754 | 755 | # Use TXT,SOA,MX,AAAA record to find sub domains 756 | if self.multiresolve: 757 | logger.info('Enumerating subdomains with TXT, SOA, MX, AAAA record...') 758 | dnsquery = DNSQuery(self.domain, total_subs, self.domain) 759 | record_info = dnsquery.dns_query() 760 | tasks = (self.query(record[:record.find('.')]) for record in record_info) 761 | self.loop.run_until_complete(self.start(tasks, len(record_info))) 762 | logger.info(f'DNS record subdomain count: {len(record_info)}') 763 | 764 | if self.is_wildcard_domain and not self.skip_rsc: 765 | # Response similarity comparison 766 | total_subs = set(subs + transfer_info + ca_subdomains) 767 | self.wildcard_subs = list(set(subs).union(total_subs)) 768 | logger.info( 769 | f'Enumerates {len(self.data)} sub domains by DNS mode in {str(datetime.timedelta(seconds=time_consume_dns))}') 770 | logger.info( 771 | f'Will continue to test the distinct({len(subs)}-{len(self.data)})={len(self.wildcard_subs)} domains used by RSC, the speed will be affected.') 772 | self.coroutine_count = self.coroutine_count_request 773 | self.remainder = len(self.wildcard_subs) 774 | tasks = (self.similarity(sub) for sub in self.wildcard_subs) 775 | self.loop.run_until_complete(self.start(tasks, len(self.wildcard_subs))) 776 | 777 | # Distinct last domains use RSC 778 | # Maybe misinformation 779 | # self.distinct() 780 | 781 | time_consume_request = int(time.time() - dns_time) 782 | logger.info(f'Requests time consume {str(datetime.timedelta(seconds=time_consume_request))}') 783 | # RS(redirect/response) domains 784 | while len(self.domains_rs) != 0: 785 | logger.info(f'RS(redirect/response) domains({len(self.domains_rs)})...') 786 | tasks = (self.similarity(''.join(domain.rsplit(self.domain, 1)).rstrip('.')) for domain in self.domains_rs) 787 | 788 | self.loop.run_until_complete(self.start(tasks, len(self.domains_rs))) 789 | 790 | # write output 791 | tmp_dir = '/tmp/esd' 792 | if not os.path.isdir(tmp_dir): 793 | os.mkdir(tmp_dir, 0o777) 794 | output_path_with_time = f'{tmp_dir}/.{self.domain}_{datetime.datetime.now().strftime("%Y-%m_%d_%H-%M")}.esd' 795 | output_path = f'{tmp_dir}/.{self.domain}.esd' 796 | if len(self.data): 797 | max_domain_len = max(map(len, self.data)) + 2 798 | else: 799 | max_domain_len = 2 800 | output_format = '%-{0}s%-s\n'.format(max_domain_len) 801 | with open(output_path_with_time, 'w') as opt, open(output_path, 'w') as op: 802 | for domain, ips in self.data.items(): 803 | # The format is consistent with other scanners to ensure that they are 804 | # invoked at the same time without increasing the cost of 805 | # resolution 806 | if ips is None or len(ips) == 0: 807 | ips_split = '' 808 | else: 809 | ips_split = ','.join(ips) 810 | con = output_format % (domain, ips_split) 811 | op.write(con) 812 | opt.write(con) 813 | 814 | logger.info(f'Output: {output_path}') 815 | logger.info(f'Output with time: {output_path_with_time}') 816 | logger.info(f'Total domain: {len(self.data)}') 817 | time_consume = int(time.time() - start_time) 818 | logger.info(f'Time consume: {str(datetime.timedelta(seconds=time_consume))}') 819 | return self.data 820 | 821 | 822 | def banner(): 823 | print("""\033[94m 824 | ______ _____ _____ 825 | | ____| / ____| | __ \ 826 | | |__ | (___ | | | | 827 | | __| \___ \ | | | | 828 | | |____ ____) | | |__| | 829 | |______| |_____/ |_____/\033[0m\033[93m 830 | Enumeration Sub Domains v%s\033[92m 831 | """ % __version__) 832 | 833 | 834 | def main(): 835 | banner() 836 | parser = OptionParser( 837 | 'Usage: esd -d feei.cn -F response_filter -p user:pass@host:port') 838 | parser.add_option('-d', '--domain', dest='domains', help='The domains that you want to enumerate') 839 | parser.add_option('-f', '--file', dest='input', help='Import domains from this file') 840 | parser.add_option('-F', '--filter', dest='filter', help='Response filter') 841 | parser.add_option('-s', '--skip-rsc', dest='skiprsc', help='Skip response similary compare', action='store_true', 842 | default=False) 843 | parser.add_option('-S', '--split', dest='split', help='Split the dict into several parts', default='1/1') 844 | parser.add_option('-p', '--proxy', dest='proxy', help='Use socks5 proxy to access Google and Yahoo') 845 | parser.add_option('-m', '--multi-resolve', dest='multiresolve', 846 | help='Use TXT, AAAA, MX, SOA record to find subdomains', action='store_true', default=False) 847 | (options, args) = parser.parse_args() 848 | 849 | domains = [] 850 | response_filter = options.filter 851 | skip_rsc = options.skiprsc 852 | split_list = options.split.split('/') 853 | split = options.split 854 | multiresolve = options.multiresolve 855 | 856 | try: 857 | if len(split_list) != 2 or int(split_list[0]) > int(split_list[1]): 858 | logger.error('Invaild split parameter,can not split the dict') 859 | split = None 860 | except: 861 | logger.error(f'Split validation failed: {split_list}') 862 | exit(0) 863 | 864 | if options.proxy: 865 | proxy = { 866 | 'http': 'socks5h://%s' % options.proxy, 867 | 'https': 'socks5h://%s' % options.proxy 868 | } 869 | else: 870 | proxy = {} 871 | 872 | if options.domains is not None: 873 | for p in options.domains.split(','): 874 | p = p.strip().lower() 875 | re_domain = re.findall(r'^(([a-z0-9]+(-[a-z0-9]+)*\.)+[a-z]{2,})$', p) 876 | if len(re_domain) > 0 and re_domain[0][0] == p: 877 | domains.append(p.strip()) 878 | else: 879 | logger.error(f'Domain validation failed: {p}') 880 | elif options.input and os.path.isfile(options.input): 881 | with open(options.input) as fh: 882 | for line_domain in fh: 883 | line_domain = line_domain.strip().lower() 884 | re_domain = re.findall(r'^(([a-z0-9]+(-[a-z0-9]+)*\.)+[a-z]{2,})$', line_domain) 885 | if len(re_domain) > 0 and re_domain[0][0] == line_domain: 886 | domains.append(line_domain) 887 | else: 888 | logger.error(f'Domain validation failed: {line_domain}') 889 | else: 890 | logger.error('Please input vaild parameter. ie: "esd -d feei.cn" or "esd -f /Users/root/domains.txt"') 891 | 892 | if 'esd' in os.environ: 893 | debug = os.environ['esd'] 894 | else: 895 | debug = False 896 | logger.info(f'Debug: {debug}') 897 | logger.info(f'--skip-rsc: {skip_rsc}') 898 | 899 | logger.info(f'Total target domains: {len(domains)}') 900 | try: 901 | for d in domains: 902 | esd = EnumSubDomain(d, response_filter, skip_rsc=skip_rsc, debug=debug, split=split, 903 | proxy=proxy, 904 | multiresolve=multiresolve) 905 | esd.run() 906 | except KeyboardInterrupt: 907 | print('', end='\n') 908 | logger.info('Bye :)') 909 | exit(0) 910 | 911 | 912 | if __name__ == '__main__': 913 | main() 914 | -------------------------------------------------------------------------------- /ESD/subs-test.esd: -------------------------------------------------------------------------------- 1 | {letter}{letter} 2 | {letter}{letter}{letter} 3 | www 4 | h5 5 | wap 6 | _feei 7 | test 8 | dkim._domainkey 9 | _finger._tcp 10 | sso.cn 11 | dmarc.mail2 12 | f2.market 13 | market 14 | mail 15 | bn73 16 | passport 17 | djfowj 18 | video 19 | dkfowejf 20 | cnvhueq 21 | dhfowje 22 | clive 23 | echiu 24 | img 25 | inn 26 | et25 27 | gsil 28 | dms 29 | beps -------------------------------------------------------------------------------- /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 | {one line to give the program's name and a brief idea of what it does.} 635 | Copyright (C) {year} {name of author} 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 | {project} Copyright (C) {year} {fullname} 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 | . -------------------------------------------------------------------------------- /README.md: -------------------------------------------------------------------------------- 1 | # ESD(Enumeration Sub Domain) 2 | 3 | [![PyPI](https://img.shields.io/pypi/v/ESD.svg)](https://pypi.org/project/ESD/) 4 | ![PyPI - Python Version](https://img.shields.io/pypi/pyversions/ESD.svg) 5 | ![license](https://img.shields.io/github/license/FeeiCN/ESD.svg) 6 | 7 | [![asciicast](https://asciinema.org/a/15WhUe40eEhSbwAXZdf2RQdq9.png)](https://asciinema.org/a/15WhUe40eEhSbwAXZdf2RQdq9) 8 | 9 | ## 优势 10 | #### 支持泛解析域名 11 | > 基于`RSC`（响应相似度对比）技术对泛解析域名进行枚举（受网络质量、网站带宽等影响，速度会比较慢） 12 | 13 | 基于`aioHTTP`获取一个不存在子域名的响应内容，并将其和字典子域名响应进行相似度比对。 14 | 超过阈值则说明是同个页面，否则则为可用子域名，并对最终子域名再次进行响应相似度对比。 15 | 16 | #### 更快的速度 17 | > 基于`AsyncIO`异步协程技术对域名进行枚举（受网络和DNS服务器影响会导致扫描速度小幅波动，基本在250秒以内） 18 | 19 | 基于`AsyncIO`+`aioDNS`将比传统多进程/多线程/gevent模式快50%以上。 20 | 通过扫描`qq.com`，共`661593`条规则，找到`3442`个域名，耗时`15`分钟左右。 21 | 22 | 更新于2021年9月，经实测多个DNS Server做了请求数限制，大并发下存在大量连接超时和异常导致遗漏情况大幅增加，目前通过限制DNS服务器以及并发数来解决，因此建议不要过于追求速度，通过设计更合理的触发时间来解决速度变慢问题。 23 | 24 | #### 更全的字典 25 | > 融合各类字典，去重后共620328条子域名字典 26 | 27 | - 通用字典 28 | - 域名解析商公布使用最多的子域名 29 | - 其它域名爆破工具字典 30 | 31 | #### 更多的收集渠道 32 | - [X] 收集DNSPod接口泄露的子域名 33 | - [X] 收集页面响应内容中出现的子域名 34 | - [X] 收集跳转过程中的子域名 35 | - [X] 收集HTTPS证书透明度子域名 36 | - [X] 收集DNS域传送子域名 37 | 38 | #### DNS服务器 39 | - 解决各家DNS服务商对于网络线路出口判定不一致问题 40 | - 解决各家DNS服务商缓存时间不一致问题 41 | - 解决随机DNS问题，比如fliggy.com、plu.cn等 42 | - 根据网络情况自动剔除无效DNS，提高枚举成功率 43 | 44 | ## 使用 45 | 46 | ```bash 47 | # 安装 48 | pip install esd 49 | ``` 50 | 51 | **CLI命令行使用** 52 | ```bash 53 | # 扫描单个域名 54 | esd -d qq.com 55 | ``` 56 | 57 | **程序调用** 58 | ```python 59 | from ESD import EnumSubDomain 60 | domains = EnumSubDomain('feei.cn').run() 61 | ``` 62 | 63 | ## 文档 64 | - https://yuque.com/esd 65 | -------------------------------------------------------------------------------- /setup.py: -------------------------------------------------------------------------------- 1 | # -*- coding: utf-8 -*- 2 | 3 | """ 4 | ESD 5 | ~~~ 6 | 7 | Implements ESD setup 8 | 9 | sudo python setup.py sdist bdist_wheel 10 | sudo twine upload dist/ESD-0.0.x 11 | 12 | :author: Feei 13 | :homepage: https://github.com/FeeiCN/ESD 14 | :license: GPL, see LICENSE for more details. 15 | :copyright: Copyright (c) 2018 Feei. All rights reserved 16 | """ 17 | import setuptools 18 | from ESD import __version__ 19 | 20 | with open('README.md', 'r') as f: 21 | long_description = f.read() 22 | 23 | setuptools.setup( 24 | name='ESD', 25 | version=__version__, 26 | author='Feei', 27 | author_email='feei@feei.cn', 28 | description='Enumeration Sub Domains(枚举子域名)', 29 | long_description=long_description, 30 | long_description_content_type='text/markdown', 31 | url='https://github.com/FeeiCN/ESD', 32 | packages=setuptools.find_packages(), 33 | install_requires=[ 34 | 'colorlog', 35 | 'aiodns', 36 | 'aiohttp', 37 | 'async-timeout', 38 | 'requests', 39 | 'backoff', 40 | 'dnspython', 41 | 'pysocks', 42 | 'tqdm', 43 | 'colorama', 44 | ], 45 | classifiers=[ 46 | "Topic :: Security", 47 | "Programming Language :: Python :: 3", 48 | "License :: OSI Approved :: GNU General Public License v3 (GPLv3)" 49 | ], 50 | package_data={ 51 | 'esdx': ['ESD/*.esd', 'ESD/*.pem'] 52 | }, 53 | include_package_data=True, 54 | entry_points={ 55 | 'console_scripts': [ 56 | 'esd=ESD:main' 57 | ] 58 | } 59 | ) 60 | -------------------------------------------------------------------------------- /tests/test_esd.py: -------------------------------------------------------------------------------- 1 | #!/usr/bin/env python 2 | # -*- coding: utf-8 -*- 3 | 4 | """ 5 | ESD TestCase 6 | ~~~ 7 | 8 | Implements enumeration ESD TestCase 9 | 10 | :author: Feei 11 | :homepage: https://github.com/FeeiCN/ESD 12 | :license: GPL, see LICENSE for more details. 13 | :copyright: Copyright (c) 2018 Feei. All rights reserved 14 | """ 15 | import unittest 16 | 17 | from ESD import EnumSubDomain 18 | from difflib import SequenceMatcher 19 | 20 | 21 | class TestESD(unittest.TestCase): 22 | 23 | def test_generate_general_dicts(self): 24 | esd = EnumSubDomain('feei.cn') 25 | subs = esd.generate_general_dicts('{letter}{letter}{letter}') 26 | # print(subs) 27 | assert 'c-r' in subs 28 | assert '-ab' not in subs 29 | assert 'cd-' not in subs 30 | assert '--e' not in subs 31 | 32 | def test_load_sub_domain_dict(self): 33 | esd = EnumSubDomain('feei.cn') 34 | subs = esd.load_sub_domain_dict() 35 | assert len(subs) == 661593 36 | 37 | def test_rsc(self): 38 | a_html = """ 39 | 40 | 41 | 42 | 43 | 44 | 45 | 46 | 47 | 48 | 49 | 50 | 51 | 52 | 蘑菇街-我的买手街 53 | 54 |
55 | 56 | 65 | """ 66 | b_html = """ 67 | 68 | 69 | 70 | 71 | 72 | 73 | 74 | 75 | 76 | 77 | 78 | 79 | 80 | 蘑菇街-我的买手街 81 | 82 |
83 | 84 | 93 | """ 94 | ratio = SequenceMatcher(None, a_html, b_html).real_quick_ratio() 95 | assert ratio > 0.8 96 | 97 | 98 | if __name__ == '__main__': 99 | unittest.main() 100 | --------------------------------------------------------------------------------