Class Central is learner-supported. When you buy through links on our site, we may earn an affiliate commission.

YouTube

By-Design Backdooring of Encryption System - Can We Trust Foreign Encryption Algorithms

Black Hat via YouTube

Overview

Save Big on Coursera Plus. 7,000+ courses at $160 off. Limited Time Only!
Explore the critical issue of mathematical backdoors in encryption algorithms in this 50-minute Black Hat conference talk. Delve into the concept of by-design backdoors placed directly within the mathematical structure of encryption systems. Understand how these backdoors differ from implementation-level vulnerabilities and why they pose a significant challenge to detect and exploit. Learn about the historical context, regulatory landscape, and international agreements surrounding cryptographic control. Examine case studies, including the Swiss company saga and the evolution of random number generators. Analyze specific algorithmic components like design transformations, linear partitions, and secret S-boxes. Discover techniques for last-round attacks and methods to detect potential tampering in existing ciphers. Gain insights into the implications of these findings for trusting foreign encryption algorithms and the future of cryptographic security.

Syllabus

Introduction
Agenda
Context
News
Regulation
International Agreement
Academic Approach
Trapdoor
Aim
Algorithm
Implementation
Bitty story
Swiss companies
Alice Billa
History of Random Number Generator
Federal Standards
Time Line
Statistics
NSA
Design Transformation
Linear Partition
Parameters
Primitive
Algorithms
Exploit
Last Round Attack
Secret SBox
Project Success
Conclusion
Future work
Analyzing existing ciphers
Detecting tampering

Taught by

Black Hat

Reviews

Start your review of By-Design Backdooring of Encryption System - Can We Trust Foreign Encryption Algorithms

Never Stop Learning.

Get personalized course recommendations, track subjects and courses with reminders, and more.

Someone learning on their laptop while sitting on the floor.