Extracting Unknown Keys from Unknown Algorithms Encrypting Unknown Fixed Messages and Returning no Results
- đ¤ Speaker: David Naccache (ENS)
- đ Date & Time: Monday 30 January 2012, 14:00 - 15:00
- đ Venue: Lecture Theatre 2, Computer Laboratory, William Gates Building
Abstract
In addition to its usual complexity assumptions, cryptography silently assumes that information can be physically protected in a single location. As we now know, real-life devices are not ideal and confidential information leaks through different physical channels. Whilst most aspects of side channel leakage (cryptophthora) are now well understood, no attacks on totally unknown algorithms are known to date. This paper describes such an attack. By totally unknown we mean that no information on the algorithm’s mathematical description (including the plaintext size), the microprocessor or the chip’s power consumption model is available to the attacker.
Series This talk is part of the Computer Laboratory Security Seminar series.
Included in Lists
- All Talks (aka the CURE list)
- bld31
- Cambridge talks
- Computer Laboratory Security Seminar
- Department of Computer Science and Technology talks and seminars
- Interested Talks
- Lecture Theatre 2, Computer Laboratory, William Gates Building
- School of Technology
- Security-related talks
- Trust & Technology Initiative - interesting events
- yk449
Note: Ex-directory lists are not shown.
![[Talks.cam]](/static/images/talkslogosmall.gif)

David Naccache (ENS)
Monday 30 January 2012, 14:00-15:00