Bitwise higher order differential cryptanalysis

Authors:
Bo Zhu;Kefei Chen;Xuejia Lai
Affiliations:
Department of Computer Science and Engineering, Shanghai Jiao Tong University, China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, China;Department of Computer Science and Engineering, Shanghai Jiao Tong University, China
Venue:
INTRUST'09 Proceedings of the First international conference on Trusted Systems
Year:
2009

Citing 7
Cited 0

How to construct pseudo-random permutations from pseudo-random functions

Lecture notes in computer sciences; 218 on Advances in cryptology---CRYPTO 85
Keying Hash Functions for Message Authentication

CRYPTO '96 Proceedings of the 16th Annual International Cryptology Conference on Advances in Cryptology
Integral Cryptanalysis

FSE '02 Revised Papers from the 9th International Workshop on Fast Software Encryption
Encyclopedia of Cryptography and Security

Encyclopedia of Cryptography and Security
PRESENT: An Ultra-Lightweight Block Cipher

CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems
KATAN and KTANTAN -- A Family of Small and Efficient Hardware-Oriented Block Ciphers

CHES '09 Proceedings of the 11th International Workshop on Cryptographic Hardware and Embedded Systems
Foiling birthday attacks in length-doubling transformations: benes: a non-reversible alternative to feistel

EUROCRYPT'96 Proceedings of the 15th annual international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper attempts to utilize the ideas of higher order differential cryptanalysis to investigate Boolean algebra based block ciphers. The theoretical foundation is built for later research, and two kinds of distinguishing attacks are proposed. The prerequisites of the attacks are also presented and proved, and an efficient algorithm is introduced to search these prerequisites. Furthermore, our analysis result shows that 5 rounds of the block cipher PRESENT can be distinguished by using only 512 chosen plaintexts.