Why do we need discrete logarithm over normal logarithm? Find out whet | Cryptography 2079

Cryptography20795 marksNumerical: Primitive root modulo 7

Why do we need discrete logarithm over normal logarithm? Find out whether 3 is primitive root of 7 or not. [5]

Base to test: $g = 3$ - Prime modulus: $p = 7$ - Task: Determine whether 3 is a primitive root of 7. --- Normal (continuous) logarithm: If $b = a^i$ , then $i = \loga b$ . This is defined over real numbers and is easy to compute in both directions (forward exponentiation and backward log). It is ...

Base to test: $g = 3$ - Prime modulus: $p = 7$ - Task: Determine whether 3 is a primitive root of 7. --- Normal (continuous) logarithm: If $b = a^i$, then $i = \loga b$. This is defined over real numbers and is easy to compute in both directions (forward exponentiation and backward log). It is ...