Understanding Prime Numbers & RSA Encryption π | Computerphile
Discover how large prime numbers form the backbone of RSA encryption and keep our online data secure. Dr. Tim Muller explains the fascinating math behind it!

Computerphile
200.9K views β’ Jan 8, 2021

About this video
RSA is widespread on the Internet, and uses large prime numbers - but how does it work? Dr Tim Muller takes us through the details.
Apologies for the poor audio quality of this video which is due to the remote nature in which it was recorded.
https://www.facebook.com/computerphile
https://twitter.com/computer_phile
This video was filmed and edited by Sean Riley.
Computer Science at the University of Nottingham: https://bit.ly/nottscomputer
Computerphile is a sister project to Brady Haran's Numberphile. More at http://www.bradyharan.com
Apologies for the poor audio quality of this video which is due to the remote nature in which it was recorded.
https://www.facebook.com/computerphile
https://twitter.com/computer_phile
This video was filmed and edited by Sean Riley.
Computer Science at the University of Nottingham: https://bit.ly/nottscomputer
Computerphile is a sister project to Brady Haran's Numberphile. More at http://www.bradyharan.com
Tags and Topics
Browse our collection to discover more content in these categories.
Video Information
Views
200.9K
Likes
5.1K
Duration
15:06
Published
Jan 8, 2021
User Reviews
4.7
(40) Related Trending Topics
LIVE TRENDSRelated trending topics. Click any trend to explore more videos.
Trending Now