Related-Key Rectangle Attacks on Reduced Rounds of SHACAL-1

    , , , ,
Vol. 14, No. 5, pp. 57-68, Oct. 2004
10.13089/JKIISC.2004.14.5.57, Full Text:
Keywords: Related-Key Rectangle Attack, SHACAL-1
Abstract

The rectangle attack and the related-key attack on block ciphers are well-known to be very powerful. In this paper we combine the rectangle attack with the related-key attack. Using this combined attack we can attack the SHACAL-1 cipher with 512-bit keys up to 59 out of its 80 rounds. Our 59-round attack requires a data complexity of $2^{149.72}$ chosen plaintexts and a time complexity of $2^{498.30}$ encryptions, which is faster than exhaustive search.

Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from December 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
김종성, 김구일, 홍석희, 이상진, "Related-Key Rectangle Attacks on Reduced Rounds of SHACAL-1," Journal of The Korea Institute of Information Security and Cryptology, vol. 14, no. 5, pp. 57-68, 2004. DOI: 10.13089/JKIISC.2004.14.5.57.

[ACM Style]
김종성, 김구일, 홍석희, and 이상진. 2004. Related-Key Rectangle Attacks on Reduced Rounds of SHACAL-1. Journal of The Korea Institute of Information Security and Cryptology, 14, 5, (2004), 57-68. DOI: 10.13089/JKIISC.2004.14.5.57.