Low-Weight JSF3 Representations for Pairs of Integers

@article{Yajuan2006LowWeightJR,
  title={Low-Weight JSF3 Representations for Pairs of Integers},
  author={Zhang Ya-juan and Zhu Yue-fei and Kuang Bai-Jie},
  journal={Journal of Software},
  year={2006},
  volume={17},
  pages={2004}
}
  • Zhang Ya-juan, Zhu Yue-fei, Kuang Bai-Jie
  • Published 2006
  • Computer Science
  • Journal of Software
  • 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.

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 10 REFERENCES
    On multi-exponentiation in cryptography
    46
    A Survey of Fast Exponentiation Methods
    548
    Topics in Cryptology — CT-RSA 2001
    283
    A course in computational algebraic number theory
    • H. Cohen
    • Computer Science, Mathematics
    • 1993
    2461
    Software Implementation of the NIST Elliptic Curves Over Prime Fields
    284
    A Course in Computational Algebraic
    • 1993
    Pippenger'2 exponentiation algorithm
    • 2002