文摘
Khudra is a lightweight block cipher for field-programmable gate arrays, which appeared in SPACE 2014. In this paper, we consider the security of Khudra against the related-key attack. Firstly, we give some observations of F-function. Then we design a simple searching algorithm for related-key differential characteristics. By utilizing the observations and the searching algorithm, we launch related-key differential attacks on 16-round Khudra and full Khudra without whitening keys. Furthermore, we build a 13-round related-key rectangle distinguisher and attack on 16-round Khudra, which requires 253 chosen plaintexts and 264.08 encryptions. Moreover, with the 13-round distinguisher, there exists an attack on full Khudra without whitening keys. Then, we present a 14-round related-key impossible differential distinguisher. However, the 14-round distinguisher cannot work well, we propose a 11-round related-key impossible differential, which lead to an attack on 14-round Khudra without the pre-whitening keys. These results provide a helpful understanding of Khudra security evaluation against related-key attack. Copyright