Get our expert's

answer on brainly

SEE EXPERT ANSWER

Get your **free** account and access **expert** answers to this and **thousands** of other questions.

See more answers at brainly.com

Get this expert

answer on brainly

SEE EXPERT ANSWER

Get your **free** account and access **expert** answers to this and **thousands** of other questions

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

you know since b is equivalent to a mod 91

a mod 91=b mod 91=53 mod 91

a = ciphertext
b = plaintext

you are suppose to determin k which I got to 73 in somehow...

I am beginning to feel that question has something missing..

Cant a be all the relatively primes to under 91? phi(91)?

and the thing is I know b≡a mod 91 and need to show that b^k≡a mod 91

I mean proove it right?

could you take a screenshot of actual question and post if psble

its in swedish, and thats all there is...

yes thomas thats what I did, but is that proof enough?

I guess so. If \(\gcd(b,91)=1\) then I think the proof is good enough.

@thomas5267 and how do we know that GCD(b,91)=1?

So Thomas, how can we determine k from that? @thomas5267

Now excuse me, I have to go make myself a instant noodle.