Translator Disclaimer
25 August 2006 Residue systems efficiency for modular products summation: application to elliptic curves cryptography
Author Affiliations +
Residue systems of representation, like Residue Number Systems (RNS) for primary field(GF(p)) or Trinomial Residue Arithmetic for binary field (GF(2k)), 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 of fact, the complexities of the reduction in residue systems and of the multiplication in classical representations are similar. One of the main features of this reduction is that it doesn't depend on the field. Moreover, the cost of multiplication in residue systems is equivalent to the cost of reduction in classical representations for special well-chosen fields. Taking those properties into account, we remark that an expression like A * B + C * D, which requires two products, one addition and one reduction, evaluates faster in a residue system than in a classical one. So we propose to study types of expressions to offer a guide for choosing a most appropriate representation. One of the best domain of application is the Elliptic Curves Cryptography where addition and doubling points formulas are composed of products summation. The different kinds of coordinates like affine, projective, and Jacobean, offer a good choice of expressions for our study.
© (2006) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
J. C. Bajard, S. Duquesne, M. Ercegovac, and N. Meloni "Residue systems efficiency for modular products summation: application to elliptic curves cryptography", Proc. SPIE 6313, Advanced Signal Processing Algorithms, Architectures, and Implementations XVI, 631304 (25 August 2006);


Design of high-radix digit slices for online computations
Proceedings of SPIE (October 20 1996)
RNS bases and conversions
Proceedings of SPIE (October 25 2004)
Tools for mapping applications to CCMs
Proceedings of SPIE (October 07 1998)
Some improvements on RNS Montgomery modular multiplication
Proceedings of SPIE (November 12 2000)
Redundant finite rings for fault-tolerant signal processors
Proceedings of SPIE (October 27 1994)

Back to Top