Chapter
The Security of Encryption
1:09:10 - 1:14:19 (05:09)
The security of most of the encryption that we currently use to protect the internet is based on the belief that factoring is an inherently hard problem for our computers. If the prime factors are all very large, then it's not clear how you even get started.
Clips
The Complexity Zoo is an organized collection of complexity classes and problems in computer science, which form the basis for the study of the inherent resources needed to solve computational problems.
1:09:10 - 1:10:08 (00:58)
Summary
The Complexity Zoo is an organized collection of complexity classes and problems in computer science, which form the basis for the study of the inherent resources needed to solve computational problems. Complexity theory, on the other hand, is the study of the inherent resources, like time and memory, needed to solve computational problems.
ChapterThe Security of Encryption
Episode#130 – Scott Aaronson: Computational Complexity and Consciousness
PodcastLex Fridman Podcast
In this episode, the host discusses the time complexity of multiplying numbers and how it relates to the length of the numbers being multiplied.
1:10:08 - 1:11:15 (01:06)
Summary
In this episode, the host discusses the time complexity of multiplying numbers and how it relates to the length of the numbers being multiplied. They also touch on the concept of factoring a number.
ChapterThe Security of Encryption
Episode#130 – Scott Aaronson: Computational Complexity and Consciousness
PodcastLex Fridman Podcast
The security of the encryption we use to protect the internet is largely based on the belief that factoring is a difficult problem for our computers, although there are few obvious things we know about it.
1:11:15 - 1:14:19 (03:04)
Summary
The security of the encryption we use to protect the internet is largely based on the belief that factoring is a difficult problem for our computers, although there are few obvious things we know about it.