Name
Abstract | ||
|---|---|---|
In this paper, we study how AES key schedules can be reconstructed from decayed memory. This operation is a crucial and time consuming operation when trying to break encryption systems with cold-boot attacks. In software, the reconstruction of the AES master key can be performed using a recursive, branch-and-bound tree-search algorithm that exploits redundancies in the key schedule for constraining the search space. In this work, we investigate how this branch-andbound algorithm can be accelerated with FPGAs. We translate the recursive search procedure to a state machine with an explicit stack for each recursion level and create optimized datapaths to accelerate in particular the processing of the most frequently accessed tree levels. We support two different decay models, of which especially the more realistic non-idealized asymmetric decay model causes very high runtimes in software. Our implementation on a Maxeler dataflow computing system outperforms a software implementation for this model by up to 27x, which makes cold-boot attacks against AES practical even for high error rates. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1109/FCCM.2014.67 | FCCM |
Keywords | Field | DocType |
branch and bound,state machine,aes,field programmable gate arrays,schedules,cold boot attacks,hardware acceleration,encryption,cold boot attack,cryptography,acceleration,search space,key schedule,computational modeling,fpga | Key schedule,Computer science,Cold boot attack,Parallel computing,Encryption,Finite-state machine,Dataflow,Software,Schedule,Hardware acceleration | Conference |
Citations | PageRank | References |
0 | 0.34 | 8 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Heinrich Riebler | 1 | 13 | 3.58 |
| Tobias Kenter | 2 | 13 | 6.07 |
| Christian Plessl | 3 | 297 | 35.98 |
| Christoph Sorge | 4 | 172 | 22.16 |