Left-to-Right signed-bit τ-adic representations of n integers

Authors:
Billy Bob Brumley
Affiliations:
Laboratory for Theoretical Computer Science, Helsinki University of Technology, TKK, Finland
Venue:
ICICS'06 Proceedings of the 8th international conference on Information and Communications Security
Year:
2006

Citing 5
Cited 1

Efficient Arithmetic on Koblitz Curves

Designs, Codes and Cryptography - Special issue on towards a quarter-century of public key cryptography
CM-Curves with Good Cryptographic Properties

CRYPTO '91 Proceedings of the 11th Annual International Cryptology Conference on Advances in Cryptology
Guide to Elliptic Curve Cryptography

Guide to Elliptic Curve Cryptography
Distribution results for low-weight binary representations for pairs of integers

Theoretical Computer Science - Combinatorics of the discrete plane and tilings
Improved algorithms for efficient arithmetic on elliptic curves using fast endomorphisms

EUROCRYPT'03 Proceedings of the 22nd international conference on Theory and applications of cryptographic techniques

FPGA Design of Self-certified Signature Verification on Koblitz Curves

CHES '07 Proceedings of the 9th international workshop on Cryptographic Hardware and Embedded Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Koblitz curves are often used in digital signature schemes where signature verifications need to be computed efficiently. Simultaneous elliptic scalar multiplication is a useful method of carrying out such verifications. This paper presents an efficient alternative to τ-adic Joint Sparse Form that moves left-to-right for computations involving two points. A generalization of this algorithm is then presented for generating a low joint weight representation of an arbitrary number of integers.