Tool to decrypt/encrypt with XOR cipher (eXclusive OR), a moder cryptographic method that consists in encrypting a binary message with a repeated key using a XOR multiplication.
XOR Cipher - dCode
Tag(s) : Modern Cryptography
dCode is free and its tools are a valuable help in games, maths, geocaching, puzzles and problems to solve every day!
A suggestion ? a feedback ? a bug ? an idea ? Write to dCode!
XOR encryption is a symmetrical encryption/decryption method based on the use of the logical/binary operator XOR (also called Exclusive Or, symbolized by ⊕). The XOR cipher uses as operands the plain text and the key (previously encoded in binary/bit string).
The XOR operation takes 2 bits as input and returns one bit as output according to the following truth table: if the two bits are different, the result is 1, otherwise the result is 0.
Example: Encrypt the plain message 1001 with the key 10
Take the first bit of the plain text and the first bit of the key and multiply then using XOR operation to get the ciphered bit.
Example: 1 ⊕ 1 = 0
The operation is repeated with the second bit of the plaintext and the second bit of the key. At the end of the key, loop back to the first bit.
XOR Decryption (UnXOR/DeXOR) is identical to encryption because the XOR operation is symmetrical (reverse XOR = XOR).
Example: 1001 ⊕ 1010 = 0011 and 0011 ⊕ 1010 = 1001
dCode manages the conversion automatically, but by default the ASCII encoding table for classic characters (letters of the alphabet or numbers) allows each character to be coded by a number between 0 and 127, which is then converted to base 2 (binary). For accented or less common characters (symbols, emojis, etc.) dCode uses Unicode.
The truth table of the 2-parameter XOR logic function is:
|A||B||A xor B|
A xored message (XOR encrypted message) has no particularities, this makes it hard to detect.
It can be presented under binary form but also as ascii text.
Data in the form of a stream is well suited to XOR encoding.
The XOR operation is one of the basics of logical computing. Computer processors can perform this type of calculation immediately, billions of times per second, which is therefore useful if computing resources are limited.
The XOR operation has the advantage of being reversible and above all symmetrical by applying the same algorithm, which further simplifies the calculations.
XOR encryption provides some cryptographic security when the key is as large as the original message, otherwise XOR is vulnerable to known-plaintext attacks.
Xor decryption without knowing the key is hard. It is possible to find all or a part of the key by knowing a part of the plain text. Else, there are no practical methods other than trying all the keys.
XOR is compatible with the principle of autoclave cipher.
Reminder : dCode is free to use.
The copy-paste of the page "XOR Cipher" or any of its results, is allowed (even for commercial purposes) as long as you cite dCode!
Exporting results as a .csv or .txt file is free by clicking on the export icon
Cite as source (bibliography):
XOR Cipher on dCode.fr [online website], retrieved on 2023-09-30,