# Symmetric XOR cipher library

## About XOR cipher

XOR Encryption is an encryption method used to encrypt data and is hard to crack by brute-force method, i.e generating random encryption keys to match with the correct one.
The XOR Encryption algorithm is a very effective yet easy to implement method of symmetric encryption. Due to its effectiveness and simplicity, the XOR Encryption is an extremely common component used in more complex encryption algorithms used nowadays.
In cryptography, the **simple XOR cipher** is a type of *additive cipher*, an encryption algorithm that operates according to the principles:

```
A XOR 0 = A,
A XOR A = 0,
A XOR B = B XOR A,
(A XOR B) XOR C = A XOR (B XOR C),
(B XOR A) XOR A = B XOR 0 = B
```

where `XOR`

denotes the exclusive disjunction (XOR) operation. This operation is sometimes called modulus 2 addition (or subtraction, which is identical). With this logic, a string of text can be encrypted by applying the bitwise XOR operator to every character using a given key. To decrypt the output, merely reapplying the XOR function with the key will remove the cipher.

The XOR operator is extremely common as a component in more complex ciphers. By itself, using a constant repeating key, a simple XOR cipher can trivially be broken using frequency analysis. If the content of any message can be guessed or otherwise known then the key can be revealed. Its primary merit is that it is simple to implement, and that the XOR operation is computationally inexpensive. A simple repeating XOR (i.e. using the same key for xor operation on the whole data) cipher is therefore sometimes used for hiding information in cases where no particular security is required. The XOR cipher is often used in computer malware to make reverse engineering more difficult.

If the key is random and is at least as long as the message, the XOR cipher is much more secure than when there is key repetition within a message. When the keystream is generated by a pseudo-random number generator, the result is a stream cipher. With a key that is truly random, the result is a one-time pad, which is unbreakable in theory.

The XOR operator in any of these ciphers is vulnerable to a known-plaintext attack, since *plaintext* ^ *ciphertext* = *key*. It is also trivial to flip arbitrary bits in the decrypted plaintext by manipulating the ciphertext. This is called malleability.

## Usage example

```
import 'package:xor_cipher/xor_cipher.dart';
void main() {
const source = 'Hello ðŸ¦Š world!!!';
const secret = 'Top ðŸ˜º secret';
print(
'Source: $source\n'
'Secret: $secret',
);
final encrypted = XOR.encrypt(source, secret, urlEncode: true);
print('Encrypted: $encrypted');
final decrypted = XOR.decrypt(encrypted, secret, urlDecode: true);
print(
'Decrypted: $decrypted\n'
'Identical: ${identical(source, decrypted)}',
);
}
```

## Coverage

## Changelog

Refer to the Changelog to get all release notes.