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. © 2010 Springer-Verlag.
CITATION STYLE
Zhu, B., Chen, K., & Lai, X. (2010). Bitwise higher order differential cryptanalysis. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6163 LNCS, pp. 250–262). https://doi.org/10.1007/978-3-642-14597-1_16
Mendeley helps you to discover research relevant for your work.