[Resource Topic] 2017/1211: Zero-Sum Partitions of PHOTON Permutations

Welcome to the resource topic for 2017/1211

Title:
Zero-Sum Partitions of PHOTON Permutations

Authors: Qingju Wang, Lorenzo Grassi, Christian Rechberger

Abstract:

We describe an approach to zero-sum partitions using Todo’s division property at EUROCRYPT 2015. It follows the inside-out methodology, and includes MILP-assisted search for the forward and backward trails, and subspace approach to connect those two trails that is less restrictive than commonly done. As an application we choose PHOTON, a family of sponge-like hash function proposals that was recently standardized by ISO. With respect to the security claims made by the designers, we for the first time show zero-sum partitions for almost all of those full 12-round permutation variants that use a 4-bit S-Box. As with essentially any other zero-sum property in the literature, also here the gap between a generic attack and the shortcut is small.

ePrint: https://eprint.iacr.org/2017/1211

See all topics related to this paper.

Feel free to post resources that are related to this paper below.

Example resources include: implementations, explanation materials, talks, slides, links to previous discussions on other websites.

For more information, see the rules for Resource Topics .