a)
b)
So
c) Comparing the two tables, we have:
So that
Let p 37, and let g-5, which is a primitive root. Let h 31. We will...
8. Let g be a primitive root of an odd prime p, and suppose that p3 (mod 4). Show that -g is not a primitive root of p.
8. Let g be a primitive root of an odd prime p, and suppose that p3 (mod 4). Show that -g is not a primitive root of p.
Let
p be an odd prime. Prove that if g is a primitive root modulo p,
then g^(p-1)/2 ≡ -1 (mod p).
Let p be an odd prime. Prove that if g is a primitive root modulo p, then go-1)/2 =-1 (mod p) Hint: Use Lemma 2 from Chapter 28 (If p is prime and d(p 1), then cd-1 Ξ 0 (mod p) has exactly d solutions).
Let p be an odd prime. Prove that if g is a primitive...
2.5. Let p be an odd prime and let g be a primitive root modulo has a square root modulo p if and only if its discrete logarithm log,(a) mod p. Prove t that is even.
Need help!! Please help — crypto math
1. Determine L13(18) for p 19. 2. Let p be prime, and α a primitive root mod p. Prove that α(p-1)/2-_1 (mod p). 3. It can be shown that 5 is a primitive root for the prime 1223. You want to solve the discrete logarithm problem 53 (mod 1223). You know 3611 Prove it. 1 (mod 1223). Is x even or odd?
1. Determine L13(18) for p 19. 2. Let p be prime,...
Let g be a primitive root modulo to the odd prime p. Prove that: 2)=-1 2)=-1
7.23 Theorem. Let p be a prime congruent to 3 modulo 4. Let a be a natural number with 1 a< p-1. Then a is a quadrutic residue modulo pif and only ifp-a is a quadratic non-residue modulo p. 7.24 Theorem. Let p be a prime of the form p odd prime. Then p 3 (mod 4). 241 where q is an The next theorem describes the symmetry between primitive roots and quadratic residues for primes arising from odd Sophie...
Prove the given definition, for parts a) through c).
Lemma 9.3.5 (Orthogonality Lemma). Fir N and let w-wN-e2mi/N be the natural primitive Nth root of unity in C. Fort Z/(N), we have: N-1 ktN ift-0 (mod N), 0 otherwise. Lukt (9.3.5) k-0 9.3.2. (Proves Lemma 9.3.5) Fix N є N, and let w-e2m/N. Let f(x)-r"-1. o510 (a) Explain why N-1 (9.3.9) (Suggestion: Try writing out the sum as 1 +z+....) (b) Explain why for any t є z/(N), fw)-0. (c)...
please prove proofs and do
7.4
7.2 Theorem. Let p be a prime, and let b and e be integers. Then there exists a linear change of variahle, yx+ with a an integer truns- farming the congruence xbx e0 (mod p) into a congruence of the farm y (mod p) for some integer 8 Our goal is to understand which integers are perfect squares of other inte- gers modulo a prime p. The first theorem below tells us that half...
8. Let p be an odd prime. In this exercise, we prove a famous result that characterizes precisely when -1 has a sqare root 1 mod 4. (You will need Wilson's Theorem for one (mod p). Prove: a 2--1 mod p has a solution if and only if p dircction of the proof.)
8. Let p be an odd prime. In this exercise, we prove a famous result that characterizes precisely when -1 has a sqare root 1 mod 4....
(d) Decrypt the ciphertext message LEWLYPLUJL PZ H NYLHA ALHJOLY that was encrypted with the shift cipher f(p) (p+7) mod 26. [10 points] (e) [Extra Credit - 5 points] Encrypt the message "BA" using the RSA cryptosystem with key (ne) = (35,5), where n = p . q 5-7 and ged(e, (p-1) 1)) (5, 24) 1. 6. [5 points each (a) Is 2 a primitive root of 11? (b) Find the discrete logarithm of 3 modulo 11 to the base...