Publication

Linear Cryptanalysis of DES

Pascal Junod
2000
Student Projects

Abstract

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 on the Intel Pentium III MMX architecture which is optimised for linear cryptanalysis. New implementation concepts are applied, resulting in a speed increase of almost 50% towards the best known classical implementation. The experimental results suggest strongly that the attack is in average about 10 times faster (O(239) DES computations) as expected with 243 known plaintext-ciphertext at disposal; furthermore, we have achieved a complexity of O(243) by using only 242.5 known pairs. Last, we propose a new analytical expression which approximates success probabilities; it gives slightly better results than Matsui's experimental ones.

Official source

https://infoscience.epfl.ch/entities/publication/1f12aa18-867b-4c76-b4a0-14705a8cd1bd

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Graph Chat

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.

Pascal Junod
2000
Student Projects

Abstract

Official source

https://infoscience.epfl.ch/entities/publication/1f12aa18-867b-4c76-b4a0-14705a8cd1bd

About this result

Related concepts (32)

Linear cryptanalysis

In cryptography, linear cryptanalysis is a general form of cryptanalysis based on finding affine approximations to the action of a cipher. Attacks have been developed for block ciphers and stream ciphers. Linear cryptanalysis is one of the two most widely used attacks on block ciphers; the other being differential cryptanalysis. The discovery is attributed to Mitsuru Matsui, who first applied the technique to the FEAL cipher (Matsui and Yamagishi, 1992).

Differential cryptanalysis

Differential cryptanalysis is a general form of cryptanalysis applicable primarily to block ciphers, but also to stream ciphers and cryptographic hash functions. In the broadest sense, it is the study of how differences in information input can affect the resultant difference at the output. In the case of a block cipher, it refers to a set of techniques for tracing differences through the network of transformation, discovering where the cipher exhibits non-random behavior, and exploiting such properties to recover the secret key (cryptography key).

Cryptanalysis

Cryptanalysis (from the Greek kryptós, "hidden", and analýein, "to analyze") refers to the process of analyzing information systems in order to understand hidden aspects of the systems. Cryptanalysis is used to breach cryptographic security systems and gain access to the contents of encrypted messages, even if the cryptographic key is unknown. In addition to mathematical analysis of cryptographic algorithms, cryptanalysis includes the study of side-channel attacks that do not target weaknesses in the cryptographic algorithms themselves, but instead exploit weaknesses in their implementation.

Related publications (4)

Linear Cryptanalysis of DES

Chat with Graph Search

On the Complexity of Matsui's Attack

A Universal Encryption Standard

A probabilistic model for ligand-cytoskeleton transmembrane adhesion: predicting the behavior of microspheres on the surface of migrating cells