Back to Search
Start Over
Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains.
- Source :
- Advances in Cryptology - ASIACRYPT 2005; 2005, p59-78, 20p
- Publication Year :
- 2005
-
Abstract
- In this paper, we propose a efficient and secure point multiplication algorithm, based on double-base chains. This is achieved by taking advantage of the sparseness and the ternary nature of the so-called double-base number system (DBNS). The speed-ups are the results of fewer point additions and improved formulæ for point triplings and quadruplings in both even and odd characteristic. Our algorithms can be protected against simple and differential side-channel analysis by using side-channel atomicity and classical randomization techniques. Our numerical experiments show that our approach leads to speed-ups compared to windowing methods, even with window size equal to 4, and other SCA resistant algorithms. [ABSTRACT FROM AUTHOR]
Details
- Language :
- English
- ISBNs :
- 9783540306849
- Database :
- Supplemental Index
- Journal :
- Advances in Cryptology - ASIACRYPT 2005
- Publication Type :
- Book
- Accession number :
- 32864438
- Full Text :
- https://doi.org/10.1007/11593447_4