Differential fault analysis on PRESENT key schedule

  • Gaoli Wang*
  • , Shaohui Wang
  • *Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

48 Scopus citations

Abstract

PRESENT is a lightweight block cipher designed by A. Bogdanov et al. in 2007 for extremely constrained environments such as RFID tags and sensor networks, where the AES is not suitable for. In this paper, the strength of PRESENT against the differential fault attack on the key schedule is explored. Our attack adopts the nibble oriented model of random faults and assumes that the attacker can induce a single nibble fault on the round key. The attack can efficiently recover the secret key with the computational complexity of 2 29, and sixty-four pairs of correct and faulty ciphertexts on average.

Original languageEnglish
Title of host publicationProceedings - 2010 International Conference on Computational Intelligence and Security, CIS 2010
Pages362-366
Number of pages5
DOIs
StatePublished - 2010
Externally publishedYes
Event2010 International Conference on Computational Intelligence and Security, CIS 2010 - Nanning, China
Duration: 11 Dec 201014 Dec 2010

Publication series

NameProceedings - 2010 International Conference on Computational Intelligence and Security, CIS 2010

Conference

Conference2010 International Conference on Computational Intelligence and Security, CIS 2010
Country/TerritoryChina
CityNanning
Period11/12/1014/12/10

Keywords

  • Block cipher
  • Differential fault analysis
  • PRESENT

Fingerprint

Dive into the research topics of 'Differential fault analysis on PRESENT key schedule'. Together they form a unique fingerprint.

Cite this