Related-key rectangle attacks on reduced versions of SHACAL-1 and AES-192

  • Authors:
  • Seokhie Hong;Jongsung Kim;Sangjin Lee;Bart Preneel

  • Affiliations:
  • Katholieke Universiteit Leuven, ESAT/SCD-COSIC, Leuven-Heverlee, Belgium;Center for Information Security Technologies(CIST), Korea University, Seoul, Korea;Center for Information Security Technologies(CIST), Korea University, Seoul, Korea;Katholieke Universiteit Leuven, ESAT/SCD-COSIC, Leuven-Heverlee, Belgium

  • Venue:
  • FSE'05 Proceedings of the 12th international conference on Fast Software Encryption
  • Year:
  • 2005

Quantified Score

Hi-index 0.00

Visualization

Abstract

In this paper we propose a notion of related-key rectangle attack using 4 related keys. It is based on two consecutive related-key differentials which are independent of each other. Using this attack we can break SHACAL-1 with 512-bit keys up to 70 rounds out of 80 rounds and AES with 192-bit keys up to 8 rounds out of 12 rounds, which are faster than exhaustive search.