首页> 外文会议>Cryptographers Track at the RSA Conference >Zero-Sum Partitions of PHOTON Permutations
【24h】

Zero-Sum Partitions of PHOTON Permutations

机译:光子置换的零和分区

获取原文

摘要

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.
机译:我们在Eurocrypt 2015中描述了一种使用Todo的分区属性的零和分区的方法。它遵循内外方法,并包括MILP辅助搜索前向和后向路径,以及连接那些更少限制的两条路径的子空间方法而不是常见的。作为一个应用程序,我们选择Photon,一系列海绵样哈希函数建议,最近被ISO标准化。关于设计人员所做的安全声明,我们首次显示零和分区,几乎所有使用4位S框的全12个完整的12次置换变体。与文献中基本上任何其他零和属性一样,这里也是通用攻击和快捷方式之间的间隙。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号