Everything about Partitioning cryptanalysis
Technique in cryptography
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 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. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Partitioning cryptanalysisA 5-minute orientation
- Read the landmark paper: An application of genetic algorithm to cryptanalysis of block ciphers by partitioning the key spaceCited 4 times
- Go sideways: Integral cryptanalysisA closely related topic
- Go sideways: COCONUT98A closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
No outline available.
🏆 Landmark papers (most cited)
An application of genetic algorithm to cryptanalysis of block ciphers by partitioning the key space
SAT-Based Space Partitioning and Applications to Ascon-Hash256 Cryptanalysis
On the cryptanalysis of the hash function Fugue: Partitioning and inside-out distinguishers
Key Partitioning Cryptanalysis of Reduced Rounds AES Algorithm Variant
📚 Books worth reading
Open Library didn't respond; try again in a moment.
🔗 Related topics
- Integral cryptanalysis In cryptography, integral cryptanalysis is a cryptanalytic attack that is particularly applicable to block ciphers based on substitution–permutation networks…
- COCONUT98 In cryptography, COCONUT98 (Cipher Organized with Cute Operations and N-Universal Transformation) is a block cipher designed by Serge Vaudenay in 1998…
- Differential-linear attack Introduced by Martin Hellman and Susan K. Langford in 1994, the differential-linear attack is a mix of both linear cryptanalysis and differential cryptanalysis…
- KN-Cipher In cryptography, KN-Cipher is a block cipher created by Kaisa Nyberg and Lars Knudsen in 1995. One of the first ciphers designed to be provably secure…
- Truncated differential cryptanalysis In cryptography, truncated differential cryptanalysis is a generalization of differential cryptanalysis, an attack against block ciphers. Lars Knudsen…
- Khufu and Khafre In cryptography, Khufu and Khafre are two block ciphers designed by Ralph Merkle in 1989 while working at Xerox's Palo Alto Research Center. Along with…
- Boomerang attack In cryptography, the boomerang attack is a method for the cryptanalysis of block ciphers based on differential cryptanalysis. The attack was published…
- Davies attack In cryptography, the Davies attack is a dedicated statistical cryptanalysis method for attacking the Data Encryption Standard (DES). The attack was originally…