...
首页> 外文期刊>International Journal of Foundations of Computer Science >ANALYSIS OF COMPLEMENTS IN MULTI-EXPONENTIATION ALGORITHMS USING SIGNED DIGIT REPRESENTATIONS
【24h】

ANALYSIS OF COMPLEMENTS IN MULTI-EXPONENTIATION ALGORITHMS USING SIGNED DIGIT REPRESENTATIONS

机译:基于符号数字表示的多幂运算算法的补码分析

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

摘要

Wu, Lou, Lai and Chang proposed a multi-exponentiation algorithm using binary complements and the non-adjacent form. The purpose of this paper is to give a precise asymptotic analysis of the expected costs of this algorithm. It turns out that the complement operation does not have significant influence on the performance of the algorithm.
机译:Wu,Lou,Lai和Chang提出了一种使用二进制补码和非相邻形式的多幂运算算法。本文的目的是对该算法的预期成本进行精确的渐近分析。事实证明,补数运算对算法的性能没有重大影响。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号