A comprehensive, powerful command-line toolkit for classical cryptanalysis, cipher breaking, and automated brute-forcing. Designed for cryptography enthusiasts.
##Features
CCT is divided into four main categories, accessible via an interactive terminal launcher.
Tools to encrypt, decrypt, and brute-force classical substitution ciphers:
- Caesar Cipher
- Vigenère Cipher
- Beaufort Cipher
- Porta Cipher
- Autoclave Cipher
- Running Key Cipher
- Playfair Cipher (Includes Memetic Algorithm optimization)
- Four-Square Cipher
- Affine Cipher
- Hill Cipher
- Gronsfeld Cipher
- Gromark Cipher
- Polybius Square
- Bifid Cipher
- XOR Cipher
- Modular Add/Sub
Tools for ciphers that rearrange the plaintext without changing the alphabet:
- Columnar Transposition
- Scytale Cipher
- Rail Fence Cipher
The core strength of the CCT lies in its algorithmic approaches to cracking ciphers without knowing the key. Recent updates include a Dynamic Fitness Engine supporting Pure N-Gram, Pure IoC Tolerance, and Combined scoring to actively strip away layers of Double Ciphers.
- Simulated Annealing (SA): Cracks completely random Simple Substitution and complex Polyalphabetic ciphers from scratch using thermal cooling, with N-gram/IoC scoring.
- Genetic Algorithms (GA): Breeds and mutates generations of keys to crack highly complex systems like the Gromark Cipher.
- Hill Climbing: Unscrambles complex transpositions and polyalphabetic sequences by optimizing bigram fitness.
- Vigenère Auto-Solver: Fully automated frequency analysis and key deduction for standard Vigenère ciphers.
- Word Pattern Isomorphism: Instantly solves space-preserving substitution ciphers by mapping word shapes (e.g.,
1-2-2-1-3-4) against a dictionary (e.g.,ATTACK). - Automated Crib Dragging: "Drags" a suspected plaintext word across a ciphertext to reveal underlying key snippets.
- Kasiski Examination: Analyzes polyalphabetic ciphers to find repeating substrings and deduce the key length.
- Friedman Test: Mathematically estimates polyalphabetic key lengths using the Index of Coincidence (IoC).
- Matrix Permutation Solver: Generates and solves matrix-based permutations.
- Calculate IoC (Index of Coincidence): Determines whether a cipher is monoalphabetic or polyalphabetic.
- Frequency Analysis: Plots character deviations against standard English text.
- Keyword Alphabet Generator: Generates mixed keyed alphabets.
- Text Formatter: Cleans and formats ciphertexts.
- Matrix Generator: Dumps all possible
n x mpermutations of a ciphertext string.
- Clone the repository to your local machine:
git clone [https://github.com/hippie-cycling/CBFT.git](https://github.com/hippie-cycling/CBFT.git)