You are looking at a specific version 20060629:031721 of this paper.
See the latest version.
Paper 2006/216
Fast and Secure Elliptic Curve Scalar Multiplication Over Prime Fields Using Special Addition Chains
Meloni Nicolas
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)
- Category
- Implementation
- Publication info
- Published elsewhere. Unknown where it was published
- Contact author(s)
- meloni @ lirmm fr
- History
- 2006-06-29: received
- Short URL
- https://ia.cr/2006/216
- License
-
CC BY