New Related-Key Boomerang Attacks on AES
INDOCRYPT '08 Proceedings of the 9th International Conference on Cryptology in India: Progress in Cryptology
ICISS '08 Proceedings of the 4th International Conference on Information Systems Security
Lightweight Block Ciphers Revisited: Cryptanalysis of Reduced Round PRESENT and HIGHT
ACISP '09 Proceedings of the 14th Australasian Conference on Information Security and Privacy
The price of security in wireless sensor networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Differential-multiple linear cryptanalysis
Inscrypt'09 Proceedings of the 5th international conference on Information security and cryptology
Linear cryptanalysis of ARIA block cipher
ICICS'11 Proceedings of the 13th international conference on Information and communications security
Related-key rectangle attacks on reduced AES-192 and AES-256
FSE'07 Proceedings of the 14th international conference on Fast Software Encryption
Improbable differential cryptanalysis
Proceedings of the 6th International Conference on Security of Information and Networks
Improbable differential attacks on Present using undisturbed bits
Journal of Computational and Applied Mathematics
Hi-index | 0.00 |
In this paper we present a cryptanalytic technique, based on impossible differentials. We use it to show that recovering keys of Skipjack reduced from 32 to 31 rounds can be performed faster than exhaustive search. We also describe the Yoyo game (a tool that can be used against reduced-round Skipjack), and other properties of Skipjack.