| 整数对的低重量表示JSF3 |
| |
| 引用本文： | 张亚娟,祝跃飞,况百杰. 整数对的低重量表示JSF3[J]. 软件学报, 2006, 17(9) |
| |
| 作者姓名： | 张亚娟 祝跃飞 况百杰 |
| |
| 作者单位： | 解放军信息工程大学,信息工程学院,网络工程系,河南,郑州,450002;解放军信息工程大学,信息工程学院,网络工程系,河南,郑州,450002;解放军信息工程大学,信息工程学院,网络工程系,河南,郑州,450002 |
| |
| 基金项目： | 国家自然科学基金;国家重点基础研究发展计划(973计划);河南省杰出青年科学基金 |
| |
| 摘 要： | J.A.Solinas给出了整数对的最优带符号二进制表示,称做联合稀疏表示(JSF).JSF表示长度至多是最大整数的二进制长度加一,其平均汉明密度为1/2.利用窗口方法扩展了联合稀疏表示,给出了整数对的一种新表示方法:3-宽度联合稀疏表示(JSF3).该表示长度至多是最大整数的二进制长度加一,平均汉明密度为19/52.因此,利用JSF3计算uP+vQ比用JSF大约提高9%的效率.
|
| 关 键 词： | 椭圆曲线密码 ECDSA JSF 3-宽度联合稀疏表示(JSF3) AJHD |
Low-Weight JSF3 Representations for Pairs of Integers |
| |
| ZHANG Ya-Juan,ZHU Yue-Fei,KUANG Bai-Jie. Low-Weight JSF3 Representations for Pairs of Integers[J]. Journal of Software, 2006, 17(9) |
| |
| Authors: | ZHANG Ya-Juan ZHU Yue-Fei KUANG Bai-Jie |
| |
| Abstract: | J.A.Solinas suggested an optimal signed binary representation for pairs of integers, which is called a Joint Sparse Form (JSF). JSF is at most one bit longer than the binary expansion of the larger of the two integers, and the average joint Hamming density among Joint Sparse Form representations is 1/2. This paper extends the Joint Sparse Form by using a window method, namely a new representations, for pairs of integers, which is called Width-3 Joint Sparse Form (JSF3). The representation is at most one bit longer than the binary expansion of the larger of the two integers, and the average joint Hamming density is 19/52. So, computing the form of uP+vQ by using JSF3 is almost 9% faster than that by using JSF. |
| |
| Keywords: | ECDSA JSF AJHD elliptic curve cryptosystem ECDSA JSF width-3 joint sparse form (JSF3) AJHD |
| 本文献已被 万方数据 等数据库收录！ |
|
