Low-Weight JSF3 Representations for Pairs of Integers

  title={Low-Weight JSF3 Representations for Pairs of Integers},
  author={Zhang Yajuan and Zhu Yue-fei and Kuang BaiJie},
J.A.Solinas suggested an optimal signed binary representation for pairs of integers, which is called a Joint Sparse Form (JSF). JSF is at most one bit longer than the binary expansion of the larger of the two integers, and the average joint Hamming density among Joint Sparse Form representations is 1/2. This paper extends the Joint Sparse Form by using a window method, namely a new representations, for pairs of integers, which is called Width-3 Joint Sparse Form (JSF3). The representation is at… CONTINUE READING

Topics from this paper.


Publications referenced by this paper.

Pippenger’2 exponentiation algorithm

  • DJ Bernstein
  • http://cr.rp.to/papers.html
  • 2002

A survey of fast exponentiation methods

  • DM Gordon
  • Journal of Algorithms,
  • 1998
3 Excerpts

A Course in Computational Algebraic

  • H. Cohen
  • Number Theory. Berlin: Springer-Verlag,
  • 1993
2 Excerpts

Similar Papers

Loading similar papers…