[MINI] Is the Internet Secure?
Data Skeptic31 Okt 2014

[MINI] Is the Internet Secure?

This episode explores the basis of why we can trust encryption. Suprisingly, a discussion of looking up a word in the dictionary (binary search) and efficiently going wine tasting (the travelling salesman problem) help introduce computational complexity as well as the P ?= NP question, which is paramount to the trustworthiness RSA encryption.

With a high level foundation of computational theory, we talk about NP problems, and why prime factorization is a difficult problem, thus making it a great basis for the RSA encryption algorithm, which most of the internet uses to encrypt data. Unlike the encryption scheme Ray Romano used in "Everybody Loves Raymond", RSA has nice theoretical foundations.

It should be noted that although this episode gives good reason to trust that properly encrypted data, based on well choosen public/private keys where the private key is not compromised, is safe. However, having safe encryption doesn't necessarily mean that the Internet is secure. Topics like Man in the Middle attacks as well as the Snowden revelations are a topic for another day, not for this record length "mini" episode.

Det här avsnittet är hämtat från ett öppet RSS-flöde och publiceras inte av Podme. Det kan innehålla reklam.

Avsnitt(601)

Quantum K-Means

Quantum K-Means

In this episode, we interview Jonas Landman, a Postdoc candidate at the University of Edinburg. Jonas discusses his study around quantum learning where he attempted to recreate the conventional k-mean...

11 Apr 202239min

K-Means in Practice

K-Means in Practice

K-means is widely used in real-life business problems. In this episode, Mujtaba Anwer, a researcher and Data Scientist walks us through some use cases of k-means. He also spoke extensively on how to p...

4 Apr 202230min

Fair Hierarchical Clustering

Fair Hierarchical Clustering

Building a fair machine learning model has become a critical consideration in today's world. In this episode, we speak with Anshuman Chabra, a Ph.D. candidate in Computer Networks. Chhabra joins us to...

28 Mars 202234min

Matrix Factorization For k-Means

Matrix Factorization For k-Means

Many people know K-means clustering as a powerful clustering technique but not all listeners will be as familiar with spectral clustering. In today's episode, Sibylle Hess from the Data Mining group a...

21 Mars 202230min

Breathing K-Means

Breathing K-Means

In this episode, we speak with Bernd Fritzke, a proficient financial expert and a Data Science researcher on his recent research - the breathing K-means algorithm. Bernd discussed the perks of the alg...

14 Mars 202242min

Power K-Means

Power K-Means

In today's episode, Jason, an Assistant Professor of Statistical Science at Duke University talks about his research on K power means. K power means is a newly-developed algorithm by Jason and his tea...

7 Mars 202232min

Explainable K-Means

Explainable K-Means

In this episode, Kyle interviews Lucas Murtinho about the paper "Shallow decision treees for explainable k-means clustering" about the use of decision trees to help explain the clustering partitions. ...

3 Mars 202225min

Customer Clustering

Customer Clustering

Have you ever wondered how you can use clustering to extract meaningful insight from a time-series single-feature data? In today's episode, Ehsan speaks about his recent research on actionable feature...

28 Feb 202222min

Populärt inom Vetenskap

allt-du-velat-veta
dumma-manniskor
p3-dystopia
rss-ufobortom-rimligt-tvivel
ufo-sverige
kapitalet-en-podd-om-ekonomi
sexet
medicinvetarna
svd-nyhetsartiklar
rss-vetenskapsradion
hacka-livet
rss-vetenskapsradion-2
paranormalt-med-caroline-giertz
det-morka-psyket
ufo-sverige-2
rss-spraket
halsorevolutionen
rss-klotet
dumforklarat
ideer-som-forandrar-varlden