Loading...
110 tools
A random password generator to create strong and secure passwords. To ensure security, they are generated on the webpage without being sent over the internet.
Query DNS records with email security analysis and health scoring
Encode and decode Base64, Hex, Binary, and other formats with file support
Decode and analyze JSON Web Tokens with security validation
Debug OAuth 2.0 and OpenID Connect flows with JWT decoder, PKCE generator, flow tester, and error troubleshooting
Transforming text with a classic substitution method, the ROT13 Cipher provides a simple way to obfuscate messages and data. It operates by shifting each letter 13 places forward in the alphabet, effectively wrapping around once it reaches the end. Because the English alphabet contains 26 letters, applying the same process twice restores the original content, making it an efficient tool for both encoding and decoding without needing a separate key. Developers, puzzle enthusiasts, and online community members often use this method to hide spoilers, punchlines, or sensitive information from casual viewing. While it does not provide cryptographic security against modern threats, it serves as a reliable way to ensure that text remains unreadable until the recipient chooses to reveal it. This utility supports both the standard ROT13 algorithm and general Caesar cipher shifts, offering flexibility for various obfuscation needs.
Decode and analyze SSL/TLS certificates with security validation
Free XOR encryption and decryption online. Encrypt text, decode XOR ciphertext, brute force cryptanalysis
Encrypt and decrypt text or files with AES-256-GCM, AES-CBC, or AES-CTR. Runs in your browser.
Security professionals and malware analysts use Entropy Analyzer to measure the randomness of data within binary files. By calculating Shannon entropy, the utility identifies areas of high complexity that often signal the presence of packed, encrypted, or obfuscated code. This quantitative approach helps researchers quickly distinguish between standard executable instructions and hidden payloads that might be attempting to evade signature-based detection. Analyzing file entropy serves as a critical first step in the reverse engineering and incident response process. High entropy scores across specific sections frequently indicate that a file has been compressed or transformed to hide its true intent. Integrating this analysis into a security workflow allows for more efficient triage of suspicious samples, enabling teams to prioritize which binaries require deeper manual inspection or automated sandbox detonation.
Encrypt and decrypt text with Caesar cipher (ROT-N), frequency analysis, auto-detection, and visual cipher wheel
The Vigenère Cipher provides an interactive platform for encrypting and decrypting text using one of the most famous polyalphabetic substitution methods. By applying a keyword to shift characters across multiple alphabets, it adds a layer of complexity beyond simple substitution ciphers. Users can explore the mechanics of the algorithm through a Tabula Recta visualization, which clearly maps how plaintext and keys interact to produce ciphertext. Security enthusiasts and students of cryptography can perform deep analysis on encrypted messages using integrated tools like Kasiski examination and Index of Coincidence. These features help identify repeating patterns and key lengths, facilitating automated key recovery for educational or testing purposes. Whether for learning the history of codes or analyzing ciphertext, this resource offers a comprehensive set of tools for classical cryptanalysis.
Monoalphabetic substitution cipher with interactive solving assistant, frequency analysis, and pattern finder
Collection of classical cipher tools for encryption, decryption, and cryptanalysis including Caesar, Vigenère, and substitution ciphers
Analyzing unknown ciphertext becomes significantly easier with a system that automatically identifies the most likely encryption methods used. By examining the structural characteristics of a provided text, the Cipher Identifier evaluates statistical data such as letter frequencies and the Index of Coincidence to narrow down the possibilities. This process allows users to quickly distinguish between various classical and modern ciphers without manual trial and error. Cryptographers, security students, and puzzle enthusiasts find value in this utility when faced with encrypted strings of unknown origin. Pattern matching algorithms look for specific markers that indicate substitution, transposition, or polyalphabetic encryption techniques. Identifying the underlying cipher is the critical first step in decryption, making this an essential starting point for any cryptographic analysis or educational exercise.
The Affine Cipher utility provides a straightforward way to apply one of the classic monoalphabetic substitution ciphers to text. By using the mathematical formula (ax + b mod 26), users can transform plain text into ciphertext or reverse the process with ease. It simplifies the complexities of modular arithmetic, handling the necessary calculations for the multiplier and shift parameters automatically. Cryptographers, students, and hobbyists find this resource useful for exploring historical encryption or solving cryptographic puzzles. Beyond basic transformation, the interface includes a modular inverse calculator to ensure chosen parameters are valid for encryption. For situations where the encryption key is unknown, the built-in brute force mode systematically tests possible combinations to recover the original message. This implementation ensures that mathematical constraints are met while providing instant results. It serves as an educational resource for understanding how linear functions interact with alphabet mapping, making it a practical addition to any security-focused digital workspace.
Ancient Hebrew reverse alphabet cipher (A↔Z, B↔Y). Self-inverse cipher with visual alphabet mapping
Transposition cipher that writes text in zigzag pattern. Visual diagram and brute force mode included
Encryption enthusiasts and students of cryptography can use the Playfair Cipher to encrypt and decrypt messages using a manual symmetric encryption technique. Unlike simple substitution ciphers that replace single letters, this system utilizes a 5x5 grid of letters generated by a secret keyword to process pairs of letters, or digraphs. By arranging the alphabet within this matrix, the cipher creates a layer of security that is significantly more robust than standard monoalphabetic substitution. The interface provides a visual representation of the keyword matrix, which updates dynamically based on the chosen key. It clearly displays the specific encoding rules, ensuring that users can follow the logic behind every character shift and substitution. This resource is ideal for those learning about classical encryption methods or anyone looking to experiment with historical cryptographic systems in a modern digital environment. The automated processing handles the manual steps of the cipher, providing instant results for both encoding and decoding tasks.
The Beaufort Cipher provides a streamlined approach to polyalphabetic substitution, offering a classic method for securing text through a self-reciprocal process. While it shares similarities with the Vigenère cipher, it utilizes a specific mathematical operation where the same steps are used for both encryption and decryption. By calculating the difference between a keyword and the message, it creates a complex ciphertext that requires the specific key to reverse, making it a fascinating study in historical cryptography. Security enthusiasts and students of mathematics use this implementation to explore the mechanics of historical ciphers without manual calculations. The interface simplifies the process of applying a repeating keyword across a message, ensuring that each letter is transformed based on its position and the corresponding key character. It serves as a practical resource for those learning about the evolution of cryptographic standards and the logic behind reciprocal encryption systems.
The Hill Cipher facilitates the encryption and decryption of text through a classical polygraphic substitution method based on linear algebra. By processing blocks of characters simultaneously, it utilizes matrix multiplication to transform plaintext into secure ciphertext. This implementation offers flexibility by supporting both 2x2 and 3x3 key matrices, catering to varying levels of cryptographic complexity. Security students and cryptography enthusiasts benefit from the integrated inverse matrix calculator, which streamlines the often difficult task of determining decryption keys. The interface allows for immediate validation of mathematical transformations, making it a valuable resource for learning the mechanics of historical ciphers. It provides a reliable way to test custom keys and observe how different matrix configurations impact the resulting output.
Historical cryptography comes to life through this interactive Enigma machine simulator. Users can explore the inner workings of the famous World War II cipher device by configuring authentic rotor sets I through V, selecting reflectors, and setting up the complex plugboard. As text is entered, the simulator provides a real-time visualization of the electrical signal path, demonstrating how mechanical components transformed plain language into sophisticated code. This simulator serves as a practical educational resource for students, history enthusiasts, and cryptography professionals interested in the mechanics of 20th-century security. By allowing manual adjustment of every setting, it provides a tactile understanding of how polyalphabetic substitution works in a mechanical context. Whether used for learning about Alan Turing's codebreaking efforts or simply experimenting with historical encryption methods, the simulator offers a precise and accessible way to engage with a pivotal piece of security history.
Theoretically unbreakable cipher with random key generation. XOR encryption with perfect secrecy when used correctly
Interactive RSA encryption with small primes. See key generation, encryption, decryption step-by-step. Break RSA to understand why key size matters.