A Note on Signed Binary Window Algorithm for Elliptic Curve Cryptosystems

  title={A Note on Signed Binary Window Algorithm for Elliptic Curve Cryptosystems},
  author={Fanyu Kong and Daxing Li},
The window algorithms for various signed binary representations have been used to speed up point multiplication on elliptic curves. While there’s been extensive research on the non-adjacent form, little attention has been devoted to non-sparse optimal signed binary representations. In the paper, we prove some properties of non-sparse optimal signed binary representations and present a precise analysis of the nonsparse signed window algorithm. The main contributions are described as follows… CONTINUE READING


Publications citing this paper.


Publications referenced by this paper.
Showing 1-10 of 30 references

Efficiency analysis of window methods using Markov chains,

  • Olivier Semay
  • Available at: http://www.cdc.informatik. tu…
  • 2004
Highly Influential
8 Excerpts

Window and extended window methods for addition-subtraction chain,

  • N. Kunihiro, H. Yamamoto
  • IEICE Trans. on Fundamentals, vol.E81-A,
  • 1998
Highly Influential
5 Excerpts

Reitwiesner, “Binary arithmetic,

  • G W.
  • Advances in Computers,
  • 1960
Highly Influential
4 Excerpts

Similar Papers

Loading similar papers…