Abstract
PRESENT is proposed by A.Bogdanov et al. in CHES 2007 for extremely constrained environments such as RFID tags and sensor networks. In this paper, we present the differential characteristics for r-round(5 ≤ r ≤ 15), then give the differential cryptanalysis on reduced-round variants of PRESENT. We attack 16-round PRESENT using 264 chosen plaintexts, 232 6-bit counters, and 264 memory accesses. © 2008 Springer-Verlag Berlin Heidelberg.
Cite
CITATION STYLE
Wang, M. (2008). Differential cryptanalysis of reduced-round PRESENT. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5023 LNCS, pp. 40–49). https://doi.org/10.1007/978-3-540-68164-9_4
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
