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.
Original language | English |
---|---|
Title of host publication | Information Security and Cryptology – ICISC 2012 : 15th International Conference, Seoul, Korea, November 28-30, 2012, Revised Selected Papers |
Publisher | Springer |
Publication date | 2012 |
Pages | 368-382 |
ISBN (Print) | 978-3-642-37681-8 |
ISBN (Electronic) | 978-3-642-37682-5 |
DOIs | |
Publication status | Published - 2012 |
Event | 15th Annual International Conference on Information Security and Cryptology (ICISC 2012) - Seoul, Korea, Republic of Duration: 28 Nov 2012 → 30 Nov 2012 http://www.icisc.org/ |
Conference
Conference | 15th Annual International Conference on Information Security and Cryptology (ICISC 2012) |
---|---|
Country/Territory | Korea, Republic of |
City | Seoul |
Period | 28/11/2012 → 30/11/2012 |
Internet address |
Series | Lecture Notes in Computer Science |
---|---|
Volume | 7839 |
ISSN | 0302-9743 |