Extracting Unknown Keys from Unknown Algorithms Encrypting Unknown Fixed Messages and Returning no Results

Add to your list(s) Download to your calendar using vCal

• David Naccache (ENS)
• Monday 30 January 2012, 14:00-15:00
• Lecture Theatre 2, Computer Laboratory, William Gates Building.

If you have a question about this talk, please contact Wei Ming Khoo.

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.

This talk is part of the Computer Laboratory Security Seminar series.

This talk is included in these lists:

• All Talks (aka the CURE list)
• Computer Laboratory Security Seminar
• Computer Laboratory talks
• Lecture Theatre 2, Computer Laboratory, William Gates Building
• School of Technology
• de239's list

Note that ex-directory lists are not shown.