Multiple differential-zero correlation linear cryptanalysis of reduced-round CAST-256
Hadian Dehkordi Massoud, Taghizadeh Roghayeh
Journal of Mathematical Cryptology · 2017
doi:10.1515/jmc-2016-0054 (opens in a new tab)
We email you when a new notice or a question about this paper appears.
Abstract
CAST-256 (or CAST6) is a symmetric-key block cipher published in June 1998. It was submitted as a candidate for Advanced Encryption Standard (AES). In this paper, we will propose a new chosen text attack, the multiple differential-zero correlation linear attack, to analyze the CAST-256 block cipher. Our attack is the best-known attack on CAST-256 according to the number of rounds without the weak-key assumption. We first construct a 30-round differential-zero correlation linear distinguisher. Based on the distinguisher, we propose a first 33-round attack on CAST-256 with data complexity of 2115.63{2^{115.63}} and time complexity 2238.26{2^{238.26}}. In the end, the 111-bit subkey is recovering.
Abstract licence: CC BY
Reads
Read by people on this page
None yet.
Checked or read by AI through naulon
None yet.
A person counts once a day per paper. We keep no cookie and no address: a reader is a hash that changes every day. Any month under five reads shows no number.
Are you an author?
Is this your paper?
Claim it to add your note and be paid when agents cite it. Free.