首页> 外文会议>Annual international cryptology conference >Improved Division Property Based Cube Attacks Exploiting Algebraic Properties of Superpoly
【24h】

Improved Division Property Based Cube Attacks Exploiting Algebraic Properties of Superpoly

机译:利用改进的基于分割属性的多维数据集攻击开发超级多边形的代数性质

获取原文

摘要

The cube attack is an important technique for the cryptanal-ysis of symmetric key primitives, especially for stream ciphers. Aiming at recovering some secret key bits, the adversary reconstructs a superpoly with the secret key bits involved, by summing over a set of the plain-texts/Ⅳ which is called a cube. Traditional cube attack only exploits linear/quadratic superpolies. Moreover, for a long time after its proposal, the size of the cubes has been largely confined to an experimental range, e.g., typically 40. These limits were first overcome by the division property based cube attacks proposed by Todo et al. at CRYPTO 2017. Based on MILP modelled division property, for a cube (index set) I, they identify the small (index) subset J of the secret key bits involved in the resultant superpoly. During the precomputation phase which dominates the complexity of the cube attacks, 2~(|I|+|J|) encryptions are required to recover the superpoly. Therefore, their attacks can only be available when the restriction |I| + |J| < n is met. In this paper, we introduced several techniques to improve the division property based cube attacks by exploiting various algebraic properties of the superpoly. 1. We propose the "flag" technique to enhance the preciseness of MILP models so that the proper non-cube Ⅳ assignments can be identified to obtain a non-constant superpoly. 2. A degree evaluation algorithm is presented to upper bound the degree of the superpoly. With the knowledge of its degree, the super-poly can be recovered without constructing its whole truth table. This enables us to explore larger cubes I's even if |I| + |J| ≥ n. 3. We provide a term enumeration algorithm for finding the monomials of the superpoly, so that the complexity of many attacks can be further reduced. As an illustration, we apply our techniques to attack the initialization of several ciphers. To be specific, our key recovery attacks have mounted to 839-round Trivium, 891-round Kreyvium, 184-round Grain-128a and 750-round Acorn respectively.
机译:多维数据集攻击是对称密钥基元的密码分解(尤其是流密码)的一项重要技术。为了恢复某些秘密密钥位,对手通过对一组称为立方的纯文本/Ⅳ求和,从而构造了一个包含该秘密密钥位的超级垄断。传统的立方攻击仅利用线性/二次超级策略。此外,在提出该提议之后的很长一段时间内,这些立方体的大小基本上被限制在一个实验范围内,例如通常为40。这些限制首先由Todo等人提出的基于划分属性的立方体攻击得以克服。在CRYPTO 2017上。基于MILP建模的除法属性,对于多维数据集(索引集)I,他们标识了所产生的超级垄断中所涉及的秘密密钥位的小(索引)子集J。在控制多维数据集攻击的复杂性的预计算阶段,需要2〜(| I | + | J |)加密才能恢复超级垄断。因此,只有在| I |限制条件下,它们的攻击才可用。 + | J |

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号