Finite Field Arithmetic for Cryptography Feature

@inproceedings{Savas2010FiniteFA,
  title={Finite Field Arithmetic for Cryptography Feature},
  author={Erkay Savas},
  year={2010}
}
Cryptography is one of the most prominent application areas of the finite field arithmetic. Almost all public-key cryptographic algorithms including the recent algorithms such as elliptic curve and pairing-based cryptography rely heavily on finite field arithmetic, which needs to be performed efficiently to meet the execution speed and design space constraints. These objectives constitute massive challenges that necessitate interdisciplinary research efforts that will render the best algorithms… CONTINUE READING
Highly Cited
This paper has 48 citations. REVIEW CITATIONS
19 Citations
46 References
Similar Papers

Citations

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

Similar Papers

Loading similar papers…