Comparison of Modular Arithmetic Algorithms on GPUs

@inproceedings{Giorgi2009ComparisonOM,
  title={Comparison of Modular Arithmetic Algorithms on GPUs},
  author={Pascal Giorgi and Thomas Izard and Arnaud Tisserand},
  booktitle={PARCO},
  year={2009}
}
We present below our first implementation results on a modular arithmetic library for cryptography on GPUs. Our library, in C++ for CUDA, provides modular arithmetic, finite field arithmetic and some ECC support. Several algorithms and memory coding styles have been compared: local, shared and register. For moderate sizes, we report up to 2.6 speedup compared to state-of-the-art library. 
Highly Cited
This paper has 31 citations. REVIEW CITATIONS
23 Citations
9 References
Similar Papers

Citations

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

References

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

A library for prototyping the computer arithmetic level in elliptic curve cryptography

  • L. Imbert, A. Peirera, A. Tisserand
  • Proc. Advanced Signal Processing Algorithms…
  • 2007
Highly Influential
5 Excerpts

Modern C++ design: generic programming and design patterns applied

  • Andrei Alexandrescu
  • 2001
1 Excerpt

Burton S . Kaliski . Analyzing and comparing montgomery multiplication algorithms

  • F. T. Luk, Cetin Kaya Koc, Tolga Acar
  • IEEE Micro
  • 1996

Modular multiplication without trial division

  • P. L. Montgomery
  • Mathematics of Computation,
  • 1985
1 Excerpt

Similar Papers

Loading similar papers…