9. an rsa cryptosystem has modulus n 391, which is a product of the primes 23 and 17. which of the following is suitable as an encoding key e? (a) 163 (b) 353 (c) 351 (d) 277 (e) none of these. 10. which of the following polynomials p(x) is complete over zalr? (a) z4+1 (e) none of these

163

Step-by-step explanation:

So n=391.

This means p=23 and q=17 where p*q=n.

We want to choose e so that e is between 1 and 176 and the gcd(e,176)=1.

There is only one number in your list that is between 1 and 176... Hopefully the gcd(163,176)=1.

It does. See notes below for checking it:

176=2(88)=2(4*22)=2(2)(2)(2)(11)

None of the prime factors of 176 divide 163 so we are good.

The answer is 163.

let's solve your equation step-by-step.

4x+2=2x+12

step 1: subtract 2x from both sides.

4x+2−2x=2x+12−2x

2x+2=12

step 2: subtract 2 from both sides.

2x+2−2=12−2

2x=10

step 3: divide both sides by 2.

2x

2

=

10

2

x=5

step-by-step explanation:

attachment?

step-by-step explanation: