Concept

Running key cipher

Publications associées (23)

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

Discovery and Exploitation of New Biases in RC4

Serge Vaudenay, Martin Vuagnoux, Pouyan Sepehrdad

In this paper, we present several weaknesses in the stream cipher RC4. First, we present a technique to automatically reveal linear correlations in the PRGA of RC4. With this method, 48 new exploitable correlations have been discovered. Then we bind these ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Erased Secrets: Practical Information-Theoretic Group Secrecy

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani, Uday Kiran Pulleti

We consider the scenario where a group of wireless nodes want to exchange a secret key, such that no eavesdropper can guess the key. Today, this can be achieved using publickey cryptography, e.g., the Diffie-Hellman or the RSA keyexchange algorithms. Howev ...

2010

Linear (Hull) and Algebraic Cryptanalysis of the Block Cipher PRESENT

Pouyan Sepehrdad, Jorge Nakahara

The contributions of this paper include the first linear hull and a revisit of the algebraic cryptanalysis of reduced-round variants of the block cipher PRESENT, under known-plaintext and ciphertext- only settings. We introduce a pure algebraic cryptanalys ...

Springer Berlin / Heidelberg2009

Lightweight Block Ciphers Revisited: Cryptanalysis of Reduced Round PRESENT and HIGHT

Onur Özen, Cihangir Tezcan, Kerem Varici

Design and analysis of lightweight block ciphers have become more popular due to the fact that the future use of block ciphers in ubiquitous devices is generally assumed to be extensive. In this respect, several lightweight block ciphers are designed, of w ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2009

Quantitative security of block ciphers

Thomas Baignères

Block ciphers probably figure in the list of the most important cryptographic primitives. Although they are used for many different purposes, their essential goal is to ensure confidentiality. This thesis is concerned by their quantitative security, that i ...

EPFL2008

On the Notions of PRP-RKA, KR and KR-RKA for Block Ciphers

Security of a modern block cipher is commonly measured in terms of its resistance to known attacks. While the provable security approach to block ciphers dates back to the first CRYPTO conference (1981), analysis of modern block cipher proposals typically ...

Springer2007

Applied stream ciphers in mobile communications

Yi Lu

This dissertation is concerned with cryptanalysis of E0, the stream cipher used in the short-range wireless radio standard Bluetooth, and of its generalization by means of correlation attacks. It consists of three parts. In the first part, we propose an E0 ...

EPFL2006

A Polynomial-Time Universal Security Amplifier in the Class of Block Ciphers

We demonstrate the existence of an efficient block cipher with the property that whenever it is composed with any non-perfect cipher, the resulting product is strictly more secure, against an ideal adversary, than the original cipher. We call this property ...

2001

On the Complexity of Matsui's Attack

Pascal Junod

Linear cryptanalysis remains the most powerful attack against DES at this time. Given

2^{43}

known plaintext-ciphertext pairs, Matsui expected a complexity of less than

2^{43}

DES evaluations in 85% of the cases for recovering the key. In this paper, w ...

2001

A Polynomial-Time Universal Security Amplifier in the Class of Block Ciphers

2000

On the Complexity of Matsui's Attack

Pascal Junod

Linear cryptanalysis remains the most powerful attack against DES at this time. Given

2^{43}

known plaintext-ciphertext pairs, Matsui expected a complexity of less than

2^{43}

DES evaluations in 85% of the cases for recovering the key. In this paper, w ...

2001