Leftover Hash Lemma by Mahesh S R πŸ—οΈ

Explore the Leftover Hash Lemma and how it extracts near-uniform randomness from weak sources, presented by Mahesh S R.

Leftover Hash Lemma by Mahesh S R πŸ—οΈ
SIGTACS IITK
442 views β€’ Nov 8, 2019
Leftover Hash Lemma by Mahesh S R πŸ—οΈ

About this video

Topic: Leftover Hash Lemma
Speaker: Mahesh S R
Abstract: A randomness extractor is a function that outputs almost uniform bits from a weakly random entropy source. The Leftover Hash Lemma (LHL) states that universal hash functions are good randomness extractors. LHL leads to simple and efficient extractors and hence has applications in many areas of cryptography and complexity theory.
In this talk, the speaker will give a short description of extractors, discuss the proof for LHL and give a simple application of LHL.

Introduction Audio Credits
––––––––––––––––––––––––––––––
Journey by Jay Hifive & Broken Elegance https://soundcloud.com/brokenelegance
Creative Commons β€” Attribution 3.0 Unportedβ€” CC BY 3.0
Free Download / Stream: https://bit.ly/journey-broken-elegance
Music promoted by Audio Library https://youtu.be/eTtyZDU6WZQ
––––––––––––––––––––––––––––––

Tags and Topics

Browse our collection to discover more content in these categories.

Video Information

Views

442

Likes

6

Duration

48:36

Published

Nov 8, 2019

Related Trending Topics

LIVE TRENDS

Related trending topics. Click any trend to explore more videos.

Trending Now