J. Allouche and J. Shallit, Automatic Sequences, 2003.

R. Avanzi, A Note on the Signed Sliding Window Integer Recoding and a Left-to-Right Analogue, Selected Areas in Cryptography, pp.130-143, 2004.
DOI : 10.1007/978-3-540-30564-4_9

J. Bajard, L. Didier, and P. Kornerup, An RNS Montgomery modular multiplication algorithm, IEEE Transactions on Computers, vol.46, issue.7, pp.766-776, 1998.

J. Bajard, L. Didier, and P. Kornerup, Modular multiplication and base extensions in residue number systems, Proceedings 15th IEEE Symposium on Computer Arithmetic. ARITH-15 2001, pp.59-65, 2001.
DOI : 10.1109/ARITH.2001.930104

J. Bajard and L. Imbert, a full RNS implementation of RSA, IEEE Transactions on Computers, vol.53, issue.6, pp.769-774, 2004.
DOI : 10.1109/TC.2004.2

URL : https://hal.archives-ouvertes.fr/lirmm-00108553

J. Bajard, L. Imbert, and G. A. Jullien, Parallel Montgomery Multiplication in GF (2^k) Using Trinomial Residue Arithmetic, 17th IEEE Symposium on Computer Arithmetic (ARITH'05), pp.164-171, 2005.
DOI : 10.1109/ARITH.2005.34

URL : https://hal.archives-ouvertes.fr/lirmm-00106024

J. Bajard, L. Imbert, G. A. Jullien, and H. C. Williams, A CRT-based Montgomery multiplication for finite fields of small characteristic, Proceedings 17th IMACS World Congress, Scientific Computation, Applied Mathematics and Simulation, pp.101-107, 2005.
URL : https://hal.archives-ouvertes.fr/lirmm-00106455

J. Bajard, L. Imbert, P. Liardet, and Y. Teglia, Leak Resistant Arithmetic, Cryptographic Hardware and Embedded Systems, pp.62-75, 2004.
DOI : 10.1007/978-3-540-28632-5_5

URL : https://hal.archives-ouvertes.fr/lirmm-00108863

J. Bajard, L. Imbert, and C. Negre, Modular Multiplication in GF(pk) Using Lagrange Representation, Progress in Cryptology, INDOCRYPT'02, number 2551 in Lecture Notes in Computer Science, pp.275-284, 2002.
DOI : 10.1007/3-540-36231-2_22

URL : https://hal.archives-ouvertes.fr/lirmm-00090350

J. Bajard, L. Imbert, and C. Negre, Arithmetic Operations in Finite Fields of Medium Prime Characteristic Using the Lagrange Representation, IEEE Transactions on Computers, vol.55, issue.9, pp.1167-1177, 2006.
DOI : 10.1109/TC.2006.136

URL : https://hal.archives-ouvertes.fr/lirmm-00102865

J. Bajard, L. Imbert, C. Negre, and T. Plantard, Multiplication in GF(p k ) for elliptic curve cryptography, Proceedings of the 16th IEEE Symposium on Computer Arithmetic, ARITH16, pp.181-187, 2003.
URL : https://hal.archives-ouvertes.fr/lirmm-00269538

J. Bajard, L. Imbert, and T. Plantard, Modular Number Systems: Beyond the Mersenne Family, Proceedings of the 11th International Workshop on Selected Areas in Cryptography, pp.159-169, 2005.
DOI : 10.1007/978-3-540-30564-4_11

URL : https://hal.archives-ouvertes.fr/lirmm-00109208

P. Barrett, Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor, Advances in Cryptology, CRYPTO'86, pp.311-326, 1986.
DOI : 10.1007/3-540-47721-7_24

D. J. Bernstein, Curve25519: New Diffie-Hellman Speed Records, Proceedings of Public Key Cryptography, PKC 2006, pp.207-228, 2006.
DOI : 10.1007/11745853_14

D. J. Bernstein and T. Lange, Faster Addition and Doubling on Elliptic Curves, Advances in cryptology, ASIACRYPT 2007, pp.29-50, 2007.
DOI : 10.1007/978-3-540-76900-2_3

V. Berthé, Autour du système de numération d'Ostrowski, Bulletin of the Belgian Mathematical Society, vol.8, pp.209-239, 2001.

V. Berthé and L. Imbert, On converting numbers to the double-base number system, Advanced Signal Processing Algorithms, pp.70-78, 2004.

V. Berthé and L. Imbert, Writing integers in two bases, 2008.

I. F. Blake, G. Seroussi, and N. P. Smart, Elliptic Curves in Cryptography, Number, vol.256, 1999.
DOI : 10.1017/CBO9781107360211

I. F. Blake, G. Seroussi, and N. P. Smart, Advances in Elliptic Curve Cryptography. Number 317 in London Mathematical Society Lecture Note Series, 2005.

D. Boneh, R. A. Demillo, and R. J. Lipton, On the Importance of Checking Cryptographic Protocols for Faults, Advances in Cryptology, EUROCRYPT'97, pp.37-51, 1997.
DOI : 10.1007/3-540-69053-0_4

A. D. Booth, A SIGNED BINARY MULTIPLICATION TECHNIQUE, The Quarterly Journal of Mechanics and Applied Mathematics, vol.4, issue.2, pp.236-240, 1951.
DOI : 10.1093/qjmam/4.2.236

W. Bosma, Signed bits and fast exponentiation, Journal de Th??orie des Nombres de Bordeaux, vol.13, issue.1, pp.27-41, 2001.
DOI : 10.5802/jtnb.301

W. Bosma, J. Cannon, and C. Playoust, The Magma Algebra System I: The User Language, Journal of Symbolic Computation, vol.24, issue.3-4, pp.235-265, 1997.
DOI : 10.1006/jsco.1996.0125

C. ¸. Koç, T. Acar, and B. S. Kaliski-jr, Analyzing and comparing Montgomery multiplication algorithms, IEEE Micro, vol.16, issue.3, pp.26-33, 1996.
DOI : 10.1109/40.502403

J. Chung and A. Hasan, More Generalized Mersenne Numbers, Selected Areas in Cryptography , SAC'03, pp.335-347, 2004.
DOI : 10.1007/978-3-540-24654-1_24

H. Cohen, Analysis of the Sliding Window Powering Algorithm, Journal of Cryptology, vol.18, issue.1, pp.63-76, 2005.
DOI : 10.1007/s00145-004-0218-8

H. Cohen and G. Frey, Handbook of Elliptic and Hyperelliptic Curve Cryptography, 2005.
DOI : 10.1201/9781420034981

H. Cohen, A. Miyaji, and T. Ono, Efficient elliptic curve exponentiation, Information and Commuunication Security, pp.282-290, 1997.

R. Crandall, Method and apparatus for public key exchange in a cryptographic system, 1992.

W. Diffie and M. E. Hellman, New directions in cryptography, IEEE Transactions on Information Theory, vol.22, issue.6, pp.22644-654, 1976.
DOI : 10.1109/TIT.1976.1055638

V. Dimitrov and T. V. Cooklev, Hybrid algorithm for the computation of the matrix polynomial I+A+??????+A/sup N-1/, IEEE Transactions on Circuits and Systems I : Fundamental Theory and Applications, pp.377-380, 1995.
DOI : 10.1109/81.401149

V. Dimitrov, J. Eskritt, L. Imbert, G. A. Jullien, and W. C. Miller, The use of the multidimensional logarithmic number system in DSP applications, Proceedings of the 15th IEEE Symposium on Computer Arithmetic, ARITH15, pp.247-254, 2001.

V. Dimitrov, L. Imbert, and P. K. Mishra, Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains, Advances in Cryptology, ASIACRYPT'05, pp.59-78, 2005.
DOI : 10.1007/11593447_4

URL : https://hal.archives-ouvertes.fr/lirmm-00106638

V. Dimitrov, L. Imbert, and P. K. Mishra, The double-base number system and its application to elliptic curve cryptography, Mathematics of Computation, vol.77, issue.262, pp.1075-1104, 2008.
DOI : 10.1090/S0025-5718-07-02048-0

URL : https://hal.archives-ouvertes.fr/lirmm-00102810

V. Dimitrov, L. Imbert, and A. Zakaluzny, Sublinear constant multiplication algorithms, Advanced Signal Processing Algorithms, Architectures, and Implementations XVI, p.631305, 2006.
DOI : 10.1117/12.680289

URL : https://hal.archives-ouvertes.fr/lirmm-00102864

V. Dimitrov, L. Imbert, and A. Zakaluzny, Multiplication by a Constant is Sublinear, 18th IEEE Symposium on Computer Arithmetic (ARITH '07), pp.261-268, 2007.
DOI : 10.1109/ARITH.2007.24

URL : https://hal.archives-ouvertes.fr/lirmm-00158322

V. Dimitrov and G. A. Jullien, Loading the bases: a new number representation with applications, IEEE Circuits and Systems Magazine, vol.3, issue.2, pp.6-23, 2003.
DOI : 10.1109/MCAS.2003.1242832

V. Dimitrov, G. A. Jullien, and W. C. Miller, An algorithm for modular exponentiation, Information Processing Letters, vol.66, issue.3, pp.155-159, 1998.
DOI : 10.1016/S0020-0190(98)00044-1

V. Dimitrov, G. A. Jullien, and W. C. Miller, Theory and applications of the double-base number system, IEEE Transactions on Computers, vol.48, issue.10, pp.1098-1106, 1999.
DOI : 10.1109/12.805158

C. Doche, T. Icart, and D. R. , Efficient Scalar Multiplication by Isogeny Decompositions, Public Key Cryptography, PKC'06, pp.191-206, 2006.
DOI : 10.1007/11745853_13

C. Doche and L. Imbert, Extended Double-Base Number System with Applications to Elliptic Curve Cryptography, Progress in Cryptology, INDOCRYPT'06, pp.335-348, 2006.
DOI : 10.1007/11941378_24

URL : https://hal.archives-ouvertes.fr/lirmm-00125442

H. M. Edwards, A normal form for elliptic curves, Bulletin of the American Mathematical Society, vol.44, issue.03, pp.393-422, 2007.
DOI : 10.1090/S0273-0979-07-01153-6

M. D. Ercegovac, L. Imbert, D. W. Matula, J. Muller, and G. Wei, Improving Goldschmidt division, square root, and square root reciprocal, IEEE Transactions on Computers, vol.49, issue.7, pp.759-763, 2000.
DOI : 10.1109/12.863046

URL : https://hal.archives-ouvertes.fr/inria-00072909

M. D. Ercegovac and T. Lang, Division and Square Root : Digit-Recurrence Algorithms and Implementations, 1994.

M. D. Ercegovad and T. Lang, Digital Arithmetic, 2003.

C. V. Freiman, Statistical Analysis of Certain Binary Division Algorithms, IRE Proceedings, pp.91-103, 1961.
DOI : 10.1109/JRPROC.1961.287780

R. E. Goldschmidt, Applications of division by convergence, 1964.

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

L. Imbert, V. Dimitrov, and G. A. Jullien, Fault-tolerant computations over replicated finite rings, IEEE Transactions on Circuits and Systems I : Fundamental Theory and Applications, pp.858-864, 2003.
DOI : 10.1109/TCSI.2003.814085

URL : https://hal.archives-ouvertes.fr/lirmm-00269574

L. Imbert, A. Pereira, and A. Tisserand, A library for prototyping the computer arithmetic level in elliptic curve cryptography, Advanced Signal Processing Algorithms, Architectures, and Implementations XVII, p.66970, 2007.
DOI : 10.1117/12.733652

URL : https://hal.archives-ouvertes.fr/lirmm-00153369

M. Joye and S. Yen, Optimal left-to-right binary signed-digit recoding, IEEE Transactions on Computers, vol.49, issue.7, pp.740-748, 2000.
DOI : 10.1109/12.863044

D. E. Knuth, The Art of Computer Programming Seminumerical Algorithms, 1997.

N. Koblitz, Elliptic curve cryptosystems, Mathematics of Computation, vol.48, issue.177, pp.203-209, 1987.
DOI : 10.1090/S0025-5718-1987-0866109-5

N. Koblitz, CM-Curves with Good Cryptographic Properties, Advances in Cryptography, CRYPTO'91, pp.279-287, 1992.
DOI : 10.1007/3-540-46766-1_22

P. Kocher, J. Jaffe, and B. Jun, Differential Power Analysis, Advances in Cryptology, CRYPTO'99, pp.388-397, 1999.
DOI : 10.1007/3-540-48405-1_25

P. C. Kocher, Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems, Advances in Cryptology, CRYPTO'96, pp.104-113, 1996.
DOI : 10.1007/3-540-68697-5_9

A. Menezes, P. C. Van-oorschot, and S. A. Vanstone, Handbook of applied cryptography, 1997.
DOI : 10.1201/9781439821916

V. S. Miller, Use of Elliptic Curves in Cryptography, Advances in Cryptology, pp.417-428, 1986.
DOI : 10.1007/3-540-39799-X_31

P. L. Montgomery, Evaluating recurrences of form x m+n = f (x m , x n , x m?n ) via Lucas chains, 1983.

P. L. Montgomery, Modular multiplication without trial division, Mathematics of Computation, vol.44, issue.170, pp.519-521, 1985.
DOI : 10.1090/S0025-5718-1985-0777282-X

P. L. Montgomery, Speeding the Pollard and elliptic curve methods of factorization, Mathematics of Computation, vol.48, issue.177, pp.243-264, 1987.
DOI : 10.1090/S0025-5718-1987-0866113-7

J. A. Muir and D. R. Stinson, New Minimal Weight Representations for Left-to-Right Window Methods, Topics in cryptology, CT-RSA 2005, pp.366-383, 2005.
DOI : 10.1007/978-3-540-30574-3_25

J. Muller, Arithmétique des ordinateurs, 1989.

J. Muller, Algorithmes de division pour microprocesseurs : illustrationàillustrationà l'aide du " bug " du Pentium, Technique et Science Informatiques, vol.14, issue.8, 1995.

T. Plantard, Arithmétique Modulaire pour la Cryptographie, 2005.

G. W. Reitwiesner, Binary arithmetic Advances in Computers, pp.231-308, 1960.

R. Rivest, A. Shamir, and L. Adleman, A method for obtaining digital signatures and public-key cryptosystems, Communications of the ACM, vol.21, issue.2, pp.120-126, 1978.
DOI : 10.1145/359340.359342

J. E. Robertson, A New Class of Digital Division Methods, IEEE Transactions on Electronic Computers, vol.7, issue.3, 1958.
DOI : 10.1109/TEC.1958.5222579

R. Schoof, Elliptic curves over finite fields and the computation of square roots mod p, Mathematics of Computation, vol.44, pp.483-494, 1985.

R. Schoof, Counting points on elliptic curves over finite fields, Journal de Th??orie des Nombres de Bordeaux, vol.7, issue.1, pp.219-254, 1995.
DOI : 10.5802/jtnb.142

J. Solinas, Generalized mersenne numbers Research Report CORR-99-39, Center for Applied Cryptographic Research, 1999.

J. A. Solinas, Improved algorithms for arithmetic on anomalous binary curves Research Report CORR-99-46, 1999.

S. The and . Group, SEC 1 : Elliptic curve cryptography Standard for Efficient Cryptography, 2000.

S. The, SEC 2 : Recommended elliptic curve domain parameters. Standard for Efficient Cryptography, 2000.

N. Theriault, SPA Resistant Left-to-Right Integer Recodings, Selected areas in cryptography, SAC 2005, pp.345-358, 2006.
DOI : 10.1007/11693383_24

R. Tijdeman, On the maximal distance between integers composed of small primes, Compositio Mathematica, vol.28, pp.159-162, 1974.

L. C. Washington, Elliptic Curves : Number Theory and Cryptography, 2003.
DOI : 10.1201/9781420071474

P. Barrett, Implementing the Rivest Shamir and Adleman Public Key Encryption Algorithm on a Standard Digital Signal Processor, Advances in Cryptology -Crypto '86, pp.311-326, 1986.
DOI : 10.1007/3-540-47721-7_24

J. Chung and A. Hasan, More Generalized Mersenne Numbers, Selected Areas in Cryptography ? SAC 2003, 2003.
DOI : 10.1007/978-3-540-24654-1_24

R. Crandall, Method and apparatus for public key exchange in a cryptographic system, U.S, 1992.

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

C. ¸. Koç, T. Acar, and B. S. Kaliski-jr, Analyzing and comparing Montgomery multiplication algorithms, IEEE Micro, vol.16, issue.3, pp.26-33, 1996.
DOI : 10.1109/40.502403

A. J. Menezes, P. C. Van-oorschot, and S. A. Vanstone, Handbook of applied cryptography, N.W. Corporate Blvd. Boca Raton, vol.19964964, pp.33431-9868, 1997.
DOI : 10.1201/9781439821916

P. L. Montgomery, Modular multiplication without trial division, Mathematics of Computation, vol.44, issue.170, pp.519-521, 1985.
DOI : 10.1090/S0025-5718-1985-0777282-X

J. Solinas, Generalized mersenne numbers Research Report CORR-99-39, Center for Applied Cryptographic Research, 1999.

N. Koblitz, Elliptic curve cryptosystems, Mathematics of Computation, vol.48, issue.177, pp.203-209, 1987.
DOI : 10.1090/S0025-5718-1987-0866109-5

V. S. Miller, Use of Elliptic Curves in Cryptography, Lecture Notes in Computer Science, vol.218, pp.417-428, 1986.
DOI : 10.1007/3-540-39799-X_31

A. Menezes, P. C. Van-oorschot, and S. A. , Vanstone, Handbook of applied cryptography, 1997.

D. Bailey and C. Paar, Optimal extension fields for fast arithmetic in public-key algorithms, Lecture Notes in Computer Science, vol.1462, pp.472-485, 1998.
DOI : 10.1007/BFb0055748

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

N. P. Smart and E. J. Westwood, Point muliplication on ordinary elliptic curves over fields of characteristic three Applicable Algebra in Engineering, Communication and Computing, vol.13, issue.6, pp.485-497, 2003.

J. A. Solinas, Improved algorithms for arithmetic on anomalous binary curves Center for Applied Cryptographic Research, 1999.

N. Koblitz, CM-Curves with Good Cryptographic Properties, Lecture Notes in Computer Science, vol.576, pp.279-287, 1992.
DOI : 10.1007/3-540-46766-1_22

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.137.6778

D. H. Lehmer, Euclid's Algorithm for Large Numbers, The American Mathematical Monthly, vol.45, issue.4, pp.227-233, 1938.
DOI : 10.2307/2302607

J. , V. Zur-gathen, and J. Gerhard, Modern Computer Algebra, 1999.

P. L. Montgomery, Modular multiplication without trial division, Mathematics of Computation, vol.44, issue.170, pp.519-521, 1985.
DOI : 10.1090/S0025-5718-1985-0777282-X

C. ¸. Koç and T. Acar, Montgomery multiplication in GF(2 k ), Designs, Codes and Cryptography, pp.57-69, 1998.

V. Lefèvre, Multiplication by an integer constant, INRIA, Research Report, vol.4192, 2001.

N. Boullis and A. Tisserand, Some Optimizations of Hardware Multiplication by Constant Matrices, IEEE Transactions on Computers, vol.54, issue.10, pp.1271-1282, 2005.
DOI : 10.1109/TC.2005.168

URL : https://hal.archives-ouvertes.fr/lirmm-00113092

J. Bajard, L. Imbert, C. , and T. Plantard, Multiplication in GF(p k ) for elliptic curve cryptography, Proceedings 16th IEEE symposium on Computer Arithmetic, pp.181-187, 2003.
URL : https://hal.archives-ouvertes.fr/lirmm-00269538

D. E. Knuth, The Art of Computer Programming, Seminumerical Algorithms, 1997.

R. Crandall and C. Pomerance, Prime Numbers. A Computational Perspective, 2001.

J. Sorenson, Two Fast GCD Algorithms, Journal of Algorithms, vol.16, issue.1, pp.110-144, 1994.
DOI : 10.1006/jagm.1994.1006

J. M. Pollard, Monte Carlo methods for index computation mod p, Mathematics of Computation, vol.32, issue.143, pp.918-924, 1978.
DOI : 10.2307/2006496

P. Gaudry, Index calculus for abelian varieties of small dimension and the elliptic curve discrete logarithm problem, Journal of Symbolic Computation, vol.44, issue.12, 2004.
DOI : 10.1016/j.jsc.2008.08.005

URL : https://hal.archives-ouvertes.fr/inria-00337631

R. M. Avanzi, H. Cohen, C. Doche, G. Frey, T. Lange et al., Handbook of Elliptic and Hyperelliptic Curve Cryptography, 2005.

J. Allouche and J. Shallit, Automatic sequences, 2003.
DOI : 10.1017/cbo9780511546563

R. Avanzi, H. Cohen, C. Doche, G. Frey, T. Lange et al., Handbook of elliptic and hyperelliptic curve cryptography, p.216271614020, 2005.

R. Avanzi, V. Dimitrov, C. Doche, and F. Sica, Extending Scalar Multiplication Using Double Bases, Advances in Cryptology, ASIACRYPT'06, pp.130-144, 2006.
DOI : 10.1007/11935230_9

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.414.7051

R. Avanzi and F. Sica, Scalar multiplication on Koblitz curves using double bases, Cryptology ePrint Archive, Report, vol.067, p.67, 2006.
DOI : 10.1007/11958239_9

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.1578

J. Bajard, L. Imbert, and T. Plantard, Modular Number Systems: Beyond the Mersenne Family, Proceedings of the 11th International Workshop on Selected Areas in Cryptography , SAC'04, pp.159-169, 2005.
DOI : 10.1007/978-3-540-30564-4_11

URL : https://hal.archives-ouvertes.fr/lirmm-00109208

V. Berthé, Autour du système de numération d'Ostrowski, Bulletin of the Belgian Mathematical Society, vol.8, pp.209-239, 2001.

V. Berthé and L. Imbert, On converting numbers to the double-base number system, Advanced Signal Processing Algorithms, Architecture and Implementations XIV Proceedings of SPIE SPIE, vol.5559, pp.70-78, 2004.

I. F. Blake, G. Seroussi, N. P. Smart, ´. E. Brier, and M. Joye, Advances in elliptic curve cryptography Fast point multiplication on elliptic curves through isogenies, Applied Algebra, Algebraic Algorithms and Error-Correcting Codes, Lecture Notes in Computer Science, vol.2643, issue.317, pp.43-50, 2003.

B. Chevalier-mames, M. Ciet, and M. Joye, Low-cost solutions for preventing simple side-channel analysis: side-channel atomicity, IEEE Transactions on Computers, vol.53, issue.6, pp.760-768, 2004.
DOI : 10.1109/TC.2004.13

J. Chung and A. Hasan, More Generalized Mersenne Numbers, Lecture Notes in Computer Science, vol.3006, pp.335-347, 2004.
DOI : 10.1007/978-3-540-24654-1_24

M. Ciet, M. Joye, K. Lauter, and P. L. Montgomery, Trading Inversions for Multiplications in Elliptic Curve Cryptography, Designs, Codes and Cryptography, vol.70, issue.7, pp.189-206, 2006.
DOI : 10.1007/s10623-005-3299-y

M. Ciet and F. Sica, An Analysis of Double Base Number Systems and a Sublinear Scalar Multiplication Algorithm, Lecture Notes in Computer Science, vol.3715, pp.171-182, 2005.
DOI : 10.1007/11554868_12

H. Cohen, A. Miyaji, and T. Ono, Efficient Elliptic Curve Exponentiation Using Mixed Coordinates, Advances in Cryptology, ASIACRYPT'98, pp.51-65, 1998.
DOI : 10.1007/3-540-49649-1_6

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.26.2566

E. De-win, S. Bosselaers, S. Vandenberghe, P. D. Gersem, and J. Vandewalle, A fast software implementation for arithmetic operations in GF(2n), Lecture Notes in Computer Science, vol.1163, pp.65-76, 1996.
DOI : 10.1007/BFb0034836

V. Dimitrov, L. Imbert, and P. K. Mishra, Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains, Advances in Cryptology, ASIACRYPT'05, pp.59-78, 2005.
DOI : 10.1007/11593447_4

URL : https://hal.archives-ouvertes.fr/lirmm-00106638

V. Dimitrov, K. Järvinen, M. J. Jacobson, J. , W. F. Chan et al., FPGA Implementation of Point Multiplication on Koblitz Curves Using Kleinian Integers, FPGA implementation of point multiplication on Koblitz curves using Kleinian integers, Cryptographic Hardware and Embedded Systems, CHES'06, pp.445-459, 2006.
DOI : 10.1007/11894063_35

V. S. Dimitrov, G. A. Jullien, and W. C. Miller, An algorithm for modular exponentiation, Information Processing Letters, vol.66, issue.3, pp.155-159, 1998.
DOI : 10.1016/S0020-0190(98)00044-1

C. Doche, T. Icart, and D. R. , Efficient Scalar Multiplication by Isogeny Decompositions, Lecture Notes in Computer Science, vol.3958, pp.191-206, 2006.
DOI : 10.1007/11745853_13

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.219.2150

C. Doche and L. Imbert, Extended Double-Base Number System with Applications to Elliptic Curve Cryptography, Progress in Cryptology, INDOCRYPT'06, pp.335-348, 2006.
DOI : 10.1007/11941378_24

URL : https://hal.archives-ouvertes.fr/lirmm-00125442

K. Eisenträger, K. Lauter, and P. L. Montgomery, Fast Elliptic Curve Arithmetic and Improved Weil Pairing Evaluation, Topics in Cryptology ? CT-RSA 2003, pp.343-354, 2003.
DOI : 10.1007/3-540-36563-X_24

K. Fong, D. Hankerson, J. , and A. Menezes, Field inversion and point halving revisited, IEEE Transactions on Computers, vol.53, issue.8, pp.1047-1059, 2004.
DOI : 10.1109/TC.2004.43

D. M. Gordon, A Survey of Fast Exponentiation Methods, Journal of Algorithms, vol.27, issue.1, pp.129-146, 1998.
DOI : 10.1006/jagm.1997.0913

T. Granlund, GMP, the GNU multiple precision arithmetic library, see

J. Guajardo and C. Paar, Efficient algorithms for elliptic curve cryptosystems, Lecture Notes in Computer Science, vol.1294, pp.342-356, 1997.
DOI : 10.1007/BFb0052247

D. Hankerson, J. Hernandez, and A. Menezes, Software Implementation of Elliptic Curve Cryptography over Binary Fields, Cryptographic Hardware and Embedded Systems, CHES'00, pp.1-24, 2000.
DOI : 10.1007/3-540-44499-8_1

D. Hankerson, A. Menezes, and S. Vanstone, Guide to elliptic curve cryptography, p.205489194049, 2004.

K. Itoh, M. Takenaka, N. Torii, S. Temma, and Y. Kurihara, Fast Implementation of Public-Key Cryptography on a DSP TMS320C6201, Cryptographic Hardware and Embedded Systems , CHES'99, pp.61-72, 1999.
DOI : 10.1007/3-540-48059-5_7

T. Izu, B. Möller, and T. Takagi, Improved Elliptic Curve Multiplication Methods Resistant against Side Channel Attacks, Progress in Cryptology, INDOCRYPT'02, pp.269-313, 2002.
DOI : 10.1007/3-540-36231-2_24

T. Izu and T. Takagi, A Fast Parallel Elliptic Curve Multiplication Resistant against Side Channel Attacks, Lecture Notes in Computer Science IEICE Transactions Fundamentals E88-A, vol.2274, issue.1, pp.280-296, 2002.
DOI : 10.1007/3-540-45664-3_20

M. Joye and C. Tymen, Protections against Differential Analysis for Elliptic Curve Cryptography ??? An Algebraic Approach ???, Cryptographic Hardware and Embedded Systems, CHES'01, pp.377-390, 2001.
DOI : 10.1007/3-540-44709-1_31

N. Koblitz, Elliptic curve cryptosystems, Mathematics of Computation, vol.48, issue.177, pp.203-209, 1987.
DOI : 10.1090/S0025-5718-1987-0866109-5

P. Kocher, J. Jaffe, and B. Jun, Differential Power Analysis, Lecture Notes in Computer Science, vol.1666, pp.388-397, 1999.
DOI : 10.1007/3-540-48405-1_25

P. C. Kocher, Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and Other Systems, Lecture Notes in Computer Science, vol.1109, pp.104-113, 1996.
DOI : 10.1007/3-540-68697-5_9

J. Lopez and R. Dahab, An improvement of the Guajardo-Paar method for multiplication on non-supersingular elliptic curves, Proceedings SCCC'98. 18th International Conference of the Chilean Society of Computer Science (Cat. No.98EX212), pp.91-95, 1998.
DOI : 10.1109/SCCC.1998.730787

K. Mahler, On a Special Functional Equation, Journal of the London Mathematical Society, vol.1, issue.2, pp.1-15, 1940.
DOI : 10.1112/jlms/s1-15.2.115

V. S. Miller, Uses of elliptic curves in cryptography Advances in Cryptology, CRYPTO'85, Lecture Notes in Computer Science, vol.21888, pp.417-428, 1986.

W. B. Pennington, On Mahler's Partition Problem, The Annals of Mathematics, vol.57, issue.3, pp.531-546, 1953.
DOI : 10.2307/1969735

C. M. Skinner, On the diophantine equation apx + bqy = c + dpzqw, Journal of Number Theory, vol.35, issue.2, pp.194-207, 1990.
DOI : 10.1016/0022-314X(90)90112-5

J. Solinas, Generalized mersenne numbers, Research Report CORR-99-39, Center for Applied Cryptographic Research, 1999.

R. Tijdeman, On the maximal distance between integers composed of small primes, Compositio Mathematica, vol.2849, pp.159-162, 1974.

N. W. Calgary, A. , T. N. Calgary, A. , and T. N. , Canada E-mail address: dimitrov@vlsi.enel.ucalgary.ca Department of Mathematics, Centre for Information Security and Cryptography, E-mail address: pradeep@math.ucalgary.ca Platforms and by a French-Australian collaborative research program from the Direction des Relations Européennes et Internationales du CNRS

R. 1. Miller and V. S. , Use of Elliptic Curves in Cryptography, Lecture Notes in Comput. Sci, vol.218, pp.417-426, 1985.
DOI : 10.1007/3-540-39799-X_31

N. Koblitz, Elliptic curve cryptosystems, Mathematics of Computation, vol.48, issue.177, pp.203-209, 1987.
DOI : 10.1090/S0025-5718-1987-0866109-5

N. Koblitz, Hyperelliptic cryptosystems, Journal of Cryptology, vol.2, issue.4, pp.139-150, 1989.
DOI : 10.1007/BF02252872

I. F. Blake, G. Seroussi, and N. P. Smart, Elliptic curves in cryptography, 1999.
DOI : 10.1017/CBO9781107360211

D. Hankerson, A. J. Menezes, and S. A. Vanstone, Guide to elliptic curve cryptography, 2003.

I. F. Blake, G. Seroussi, and N. P. Smart, Advances in Elliptic Curve Cryptography, 2005.
DOI : 10.1017/CBO9780511546570

F. Morain and J. Olivos, Speeding up the computations on an elliptic curve using addition-subtraction chains, RAIRO - Theoretical Informatics and Applications, vol.24, issue.6, pp.24-531, 1990.
DOI : 10.1051/ita/1990240605311

URL : https://hal.archives-ouvertes.fr/inria-00075576

V. S. Dimitrov, G. A. Jullien, and W. C. Miller, Theory and applications of the double-base number system, IEEE Transactions on Computers, vol.48, issue.10, pp.1098-1106, 1999.
DOI : 10.1109/12.805158

A. Miyaji, T. Ono, and H. Cohen, Efficient elliptic curve exponentiation, Information and Communication ? ICICS'97, pp.282-291, 1997.
DOI : 10.1007/BFb0028484

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.25.1196

T. Takagi, S. M. Yen, and B. C. Wu, Radix-r Non-Adjacent Form, Information Security Conference ? ISC 2004, pp.99-110, 2004.
DOI : 10.1007/978-3-540-30144-8_9

V. S. Dimitrov, G. A. Jullien, and W. C. Miller, An algorithm for modular exponentiation, Information Processing Letters, vol.66, issue.3, pp.155-159, 1998.
DOI : 10.1016/S0020-0190(98)00044-1

V. Berthé and L. Imbert, On converting numbers to the double-base number system, Advanced Signal Processing Algorithms, pp.70-78, 2004.

M. Ciet and F. Sica, An Analysis of Double Base Number Systems and a Sublinear Scalar Multiplication Algorithm, Progress in Cryptology ? Mycrypt 2005, pp.171-182, 2005.
DOI : 10.1007/11554868_12

R. M. Avanzi and F. Sica, Scalar Multiplication on Koblitz Curves Using Double Bases, Lecture Notes in Comput. Sci. Report, 2006.
DOI : 10.1007/11958239_9

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.60.1578

V. S. Dimitrov, L. Imbert, and P. K. Mishra, Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains, Advances in Cryptology ? Asiacrypt 2005, pp.59-78, 2005.
DOI : 10.1007/11593447_4

URL : https://hal.archives-ouvertes.fr/lirmm-00106638

C. Doche and L. Imbert, Extended Double-Base Number System with Applications to Elliptic Curve Cryptography (2006) full version of the present paper, see Cryptology ePrint Archive

C. Doche, A set of PARI/GP functions to compute DBNS expansions http

C. Doche and T. Lange, Arithmetic of Elliptic Curves, pp.267-302
DOI : 10.1201/9781420034981.pt3

M. Ciet, M. Joye, K. Lauter, and P. L. Montgomery, Trading Inversions for Multiplications in Elliptic Curve Cryptography, Designs, Codes and Cryptography, vol.70, issue.7, pp.189-206, 2006.
DOI : 10.1007/s10623-005-3299-y

R. M. Avanzi, V. S. Dimitrov, C. Doche, and F. Sica, Extending Scalar Multiplication Using Double Bases, In: proceedings of Asiacrypt Lecture Notes in Comput. Sci, 2006.
DOI : 10.1007/11935230_9

URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.414.7051

A. D. Booth, A SIGNED BINARY MULTIPLICATION TECHNIQUE, The Quarterly Journal of Mechanics and Applied Mathematics, vol.4, issue.2, pp.236-240, 1951.
DOI : 10.1093/qjmam/4.2.236

R. Bernstein, Multiplication by integer constants, Software: Practice and Experience, vol.6, issue.7, pp.641-652, 1986.
DOI : 10.1002/spe.4380160704

V. Lefèvre, Multiplication by an integer constant, INRIA, Research Report, vol.4192, 2001.

N. Boullis and A. Tisserand, Some Optimizations of Hardware Multiplication by Constant Matrices, IEEE Transactions on Computers, vol.54, issue.10, pp.1271-1282, 2005.
DOI : 10.1109/TC.2005.168

URL : https://hal.archives-ouvertes.fr/lirmm-00113092

V. S. Dimitrov, G. A. Jullien, and W. C. Miller, Theory and applications of the double-base number system, IEEE Transactions on Computers, vol.48, issue.10, pp.1098-1106, 1999.
DOI : 10.1109/12.805158

V. Dimitrov, L. Imbert, and P. K. Mishra, Efficient and Secure Elliptic Curve Point Multiplication Using Double-Base Chains, Advances in Cryptology, ASIACRYPT'05, pp.59-78, 2005.
DOI : 10.1007/11593447_4

URL : https://hal.archives-ouvertes.fr/lirmm-00106638

G. W. Reitwiesner, Binary Arithmetic, Advances in Computers, vol.1, pp.231-308, 1960.
DOI : 10.1016/S0065-2458(08)60610-5

R. I. Hartley, Subexpression sharing in filters using canonic signed digit multipliers, IEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, pp.677-688, 1996.
DOI : 10.1109/82.539000

A. G. Dempster and M. D. Macleod, Constant integer multiplication using minimum adders, Proc. Circuits Devices Syst, pp.407-413, 1994.
DOI : 10.1049/ip-cds:19941191

V. S. Dimitrov, G. A. Jullien, and W. C. Miller, An algorithm for modular exponentiation, Information Processing Letters, vol.66, issue.3, pp.155-159, 1998.
DOI : 10.1016/S0020-0190(98)00044-1

R. Tijdeman, On the maximal distance between integers composed of small primes, Compositio Mathematica, vol.28, pp.159-162, 1974.

V. Berthé and L. Imbert, On converting numbers to the double-base number system, Advanced Signal Processing Algorithms, pp.70-78, 2004.

C. Doche and L. Imbert, Extended Double-Base Number System with Applications to Elliptic Curve Cryptography, Progress in Cryptology, INDOCRYPT'06, pp.335-348, 2006.
DOI : 10.1007/11941378_24

URL : https://hal.archives-ouvertes.fr/lirmm-00125442