One Time Pad

[Pigeon]

I think it is about the range of values that can result based on constants that are used.

[Pigeon]

But encryption based on the 12 hour clock is very interesting!

Using Modulo, remainder after division. That is how one-time pads are often done. It helps hide the inputs.

Using it in encryption process requires a random key.

[Pigeon]

Basing it on hiding how it works is considered weak because with a few examples it will most likely be cracked.

Everyone knows how the best encryption is performed, it is just difficult to determine the proper keys or reverse the process in real time.

[Pigeon]

Exclusive OR is a common component.

Truth table

1 xor 1 = 0
1 xor 0 = 1
0 xor 1 = 1
0 xor 0 = 0

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 cipher is therefore sometimes used for hiding information in cases where no particular security is required.

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 even in theory.

In any of these ciphers, the XOR operator is vulnerable to a known-plaintext attack, since plaintext XOR ciphertext = key.

Link