Encryption Calculator

Encryption is the process of transforming readable information — called plaintext — into an unreadable scrambled form called ciphertext, using a mathematical algorithm and, in most cases, a key. Only someone who possesses the correct key and algorithm can reverse the process and recover the original message. Encryption is one of the oldest and most fundamental practices in information security, with roots stretching back thousands of years to ancient Egypt, Rome, and the Arab world.

In everyday digital life, encryption protects your banking sessions, private messages, passwords, and healthcare records from eavesdroppers and attackers. Every time you see "https://" in your browser's address bar, a modern encryption protocol (TLS) is keeping your data private in transit. Every time you log in with a password, that password is (or should be) stored as a cryptographic hash — a one-way transformation that prevents the raw password from ever being saved in plaintext.

Understanding the principles behind encryption is valuable for developers, security students, and curious learners alike. This encryption calculator exposes several classical cipher algorithms — Caesar, Vigenere, ROT13, Atbash, XOR, Morse code, binary, and reverse — in an interactive tool that lets you experiment with encryption and decryption instantly. While these classical ciphers are not secure by modern standards, studying them builds intuition for how substitution, transposition, and key-based transformations work, which are the same conceptual building blocks found in AES, RSA, and other modern algorithms.

Encryption differs from encoding and hashing in important ways. Encoding (such as Base64 or URL encoding) transforms data into a different format for compatibility — it is reversible without any key. Hashing (such as SHA-256 or MD5) is a one-way function with no intended reversal. Encryption is specifically designed to be reversible, but only by an authorized party who holds the decryption key. This encryption calculator supports both encrypt and decrypt operations for all supported ciphers, making it easy to observe the full round-trip transformation.

This encryption calculator supports eight distinct cipher algorithms. Each one uses a different mathematical transformation. Understanding the mechanism behind each cipher helps you choose the right one for educational demonstrations and puzzle-solving.

Caesar Cipher

The Caesar cipher shifts every alphabetic character forward (for encryption) or backward (for decryption) by a fixed number of positions in the alphabet, wrapping around from Z back to A. The shift amount is the key. For example, with a shift of 3, the letter "A" becomes "D", "B" becomes "E", and "Z" becomes "C". Non-alphabetic characters (digits, spaces, punctuation) pass through unchanged.

ROT13

ROT13 is a special case of the Caesar cipher with a fixed shift of 13. Because the English alphabet has 26 letters and 13 is exactly half of 26, applying ROT13 twice always restores the original text. This means the encrypt and decrypt operations are identical — you simply apply ROT13 again to undo it. ROT13 is commonly used to hide spoilers and puzzle answers in online forums.

Atbash

Atbash is an ancient Hebrew cipher that maps each letter to its mirror-image position in the alphabet: A becomes Z, B becomes Y, C becomes X, and so on. Like ROT13, it is its own inverse — applying Atbash twice returns the original text. The name comes from the Hebrew letters Aleph-Tav-Beth-Shin, reflecting the A→Z and B→Y substitutions.

Vigenere Cipher

The Vigenere cipher is a polyalphabetic substitution cipher that uses a keyword rather than a single shift value. The keyword is repeated to match the length of the plaintext. Each alphabetic character in the plaintext is shifted by the alphabetic position of the corresponding keyword character (A=0, B=1, …, Z=25). Because different characters are shifted by different amounts, the Vigenere cipher resists simple frequency analysis that defeats the Caesar cipher.

XOR Cipher

The XOR cipher applies a bitwise exclusive-OR operation between each character's ASCII code and a numeric key (0–255). XOR encryption is symmetric: applying the same XOR key a second time restores the original value. While not cryptographically secure on its own, XOR is a core building block in stream ciphers and block cipher modes such as CTR and CFB.

Morse Code, Binary, and Reverse

Morse code encodes each letter and digit as a sequence of dots and dashes. Binary encoding represents each character as its 8-bit ASCII binary code, separated by spaces. Reverse simply mirrors the entire input string. These three transformations are technically encodings rather than ciphers, but they are included as useful educational demonstrations of character-level transformations.

The Caesar cipher is one of the earliest known substitution ciphers, named after Julius Caesar who reportedly used a shift of 3 to protect military communications around 58 BCE. Despite its extreme simplicity by modern standards, it illustrates every essential concept of symmetric encryption: a plaintext input, a key (the shift value), a deterministic transformation, and an inverse transformation (decryption) that recovers the original message.

The mathematical formula for Caesar encryption is straightforward. For each alphabetic character, compute its zero-based position in the alphabet (so A=0, B=1, …, Z=25), add the shift value, take the result modulo 26 to wrap around the end of the alphabet, then convert back to a character. For decryption, subtract the shift instead of adding it — or equivalently, add (26 - shift) % 26 to keep the arithmetic positive before applying modulo 26.

The code in this calculator uses the formula ((char.charCodeAt(0) - base + actualShift + 26) % 26) + base, where base is 65 for uppercase letters and 97 for lowercase letters. Adding 26 before the modulo operation ensures the result is never negative even when the shift is negative (during decryption), which is a common implementation guard in modular arithmetic.

