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

RSA i beleieve deals with 2 large primes and the totient function

im not about to type up 200 to 300 words on it tho, youll have to do that yourself

this ensures us that a decryption key can be produced to uncode it all

I understand,
I have done this so fay from my notes but i dont understand what is what.
SO
1) Choose two distinct primes, p and q
2) Find n such that n=pq
3) Use Q(n)= (p-1)(q-1) Q = phi, (*****)
4)Choose e such that 1

how does this help us find an inverse?

\[a*a^{\phi(n)-1}=a^{\phi(n)}\]

Eulers thrm is the backbone of the RSA

aϕ(n)≅a (mod n), shouldnt this be
aϕ(n)≅ 1 (mod n) ?