|COOKIES: By using this website you agree that we can place Google Analytics Cookies on your device for performance monitoring.|
Bumping attacks: the affordable way of obtaining chip secrets
If you have a question about this talk, please contact Wei Ming Khoo.
This talk presents a new class of fault injection attacks called bumping attacks. These attacks are aimed at data extraction from secure embedded memory, which usually stores critical parts of algorithms, sensitive data and cryptographic keys. As a security measure, read-back access to the memory is not implemented leaving only authentication and verification options for integrity check. Verification is usually performed on relatively large blocks of data, making a brute force searching infeasible. I will evaluate memory verification and AES authentication schemes used in secure microcontrollers and a highly secure FPGA . By attacking the security in three steps, the search space can be reduced from infeasible 2 to the 100 to affordable 2 to the 15 guesses per block of data. This development was achieved by finding a way to preset certain bits in the data path to a known state using semi-invasive optical bumping. Further improvements to these attacks involved using non-invasive power glitching technique for the secure microcontroller. Partial reverse engineering of the FPGA made bumping attacks possible via the use of non-invasive threshold voltage alteration combined with power glitching. Research into positioning and timing dependency showed that Flash memory bumping attacks are relatively easy to carry out.
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 listsTwentieth Century Think Tank Open Research Cambridge Medsin Cambridge
Other talksMembers' slides (or digital presentations!) Dr Megan MacLeod: Regulation of CD4 T cell retention and function at inflamed sites Prof Massimo Piepoli: TBC Design for Security Test against Fault Injection Attack, and Fast Test with Compressive Sensing Estimating the Cascade of Care (CoC): Is it as simple as it seems? A Bayesian nonparametric model for sparse dynamic networks