Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 219,937,500 papers from all fields of science
Search
Sign In
Create Free Account
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
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
11 relations
Balanced boolean function
Block cipher
CRYPTON
Cryptanalysis
Expand
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
Itai Dinur
,
O. Dunkelman
,
A. Shamir
IACR Cryptology ePrint Archive
2012
Corpus ID: 1963197
. 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
Key Partitioning Cryptanalysis of Reduced Rounds AES Algorithm Variant
Amr M Ashry
,
A. Shehata
,
A. Elbayoumy
2012
Corpus ID: 181705198
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
1997
Highly Cited
1997
Partitioning Cryptanalysis
C. Harpes
,
J. Massey
Fast Software Encryption Workshop
1997
Corpus ID: 17235381
Matsui's linear cryptanalysis for iterated block ciphers is generalized to an attack called . This attack exploits a weakness…
Expand
1996
1996
Cryptanalysis of iterated block ciphers
C. Harpes
1996
Corpus ID: 28869007
Matsui's linear cryptanalysis for iterated block ciphers is first general¬ ized by replacing his linear expressions with I/O sums…
Expand
1996
1996
Bounds On Non-Uniformity Measures For Generalized Linear Cryptanalysis And Partitioning Cryptanalysi
Thomas P. Jakobsen
,
C. Harpes
1996
Corpus ID: 409228
The paper presents a general setting which is used to describe generalized linear and partitioning cryptanalysis. A measure of…
Expand
1995
1995
Security against Generalized Linear Cryptanalysis and Partitioning Cryptanalysis
J. Massey
,
G. Kramer
,
Thomas P. Jakobsen
1995
Corpus ID: 14631917
In this work we give some bounds which can be used to determine if a block cipher is secure against generalized linear…
Expand
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)
ACCEPT & CONTINUE