【24h】

A middletext distinguisher for full CLEFIA-128

机译:完整CLEFIA-128的中间文字区分符

获取原文
获取原文并翻译 | 示例

摘要

CLEFIA is a 128-bit block cipher proposed by Shirai et al. at FSE 2007, and it was adopted as several standards. CLEFIA adopts a generalized Feistel structure with the switching diffusion mechanism, which realizes a compact hardware implementation for CLEFIA, and it seems one of the promising candidates to be used for restricted environments, which requires that a cryptographic primitive is versatile. It means that we need to evaluate the security of CLEFIA even for unusual scenario such as known-key scenario. As Knudsen and Rijmen did for 7-round AES at Asiacrypt 2007, we construct 17-round known-key distinguisher using two integral characteristics. To combine the 17-round known-key distinguisher with the standard subkey recovery technique for a secret-key scenario, we can construct a distinguisher for full CLEFIA-128 from a random permutation under the framework of middletext distinguisher proposed by Minier et al. at Africacrypt 2009. The distinguisher requires query of 2112 texts, time complexity of 2112, and memory complexity of 23 blocks, with the advantage of e−1, where e is the base of the natural logarithm.
机译:CLEFIA是Shirai等人提出的128位块密码。在FSE 2007上被采用,并且被采纳为多个标准。 CLEFIA采用带有切换扩散机制的通用Feistel结构,可实现CLEFIA的紧凑硬件实现,并且似乎是用于受限环境的有希望的候选者之一,这要求密码原语具有通用性。这意味着即使在不寻常的情况下(例如已知密钥的情况),我们也需要评估CLEFIA的安全性。正如Knudsen和Rijmen在Asiacrypt 2007上针对7轮AES所做的那样,我们使用两个不可分割的特征构造了17轮的已知密钥识别器。结合17轮已知密钥区分符和标准的子密钥恢复技术以解决秘密场景,我们可以在Minier等人提出的中间文本区分符的框架下,根据随机排列构造一个完整的CLEFIA-128区分符。在Africacrypt 2009上。区分器需要查询2 112 文本,2 112 的时间复杂度和2 3 块的存储复杂度,其中e -1 的优势,其中e是自然对数的底数。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号