On addition chains l(mn) 1 (n)-b and lower bounds for c(r)

DOI10.1215/S0012-7094-73-04085-4zbMATH Open0275.10027OpenAlexW1542545476MaRDI QIDQ2265460FDOQ2265460

Authors: Edward G. Thurber 

Publication date: 1973

Published in: Duke Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1215/s0012-7094-73-04085-4

Mathematics Subject Classification ID

Additive number theory; partitions (11P99)

Cited In (8)

• A study of some addition chain problems
• Fast cryptography in genus 2
• Optimizing Double-Base Elliptic-Curve Single-Scalar Multiplication
• On-line evaluation of powers using Euclid's algorithm
• Some results on addition/subtraction chains
• Internal structure of addition chains: well-ordering
• Addition chains and solutions of \(\ell(2n)=\ell(n)\) and \(\ell(2^n-1)= n+\ell(n)-1\)
• Efficient computation of addition chains

This page was built for publication: On addition chains \(l(mn)\leq 1 (n)-b\) and lower bounds for c(r)

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