Efficient Circuitry for Computing τ-adic Non-Adjacent Form

@article{Jrvinen2006EfficientCF,
  title={Efficient Circuitry for Computing τ-adic Non-Adjacent Form},
  author={Kimmo J{\"a}rvinen and Juha Forsten and Jorma Skytt{\"a}},
  journal={2006 13th IEEE International Conference on Electronics, Circuits and Systems},
  year={2006},
  pages={232-235}
}
Elliptic curve point multiplication kP on an elliptic curve is required in every elliptic curve cryptosystem. The operation can be significantly accelerated by using a special type of elliptic curves called the Koblitz curves and by representing the integer k in τ-adic non-adjacent form (τNAF). Hardware-friendly modifications of existing τNAF conversion algorithms are presented and an efficient circuitry for the τNAF conversion is described with performance characteristics on an Altera Stratix… CONTINUE READING
Highly Cited
This paper has 20 citations. REVIEW CITATIONS
14 Citations
7 References
Similar Papers

Citations

Publications citing this paper.
Showing 1-10 of 14 extracted citations

References

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

Similar Papers

Loading similar papers…