Cryptography: From Mathematical Magic to Secure Communication
Dan Boneh, Stanford University Theoretically Speaking Series http://simons.berkeley.edu/events/the... Theoretically Speaking is produced by the Simons Institute for the Theory of Computing, with sponsorship from the Mathematical Sciences Research Institute (MSRI) and Berkeley City College. These presentations are supported in part by an award from the Simons Foundation.
▶︎
Martijn Grooten - Elliptic Curve Cryptography for those who are afraid of maths
▶︎
But what is quantum computing? (Grover's Algorithm)
▶︎
Surface Data vs. Deep Data
▶︎
Lecture 16: Introduction to Elliptic Curves by Christof Paar
▶︎
NestJS Full Course for Beginners in 2026 | Build a Production-Ready API
▶︎
The Oldest Unsolved Problem in Math
▶︎
Turing Award Winner: Disagreeing with Google, Postgres, Future Problems | Mike Stonebraker
▶︎
Brian Cox: The quantum roots of reality | Full Interview
▶︎
Maggie Haberman & Jonathan Swan - On “Regime Change” & Inside The Trump Presidency | The Daily Show
▶︎
William Dunham, A tribute to Euler
▶︎
ACLS Drugs Review with Nurse Eunice 📚💉
▶︎
Can space and time emerge from simple rules? Stephen Wolfram thinks so. | World Science Festival
▶︎
But what are Hamming codes? The origin of error correction
▶︎
Training Sand to Think: Artificial General Intelligence & Future of Physics
▶︎
Terence Tao: Hardest Problems in Mathematics, Physics & the Future of AI | Lex Fridman Podcast #472
▶︎
Pairings in Cryptography
▶︎
The Strange Math That Predicts (Almost) Anything
▶︎
The Riemann Hypothesis, Explained
▶︎
Chris Peikert: Lattice-Based Cryptography
▶︎