首页> 外文会议>International Conference on Information Networking >Stochastic Heuristic Approach to Addition Chain Problem in PKC for Efficiency and Security Effectiveness
【24h】

Stochastic Heuristic Approach to Addition Chain Problem in PKC for Efficiency and Security Effectiveness

机译:为了提高效率和安全性,采用随机启发式方法解决PKC中的附加链问题

获取原文

摘要

This paper shows that stochastic heuristic approach for implicitly solving addition chain problem (ACP) in public-key cryptosystem (PKC) enhances the efficiency of the PKC and improves the security by blinding the multiplications/squaring operations involved against side-channel attack (SCA). We show that while the current practical heuristic approaches being deterministic expose the fixed pattern of the operations, using stochastic method blinds the pattern by being unpredictable and generating diffident pattern of operation for the same exponent at a different time. Thus, if the addition chain (AC) is generated implicitly every time the exponentiation operation is being made, needless for such approaches as padding by insertion of dummy operations and the operation is still totally secured against the SCA. Furthermore, we also show that the stochastic approaches, when carefully designed, further reduces the length of the operation than state-of-the-art practical methods for improving the efficiency. We demonstrated our investigation by implementing RSA cryptosystem using the stochastic approach and the results benchmarked with the existing current methods.
机译:本文显示了通过隐式解决公钥密码系统(PKC)中的附加链问题(ACP)的随机启发式方法,可以通过提高针对边信道攻击(SCA)的乘法/平方运算的盲目性来提高PKC的效率并提高安全性。 。我们表明,尽管当前的确定性实用启发式方法暴露了固定的操作模式,但是使用随机方法由于不可预测并在不同时间针对相同指数生成不同的操作模式而使该模式蒙蔽。因此,如果每次进行乘幂运算时都会隐式生成加法链(AC),则无需进行诸如通过插入虚拟运算进行填充之类的操作,并且仍然可以完全针对SCA确保该运算。此外,我们还表明,与精心设计的随机方法相比,随机方法比用于提高效率的最新实用方法还缩短了操作时间。我们通过使用随机方法实施RSA密码系统并以现有的现有方法作为基准来验证结果,从而证明了我们的调查结果。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号