Abstract
AbstractThis paper proposes a general construction method for structural distinguishers, based on the recently proposed ‘multiple-of-n property’ of a subspace trail. The multiple-of-n property refers to the fact that by appropriate choices of difference for a number of input pairs, it is possible to make sure that the number of times that the difference of the resulting output pairs lie in a particular subspace is always a multiple of n. We weaken the condition for constructing the structural distinguisher from the exact subspace trail to the general subspace trail and this general condition is applied to the SPN cryptographic algorithm, allowing a six-round structural distinguisher to be obtained for the first time. In this way, the best six-round Midori-64 distinguisher is constructed, with its data complexity being identical to Midori’s five-round structural distinguisher. We also applied this new condition to the SKINNY algorithm, extending its structural distinguisher from five to six rounds.
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call