An improved bound for length of addition chains producing $2^n-1$

dc.contributor.authorAgama, Theophilus
dc.date.accessioned2024-03-25T11:19:34Z
dc.date.available2024-03-25T11:19:34Z
dc.date.issued2022-07-19
dc.description.abstractIn this paper we prove that there exists an addition chain producing... #find full abstract in the attached document
dc.description.provenanceSubmitted by Grace Kambwiri (gracekambwiri@gmail.com) on 2024-03-25T11:19:34Z No. of bitstreams: 1 filling the pothole method.pdf: 296025 bytes, checksum: f9264badfb55f729d787f792d921d139 (MD5)en
dc.description.provenanceMade available in DSpace on 2024-03-25T11:19:34Z (GMT). No. of bitstreams: 1 filling the pothole method.pdf: 296025 bytes, checksum: f9264badfb55f729d787f792d921d139 (MD5) Previous issue date: 2022-07-19en
dc.identifier.doihttps://doi.org/10.14293/111.000/000041.v1
dc.identifier.doihttps://doi.org/10.60763/africarxiv/1315
dc.identifier.urihttps://africarxiv.ubuntunet.net/handle/1/1364
dc.language.isoen
dc.subjectgenerators
dc.subjectsub-addition chain
dc.subjectdeterminers
dc.subjectregulators
dc.subjectlength
dc.titleAn improved bound for length of addition chains producing $2^n-1$

Files

Original bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
filling the pothole method.pdf
Size:
289.09 KB
Format:
Adobe Portable Document Format

License bundle

Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
license.txt
Size:
1.72 KB
Format:
Item-specific license agreed to upon submission
Description:

Collections