Paper 2020/1111
Extending the Signed Non-zero Bit and Sign-Aligned Columns Methods to General Bases for Use in Cryptography
Abhraneel Dutta, Aaron Hutchinson, and Koray Karabina
Abstract
An efficient scalar multiplication algorithm is a crucial component of elliptic curve cryptosystems. We propose a scalar multiplication algorithm based on scalar recodings that is regular in nature. Our scalar multiplication algorithm is made from two scalar recoding algorithms called
Metadata
- Available format(s)
-
PDF
- Category
- Public-key cryptography
- Publication info
- Preprint. MINOR revision.
- Keywords
- Elliptic curvesscalar multiplicationscalar recoding
- Contact author(s)
-
adutta2016 @ fau edu
a5hutchinson @ uwaterloo ca
koray karabina @ nrc-cnrc gc ca - History
- 2020-10-28: last of 2 revisions
- 2020-09-15: received
- See all versions
- Short URL
- https://ia.cr/2020/1111
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2020/1111, author = {Abhraneel Dutta and Aaron Hutchinson and Koray Karabina}, title = {Extending the Signed Non-zero Bit and Sign-Aligned Columns Methods to General Bases for Use in Cryptography}, howpublished = {Cryptology {ePrint} Archive, Paper 2020/1111}, year = {2020}, url = {https://eprint.iacr.org/2020/1111} }