649's repositories
Memcrashed-DDoS-Exploit
DDoS attack tool for sending forged UDP packets to vulnerable Memcached servers obtained using Shodan API
Crashcast-Exploit
This tool allows you mass play any YouTube video, terminate apps and rename Chromecast device(s) obtained from Shodan.io
Crash-iOS-Exploit
Repository dedicated to storing a multitude of iOS/macOS/OSX/watchOS crash bugs. Some samples need to be viewed as raw in order to see the Unicode. Please do not intentionally abuse these exploits.
Netscraped-Exploit
Framework for obtaining all the credentials stored in vulnerable Netwave IP cameras. Can be used to break into IP cameras, use for research only.
APT38-DYEPACK
Reverse engineered APT38 DYEPACK samples used to empty SWIFT banking servers. Use caution when handling live binaries.
Mifare-Skimmer
Arduino based device for reading Mifare cards from a distance using RC522 module and an OLED display for portable reading of card data.
Vendont-Scraper
Vendont is a Venmo transaction finder/scraper. It uses Venmo's own public API system to fetch all transactions at a given time.
Arduino-badUSB
Arduino badUSB framework for launching HID payloads. Comes with preconfigured payload selector and web service. Uses Arduino Leonardo board, LCD keypad, and ethernet shield.
Binary-Search-Tree
A binary search tree (BST) is a binary tree where each node has a comparable key (and an associated value) and satisfies the restriction that the key in any node is larger than the keys in all nodes in that node's left subtree and smaller than the keys in all nodes in that node's right subtree.
Matrix-Chain-Multiplication
Dynamic programming algorithm: matrix chain multiplication, where the goal is to find the most computationally efficient matrix order when multiplying an arbitrary number of matrices in a row.
Rijndael-Encryption-Algorithm
The Advanced Encryption Standard (AES), also known by its original name Rijndael is a specification for the encryption of electronic data established by the U.S. National Institute of Standards and Technology (NIST) in 2001.
Redditor-Bot
This is a Reddit bot that scans all possible 3-character (A-Z, 0-9, _, -) usernames and determines which ones are available.
The-Collection-Statistics
Domain and TLD statistics of "The Collection (1-5), Antipublic, AP MYR & Zabugor" breach exposure. Contains number of matches per file within, based on provider.
Max-Subarray
The maximum subarray problem is the task of finding the contiguous subarray within a one-dimensional array, a[1...n], of numbers which has the largest sum. This script solves the max subarray problem via divide-and-conquer with O(nlogn) time complexity.
Python-Tutorials
Easy to follow Python tutorials for any beginners! Scripts are labelled in accordance to its category. Helpful commenting is also included.
gpt4all-ui
Simple Docker Compose to load gpt4all (Llama.cpp) as an API and chatbot-ui for the web interface. This mimics OpenAI's ChatGPT but as a local instance (offline).
Hash-Table
A hash table is a data structure that implements an associative array abstract data type, a structure that can map keys to values. Lookups are O(1). Collisions are solved using chaining method in which chained indexes are O(n).
Heap-Sort
Heapsort is a comparison-based sorting algorithm. Heapsort can be thought of as an improved selection sort: like that algorithm, it divides its input into a sorted and an unsorted region, and it iteratively shrinks the unsorted region by extracting the largest element and moving that to the sorted region.
Huffman-Codes
A Huffman code is a particular type of optimal prefix code that is commonly used for lossless data compression.
Insertion-Sort
Insertion sort is a simple sorting algorithm that builds the final sorted array (or list) one item at a time.
Linguana-Framework
Linguistics Fingerprint Analyser. Finds authorship within bodies of text using various language analysis techniques.
Merge-Sort
Merge sort is an efficient, general-purpose, comparison-based, divide and conquer sorting algorithm.
PHP-Tutorials
Easy to follow PHP tutorials for any beginners! Scripts are labelled in accordance to its category. Helpful commenting is also included.
Quick-Sort
Quicksort is an efficient sorting algorithm, serving as a systematic method for placing the elements of an array in order.
Radix-Sort
Radix sort is a non-comparative integer sorting algorithm that sorts data with integer keys by grouping keys by the individual digits which share the same significant position and value.
Rod-Cutting
Dynamic programming algorithm: given a rod of length n inches and a table of prices "Pi", i=1,2,…,n, this algorithm finds the maximum revenue "Rn" obtainable by cutting up the rod and selling the pieces.
SPUZBlogGen
Python application that's used to produce spuz.me blog posts. Feel free to use this script to contribute to SPUZ or to reverse engineer and produce your own blog posts!
student-list
Every student that attended the class