整数对的2-Ary自适应窗口表示算法 |
| |
作者姓名: | 李学俊 胡 磊 |
| |
作者单位: | 中国科学院研究生院 信息安全国家重点实验室,北京,100049 |
| |
摘 要: | 在有些公钥密码体制的实现中,特别是大多数数字签名(除了RSA)的验证过程,不仅需要指数运算,还需要能直接计算指数对。本文研究分析了整数对的从左到右的2阶自适应窗口表示(2-AWR),使用该表示可以使得Shamir算法实时实现,并且在同类算法中具有明显的速度优势。
|
关 键 词: | 整数对 指数对 2阶自适应窗口表示 Shamir算法 |
Adaptive 2-Ary Window Representation Algorithm for Pairs of Integers |
| |
Authors: | LI Xue-Jun HU Lei |
| |
Institution: | State Key Laboratory of Information Security, Graduate School of the Chinese Academy of Sciences, Beijing 100049 |
| |
Abstract: | In the implementation of some public key cryptosystems, in particular, the verification procedure of most common digital signatures (apart from RSA) are required to perform not only exponentiation, but also pairs of exponentiation directly. In this paper, a left-to-right adaptive 2-ary window representation (2-AWR) for pairs of integers is presented and analyzed. Shamir algorithm can be on-line carried out using this representation. And its advantage over other similar algorithm is demonstrated. |
| |
Keywords: | Pairs of Integers Pairs of Exponentiations Adaptive 2-Ary Window Representation Shamir Algorithm |
|
| 点击此处可从《》浏览原始摘要信息 |
| 点击此处可从《》下载免费的PDF全文 |