Skip to content

Instantly share code, notes, and snippets.


Thomas Wang paced

View GitHub Profile
paced /
Created Aug 24, 2021
Keyboase verification with my PGP key.

Keybase proof

I hereby claim:

  • I am paced on github.
  • I am paced ( on keybase.
  • I have a public key whose fingerprint is 911A B2D3 3522 99A5 6586 B640 AD13 F72A 4454 A8AE

To claim this, I am signing this object:

paced /
Last active May 18, 2021
What I use when I hack my MacBook too much and need to reset it without Time Machine.
# Homebrew stuff.
/usr/bin/ruby -e "$(curl -fsSL" | echo
brew install zsh tree vim curl mas wget htop rustup-init nvm
brew cask install 1password discord iterm2 keyboardcleantool the-unarchiver visual-studio-code ivpn \
gitkraken postman transmission pycharm clion webstorm duet onedrive
# Additional programming stuff.
xcode-select --install
paced /
Last active Apr 24, 2019
Non-stealthy process forking with web-form cracking. For academic purposes only, I have never used this script.
"""SHyDis V 0.1.1."""
import argparse
import datetime
import os
import subprocess
HYDRA_COMMAND = "hydra -e sr -f -v -w %d -l %s -p %s %s"
TEMP_WORDLIST_FILENAME = "temp_wordlist.txt"
paced /
Last active Nov 13, 2017
Very simple Python code for breaking substitution ciphers.
from string import maketrans
def decrypt(in, out, test):
Given a plaintext input, encrypted output, and an encrypted test string, return a
decrypted test string. This will only work for a substitution-style cipher.
cipher = maketrans(out, in)
return test.translate(cipher)
paced /
Last active Nov 14, 2017
Feed random data to phishers to make their forms useless. For academic purposes only, I have never used this script.
"""Feed random data to some host in an attempt to throw off phishers."""
# This attack is best carried out via a distributed network or several
# concurrent IP addresses. Use a VPN if available.
import urllib2, urllib
import json
import time
import random
paced /
Last active Nov 14, 2017
Decryption with C, p, q, dp, and dq for RSA's Chinese Remainder Theorem.
"""Decrypt RSA using the Chinese Remainder Theorem."""
C = 95272795986475189505518980251137003509292621140166383887854853863720692420204142448424074834657149326853553097626486371206617513769930277580823116437975487148956107509247564965652417450550680181691869432067892028368985007229633943149091684419834136214793476910417359537696632874045272326665036717324623992885
p = 11387480584909854985125335848240384226653929942757756384489381242206157197986555243995335158328781970310603060671486688856263776452654268043936036556215243
q = 12972222875218086547425818961477257915105515705982283726851833508079600460542479267972050216838604649742870515200462359007315431848784163790312424462439629
dp = 8191957726161111880866028229950166742224147653136894248088678244548815086744810656765529876284622829884409590596114090872889522887052772791407131880103961
paced /
Last active Nov 14, 2017
Cracking a specific known cipher method (not shown) by reverse engineering.
import random, string
secret = "BNZQ:8o149b15764q471k2533971t6w78liec"
decoded = ""
# Each line will definitely remain lower/upper/digit.
# To find out why, pay attention to the origin code.