Conference paper
Estimating the Probabilities of Low-Weight Differential and Linear Approximations on PRESENT-like Ciphers
In
Lecture Notes in Computer Science
—
2012, pp. 368-382
Abstract
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.
| Language: | English |
|---|---|
| Publisher: | Springer |
| Year: | 2012 |
| Pages: | 368-382 |
| Proceedings: | 15th Annual International Conference on Information Security and Cryptology (ICISC 2012)International Conference on Information Security and Cryptology |
| Series: | Lecture Notes in Computer Science |
| Journal subtitle: | 15th International Conference, Seoul, Korea, November 28-30, 2012, Revised Selected Papers |
| ISBN: | 3642376819 , 3642376827 , 9783642376818 and 9783642376825 |
| ISSN: | 03029743 |
| Types: | Conference paper |
| DOI: | 10.1007/978-3-642-37682-5_26 |
