1. Multiply 10010111 00000111 in GF Use the irreducible polynomial
2. Suppose you encrypt a message m by computing C = m23 (mod 30). Assume that ged(m, 30)
1. Find a decryption exponent d such that c = m (mod 30)? (Hint: 30 is not the product of two
prime numbers, as RSA requests, but the same principle works. Remember our basic principle
which is derived from Euler Theorem: in modular exponentiation mod n what matters is how
much is the exponent mod (p(n). You will need to determine formula I gave you. Then think about the property (23- d) should the number have, and derive
d based on this.)
This material may consist of step-by-step explanations on how to solve a problem or examples of proper writing, including the use of citations, references, bibliographies, and formatting. This material is made available for the sole purpose of studying and learning - misuse is strictly forbidden.