You are looking at a specific version 20111111:044150 of this paper. See the latest version.

Paper 2011/603

Advanced Zero-Sum Distinguishers for the Permutations of the PHOTON Family

Le Dong and Wenling Wu and Shuang Wu and Jian Zou

Abstract

PHOTON is a new collection of lightweight hash functions which use an extended sponge construction and AES-like permutations. The family has five members, and each of them has a corresponding permutation. The state sizes of these permutations are 100 bits, 144 bits, 196 bits, 256 bits and 288 bits, respectively. In this paper, we firstly estimate the upper bounds on the algebraic degrees of some round-reduced permutations and use the spectral properties to improve them. Then, some zero-sum distinguishers are constructed basing on these upper bounds. Applying the integral properties and the super-sbox technique used on AES-like block ciphers, we can extend one or two rounds in the middle of the previous zero-sum distinguishers. On the other side, the tighter upper bounds on algebraic degrees of these permutations are obtained by using some new results introduced by C. Boura etc. Basing on these new bounds, the full-round zero-sum distinguishers of the first four permutations can be constructed. Additionally, the results do not threat the security of the hash family.

Metadata
Available format(s)
-- withdrawn --
Publication info
Published elsewhere. Unknown where it was published
Keywords
PHOTONzero-sumhigher-order differentialWalsh spectrumintegral attacksuper-sbox.
Contact author(s)
dongle127 @ 163 com
History
2011-11-11: withdrawn
2011-11-10: received
See all versions
Short URL
https://ia.cr/2011/603
License
Creative Commons Attribution
CC BY
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.