|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Extracting Unknown Keys from Unknown Algorithms Encrypting Unknown Fixed Messages and Returning no Results
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:
Note that ex-directory lists are not shown.
Other listsarchaeology Turing Centenary Conference Cambridge Language Sciences
Other talksForcing with large continuum Interaction of plant cell wall matrix polysaccharides with bacterial cellulose Moving pictures, moving stories: what archive films reveal Star Formation around Dusty Quasars at z~2 Cambridge in the Fifties and Sixties: an extended conversation Why We Disagree about Human Nature