Star reduction among minimal length addition chains
From MaRDI portal
Publication:644852
DOI10.1007/S00607-010-0122-ZzbMATH Open1241.11143OpenAlexW2076450152MaRDI QIDQ644852FDOQ644852
Authors: 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
Recommendations
Cites Work
- A method for obtaining digital signatures and public-key cryptosystems
- A public key cryptosystem and a signature scheme based on discrete logarithms
- New directions in cryptography
- A Survey of Fast Exponentiation Methods
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient Generation of Minimal Length Addition Chains
- 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
- Computing Sequences with Addition Chains
- Title not available (Why is that?)
- Some Properties of Nonstar Steps in Addition Chains and New Cases Where the Scholz Conjecture Is True
Cited In (4)
This page was built for publication: Star reduction among minimal length addition chains
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q644852)