Improved related-key differential attacks on reduced-round lblock

20Citations
Citations of this article
27Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

At ACNS 2011, Wu and Zhang proposed a new lightweight block cipher which is named LBlock. The design rationale of LBlock considers the trade-offs between security against cryptanalyses and performance in low-resource implementations. In this paper, we present new attacks on reduced-round LBlock using related-key differential cryptanalysis. Firstly, we construct a new related-key boomerang distinguishing attack on 16-round LBlock. Secondly, we construct a key recovery attack on 22-round LBlock based on a 16-round related-key truncated differential. In contrast to the published cryptanalysis results of reduced-round LBlock, our attacks have advantages on data and computational complexities. © 2012 Springer-Verlag.

Cite

CITATION STYLE

APA

Liu, S., Gong, Z., & Wang, L. (2012). Improved related-key differential attacks on reduced-round lblock. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7618 LNCS, pp. 58–69). https://doi.org/10.1007/978-3-642-34129-8_6

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free