Another look at complementation properties
FSE'10 Proceedings of the 17th international conference on Fast software encryption
SAC'10 Proceedings of the 17th international conference on Selected areas in cryptography
Meet-in-the-middle attacks on reduced-round XTEA
CT-RSA'11 Proceedings of the 11th international conference on Topics in cryptology: CT-RSA 2011
Multi-agent based software licensing model for embedded systems
KES-AMSTA'12 Proceedings of the 6th KES international conference on Agent and Multi-Agent Systems: technologies and applications
Impossible differential cryptanalysis of the lightweight block ciphers TEA, XTEA and HIGHT
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
Three-subset meet-in-the-middle attack on reduced XTEA
AFRICACRYPT'12 Proceedings of the 5th international conference on Cryptology in Africa
Zero correlation linear cryptanalysis with reduced data complexity
FSE'12 Proceedings of the 19th international conference on Fast Software Encryption
RFIDSec'12 Proceedings of the 8th international conference on Radio Frequency Identification: security and privacy issues
Hi-index | 0.00 |
XTEA is a 64-round block cipher with a 64-bit block size and a 128-bit user key, which was designed as a short C program that would run safely on most computers. In this paper, we present a related-key rectangle attack on a series of inner 36 rounds of XTEA without making a weak key assumption, and a related-key rectangle attack on the first 36 rounds of XTEA under certain weak key assumptions. These are better than any previously published cryptanalytic results on XTEA in terms of the numbers of attacked rounds.