Concept

Triple DES

Related publications (27)

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.

Récupération du liant bitumineux provenant d’extraction Mise en application et adaptation de la nouvelle norme européenne vis à vis des expériences suisses

Michel Pittet

L’appréciation du taux de vieillissement des enrobés par la caractérisation du liant récupéré est de plus en plus utilisé en technique routière. Les mandats de recherches précédents, (FA 7/75 [1], FA 7/77 [2] et FA 16/88 [3]) ont permis de définir, en Suis ...

2002

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 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

Linear Cryptanalysis of DES

Pascal Junod

The main goal of this diploma work is the implementation of Matsui's linear cryptanalysis of DES and a statistical and theoretical analysis of its complexity and success probability. In order to achieve this goal, we implement first a very fast DES routine ...

2000

Comparison of the Randomness Provided by Some AES Candidates

Serge Vaudenay

Using the decorrelation techniques we compare the randomness of three schemes used in the AES candidates. The target schemes are the original Feistel scheme and two modified Feistel schemes: the MARS-like structure and the CAST256-like structure. As a resu ...

1999

An experiment on DES statistical cryptanalysis

Serge Vaudenay

Linear cryptanalysis and differential cryptanalysis are the most important methods of attack against block ciphers. Their efficiency have been demonstrated against several ciphers, including the Data Encryption Standard. We prove that both of them can be c ...

1996

Conception de systèmes automatiques

Cet ouvrage propose une large introduction à toutes les connaissances nécessaires à la conception des systèmes automatiques, qu'il s'agisse de l'emploi des moyens analogiques et digitaux, des méthodes d'analyse et de synthèse théoriques ainsi que des proce ...

Presses polytechniques et universitaires romandes1988

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