Signed bits and fast exponentiation
From MaRDI portal
Publication:1826277
DOI10.5802/jtnb.301zbMath1060.11082OpenAlexW2133161721MaRDI QIDQ1826277
Publication date: 5 August 2004
Published in: Journal de Théorie des Nombres de Bordeaux (Search for Journal in Brave)
Full work available at URL: http://www.numdam.org/item?id=JTNB_2001__13_1_27_0
Analysis of algorithms and problem complexity (68Q25) Analysis of algorithms (68W40) Symbolic computation and algebraic computation (68W30) Number-theoretic algorithms; complexity (11Y16) Complexity of computation (including implicit computational complexity) (03D15) Radix representation; digital problems (11A63)
Related Items (13)
Dynamical directions in numeration ⋮ Stern polynomials ⋮ Speeding up the Elliptic Curve Scalar Multiplication Using Non Adjacent Form ⋮ Fast elliptic curve point multiplication based on binary and binary non-adjacent scalar form methods ⋮ Exponential sums over points of elliptic curves ⋮ Numeration and discrete dynamical systems ⋮ ON THE BINARY DIGITS OF ALGEBRAIC NUMBERS ⋮ Collisions in fast generation of ideal classes and points on hyperelliptic and elliptic curves ⋮ A Graph Theoretic Analysis of Double Base Number Systems ⋮ Noncanonical number systems in the integers ⋮ Another Approach to Pairing Computation in Edwards Coordinates ⋮ Fast elliptic curve point multiplication based on window non-adjacent form method ⋮ On Pseudorandom Properties of Certain Sequences of Points on Elliptic Curve
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some results on addition/subtraction chains
- Addition chains with multiplicative cost
- Effect of Improved Multiplication Efficiency on Exponentiation Algorithms Derived from Addition Chains
- A Survey of Fast Exponentiation Methods
- Speeding up the computations on an elliptic curve using addition-subtraction chains
- A SIGNED BINARY MULTIPLICATION TECHNIQUE
This page was built for publication: Signed bits and fast exponentiation
