Maximum likelihood-based key recovery algorithm from decayed key schedules

0Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A cold boot attack is a kind of side-channel attack that exploits a property of dynamic random-access memory. Using a cold boot attack, attackers can extract decayed key material from a running computer’s memory, which is a serious threat to computers using disk encryption software. Previously, an algorithm was presented that recovers a secret key from a decayed Advanced Encryption Standard key schedule. However, this method cannot recover a secret key if reverse bit flipping occurs, even in only one position, because this algorithm assumes a perfect asymmetric decay model. To remedy this limitation, we propose an algorithm based on the maximum likelihood approach, which can recover a secret key in an imperfect asymmetric decay model, i.e., where bit flipping occurs in both directions. We also give the theoretical bound of our algorithm and verify the validity thereof.

Cite

CITATION STYLE

APA

Tanigaki, T., & Kunihiro, N. (2016). Maximum likelihood-based key recovery algorithm from decayed key schedules. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9558, pp. 20–35). Springer Verlag. https://doi.org/10.1007/978-3-319-30840-1_20

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free