Quantum Computing 101: How to Crack RSA
Walter C. Daugherity explores quantum computing 101: how to crack rsa at DEF CON 10, examining quantum-computing and practical defenses.
Summary
Architecture and Background
Daugherity - Quantum Computing 101: How to Crack RSA The brand-new technology of quantum computers offers the prospect of exponential speedup, making heretofore infeasible problems like cracking RSA conceiveable.
Vulnerability Analysis
The fundamentals of quantum computing are presented, and how a quantum computer could be used to crack RSA is described.
Exploitation and Demonstrations
Daugherity is a Senior Lecturer in Computer Science and Electrical Engineering at Texas A&M University.
Remediation and Defensive Strategies
He received a bachelor's degree from Oklahoma Christian University, and master's and doctor's degrees from Harvard University. His research interests include fuzzy logic, object-oriented programming, and quantum computing. With David A. Church he created the first course in quantum computing at Texas A&M University, which will be offered for the third time in the fall semester this year.
Related talks
Main Stage·20 min
Austin Allshouse
Austin Allshouse explores mathematical factorization attacks against low-entropy and defective RSA keys in embedded firmware and IoT devices.
Main Stage·49 min
Andreas Baumhof
Separates hype from reality on quantum computing's timeline for breaking current public-key cryptography.
Main Stage·45 min
Jon Erickson
Jon Erickson - Number Theory Complexity, Theory, Cryptography, and Quantum Computing.