Slide attacks

217Citations
Citations of this article
85Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

It is a general belief among the designers of block-ciphers that even a relatively weak cipher may become very strong if its number of rounds is made very large. In this paper we describe a new gene- ric known- (or sometimes chosen-) plaintext attack on product ciphers, which we call the slide attack and which in many cases is independent of the number of rounds of a cipher. We illustrate the power of this new tool by giving practical attacks on several recently designed ciphers: TREYFER, WAKE-ROFB, and variants of DES and Blowfish.

Cite

CITATION STYLE

APA

Biryukov, A., & Wagner, D. (1999). Slide attacks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 1636, pp. 245–259). Springer Verlag. https://doi.org/10.1007/3-540-48519-8_18

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free