Concept

Timing attack

Related publications (78)

The Bussard-Bagga and Other Distance-Bounding Protocols under Attacks

Serge Vaudenay, Aikaterini Mitrokotsa, Asli Bay, Iosif-Daniel Spulber

The communication between an honest prover and an honest verifier can be intercepted by a malicious man-in-the-middle (MiM), without the legitimate interlocutors noticing the intrusion. The attacker can simply relay messages from one party to another, even ...

Springer,2012

Resistance Against Iterated Attacks by Decorrelation Revisited

Serge Vaudenay, Atefeh Mashatan, Asli Bay

Iterated attacks are comprised of iterating adversaries who can make

d

plaintext queries, in each iteration to compute a bit, and are trying to distinguish between a random cipher

C

and the ideal random cipher

C^*

based on all bits. In EUROCRYPT '99, ...

Springer2012

Statistical Attack on RC4: Distinguishing WPA

Serge Vaudenay, Martin Vuagnoux, Pouyan Sepehrdad

In this paper we construct several tools for manipulating pools of biases in the analysis of RC4. Then, we show that optimized strategies can break WEP based on 4000 packets by assuming that the first bytes of plaintext are known for each packet. We descri ...

Springer2011

A First Step Towards Automatic Application of Power Analysis Countermeasures

Paolo Ienne, Francesco Regazzoni, Philip Brisk, Ali Galip Bayrak

In cryptography, side channel attacks, such as power analysis, attempt to uncover secret information from the physical implementation of cryptosystems rather than exploiting weaknesses in the cryptographic algorithms themselves. The design and implementati ...

Acm Order Department, P O Box 64145, Baltimore, Md 21264 Usa2011

Algebraic, AIDA/Cube and Side Channel Analysis of KATAN Family of Block Ciphers

Pouyan Sepehrdad, Jorge Nakahara

This paper presents the first results on AIDA/cube, algebraic and side-channel attacks on variable number of rounds of all members of the KATAN family of block ciphers. Our cube attacks reach 60, 40 and 30 rounds of KATAN32, KATAN48 and KATAN64, respective ...

Springer2010

Computer Aided Cryptanalysis from Ciphers to Side Channels

Martin Vuagnoux

In this dissertation, we study the security of cryptographic protocols and cryptosystems from the mathematical definition of the primitives, up to their physical implementations in the real world. We propose a representation of the chronological design usi ...

EPFL2010

On the Static Diffie-Hellman Problem on Elliptic Curves over Extension Fields

Robert Granger

Recent work by Koblitz and Menezes has highlighted the existence, in some cases, of apparent separations between the hardness of breaking discrete logarithms in a particular group, and the hardness of solving in that group problems to which the security of ...

2010

A Randomized Countermeasure Against Parasitic Adversaries in Wireless Sensor Networks

Jean-Pierre Hubaux, Panagiotis Papadimitratos, Jun Luo

Due to their limited capabilities, wireless sensor nodes are subject to physical attacks that are hard to defend against. In this paper, we first identify a typical attacker, called parasitic adversary, who seeks to exploit sensor networks by obtaining mea ...

2010

Distinguishing Distributions Using Chernoff Information

Serge Vaudenay, Pouyan Sepehrdad, Thomas Baignères

In this paper, we study the soundness amplification by repetition of cryptographic protocols. As a tool, we use the Chernoff Information. We specify the number of attempts or samples required to distinguish two distributions efficiently in various protocol ...

Springer2010

Efficient Cache Attacks on AES, and Countermeasures

Dag Arne Osvik

We describe several software side-channel attacks based on inter-process leakage through the state of the CPU's memory cache. This leakage reveals memory access patterns, which can be used for cryptanalysis of cryptographic primitives that employ data-depe ...

Springer Verlag2010

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.