Speeding up the computations on an elliptic curve using addition-subtraction chains

From MaRDI portal
Publication:5202278

DOI10.1051/ita/1990240605311zbMath0724.11068OpenAlexW1584722274MaRDI QIDQ5202278

J. Olivos, François Morain

Publication date: 1990

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92374




Related Items (31)

Fast cryptography in genus 2Stern polynomialsElliptic curve scalar multiplication algorithm using complementary recodingOn binary signed digit representations of integersSpeeding up the computations of elliptic curves cryptoschemesExtending the signed non-zero bit and sign-aligned columns methods to general bases for use in cryptographySpeeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent FormFast elliptic scalar multiplication using new double-base chain and point halvingDistribution results for low-weight binary representations for pairs of integersAsymptotic expansions for linear homogeneous divide-and-conquer recurrences: algebraic and analytic approaches collatedOn-line evaluation of powers using Euclid's algorithmRedundant \(\tau \)-adic expansions. II: Non-optimality and chaotic behaviourBalanced non-adjacent formsOn the construction of short addition-subtraction chains and their applicationsFast Point Multiplication on Elliptic Curves without PrecomputationInvariant measures, matching and the frequency of 0 for signed binary expansionsAutomatic average-case analysis of algorithmsElliptic Curves and Primality ProvingIMPROVEMENT OF THE LOWER BOUND FOR THE COMPLEXITY OF EXPONENTIATIONThe Hamming weight of the non-adjacent-form under various input statisticsBinary signed-digit integers and the Stern diatomic sequenceSymmetric digit sets for elliptic curve scalar multiplication without precomputationOn the minimal Hamming weight of a multi-base representationOn the low Hamming weight discrete logarithm problem for nonadjacent representationsOn Bellman's and Knuth's problems and their generalizationsUnbalanced digit sets and the closest choice strategy for minimal weight integer representationsEfficient scalar multiplication for elliptic curves over binary fieldsSigned bits and fast exponentiationMatching for random systems with an application to minimal weight expansionsMinimal expansions in redundant number systems: Fibonacci bases and greedy algorithmsEfficient algorithms for speeding up the computations of elliptic curve cryptosystems


Uses Software


Cites Work


This page was built for publication: Speeding up the computations on an elliptic curve using addition-subtraction chains