Title :
On the signed-binary window method [cryptosystem applications]
Author :
Ruan, Xiaoyu ; Katti, Rajendra
Author_Institution :
Dept. of Electr. & Comput. Eng., North Dakota State Univ., Fargo, ND, USA
Abstract :
We propose a left-to-right (i.e., from the most significant column to the least significant column) algorithm for computing a signed-binary (SB) representation of pairs of integers with minimum joint weight as well as maximum average length of zero-column runs. The proposed method speeds up the scalar multiplication of elliptic curve cryptosystems; (ECC) by all known strategies, while at the same time reduces the hardware overhead. Furthermore, we present the necessary and sufficient condition that an SB representation of n integers has minimum joint weight.
Keywords :
binary sequences; cryptography; digital arithmetic; ECC scalar multiplication; elliptic curve cryptosystems; integer pair signed-binary representation; left-to-right algorithm; minimum joint weight representation; signed-binary window method; zero-column runs maximum average length; Digital signatures; Elliptic curve cryptography; Elliptic curves; Error correction codes; Hardware; Neodymium; Security; Smart cards; Sufficient conditions;
Conference_Titel :
Circuits and Systems, 2005. ISCAS 2005. IEEE International Symposium on
Print_ISBN :
0-7803-8834-8
DOI :
10.1109/ISCAS.2005.1465632
