Question: CRYPTOGRAPHY math foundations 1. Let () = 6 + 3 + 2 + + 1 and () = 4 + 3 + 1 in (2)[].
CRYPTOGRAPHY math foundations
1. Let () = 6 + 3 + 2 + + 1 and () = 4 + 3 + 1 in (2)[]. Find the quotient of () () and the remainder.
2. Solve the system of modular equations: x =2 mod 3, x = 3 mod 7 and x = 2 mod 11.
3.Let Galois Field GF(24) with irreducible polynomial + + 1, f(x) = 3 + 1, and g(x) = + 1.
4.find c(x) = f(x)g(x) in GF(24) (remember to do remainder operation).
5.Express the multiplication c(x) = f(x)g(x) as bit string multiplication using the equivalence ax3 + bx2 + cx + d == (abcd). For example, 3 + 1 == (1001).
(optional students need to look for the fast exponentiation algorithm an do it accordingly) Use the fast exponentiation algorithm to calculate 2369 mod 71
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
Study Help