XOR, often written ⊕, is one of the basic operations on bits and bit-sequences. It is a building block of many cryptographic primitives (and some higher-level algorithms, like modes of operations).
5
votes
0answers
380 views
How can I find two strings $m_1$ and $m_2$, knowing that I know $m_1 \oplus m_2$? [duplicate]
Possible Duplicate:
How does one attack a two-time pad (i.e. one time pad with key reuse)?
I recently started to follow the cryptography class of Dan Boneh on coursera.org and the first ...
6
votes
1answer
374 views
Why Addition Mod 32?
I was looking at the algorithm for Twofish, and I noticed that in some places a XOR is used, but in others, they use "addition modulo-32." What makes modulo-32 special? Why not always use XOR? Why not ...
