Related-key rectangle attack on the full SHACAL-1

  • Authors:
  • Orr Dunkelman;Nathan Keller;Jongsung Kim

  • Affiliations:
  • Computer Science Department, Technion, Haifa, Israel;Einstein Institute of Mathematics, Hebrew University, Jerusalem, Israel;ESAT/SCD-COSIC, Katholieke Universiteit Leuven, Leuven-Heverlee, Belgium and Center for Information Security Technologies, Korea University, Seoul, Korea

  • Venue:
  • SAC'06 Proceedings of the 13th international conference on Selected areas in cryptography
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

SHACAL-1 is a 160-bit block cipher with variable key length of up to 512-bit key based on the hash function SHA-1. It was submitted to the NESSIE project and was accepted as a finalist for the 2nd phase of the evaluation. In this paper we devise the first known attack on the full 80-round SHACAL-1 faster than exhaustive key search. The related-key differentials used in the attack are based on transformation of the collision-producing differentials of SHA-1 presented by Wang et al.