Skip to search formSkip to main contentSkip to account menu

Partitioning cryptanalysis

In cryptography, partitioning cryptanalysis is a form of cryptanalysis for block ciphers. Developed by Carlo Harpes in 1995, the attack is a… 
Wikipedia (opens in a new tab)

Related topics

Related topics

11 relations
Balanced boolean functionBlock cipherCRYPTONCryptanalysis

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Self-Differential Cryptanalysis of Up to 5 Rounds of SHA-3
. On October 2-nd 2012 NIST announced its selection of the Keccak scheme as the new SHA-3 hash standard. In this paper we present… 
2012
2012
Key Partitioning Cryptanalysis of Reduced Rounds AES Algorithm Variant
The majority of the published attacks on reduced-round variants of block ciphers seeks to maximize the number of rounds to be… 
1996
1996
Cryptanalysis of iterated block ciphers
Matsui's linear cryptanalysis for iterated block ciphers is first general¬ ized by replacing his linear expressions with I/O sums… 
1996
1996
Bounds On Non-Uniformity Measures For Generalized Linear Cryptanalysis And Partitioning Cryptanalysi
The paper presents a general setting which is used to describe generalized linear and partitioning cryptanalysis. A measure of… 
1995
1995
Security against Generalized Linear Cryptanalysis and Partitioning Cryptanalysis
In this work we give some bounds which can be used to determine if a block cipher is secure against generalized linear… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)