Low-weight left-to-right binary signed-digit representation of N integers

An algorithm for computing the binary signed-digit representation of N integers is introduced. The algorithm operates from left to right (i.e., from the most significant bit to the least significant bit) and the resulting representation has minimum joint weight. Such an algorithm is useful in ellipt...

Full description

Saved in:
Bibliographic Details
Published inInternational Symposium onInformation Theory, 2004. ISIT 2004. Proceedings p. 547
Main Authors Ruan, X., Katti, R.S.
Format Conference Proceeding
LanguageEnglish
Published Piscataway NJ IEEE 2004
Subjects
Applied sciences
Computer science; control theory; systems
Elliptic curve cryptography
Exact sciences and technology
Information theory
Information, signal and communications theory
Telecommunications and information theory
Cryptography
Elliptic curve
Information theory
Online AccessGet full text

Cover

More Information
Summary:An algorithm for computing the binary signed-digit representation of N integers is introduced. The algorithm operates from left to right (i.e., from the most significant bit to the least significant bit) and the resulting representation has minimum joint weight. Such an algorithm is useful in elliptic curve cryptosystems (ECC).
ISBN:0780382803
9780780382800
DOI:10.1109/ISIT.2004.1365585