Skip to content

Instantly share code, notes, and snippets.

View moloch--'s full-sized avatar
🏠
Working from home

Joe moloch--

🏠
Working from home
View GitHub Profile

Keybase proof

I hereby claim:

  • I am moloch-- on github.
  • I am moloch (https://keybase.io/moloch) on keybase.
  • I have a public key whose fingerprint is 9447 86C1 3B4C 5A63 B46A 3A1B E3A5 ACEE 3DA0 983C

To claim this, I am signing this object:

@moloch--
moloch-- / netkatz.cs
Created May 28, 2016 03:21
Downloads and Executes Mimikatz In Memory From GitHub
using System;
using System.IO;
using System.Net;
using System.Text;
using System.IO.Compression;
using System.Collections.Generic;
using System.Configuration.Install;
using System.Runtime.InteropServices;
@moloch--
moloch-- / vm_detect
Created September 20, 2016 22:22 — forked from malware-kitten/vm_detect
A chunk of code found online that will check for evidence of a virtual machine
#include <string>
#include <tlhelp32.h>
#include <TCHAR.H>
#include <dir.h>
using namespace std;
int detected = 0;
DWORD GetModulePath(HINSTANCE hInst,LPTSTR pszBuffer,DWORD dwSize)
private _compareArrays(a: Array<any>, b: Array<any>) {
if (a.length !== b.length) {
return false;
} else {
for (let index = 0; index < a.length; ++index) {
if (a[index] !== b[index]) {
return false;
}
}
}
#!/usr/bin/env python
"""
Python implementation of the Tiny Encryption Algorithm (TEA)
By Moloch
TEA has a few weaknesses. Most notably, it suffers from
equivalent keys each key is equivalent to three others,
which means that the effective key size is only 126 bits.
As a result, TEA is especially bad as a cryptographic hash
function. This weakness led to a method for hacking Microsoft's
@moloch--
moloch-- / Makefile
Last active April 26, 2023 00:55
Basic cross-platform reverse shell in Go
EXE = shell
SRC = .
LDFLAGS = -ldflags="-s -w"
windows:
GOOS=windows go build -o $(EXE)_win.exe $(LDFLAGS) $(SRC)
macos:
GOOS=darwin go build -o $(EXE)_macos $(LDFLAGS) $(SRC)
#!/usr/bin/env python3
value = 0
while value < 1: value = int(input('Start: '))
while value != 1:
print(value)
if value & 1:
value = (3 * value) + 1
else:
<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE plist PUBLIC "-//Apple//DTD PLIST 1.0//EN" "http://www.apple.com/DTDs/PropertyList-1.0.dtd">
<plist version="1.0">
<dict>
<key>platform-application</key>
<true/>
<key>com.apple.private.security.no-container</key>
<true/>
<key>com.apple.private.skip-library-validation</key>
<true/>
### Keybase proof
I hereby claim:
* I am moloch-- on github.
* I am moloch (https://keybase.io/moloch) on keybase.
* I have a public key whose fingerprint is 0E59 543B A7BC 269F 3AAE 707E B705 0578 9B38 EEA6
To claim this, I am signing this object: