Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

Partitioning cryptanalysis

In cryptography, partitioning cryptanalysis is a form of cryptanalysis for block ciphers. Developed by Carlo Harpes in 1995, the attack is a… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
One of the major open problems in symmetric cryptanalysis is to discover new specif i c types of invariant properties which can… Expand
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
2012
2012
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… Expand
Is this relevant?
2012
2012
The majority of the published attacks on reduced-round variants of block ciphers seeks to maximize the number of rounds to be… Expand
Is this relevant?
Highly Cited
2009
Highly Cited
2009
In this paper, we present a statistical saturation attack that combines previously introduced cryptanalysis techniques against… Expand
  • figure 1
  • table 1
Is this relevant?
Highly Cited
1997
Highly Cited
1997
Matsui's linear cryptanalysis for iterated block ciphers is generalized to an attack called . This attack exploits a weakness… Expand
  • figure 2
Is this relevant?
1996
1996
Matsui's linear cryptanalysis for iterated block ciphers is first general¬ ized by replacing his linear expressions with I/O sums… Expand
Is this relevant?
1996
1996
The paper presents a general setting which is used to describe generalized linear and partitioning cryptanalysis. A measure of… Expand
Is this relevant?
1995
1995
In this work we give some bounds which can be used to determine if a block cipher is secure against generalized linear… Expand
Is this relevant?