YoVDO

Practical Detection of Entropy Loss in Pseudo-Random Number Generators

Offered By: Association for Computing Machinery (ACM) via YouTube

Tags

ACM CCS (Computer and Communications Security) Courses Cryptography Courses Computer Security Courses

Course Description

Overview

Explore a conference talk on detecting entropy loss in pseudo-random number generators, presented at CCS 2016. Delve into the Debian disaster's impact on services, examine the simplified PANG operation cycle, and investigate instances of entropy loss. Learn about the analysis procedure, crypto function idealization, and implementation details. Gain insights from the authors' research at Karlsruhe Institute of Technology, concluding with key findings on improving security in random number generation.

Syllabus

Intro
Services Affected by Debian Disaster
PANG Operation Cycle (Simplified)
Instances of Entropy Loss
Analysis Procedure
Crypto Function Idealization
Implementation
Conclusion


Taught by

ACM CCS

Related Courses

Applied Cryptography
University of Virginia via Udacity Cryptography II
Stanford University via Coursera Coding the Matrix: Linear Algebra through Computer Science Applications
Brown University via Coursera Cryptography I
Stanford University via Coursera Unpredictable? Randomness, Chance and Free Will
National University of Singapore via Coursera