>/categories/Crypto $

Learn with me - modular arithmetics

# What is Modular Arithmetic? Usually, when you want to perform division, you do something like: $$ \frac{3}{5} = 1,(6) \Rightarrow 1\frac{2}{3} $$ But there are some cases when you only need the remainder. $$ \frac{\text{Dividend}}{\text{Divisor}} = \text{Quotient} + \text{Remainder} $$ Where \\(\text{Quotient} = k \times \text{Divis

learn with me - public-key cryptography

## The Discrete Logarithm Problem Now that you understand modular arithmetic, we can move on to its applications. In the previous post, we discussed how to perform modular computations. Now, it's time to learn how these computations are used in cryptography. Calculating the remainder in an equation like this might be easy: $$ 5^{13}\bmod{17} =