Why RSA encryption actually works (no prior knowledge required)

[@diteron]

Nice video, exactly what i was looking for. Everyone shows how it works, but not why it works

[@mathguy198]

Underrated channel, underrated contents,. Knowledge packed contents love it

[@alessandrorossi1294]

Found you due to you #SOME2 video. But this is also incredible! Underrated channel!

[@SS-jq6mh]

Underrated

[@localidiot4078]

lovely channel!

[@theblinkingbrownie4654]

Im curious, why would we raise (m^e) to the dth power and then calculate the remainder with n, instead of divinding with p or q? They should have much lower digits so shouldnt they be easier to use

[@kyay10]

Because p and q are not shared or stored. Only e and n are shared publicly, and only d is stored privately. If you shared p and q and e, or even p and n and e (because working out q is trivial from p and n), then anyone can calculate phi(n), and remember that ed = 1 mod phi(n), meaning you can very easily calculate d since you have phi(n) and e (and in fact that's how e is originally calculated)

[@viliamdokov4079]

Insane video!

[@aditya234567]

Sooo good video. Thank uu

[@tomhumphries6077]

Comment for the algorithm

[@araz911]

Write operating system don't show these uninteresting videos !