Ayaz, Eyüp SerdarSelçuk, Ali Aydın2016-02-082016-02-082006-08http://hdl.handle.net/11693/27061Date of Conference: 17-18 August, 2006Conference name: International Workshop on Selected Areas in Cryptography. SAC 2006: Selected Areas in CryptographyIn this paper, we show how the Demirci-Selcuk-Ture attack, which is currently the deepest penetrating attack on the IDEA block cipher, can be improved significantly in performance. The improvements presented reduce the attack's plaintext, memory, precomputation time, and key search time complexities. These improvements also make a practical implementation of the attack on reduced versions of IDEA possible, enabling the first experimental verifications of the DST attack. © Springer-Verlag Berlin Heidelberg 2007.EnglishComputational complexitySearch enginesSecurity of dataDemirci-Selcuk-Ture attackPrecomputation timeBlock codesConference Paper10.1007/978-3-540-74462-7_1