首页> 外文会议>Progress in Electromagnetics Research Symposium - Fall >Efficient ECC scalar multiplication algorithm based on symmetric ternary in wireless sensor networks
【24h】

Efficient ECC scalar multiplication algorithm based on symmetric ternary in wireless sensor networks

机译:无线传感器网络中基于对称三进制的高效ECC标量乘法算法

获取原文

摘要

With the rapid development of communication technology, wireless sensor networks have been widely used in several fields ranging from environmental monitoring and medical care to military uses. Sensor networks are typically deployed in hostile environments, which makes data security problems particularly severe. Therefore, it is necessary to encrypt the data and add authentication function. Elliptic curve cryptosystem (ECC) is a nice way to solve the problem. ECC has the advantages of high security, fast processing speed, low storage space and low bandwidth requirement. Thus, it is getting a lot of attention. The most critical operation in ECC is the multiplication of the user's private key with the base point, which is called scalar multiplication. It is the most basic mathematical operation in ECC. The speed of the operation decides the efficiency of elliptic curve cryptography system on the whole. To improve efficiency, it is necessary to optimize the scalar multiplication in elliptic curve cryptosystem. Based on the scalar representation of symmetric ternary, this paper optimizes the bottom operation using the Jacobi coordinate. In this way, we can eliminate the field inversion in scalar multiplication. Furthermore, this paper optimizes the symmetric ternary representation method, which can be used to improve the efficiency of scalar multiplication. The principle of this optimizing is that the point doubling is faster than point addition in Jacobi coordinate. By changing the scalar representation, the non-zero Hamming weight is reduced and point doubling is used to replace the point addition on the processing dot. The calculating amount is analyzed, so we can see that the optimized symmetric ternary scalar multiplication has a efficiency improvement at 4.3% compared with the earlier algorithm.
机译:随着通信技术的飞速发展,无线传感器网络已广泛应用于从环境监控,医疗保健到军事用途的多个领域。传感器网络通常部署在恶劣的环境中,这使得数据安全问题特别严重。因此,有必要对数据进行加密并添加身份验证功能。椭圆曲线密码系统(ECC)是解决此问题的好方法。 ECC具有安全性高,处理速度快,存储空间小和带宽需求低的优点。因此,它引起了很多关注。 ECC中最关键的操作是用户私钥与基点的乘积,这称为标量乘积。这是ECC中最基本的数学运算。运算速度总体上决定了椭圆曲线密码系统的效率。为了提高效率,有必要优化椭圆曲线密码系统中的标量乘法。基于对称三进制的标量表示,本文使用Jacobi坐标优化了底部运算。这样,我们可以消除标量乘法中的场求逆。此外,本文还对对称三元表示法进行了优化,可以提高标量乘法的效率。这种优化的原理是,在Jacobi坐标中,点加倍比点加法快。通过更改标量表示,减少了非零汉明权重,并且使用点加倍替换处理点上的点加法。分析了计算量,因此可以看到,与早期算法相比,优化的对称三进制标量乘法的效率提高了4.3%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号