Publication

Improved Related-Key Attacks on DESX and DESX+

Raphael Chung Wei Phan
2008
Journal Articles

Abstract

In this paper, we present improved related-key attacks on the original DESX, and DESX+, a variant of the DESX with its pre- and post-whitening XOR operations replaced with addition modulo $2^{64}$ . Compared to previous results, our attack on DESX has reduced text complexity, while our best attack on DESX+ eliminates the memory requirements at the same processing complexity.

Official source

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.

Raphael Chung Wei Phan
2008
Journal Articles

Abstract

Official source

Related publications (27)

Improved Related-Key Attacks on DESX and DESX+

Chat with Graph Search

Partial Synchrony for Free: New Upper Bounds for Byzantine Agreement

Inhalation of Microplastics—A Toxicological Complexity

A Comparative Analysis of Tools & Task Types for Measuring Computational Problem-Solving