The resistance of PRESENT-80 against related-key differential attacks

Sareh Emami, San Ling, Ivica Nikolić*, Josef Pieprzyk, Huaxiong Wang

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

11 Citations (Scopus)


We examine the security of the 64-bit lightweight block cipher PRESENT-80 against related-key differential attacks. With a computer search we are able to prove that for any related-key differential characteristic on full-round PRESENT-80, the probability of the characteristic only in the 64-bit state is not higher than 2-64. To overcome the exponential (in the state and key sizes) computational complexity of the search we use truncated differences, however as the key schedule is not nibble oriented, we switch to actual differences and apply early abort techniques to prune the tree-based search. With a new method called extended split approach we are able to make the whole search feasible and we implement and run it in real time. Our approach targets the PRESENT-80 cipher however,with small modifications can be reused for other lightweight ciphers as well.

Original languageEnglish
Pages (from-to)171-187
Number of pages17
JournalCryptography and Communications
Issue number3
Publication statusPublished - Sep 2014


Dive into the research topics of 'The resistance of PRESENT-80 against related-key differential attacks'. Together they form a unique fingerprint.

Cite this