A computationally feasible SPA attack on AES via optimized search

13Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We describe an SPA power attack on an 8-bit implementation of AES. Our attack uses an optimized search of the key space to improve upon previous work in terms of speed, flexibility, and handling of data error. We can find a 128-bit cipher key in 16ms on average, with similar results for 192- and 256-bit cipher keys. The attack almost always produces a unique cipher key and performs well even in the presence of substantial measurement error. Copyright © 2005 by International Federation for Information Processing.

Author supplied keywords

Cite

CITATION STYLE

APA

VanLaven, J., Brehob, M., & Compton, K. J. (2005). A computationally feasible SPA attack on AES via optimized search. In IFIP Advances in Information and Communication Technology (Vol. 181, pp. 577–588). https://doi.org/10.1007/0-387-25660-1_38

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