Paper 2015/840

Related-key Impossible Differential Analysis of Full Khudra

Qianqian Yang, Lei Hu, Siwei Sun, and Ling Song

Abstract

Khudra is a 18-round lightweight block cipher proposed by Souvik Kolay and Debdeep Mukhopadhyay in the SPACE 2014 conference which is applicable to Field Programmable Gate Arrays (FPGAs). In this paper, we obtain $2^{16}$ 14-round related-key impossible differentials of Khudra, and based on these related-key impossible differentials for 32 related keys, we launch an attack on the full Khudra with data complexity of $2^{63}$ related-key chosen-plaintexts, time complexity of about $2^{68.46}$ encryptions and memory complexity of $2^{64}$.

Metadata
Available format(s)
PDF
Category
Secret-key cryptography
Publication info
Preprint. MINOR revision.
Keywords
LightweightBlock CipherKhudraRelated-keyImpossible Differential Cryptanalysis
Contact author(s)
yangqianqian521 @ 126 com
History
2015-08-31: received
Short URL
https://ia.cr/2015/840
License
Creative Commons Attribution
CC BY

BibTeX

@misc{cryptoeprint:2015/840,
      author = {Qianqian Yang and Lei Hu and Siwei Sun and Ling Song},
      title = {Related-key Impossible Differential Analysis of Full Khudra},
      howpublished = {Cryptology ePrint Archive, Paper 2015/840},
      year = {2015},
      note = {\url{https://eprint.iacr.org/2015/840}},
      url = {https://eprint.iacr.org/2015/840}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.