Minimizing Cache Timing Attack Using Dynamic Cache Flushing (DCF) Algorithm

Details Minimizing Cache Timing Attack Using Dynamic Cache Flushing (DCF) Algorithm Minimizing Cache Timing Attack Using Dynamic Cache Flushing (DCF) Algorithm

2009-09-03

arxiv.org/abs/0909.0573v1

International Journal of Computer Science and Information Security, IJCSIS, Vol. 4, No. 1 & 2, August 2009, USA

Computer Science

Cryptography and Security

7 Pages IEEE format, International Journal of Computer Science and Information Security, IJCSIS 2009, ISSN 1947 5500, Impact F

Scientific paper

Rijndael algorithm was unanimously chosen as the Advanced Encryption Standard (AES) by the panel of researchers at National Institute of Standards and Technology (NIST) in October 2000. Since then, Rijndael was destined to be used massively in various software as well as hardware entities for encrypting data. However, a few years back, Daniel Bernstein devised a cache timing attack that was capable enough to break Rijndael seal that encapsulates the encryption key. In this paper, we propose a new Dynamic Cache Flushing (DCF) algorithm which shows a set of pragmatic software measures that would make Rijndael impregnable to cache timing attack. The simulation results demonstrate that the proposed DCF algorithm provides better security by encrypting key at a constant time.

Affiliated with

Also associated with

No associations

Rating

Minimizing Cache Timing Attack Using Dynamic Cache Flushing (DCF) Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Minimizing Cache Timing Attack Using Dynamic Cache Flushing (DCF) Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Minimizing Cache Timing Attack Using Dynamic Cache Flushing (DCF) Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-663448