, The GNU Multiple Precision Arithmetic Library (GMP)

, Explicit Formula Database, 2014.

D. J. Bernstein and T. Lange, Faster addition and doubling on elliptic curves, Proceedings of ASIACRYPT 2007, vol.4833, pp.29-50, 2007.

R. Blank and P. Gallagher, Recommendation for Key Management, 2012.

A. Bosselaers, R. Govaerts, and J. Vandewalle, Comparison of Three Modular Reduction Functions, CRYPTO '93, pp.175-186, 1993.

M. Brown, D. Hankerson, J. López, and A. Menezes, Software implementation of the NIST elliptic curves over prime fields, CT-RSA 2001, pp.250-265, 2001.

C. Doche, On the Enumeration of Double-Base Chains with Applications to Elliptic Curve Cryptography, Advances in Cryptology-ASIACRYPT 2014, vol.8873, pp.297-316, 2014.

D. M. Gordon, A Survey of Fast Exponentiation Methods, J. Algorithms, vol.27, issue.1, pp.129-146, 1998.

D. Hankerson, J. L. Hernandez, and A. Menezes, Software Implementation of Elliptic Curve Cryptography over Binary Fields, CHES 2000, volume 1965 of LNCS, pp.1-24, 2000.

M. Hedabou, P. Pinel, and L. Bénéteau, A comb method to render ECC resistant against Side Channel Attacks, IACR Cryptology ePrint Archive, 2004.

M. Joye and M. Tunstall, Exponent Recoding and Regular Exponentiation Algorithms, Proceedings of Africacrypt 2009, pp.334-349, 2009.

C. Kerry and P. Gallagher, Digital Signature Standard (DSS), 2013.

N. Koblitz, Elliptic curve cryptosystems, 1987.

C. H. Lim and P. J. Lee, More flexible exponentiation with precomputation, Advances in Cryptology-Crypto '94, vol.839, pp.95-107, 1994.

A. Menezes, D. Hankerson, and S. Vanstone, Guide to Elliptic Curve Cryptography, 2004.

V. Miller, Use of elliptic curves in cryptography, 1985.

N. Mohamed, M. Hashim, and M. Hutter, Improved Fixed-Base Comb Method for Fast Scalar Multiplication, Progress in Cryptology-AFRICACRYPT 2012, vol.7374, pp.342-359, 2012.

P. Montgomery, Modular Multiplication Without Trial Division, Mathematics of Computation, vol.44, issue.170, pp.519-521, 1985.

C. Negre and T. Plantard, Efficient regular modular exponentiation using multiplicative half-size splitting, J. of Cryptographic Engineering
URL : https://hal.archives-ouvertes.fr/hal-01185249

T. Plantard and J. Robert, Enhanced Digital Signature Using RNS Digit Exponent Representation, WAIFI 2016, pp.177-192, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01337561

W. Tsaur and C. Chou, APPENDIX We review here the NIST recommended curves (see [12]) used in our implementations. Over a finite field F p , one has, Applied Mathematics and Computation, vol.168, issue.2, pp.1045-1064, 2005.