Skip to content

Commit e83d933

Browse files
committed
fix(crypto): more latex fixes
1 parent 6696b2c commit e83d933

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

fallctf-2024/src/crypto/crypto.md

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -59,7 +59,7 @@ Nowadays, you can see why this is very insecure. There are only 26 possible shif
5959
### XOR and One-Time-Pads
6060
One of the most basic modern cryptographic tools is the Exclusive-Or operation, also called XOR. In math it gets denoted
6161
by `x ⊕ y`, while in code we use `x ^ y`.
62-
If $x$ and $y$ are 2 bits (0 or 1), `x ^ y` is defined to be one if and only if one of `x` or `y` is 1, but not both. Another way to think about it is that the XOR returns `1` if the bits are different:
62+
If `x` and `y` are 2 bits (0 or 1), `x ^ y` is defined to be one if and only if one of `x` or `y` is 1, but not both. Another way to think about it is that the XOR returns `1` if the bits are different:
6363

6464
| x | y | x^y |
6565
|---|---|-----|

0 commit comments

Comments
 (0)