data security question
Posted: Thu May 05, 2022 1:39 pm
data security question
3. (25 points) Find your own prime number p. (a) Consider the multiplicative group F and find a generator (primitive root) of it. Hint: F; has o(p)=p-1 elements and the order of an element must divide the order of group. (b) Use the extended Euclidean Algorithm to compute the inverse of 5 mod p.
3. (25 points) Find your own prime number p. (a) Consider the multiplicative group F and find a generator (primitive root) of it. Hint: F; has o(p)=p-1 elements and the order of an element must divide the order of group. (b) Use the extended Euclidean Algorithm to compute the inverse of 5 mod p.