On using expansions to the base of −2

DOI10.1080/00207160410001661311zbMATH Open1060.94013OpenAlexW1996972018MaRDI QIDQ4831428FDOQ4831428

Authors Tanja Lange, Roger Oyono, Roberto Maria Avanzi, Gerhard Frey 

Publication date 29 December 2004

Published in International Journal of Computer Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/math/0312060

zbMATH Keywords

public key cryptographyexponentiation algorithmsinteger recodings

Mathematics Subject Classification ID

Cryptography (94A60) Number-theoretic algorithms; complexity (11Y16) Applications to coding theory and cryptography of arithmetic geometry (14G50)

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.

Recommendations

• Koblitz curve cryptosystems
• Redundant \(\tau \)-adic expansions. II: Non-optimality and chaotic behaviour
• On Redundant τ-Adic Expansions and Non-adjacent Digit Sets
• Extending Scalar Multiplication Using Double Bases
• Progress in Cryptology – Mycrypt 2005

Cited in

(2)

• Fast Jacobian group operations for \(c_{3,4}\) curves over a large finite field
• Group arithmetic in \(C_{3,5}\) curves

This page was built for publication: On using expansions to the base of −2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4831428)