The Discrete Logarithm Problem (Solved Example)

Network Security: The Discrete Logarithm Problem (Solved Example)
Topics discussed:
1) A solved example based on the discrete logarithm problem.

Music:
Axol x Alex Skrindo - You [NCS Release]

#NetworkSecurityByNeso #Cryptography #NetworkSecurity #DiscreteLogarithmProblem

[rajeshprajapati]

Answer to H.W. : x = 2, 5, 8, 11, 14

[tarushgupta]

1:34 its supposed to be log g X = n (mod p)
i mean it should be equals to and not congurent to

a (mod b) equals n ----> a/b gives remainder n
a congurent to n (mod b) a/b gives remainder n
a (mod b) congurent to n n/b gives remainder a
^ (or) n congurent to a (mod b)

[dartagnanvoegt]

Doesn't the format a = b(mod n) not mean b is the remainder of a/n. You have used this notation as if it were the same as a = b mod n which does mean a is the remainder of b / n. The the brackets do make a difference? Just asking as this is clashing with other sources I'm trying to learn from and confusing me, thankyou

[johnusadispatch]

Is there any other way rather than trying different values 1 by 1

[mohammadmuaj]

2 is not a primitive root of 7. so why does discrete logarithm still works for the last example homework

[chunlangong]

2^5 mod 11 =10, so x=5 is not the answer. the smallest positive answer only x=2 such that 2^2 mod 11=4.

[prameshanand]

lil bro there is supposed to be a equal sign there not the congruent one, sht got me confused af

[petrospaulos]

how come you have 1, 67 million subs and only 8k views??? 😂😂😂