【24h】

Some Results on Related Key-IV Pairs of Grain

机译:有关粮食的关键IV对的一些结果

获取原文

摘要

In this paper we explain how one can obtain Key-IV pairs for Grain family of stream ciphers that can generate output key-streams which are either (i) almost similar in the initial part or (ii) exact shifts of each other throughout the generation of the stream. Let l_P be the size of the pad used during the key loading of Grain. For the first case, we show that in expected 2~(l_P) many invocations of the Key Scheduling Algorithm and its reverse routine, one can obtain two related Key-IV pairs that can produce same output bits in 75 (respectively 112 and 115) selected positions among the initial 96 (respectively ICO and 160) bits for Ghain v1 (respectively Grain-128 and Grain-128a). Similar idea works for the second case in showing that given any Key-IV, one can obtain another related Key-IV in expected 2~(l_P) many trials such that the related Key-IV pairs produce shifted key-streams. We also provide an efficient strategy to obtain related Key-IV pairs that produce exactly i-bit shifted key-streams for small i. Our technique pre-computes certain equations that help in obtaining such related Key-IV pairs in 2~i many expected trials.
机译:在本文中,我们解释了如何获得用于流密码的Grain系列的Key-IV对,这些对密码可以生成输出密钥流,这些密钥流要么(i)初始部分几乎相似,要么(ii)在整个生成过程中彼此精确地移位流。令l_P为谷物的关键加载过程中使用的垫的大小。对于第一种情况,我们表明在预期的2〜(l_P)次密钥调度算法及其反向例程的多次调用中,一个人可以获得两个相关的Key-IV对,它们可以产生75个相同的输出位(分别为112和115)。在Ghain v1(分别为Grain-128和Grain-128a)的初始96位(分别为ICO和160位)中选择位置。对于第二种情况,类似的想法适用于显示给定任何Key-IV的情况,可以在预期的2〜(l_P)次尝试中获得另一个相关的Key-IV,从而使相关的Key-IV对产生移位的密钥流。我们还提供了一种有效的策略来获取相关的Key-IV对,这些对可为小型i生成恰好经过i位移位的密钥流。我们的技术预先计算了某些方程,有助于在2多次预期的试验中获得此类相关的Key-IV对。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号