Paper 2006/216 Original: eprint.iacr.org/2006/216 ↗
Fast and Secure Elliptic Curve Scalar Multiplication Over Prime Fields Using Special Addition Chains
Abstract
In this paper, we propose a new fast and secure point multiplication algorithm. It is based on a particular kind of addition chains involving only additions (no doubling), providing a natural protection against side channel attacks. Moreover, we propose new addition formulae that take into account the specific structure of those chains making point multiplication very efficient.
Metadata
- Available format(s)
PDF- Category
- Implementation
- Publication info
- Preprint.
- History
- 2006-06-29: last updated
- 2006-06-29: published
- Short URL
- https://ia.cr/2006/216
- License
- https://creativecommons.org/licenses/by/4.0/
BibTeX
@misc{cryptoeprint:2006/216,
author = {Meloni Nicolas},
title = {Fast and Secure Elliptic Curve Scalar Multiplication Over Prime Fields Using Special Addition Chains},
howpublished = {Cryptology {ePrint} Archive, Paper 2006/216},
year = {2006},
url = {https://eprint.iacr.org/2006/216}
}