×

Estimating the probabilities of low-weight differential and linear approximations on PRESENT-like ciphers. (English) Zbl 1342.94066

Kwon, Taekyoung (ed.) et al., Information security and cryptology – ICISC 2012. 15th international conference, Seoul, Korea, November 28–30, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-37681-8/pbk). Lecture Notes in Computer Science 7839, 368-382 (2013).
Summary: We use large but sparse correlation and transition-difference-probability submatrices to find the best linear and differential approximations respectively on PRESENT-like ciphers. This outperforms the branch and bound algorithm when the number of low-weight differential and linear characteristics grows exponentially which is the case in PRESENT-like ciphers. We found linear distinguishers on 23 rounds of the SPONGENT permutation. We also found better linear approximations on PRESENT using trails covering at most 4 active Sboxes which give us 24-round statistical saturation distinguishers which could be used to break 26 rounds of PRESENT.
For the entire collection see [Zbl 1263.68022].

MSC:

94A60 Cryptography

Software:

ITSOL; SPARSKIT
PDFBibTeX XMLCite
Full Text: DOI