On using expansions to the base of −2

DOI10.1080/00207160410001661311zbMATH Open1060.94013arXivmath/0312060OpenAlexW1996972018MaRDI QIDQ4831428FDOQ4831428

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

Publication date: 29 December 2004

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

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.

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)

Cites Work

• Title not available (Why is that?)

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)