RSA encryption
For integers a and b, this is true b ≡ a (mod 91 ) and GCD (a, 91 ) = 1.
a)Determine a positive integer k> 1 such that b ^ k ≡ a (mod 91 ) .
b)What is a mod 91 for b = 53 ?

Hey! We 've verified this expert answer for you, click below to unlock the details :)

I got my questions answered at brainly.com in under 10 minutes. Go to brainly.com now for free help!

can we use fermat's little theorem for the first question

Looks \(k\) is public key here which he needs to choose, not much to solve as such it seems..

also question b seems weird
that question seems equivalent to evaluating 53 mod 91

Looking for something else?

Not the answer you are looking for? Search for more explanations.

## More answers

Looking for something else?

Not the answer you are looking for? Search for more explanations.