Slender-Set Differential Cryptanalysis

به نام خدا

Title: Slender-Set Differential Cryptanalysis

Authors: Julia Borghoff, Lars R Knudsen, Gregor Leander, and Sren S Thomsen

Abstract: This paper considers PRESENT-like ciphers with key-dependent S-boxes. We focus on the setting where the same selection of S-boxes is used in every round. One particular variant with 16 rounds, proposed in 2009, is broken in practice in a chosen plaintext/chosen cipher text scenario. Extrapolating these results suggests that up to 28 rounds of such ciphers can be broken. Furthermore, we outline how our attack strategy can be applied to an extreme case where the S-boxes are chosen uniformly at random for each round, and where the bit permutation is key-dependent as well.   

Publish Year: 2013

Published in: Journal of Cryptography - Journal of Springer

Number of Pages: 28

موضوع: رمزنگاری (Cryptography)

مشاهده صفحه اول مقاله

دانلود مقاله

لینک مقاله در سایت ناشر

ایران سای – مرجع مقالات علمی فنی مهندسی

حامی دانش بومی ایرانیان