Low-Weight JSF 3 Representations for Pairs of Integers

@inproceedings{Yajuan2006LowWeightJ3,
  title={Low-Weight JSF 3 Representations for Pairs of Integers},
  author={Zhang Ya-juan and Zhu Yue-fei and KUANG Bai-Jie},
  year={2006}
}
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

From This Paper

Topics from this paper.

References

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

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
View 3 Excerpts

A Course in Computational Algebraic

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

Elementary Probability Theory with Stochastic Processes

KL Chung
1978
View 3 Excerpts

Similar Papers

Loading similar papers…