Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

177

FSE
1997
Springer

210views Cryptology» more FSE 1997»

Partitioning Cryptanalysis

15 years 10 months ago

Partitioning Cryptanalysis

Download www.isiweb.ee.ethz.ch

Matsui's linear cryptanalysis for iterated block ciphers is generalized to an attack called. This attack exploits a weakness that can be described by an e ective partition-pair, i.e., a partition of the plaintext set and a partition of the next-to-last-round output set such that, for every key, the next-to-last-round outputs are non-uniformly distributed over the blocks of the second partition when the plaintexts are chosen uniformly at random from a particular block of the rst partition. The last-round attack byis formalized and requirements for it to be successful are stated. The success probability is approximated and a procedure for nding e ective partition-pairs is formulated. The usefulness of is demonstrated by applying it successfully to six rounds of the DES. Keywords. Iterated block ciphers, linear cryptanalysis , , DES.

Carlo Harpes, James L. Massey

Real-time Traffic

Cryptology | FSE 1997 | Iterated Block Ciphers | Linear Cryptanalysis | Matsui's Linear Cryptanalysis |

claim paper

Related Content

» A Statistical Saturation Attack against the Block Cipher PRESENT

» On the cryptanalysis of the hash function Fugue Partitioning and insideout distinguishers

» Mod n Cryptanalysis with Applications Against RC5P and M6

» Cache Attacks and Countermeasures The Case of AES

» Efficient Cache Attacks on AES and Countermeasures

» Predicting Secret Keys Via Branch Prediction

Post Info
More Details (n/a)

Added	07 Aug 2010
Updated	07 Aug 2010
Type	Conference
Year	1997
Where	FSE
Authors	Carlo Harpes, James L. Massey

Comments (0)