.png){kind=icon}
返回
Efficient Double Bases for Scalar Multiplication
.png){kind=icon}
OA
AI
DOI：10.1109/TC.2014.2360539.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we present efficient algorithms to take advantage of the double-base number system in the context of elliptic curve scalar multiplication. We propose a generalized version of Yao's exponentiation algorithm allowing the use of general double-base expansions instead of the popular double base chains. We introduce a class of constrained double base expansions and prove that the average density of non-zero terms in such expansions is O(log k/log log k) for any large integer k. We also propose an efficient algorithm for computing constrained expansions and finally provide a comprehensive comparison to double-base chain expansions, including a large variety of curve shapes and various key sizes.
Keyword:
Double-base number system
elliptic curve
point scalar multiplication
Yao's algorithm
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.8
论文数:
5.4K
被引数:
9.8K
机构
引用论文
Human chorion cells respond to growth factors but lose steroidogenic capacity in primary monolayer cell culture人绒毛膜细胞对生长因子有反应，但在原代单层细胞培养中会失去类固醇生成能力。
.png){kind=icon}
PREAI
分享收藏