Star reduction among minimal length addition chains

DOI10.1007/s00607-010-0122-zzbMath1241.11143OpenAlexW2076450152MaRDI QIDQ644852

Hatem M. Bahig

Publication date: 7 November 2011

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00607-010-0122-z

zbMATH Keywords

branch and bound algorithmaddition chainminimal length addition chainstar chain

Mathematics Subject Classification ID

General topics in the theory of algorithms (68W01) Calculation of integer sequences (11Y55)

Related Items (1)

EFFICIENT GENERATION OF SHORTEST ADDITION-MULTIPLICATION CHAINS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Improved generation of minimal addition chains
• Theoretical computer science. Cumulative index, volumes 1-100 (1992)
• Addition chains -- an erratic sequence
• The Scholz-Brauer problem on addition chains
• A public key cryptosystem and a signature scheme based on discrete logarithms
• New directions in cryptography
• Computing Sequences with Addition Chains
• A method for obtaining digital signatures and public-key cryptosystems
• A Survey of Fast Exponentiation Methods
• Efficient Generation of Minimal Length Addition Chains
• Some Properties of Nonstar Steps in Addition Chains and New Cases Where the Scholz Conjecture Is True

This page was built for publication: Star reduction among minimal length addition chains