The Caesar cipher is trivially broken by brute force: there are only 25 possible non-trivial shift values, so an attacker can try all of them in seconds and identify the correct one by checking which result produces readable English. This is why frequency analysis and brute-force attacks are so effective against it. Understanding the Caesar cipher's weaknesses directly motivates the design of stronger ciphers such as Vigenere (which uses a multi-character key to vary the shift) and ultimately modern block ciphers (which use much larger key spaces and non-linear substitution).

The table above illustrates the wrap-around behavior: X (position 23) shifts to A (position 0), Y shifts to B, and Z shifts to C. This wrapping is handled by the % 26 modulo operation in the formula.

The Vigenere cipher was considered unbreakable for nearly three centuries after its introduction in the 16th century — earning it the nickname "le chiffre indéchiffrable" (the indecipherable cipher). Its strength over the Caesar cipher comes from using a multi-character keyword that changes the shift amount for each position in the plaintext, defeating simple frequency analysis.

The Vigenere algorithm works as follows. The keyword is converted to uppercase and any non-alphabetic characters are removed. It is then repeated cyclically to match the length of the plaintext. For each alphabetic character at position i in the plaintext, the shift is the alphabetic index of the corresponding keyword character (A=0, B=1, …, Z=25). The formula is identical to Caesar but uses a position-specific shift value: C = ((P - base + K_i + 26) % 26) + base. Decryption subtracts K_i instead.

For example, encrypting "HELLO" with keyword "KEY" proceeds as follows. The keyword cycles as K-E-Y-K-E (positions 10, 4, 24, 10, 4). "H" (position 7) shifts by 10 to "R"; "E" (4) shifts by 4 to "I"; "L" (11) shifts by 24 to "J"; "L" (11) shifts by 10 to "V"; "O" (14) shifts by 4 to "S". The encrypted result is "RIJVS".

The XOR cipher operates at the byte level rather than the alphabet level. For each character, the calculator computes char.charCodeAt(0) ^ keyCode, where ^ is the bitwise XOR operator and keyCode is a numeric key from 0 to 255. XOR has the self-inverse property: (A ^ K) ^ K = A for any values A and K. This means the exact same operation encrypts and decrypts the data — you simply apply XOR with the same key again. This symmetric property makes XOR extremely efficient and is why it appears in virtually every modern stream cipher and is used in building block cipher modes like CTR and OFB.

Note that a single-byte XOR key is not cryptographically secure: an attacker who knows or guesses even a few characters of plaintext can immediately recover the key by XOR-ing the known plaintext with the corresponding ciphertext bytes. Multi-byte or key-stream XOR (as used in one-time pads and stream ciphers) is much stronger but requires proper key management to be secure.

While classical ciphers are not suitable for protecting sensitive data against modern attackers, they have a wide range of legitimate and practical applications in education, games, puzzles, and low-stakes obfuscation. Understanding where and why to use this encrypt and decrypt text calculator helps you get the most value from it.

• Computer science and cryptography education: Teachers and students use Caesar, Vigenere, and Atbash ciphers to illustrate core cryptographic concepts — substitution, transposition, key spaces, and frequency analysis — before moving on to modern algorithms like AES and RSA. This calculator makes it easy to demonstrate these concepts interactively in a classroom or self-study setting.
• Puzzle design and escape rooms: Game designers use ROT13, Atbash, Caesar, and Morse code as puzzle elements in escape rooms, treasure hunts, ARGs (alternate reality games), and online puzzle competitions. These ciphers are well-known enough that solvers can recognize and decode them with the right hint, but obscure enough to provide a satisfying challenge for beginners.
• Capture the Flag (CTF) competitions: CTF security competitions frequently include challenges where participants must decrypt messages encoded with classical ciphers. Having a reliable online encryption calculator that handles multiple cipher types in one tool speeds up the solving process significantly.
• Spoiler and content hiding: ROT13 is traditionally used in online forums (especially Reddit and Usenet) to hide spoilers, offensive jokes, or puzzle answers. Readers who want to see the content can easily decode it, while those who want to avoid it simply skip the ROT13 text.
• Morse code communication: Morse code was the dominant long-distance communication standard from the 1840s through the mid-20th century. It remains relevant in amateur (ham) radio, aviation, and as an accessibility input method. The Morse code mode in this calculator converts text to standard International Morse Code and back.
• Learning bitwise operations: The XOR cipher is an excellent hands-on way to understand how bitwise XOR works on character data, which is a prerequisite for understanding stream ciphers, one-time pads, and the XOR-based mixing steps inside modern hash functions and block ciphers.

For any application where real security is required — protecting passwords, financial data, private messages, or personal health information — you should use modern, peer-reviewed cryptographic algorithms and libraries such as AES-256-GCM, ChaCha20-Poly1305, or RSA-OAEP, implemented through trusted libraries like the Web Crypto API, libsodium, or OpenSSL. The classical ciphers in this tool are purely educational.