Adaptive 2-Ary Window Representation Algorithm for Pairs of Integers
整数对的2-Ary自适应窗口表示算法

In the implementation of some public key cryptosystems, the verification procedure of most common digital signatures (apart from RSA)in particular,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. With this presentation,shamir algorithm can be carried out on-line. And its advantage over other similar algorithm is demonstrated.