On using expansions to the base of -2

Roberto Avanzi; Gerhard Frey; Tanja Lange; Roger Oyono

doi:10.1080/00207160410001661311

On using expansions to the base of -2

Roberto Avanzi, Gerhard Frey, Tanja Lange, Roger Oyono

Research output: Contribution to journal › Article › peer-review

Abstract

This short note investigates the effects of using expansions to the base of -2. The main applications we have in mind are cryptographic protocols, where the crucial operation is computation of scalar multiples. For the recently proposed groups arising from Picard curves this leads to a saving of at least 7% for the computation of an m-fold. For more general non-hyperelliptic genus 3 curves we expect a larger speed-up.

Original language	English
Pages (from-to)	403-406
Number of pages	4
Journal	International Journal of Computer Mathematics
Volume	81
Issue number	4
DOIs	https://doi.org/10.1080/00207160410001661311
State	Published - Apr 2004
Externally published	Yes

Keywords

Exponentiation algorithms
Integer recodings
Public key cryptography

ASJC Scopus subject areas

Computer Science Applications
Computational Theory and Mathematics
Applied Mathematics

Access to Document

10.1080/00207160410001661311

Cite this

@article{46c65533c0fd4a75953b2414b57f702d,

title = "On using expansions to the base of -2",

abstract = "This short note investigates the effects of using expansions to the base of -2. The main applications we have in mind are cryptographic protocols, where the crucial operation is computation of scalar multiples. For the recently proposed groups arising from Picard curves this leads to a saving of at least 7% for the computation of an m-fold. For more general non-hyperelliptic genus 3 curves we expect a larger speed-up.",

keywords = "Exponentiation algorithms, Integer recodings, Public key cryptography",

author = "Roberto Avanzi and Gerhard Frey and Tanja Lange and Roger Oyono",

year = "2004",

month = apr,

doi = "10.1080/00207160410001661311",

language = "English",

volume = "81",

pages = "403--406",

journal = "International Journal of Computer Mathematics",

issn = "0020-7160",

publisher = "Taylor and Francis Ltd.",

number = "4",

}

TY - JOUR

T1 - On using expansions to the base of -2

AU - Avanzi, Roberto

AU - Frey, Gerhard

AU - Lange, Tanja

AU - Oyono, Roger

PY - 2004/4

Y1 - 2004/4

N2 - This short note investigates the effects of using expansions to the base of -2. The main applications we have in mind are cryptographic protocols, where the crucial operation is computation of scalar multiples. For the recently proposed groups arising from Picard curves this leads to a saving of at least 7% for the computation of an m-fold. For more general non-hyperelliptic genus 3 curves we expect a larger speed-up.

AB - This short note investigates the effects of using expansions to the base of -2. The main applications we have in mind are cryptographic protocols, where the crucial operation is computation of scalar multiples. For the recently proposed groups arising from Picard curves this leads to a saving of at least 7% for the computation of an m-fold. For more general non-hyperelliptic genus 3 curves we expect a larger speed-up.

KW - Exponentiation algorithms

KW - Integer recodings

KW - Public key cryptography

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

U2 - 10.1080/00207160410001661311

DO - 10.1080/00207160410001661311

M3 - Article

AN - SCOPUS:28244471581

SN - 0020-7160

VL - 81

SP - 403

EP - 406

JO - International Journal of Computer Mathematics

JF - International Journal of Computer Mathematics

IS - 4

ER -

On using expansions to the base of -2

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this