Paper 2023/051

On the Scholz conjecture on addition chains

Theophilus Agama, African Institute for Mathematical Sciences
Abstract

Applying the pothole method on the factors of numbers of the form 2n1, we prove the stronger inequality ι(2n1)n+1j=1lognlog2ξ(n,j)+3lognlog2 for all nN with n64 for 0ξ(n,j)<1, where ι() denotes the length of the shortest addition chain producing . This inequality is stronger than ι(r)<logrlog2(1+1loglogr+2log2(logr)1log2) in the case r=2n1 but slightly weaker than the conjectured inequality ι(2n1)n1+ι(n).

Metadata
Available format(s)
PDF
Category
Applications
Publication info
Preprint.
Keywords
sub-addition chaindeterminersregulatorslengthgeneratorspartitioncomplete
Contact author(s)
theophilus @ aims edu gh
History
2023-07-08: revised
2023-01-16: received
See all versions
Short URL
https://ia.cr/2023/051
License
Creative Commons Attribution-ShareAlike
CC BY-SA

BibTeX

@misc{cryptoeprint:2023/051,
      author = {Theophilus Agama},
      title = {On the Scholz conjecture on addition chains},
      howpublished = {Cryptology {ePrint} Archive, Paper 2023/051},
      year = {2023},
      url = {https://eprint.iacr.org/2023/051}
}
Note: In order to protect the privacy of readers, eprint.iacr.org does not use cookies or embedded third party content.