Skip to content

Instantly share code, notes, and snippets.

View paced's full-sized avatar

Thomas Wang paced

46 followers · 41 following
View GitHub Profile
@paced
paced / keeb-3.md
Last active August 9, 2022 14:32
MODE 80 Build
  • Kit: Mode 80 (e-white top, silver mirror bottom) (stack mount, hotswap, aluminium plate)
  • Foam: poron base (between base and PCB), plate foam (between plate and PCB), individual PE Foam adhesives on PCB
  • Switches: JWK Durock POMs (lubed with Krytox 205g0 for switch, 105 for springs, filmed with Durock foam films)
  • Springs: SPRiT Slow Extreme II 68g for all keys
  • Keycaps: GMK Serika 2 with a Salvun x GMK Serika Artisan
  • Stabilisers: Durock V2 stabs (lubed wires w/ Krytox XHT-BDZ, housings w/ Krytox 205g0, Holee modded)
@paced
paced / shydis-0.1.1.py
Last active March 6, 2023 04:59
Non-stealthy process forking with web-form cracking. For academic purposes only.
#!/usr/bin/python
"""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
paced / substitution.py
Last active November 13, 2017 23:17
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
paced / killphish.py
Last active March 6, 2023 04:59
Feed random data to phishers to make their forms useless. For academic purposes only.
"""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
paced / rsa_crt_decrypt.py
Last active November 14, 2017 02:04
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
paced / prng_known_seed.py
Last active November 14, 2017 02:04
Cracking a specific known cipher method (not shown) by reverse engineering.
import random, string
random.seed("random")
secret = "BNZQ:8o149b15764q471k2533971t6w78liec"
decoded = ""
# Each line will definitely remain lower/upper/digit.
# To find out why, pay attention to the origin code.