| import socket | |
| from struct import * | |
| s = socket.socket(socket.AF_INET, socket.SOCK_RAW, socket.IPPROTO_TCP) | |
| while True: | |
| pack = s.recvfrom(20000) | |
| #Get the single element from the tuple |
| #!/usr/bin/env python | |
| import base64, hashlib, hmac, json, sys, getpass | |
| from Crypto.Cipher import AES | |
| from Crypto.Hash import RIPEMD, SHA256 | |
| base58_chars = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz' | |
| def prompt(p): | |
| return getpass.getpass(p + ": ") |
| #!/usr/bin/env python | |
| """A simple Bloom Filter implementation | |
| Calculating optimal filter size: | |
| Where: | |
| m is: self.bitcount (how many bits in self.filter) | |
| n is: the number of expected values added to self.filter | |
| k is: the number of hashes being produced | |
| (1 - math.exp(-float(k * n) / m)) ** k | |
| http://en.wikipedia.org/wiki/Bloom_filter | |
| """ |
| #!/usr/bin/env python | |
| import base64, hashlib, hmac, json, sys, getpass | |
| from Crypto.Cipher import AES | |
| from Crypto.Hash import RIPEMD, SHA256 | |
| base58_chars = '123456789ABCDEFGHJKLMNPQRSTUVWXYZabcdefghijkmnopqrstuvwxyz' | |
| def prompt(p): | |
| return getpass.getpass(p + ": ") |
In August 2007 a hacker found a way to expose the PHP source code on facebook.com. He retrieved two files and then emailed them to me, and I wrote about the issue:
http://techcrunch.com/2007/08/11/facebook-source-code-leaked/
It became a big deal:
http://www.techmeme.com/070812/p1#a070812p1
The two files are index.php (the homepage) and search.php (the search page)
| from operator import itemgetter | |
| import multiprocessing | |
| import os | |
| import signal | |
| # yum install python-signalfd | |
| import signalfd | |
| import struct | |
| import threading | |
| import time |
| #!/bin/bash | |
| # PoC tty_tickets spoofing exploit by Ryan Castellucci | |
| # Originally written October 2012, see CVE-2013-1776 | |
| # This does not implement using setsid to cause fallback | |
| DUMMY=/does/not/exist/$RANDOM/$RANDOM/$RANDOM/$RANDOM | |
| WAIT_LOOP=0 | |
| # Usage ./sudosudo.sh command [args] |
| <!doctype html> | |
| <html> | |
| <head> | |
| <!-- | |
| Donation Address: 1NiNja1bUmhSoTXozBRBEtR8LeF9TGbZBN | |
| Notice of Copyrights and Licenses: | |
| *********************************** | |
| The bitaddress.org project, software and embedded resources are copyright bitaddress.org. | |
| The bitaddress.org name and logo are not part of the open source license. |
| def miller_rabin(n, k): | |
| # Implementation uses the Miller-Rabin Primality Test | |
| # The optimal number of rounds for this test is 40 | |
| # See http://stackoverflow.com/questions/6325576/how-many-iterations-of-rabin-miller-should-i-use-for-cryptographic-safe-primes | |
| # for justification | |
| # If number is even, it's a composite number | |
| if n == 2: |
| LD SP,$fffe ; $0000 Setup Stack | |
| XOR A ; $0003 Zero the memory from $8000-$9FFF (VRAM) | |
| LD HL,$9fff ; $0004 | |
| Addr_0007: | |
| LD (HL-),A ; $0007 | |
| BIT 7,H ; $0008 | |
| JR NZ, Addr_0007 ; $000a | |
| LD HL,$ff26 ; $000c Setup Audio |
