An Efficient Scalar Multiplication Algorithm for Elliptic Curve Cryptography Using a New Signed-Digit Representation

@inproceedings{Rezai2013AnES,
  title={An Efficient Scalar Multiplication Algorithm for Elliptic Curve Cryptography Using a New Signed-Digit Representation},
  author={Abdalhossein Rezai and Parviz Keshavarzi},
  year={2013}
}
This paper presents and evaluates a novel encoding algorithm to reduce the Hamming weight of the scalar. The scalar multiplication is modified to utilize this new scalar representation. The results show that the computation cost (the number of required clock cycles) in the proposed scalar multiplication is effectively reduced in comparison with other modified binary scalar multiplication algorithms. 

Citations

Publications citing this paper.
Showing 1-2 of 2 extracted citations

A novel Elliptic Curve Cryptography scheme using random sequence

2015 International Conference on Computer and Information Engineering (ICCIE) • 2015
View 4 Excerpts
Highly Influenced

References

Publications referenced by this paper.
Showing 1-8 of 8 references

Elliptic curve scalar multiplication algorithm using complementary recoding

Applied Mathematics and Computation • 2007
View 5 Excerpts
Highly Influenced

A new CMM-NAF modular exponentiation algorithm by using a new modular multiplication algorithm

A. Rezai, P. Keshavarzi
Trends Applied Sci. Res., 7(3), 240--247 (2012). Advanced Science and Technology Letters Vol.44 • 2013
View 1 Excerpt

High-performance implementation approach of elliptic curve cryptosystem for wireless network applications

2011 International Conference on Consumer Electronics, Communications and Networks (CECNet) • 2011
View 1 Excerpt

Minimizing hamming weight based on 1's complement of binary numbers over GF(2m)

2010 The 12th International Conference on Advanced Communication Technology (ICACT) • 2010

Similar Papers

Loading similar papers…