Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.
Partitioning cryptanalysis
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
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
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
Highly Cited
2009
Highly Cited
2009
In this paper, we present a statistical saturation attack that combines previously introduced cryptanalysis techniques against… Expand
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
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… Expand
1996
1996
Matsui's linear cryptanalysis for iterated block ciphers is first general¬ ized by replacing his linear expressions with I/O sums… Expand
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