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

Billy Bob Brumley

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

3 Citations (Scopus)

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.

Original language	English
Title of host publication	Information and Communications Security - 8th International Conference, ICICS 2006, Proceedings
Publisher	Springer Verlag
Pages	469-478
Number of pages	10
ISBN (Print)	9783540494966
Publication status	Published - 1 Jan 2006
Externally published	Yes
Publication type	A4 Article in conference proceedings
Event	8th International Conference on Information and Communications Security, ICICS 2006 - Raleigh, United States Duration: 4 Dec 2006 → 7 Dec 2006

Publication series

Name	Lecture Notes in Computer Science
Volume	4307
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	8th International Conference on Information and Communications Security, ICICS 2006
Country/Territory	United States
City	Raleigh
Period	4/12/06 → 7/12/06

Keywords

Digital signatures
Elliptic curve cryptography
Joint sparse form
Koblitz curves
Simultaneous elliptic scalar multiplication

Publication forum classification

Publication forum level 1

ASJC Scopus subject areas

Theoretical Computer Science
Computer Science(all)

Cite this

@inproceedings{06d83654d94b45d9bb16a6b5a1eadc09,

title = "Left-to-right signed-bit τ -adic representations of n integers",

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.",

keywords = "Digital signatures, Elliptic curve cryptography, Joint sparse form, Koblitz curves, Simultaneous elliptic scalar multiplication",

author = "Brumley, {Billy Bob}",

year = "2006",

month = jan,

day = "1",

language = "English",

isbn = "9783540494966",

series = "Lecture Notes in Computer Science",

publisher = "Springer Verlag",

pages = "469--478",

booktitle = "Information and Communications Security - 8th International Conference, ICICS 2006, Proceedings",

address = "Germany",

note = "8th International Conference on Information and Communications Security, ICICS 2006 ; Conference date: 04-12-2006 Through 07-12-2006",

}

Brumley, BB 2006, Left-to-right signed-bit τ -adic representations of n integers. in Information and Communications Security - 8th International Conference, ICICS 2006, Proceedings. Lecture Notes in Computer Science, vol. 4307, Springer Verlag, pp. 469-478, 8th International Conference on Information and Communications Security, ICICS 2006, Raleigh, United States, 4/12/06.

Left-to-right signed-bit τ -adic representations of n integers. / Brumley, Billy Bob.

Information and Communications Security - 8th International Conference, ICICS 2006, Proceedings. Springer Verlag, 2006. p. 469-478 (Lecture Notes in Computer Science; Vol. 4307).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Scientific › peer-review

TY - GEN

T1 - Left-to-right signed-bit τ -adic representations of n integers

AU - Brumley, Billy Bob

PY - 2006/1/1

Y1 - 2006/1/1

N2 - 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.

AB - 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.

KW - Digital signatures

KW - Elliptic curve cryptography

KW - Joint sparse form

KW - Koblitz curves

KW - Simultaneous elliptic scalar multiplication

UR - http://www.scopus.com/inward/record.url?scp=38049045374&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:38049045374

SN - 9783540494966

T3 - Lecture Notes in Computer Science

SP - 469

EP - 478

BT - Information and Communications Security - 8th International Conference, ICICS 2006, Proceedings

PB - Springer Verlag

T2 - 8th International Conference on Information and Communications Security, ICICS 2006

Y2 - 4 December 2006 through 7 December 2006

ER -

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

Abstract

Publication series

Conference

Keywords

Publication forum classification

ASJC Scopus subject areas

Other files and links

Fingerprint

Cite this