scispace - formally typeset
Open AccessJournal ArticleDOI

A comprehensive study of multiple deductions-based algebraic trace driven cache attacks on AES

Xinjie Zhao, +6 more
- 01 Nov 2013 - 
- Vol. 39, pp 173-189
TLDR
A mathematical model is constructed to estimate the maximal number of leakage rounds that can be utilized and the minimal number of cache traces required for a successful MDATDCA on AES and attests that combining TDCAs with algebraic techniques is a very efficient way to improve cache attacks.
About: 
This article is published in Computers & Security.The article was published on 2013-11-01 and is currently open access. It has received 5 citations till now. The article focuses on the topics: AES implementations & Cache.

read more

Figures
Citations
More filters
Journal ArticleDOI

RK-AES: An Improved Version of AES Using a New Key Generation Process with Random Keys

Rahul Saha, +3 more
- 06 Nov 2018 - 
TL;DR: The results show that the proposed version of AES is better in withstanding attacks and compared with the original AES based upon some parameters such as nonlinearity, resiliency, balancedness, propagation characteristics, and immunity.
Journal ArticleDOI

Analysis on the parameter selection method for FLUSH+RELOAD based cache timing attack on RSA

Ping Zhou, +4 more
- 15 Jun 2015 - 
TL;DR: The complete rules for choosing the monitored instructions based on necessary and sufficient condition are proposed and how to select the optimal threshold based on Bayesian binary signal detection principal is also proposed.
Proceedings ArticleDOI

Cache Based Side Channel Attack: A Survey

Sandeep Saxena, +2 more
TL;DR: This paper is provide support and background knowledge for new researchers in area of side channel attack in different environments and the strength of prevention method as well as drawbacks of that method.

A Quantitative Study of Advanced Encryption Standard Performance as it Relates to Cryptographic Attack Feasibility

Daniel Hawthorne
Dissertation

Efficient Key Management for Data Security using TDES

Gaurav Puri, +1 more
References
More filters
Book ChapterDOI

Cache-collision timing attacks against AES

Joseph Bonneau, +1 more
TL;DR: The most powerful attack has been shown under optimal conditions to reliably recover a full 128-bit AES key with 213 timing samples, an improvement of almost four orders of magnitude over the best previously published attacks of this type.
Book ChapterDOI

Algebraic Side-Channel Attacks on the AES: Why Time also Matters in DPA

Mathieu Renauld, +2 more
TL;DR: It is shown experimentally that most of the intuitions that hold for PRESENT can also be observed for an unprotected implementation of Rijndael in an 8-bit controller and exhibit that algebraic techniques lead to a new understanding of implementation weaknesses that is different than classical side-channel attacks.
Proceedings ArticleDOI

AES power attack based on induced cache miss and countermeasure

Guido Bertoni, +4 more
TL;DR: A new attack against a software implementation of the Advanced Encryption Standard, aimed at flushing elements of the SBOX from the cache, thus inducing a cache miss during the encryption phase, which can be used to recover part of the secret key.
Book ChapterDOI

Trace-driven cache attacks on AES (short paper)

Onur Aciicmez, +1 more
TL;DR: This paper presents an efficient trace-driven cache attack on a widely used implementation of the AES cryptosystem, and develops an accurate mathematical model that is used in the cost analysis of the attack.
Journal Article

Trace-driven cache attacks on AES (short paper)

Onur Acucmez, +1 more
- 01 Jan 2006 - 
TL;DR: In this article, the authors present an efficient trace-driven cache attack on a widely used implementation of the AES cryptosystem and evaluate the cost of the proposed attack in detail under the assumption of a noiseless environment.
Frequently Asked Questions (2)
Q1. What are the contributions in "A comprehensive study of multiple deductions-based algebraic trace driven cache attacks on aes" ?

This paper performs a comprehensive study of MDASCA-based TDCAs ( MDATDCA ) on most of the AES implementations that are widely used. How to utilize the cache events with MDATDCA is presented and the overhead is also calculated. To evaluate MDATDCA on AES, this paper constructs a mathematical model to estimate the maximal number of leakage rounds that can be utilized and the minimal number of cache traces required for a successful MDATDCA. For the first time, the authors show that TDCAs on AES-192 and AES-256 become possible with the MDATDCA technique. 

The study of the trade-off between the data and time complexity in online and offline phases of MDATDCA, how to further quantized evaluating MDATDCA in the contributions of the leaked key bits from cache events to the recovery of the maser key of AES, how to evaluate MDATDCA on AES in case of error-tolerant and pre-loaded cache attack scenarios, how to develop new attack techniques to solve the TDCA problem might also be interesting problems in the future. The authors hope this paper can bring the understanding of both ASCA and TDCA to a new level, and help to evaluate the physical security of block cipher implementations.