|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC 2007)
DFA Mechanism on the AES Key Schedule
Vienna, Austria
September 10-September 10
ISBN: 0-7695-2982-8
| ASCII Text | x | ||
| Junko Takahashi, Toshinori Fukunaga, Kimihiro Yamakoshi, "DFA Mechanism on the AES Key Schedule," 2012 Workshop on Fault Diagnosis and Tolerance in Cryptography, pp. 62-74, Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC 2007), 2007. | |||
| BibTex | x | ||
| @article{ 10.1109/FDTC.2007.13, author = {Junko Takahashi and Toshinori Fukunaga and Kimihiro Yamakoshi}, title = {DFA Mechanism on the AES Key Schedule}, journal ={2012 Workshop on Fault Diagnosis and Tolerance in Cryptography}, volume = {0}, year = {2007}, isbn = {0-7695-2982-8}, pages = {62-74}, doi = {http://doi.ieeecomputersociety.org/10.1109/FDTC.2007.13}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - 2012 Workshop on Fault Diagnosis and Tolerance in Cryptography TI - DFA Mechanism on the AES Key Schedule SN - 0-7695-2982-8 SP62 EP74 A1 - Junko Takahashi, A1 - Toshinori Fukunaga, A1 - Kimihiro Yamakoshi, PY - 2007 KW - null VL - 0 JA - 2012 Workshop on Fault Diagnosis and Tolerance in Cryptography ER - | |||
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/FDTC.2007.13
This paper describes a DFA (Differential Fault Analysis) mechanism on the AES key scheduling process and shows how an entire 128-bit AES key can be retrieved. We make a detailed analysis of the DFA mechanism on the AES key schedule and propose general attack rules. As a result of reconsidering the best attack approach on the basis of analysis, we present a more efficient attack than the previous one. We show that we can retrieve an entire 128-bit AES key using 2-pairs of correct and faulty ciphertexts with a 48-bit brute-force search, 4-pairs of them with a 16-bit brute-force search and 7-pairs of them without brute-force search. These steps are enough to calculate the key with feasible computation resources.
Citation:
Junko Takahashi, Toshinori Fukunaga, Kimihiro Yamakoshi, "DFA Mechanism on the AES Key Schedule," fdtc, pp.62-74, Workshop on Fault Diagnosis and Tolerance in Cryptography (FDTC 2007), 2007
Usage of this product signifies your acceptance of the Terms of Use.