Partitioning cryptanalysis

In cryptography, partitioning cryptanalysis is a form of cryptanalysis for block ciphers. Developed by Carlo Harpes in 1995, the attack is a generalization of linear cryptanalysis. Harpes originally replaced the bit sums (affine transformations) of linear cryptanalysis with more general balanced Boolean functions. He demonstrated a toy cipher that exhibits resistance against ordinary linear cryptanalysis but is susceptible to this sort of partitioning cryptanalysis. In its full generality, partitioning cryptanalysis works by dividing the sets of possible plaintexts and ciphertexts into efficiently-computable partitions such that the distribution of ciphertexts is significantly non-uniform when the plaintexts are chosen uniformly from a given block of the partition. Partitioning cryptanalysis has been shown to be more effective than linear cryptanalysis against variants of DES and CRYPTON. A specific partitioning attack called mod n cryptanalysis uses the congruence classes modulo some integer for partitions.

References

* cite conference
author = Carlo Harpes, Gerard G. Kramer, James L. Massey
title = A Generalization of Linear Cryptanalysis and the Applicability of Matsui's Piling-up Lemma
booktitle = Advances in Cryptology — Eurocrypt '95
pages = pp.24–38
publisher = Springer-Verlag
date = May 1995
location = Saint-Malo
url = http://citeseer.ist.psu.edu/322881.html
format = PDF/PostScript
accessdate = 2007-09-09
* cite paper
author = Thomas Jakobsen
title = Security Against Generalized Linear Cryptanalysis and Partitioning Cryptanalysis
date = 1995
url = http://citeseer.ist.psu.edu/48892.html
format = PDF/PostScript
accessdate = 2007-09-09
* cite conference
author = T. Jakobsen, C. Harpes
title = Bounds On Non-Uniformity Measures For Generalized Linear Cryptanalysis And Partitioning Cryptanalysis
booktitle = Pragocrypt '96
pages = pp.467–479
publisher = Czech Technical University Publishing House
date = 1996
location = Prague
url = http://citeseer.ist.psu.edu/jakobsen96bounds.html
format = PDF/PostScript
accessdate = 2007-09-09
* cite conference
author = C. Harpes, J. Massey
title = Partitioning Cryptanalysis
booktitle = 4th International Workshop in Fast Software Encryption (FSE '97)
pages = pp.13–27
publisher = Springer-Verlag
date = January 1997
location = Haifa
url = http://citeseer.ist.psu.edu/323185.html
format = PDF/PostScript
accessdate = 2007-09-09
* cite conference
author = Marine Minier, Henri Gilbert
title = Stochastic Cryptanalysis of Crypton
booktitle = 7th International Workshop in Fast Software Encryption (FSE 2000)
pages = pp.121–133
publisher = Springer-Verlag
date = April 2000
location = New York City
url = http://www.mathmagic.cn/Crypt1998-2003/bibs/1978/19780121.htm
format = PDF
accessdate = 2007-09-10
* cite conference
author = Thomas Baignères, Pascal Junod, Serge Vaudenay
title = How Far Can We Go Beyond Linear Cryptanalysis?
booktitle = Advances in Cryptology — ASIACRYPT 2004
pages = pp.432–450
publisher = Springer-Verlag
date = December 2004
location = Jeju Island
url = http://crypto.junod.info/a04.pdf
format = PDF
accessdate = 2007-09-09