Cryptography

Main resource: . What is Modular Arithmetic? Where \(A\) and \(B\) are integers, we can write: $$ \frac{A}{B} = Q \text{ remainder } R $$ Using the same \(A, B, Q, \text{ and } R\) as above, we have: $$ A \text{ mod } B = R $$ \(A \text{ mod } B\) can be visualized as taking \(A\) steps on a clock that runs from \(0\) to \(B-1\). If the number is positive we step clockwise, if it’s negative we step counterclockwise....