A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
Residue systems efficiency for modular products summation: application to elliptic curves cryptography
2006
Advanced Signal Processing Algorithms, Architectures, and Implementations XVI
Residue systems of representation, like Residue Number Systems (RNS) for primary field(GF (p)) or Trinomial Residue Arithmetic for binary field (GF (2 k )), are characterized by efficient multiplication and costly modular reduction. On the other hand, conventional representations allow in some cases very efficient reductions but require costly multiplications. The main purpose of this paper is to analyze the complexity of those two different approaches in the summations of products. As a matter
doi:10.1117/12.679541
fatcat:eewd5xcb4zddlk6twtqvldfzdq