[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.

Denne episoden er hentet fra en åpen RSS-feed og er ikke publisert av Podme. Den kan derfor inneholde annonser.

Episoder(601)

Computable AGI

Computable AGI

On today's show, we are joined by Michael Timothy Bennett, a Ph.D. student at the Australian National University. Michael's research is centered around Artificial General Intelligence (AGI), specifica...

3 Jul 202336min

AGI Can Be Safe

AGI Can Be Safe

We are joined by Koen Holtman, an independent AI researcher focusing on AI safety. Koen is the Founder of Holtman Systems Research, a research company based in the Netherlands. Koen started the conver...

26 Jun 202345min

AI Fails on Theory of Mind Tasks

AI Fails on Theory of Mind Tasks

An assistant professor of Psychology at Harvard University, Tomer Ullman, joins us. Tomer discussed the theory of mind and whether machines can indeed pass it. Using variations of the Sally-Anne test ...

19 Jun 202352min

AI for Mathematics Education

AI for Mathematics Education

The application of LLMs cuts across various industries. Today, we are joined by Steven Van Vaerenbergh, who discussed the application of AI in mathematics education. He discussed how AI tools have cha...

12 Jun 202335min

Evaluating Jokes with LLMs

Evaluating Jokes with LLMs

Fabricio Goes, a Lecturer in Creative Computing at the University of Leicester, joins us today. Fabricio discussed what creativity entails and how to evaluate jokes with LLMs. He specifically shared t...

6 Jun 202343min

Why Machines Will Never Rule the World

Why Machines Will Never Rule the World

Barry Smith and Jobst Landgrebe, authors of the book "Why Machines will never Rule the World," join us today. They discussed the limitations of AI systems in today's world. They also shared elaborate ...

29 Mai 202355min

A Psychopathological Approach to Safety in AGI

A Psychopathological Approach to Safety in AGI

While the possibilities with AGI emergence seem great, it also calls for safety concerns. On the show, Vahid Behzadan, an Assistant Professor of Computer Science and Data Science, joins us to discuss ...

23 Mai 202349min

The NLP Community Metasurvey

The NLP Community Metasurvey

Julian Michael, a postdoc at the Center for Data Science, New York University, joins us today. Julian's conversation with Kyle was centered on the NLP community metasurvey: a survey aimed at understan...

15 Mai 202349min

Populært innen Vitenskap

fastlegen
jss
tingenes-tilstand
forskningno
rekommandert
rss-paradigmepodden
villmarksliv
sinnsyn
rss-zahid-ali-hjelper-deg
vett-og-vitenskap-med-gaute-einevoll
kvinnehelsepodden
rss-inn-til-kjernen-med-sunniva-rose
nordnorsk-historie
nevropodden
tidlose-historier
liberal-halvtime
fjellsportpodden
rss-overskuddsliv
grunnstoffene
rss-rekommandert