원문정보
보안공학연구지원센터(IJSIA)
International Journal of Security and Its Applications
Vol.8 No.3
2014.05
pp.31-38
피인용수 : 0건 (자료제공 : 네이버학술정보)
초록
영어
Elliptic Curve Cryptosystem (ECC) is a well-known cryptosystem for securing the communications. The most important operation in ECC is scalar multiplication. The integer representation plays an important role in the performance of this operation. This paper presents and evaluates a novel recoding technique which reduces the average Hamming weight of integers. The Left-to-Right (L2R) scalar multiplication is modified to utilize this new integer representation. Our analysis shows that the computation cost (the number of required point addition/subtraction operation) in the proposed L2R scalar multiplication algorithm is effectively reduced in comparison with other modified L2R binary scalar multiplication algorithms.
목차
Abstract
1. Introduction
2. The Scalar Multiplication Algorithm
3. The Recoding Techniques
3.1. The Canonical Recoding Technique
3.2. The Complementary Recoding Technique
4. The Proposed Algorithms
4.1. The Proposed Recoding Technique
4.2. The Proposed Scalar Multiplication Algorithm
5. Comparison
6. Conclusion
References
1. Introduction
2. The Scalar Multiplication Algorithm
3. The Recoding Techniques
3.1. The Canonical Recoding Technique
3.2. The Complementary Recoding Technique
4. The Proposed Algorithms
4.1. The Proposed Recoding Technique
4.2. The Proposed Scalar Multiplication Algorithm
5. Comparison
6. Conclusion
References
키워드
저자정보
참고문헌
자료제공 : 네이버학술정보