Person

Serge Vaudenay

Related publications (237)

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.

Decorrelation over infinite domains: the encrypted CBC-MAC case

Serge Vaudenay

Decorrelation theory has recently been proposed in order to address the security of block ciphers and other cryptographic primitives over a finite domain. We show here how to extend it to infinite domains, which can be used in the message authentication co ...

2001

A Statistical Attack on RC6

Serge Vaudenay

This paper details the attack on RC6 which was announced in a report published in the proceedings of the second AES candidate conference (March 1999). Based on an observation on the RC6 statistics, we show how to distinguish RC6 from a random permutation a ...

2001

On the pseudorandomness of top-level schemes of block ciphers

Serge Vaudenay

Block ciphers are usually based on one top-level scheme into which we plug Âround functionsÂ. To analyze security, it is important to study the intrinsic security provided by the top-level scheme from the viewpoint of randomness: given a block cipher in ...

2000

Design Validations for Discrete Logarithm Based Signature Schemes

Serge Vaudenay

A number of signature schemes and standards have been recently designed, based on the discrete logarithm problem. Examples of standards are the DSA and the KCDSA. Very few formal design/security validations have already been conducted for both the KCDSA an ...

2000

Decorrelation over Infinite Domains: the Encrypted CBC-MAC Case

Serge Vaudenay

2000

Efficient generation of prime numbers

Serge Vaudenay

The generation of prime numbers underlies the use of most public-key schemes, essentially as a major primitive needed for the creation of key pairs or as a computation stage appearing during various cryptographic setups. Surprisingly, despite decades of in ...

2000

Decorrelated Fast Cipher: an AES candidate well suited for low cost smart cards applications

Serge Vaudenay

In response to the call for candidates issued by the National Institute for Standards and Technologies (the Advanced Encryption Standard project) the Ecole Normale Superieure proposed a candidate called DFC (Decorrelated Fast Cipher). DFC is based on a dec ...

2000

DFCv2

Serge Vaudenay

The development process of the Advanced Encryption Standard (AES) was launched in 1997 by the US government through NIST. The Decorrelated Fast Cipher (DFC) was the CNRS proposal for the AES, among 14 other candidates in 1998. It was based on the recent de ...

2000

A Universal Encryption Standard

Serge Vaudenay

DES and triple-DES are two well-known and popular encryption algorithms, but they both have the same drawback : their block size is limited to 64 bits. While the cryptographic community is working hard to select and evaluate candidates and finalists for th ...

2000

Resistance against general iterated attacks

Serge Vaudenay

We study the resistance of a block cipher against a class of general attacks which we call Âiterated attacksÂ. This class includes some elementary versions of differential and linear cryptanalysis. We prove that we can upper bound the complexity of the a ...

1999