Paper 2015/983
Fast, uniform, and compact scalar multiplication for elliptic curves and genus 2 Jacobians with applications to signature schemes
Ping Ngai Chung, Craig Costello, and Benjamin Smith
Abstract
We give a general framework for uniform, constant-time one- and two-dimensional scalar multiplication algorithms for elliptic curves and Jacobians of genus~2 curves that operate by projecting to the
Note: Added further bibliography.
Metadata
- Available format(s)
-
PDF
- Category
- Implementation
- Publication info
- Preprint. MINOR revision.
- Keywords
- elliptic curve cryptographyhyperelliptic curve cryptographyscalar multiplicationsignatures
- Contact author(s)
- smith @ lix polytechnique fr
- History
- 2015-10-19: revised
- 2015-10-12: received
- See all versions
- Short URL
- https://ia.cr/2015/983
- License
-
CC BY
BibTeX
@misc{cryptoeprint:2015/983, author = {Ping Ngai Chung and Craig Costello and Benjamin Smith}, title = {Fast, uniform, and compact scalar multiplication for elliptic curves and genus 2 Jacobians with applications to signature schemes}, howpublished = {Cryptology {ePrint} Archive, Paper 2015/983}, year = {2015}, url = {https://eprint.iacr.org/2015/983} }