Paper 2011/086

Fault-propagation Pattern Based DFA on SPN Structure Block Ciphers using Bitwise Permutation, with Application to PRESENT and PRINTcipher

Xin-jie Zhao, Tao Wang, and Shi-ze Guo

Abstract

This paper proposes a novel fault-propagation pattern based differential fault analysis method - FPP-DFA, and proves its feasibility on SPN structure block ciphers using bitwise permutation, such as PRESENT and PRINTcipher. Simulated experiments demonstrate that, with the fault model of injecting one nibble fault into the r-2th round substitution layer, on average 8 and 16 faulty samples can reduce the master key search space of PRESENT-80/128 to $2^{14.7}$ and $2^{21.1}$ respectively, and 12 and 24 effective faulty samples can reduce the master key search space of PRINTcipher-48/96 to $2^{13.7}$ and $2^{22.8}$ respectively; with the fault model of injecting one nibble fault into the r-3th round substitution layer, 8 samples can reduce the master key search space of PRINTCipher-96 to $2^{18.7}$.

Metadata
Available format(s)
PDF
Publication info
Published elsewhere. Unknown where it was published
Keywords
Fault-propagation patternfault-propagation pathdifferential fault analysisbitwise permutationSPN block cipherPRESENTPRINTcipher
Contact author(s)
zhaoxinjieem @ 163 com
History
2011-05-10: last of 4 revisions
2011-02-21: received
See all versions
Short URL
https://ia.cr/2011/086
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2011/086,
      author = {Xin-jie Zhao and Tao Wang and Shi-ze Guo},
      title = {Fault-propagation Pattern Based DFA on SPN Structure Block Ciphers using Bitwise Permutation, with Application to PRESENT and PRINTcipher},
      howpublished = {Cryptology ePrint Archive, Paper 2011/086},
      year = {2011},
      note = {\url{https://eprint.iacr.org/2011/086}},
      url = {https://eprint.iacr.org/2011/086}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.