Published Dec 15, 2017

Complexity and Cryptography

Join Kyle Polich and Google's Tim Henderson as they delve into the intricacies of cryptographic complexity, exploring topics like discrete logarithms, one-way functions, and how machine learning impacts cryptography and bioinformatics. This episode examines the mathematical challenges and innovations that underpin modern cryptosystems, offering fascinating insights into securing data and advancing technology.

Episode Highlights

Topics covered

Episode Highlights

Related Episodes

The Complexity of Learning Neural Networks
Answers 383 questions
[MINI] Is the Internet Secure?
Answers 383 questions
The Computational Complexity of Machine Learning
Answers 383 questions
The Model Complexity Myth
Answers 383 questions
[MINI] Exponential Time Algorithms
Answers 383 questions
Quantum Computing
Answers 383 questions
Detecting Cheating in Chess
Answers 383 questions
Fraud Detection with Graphs
Answers 383 questions
Crypto
Answers 383 questions
Mathematical Models of Ecological Systems
Answers 383 questions
Learn to Code
Answers 383 questions
[MINI] Sudoku \in NP
Answers 383 questions
Q&A with Kyle
Answers 383 questions
Introduction
Answers 383 questions
Easily Fooling Deep Neural Networks
Answers 383 questions

Dexa/Kyle Polich

Complexity and Cryptography

Topics covered

Popular Clips

Graph Mining Insights

Trusting Modern Cryptography

One Way Functions

Cryptography Challenges

Discrete Logarithm Insights

Cryptography Fundamentals

One Way Functions

Modern Cryptography Explained

Machine Learning Insights

The Essence of Encryption

Cryptography and Complexity

Episode Highlights

Discrete Logarithms

Machine Learning Intersection

One Way Functions

Modern Cryptography

Related Episodes

The Complexity of Learning Neural Networks

[MINI] Is the Internet Secure?

The Computational Complexity of Machine Learning

The Model Complexity Myth

[MINI] Exponential Time Algorithms

Quantum Computing

Detecting Cheating in Chess

Fraud Detection with Graphs

Crypto

Mathematical Models of Ecological Systems

Learn to Code

[MINI] Sudoku \in NP

Q&A with Kyle

Introduction

Easily Fooling Deep Neural Networks

Complexity and Cryptography

Topics covered

Popular Clips

Episode Highlights

Discrete LogarithmsThe discussion with Tim Henderson explores the intricacies of cryptographic complexity, focusing on the discrete logarithm problem and the challenges of selecting secure instances. He emphasizes the importance of complexity theory in ensuring robust cryptographic systems.

Discrete Logarithms

Machine Learning Intersection

One Way FunctionsThe discussion explores the critical role of one way functions in cryptography, emphasizing their complexity and application in securing data. Tim Henderson from Google provides insights into the challenges of implementing these functions effectively.

One Way Functions

Modern CryptographyTim Henderson from Google joins Kyle Polich to discuss the computational complexity foundations of modern cryptography. They explore the trustworthiness of cryptosystems and the mathematical challenges that ensure their security.

Modern Cryptography

Related Episodes