Differential cryptanalysis of reduced-round PRESENT

  • Authors:
  • Meiqin Wang

  • Affiliations:
  • Key Laboratory of Cryptologic Technology and Information Security, Ministry of Education, Shandong University, Jinan, China

  • Venue:
  • AFRICACRYPT'08 Proceedings of the Cryptology in Africa 1st international conference on Progress in cryptology
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

PRESENT is proposed by A. Bogdanov et al. in CHES 2007 for extremely constrained environments such as RFID tags and sensor networks. In this paper, we present the differential characteristics for r-round(5 ≤ r ≤ 15), then give the differential cryptanalysis on reduced-round variants of PRESENT. We attack 16-round PRESENT using 264 chosen plaintexts, 232 6-bit counters, and 264 memory accesses.