Distribution results for low-weight binary representations for pairs of integers

Theoretical Computer Science

Volumn 319, Issue 1-3, 2004, Pages 307-331

  Grabner, Peter J ^a   Heuberger, Clemens ^a   Prodinger, Helmut ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF THE WITWATERSRAND   (South Africa)

Author keywords

Elliptic curve cryptography; Fractals; Joint sparse form; Signed digit expansions

Indexed keywords

COMPUTATIONAL METHODS; CRYPTOGRAPHY; FRACTALS; MATHEMATICAL MODELS; SET THEORY; THEOREM PROVING;

ELLIPTIC CURVE CRYPTOGRAPHY; INTEGERS; LOW-WEIGHT BINARY REPRESENTATIONS;

COMPUTER SCIENCE;

EID: 2442421785     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.tcs.2004.02.012     Document Type: Conference Paper

References (18)

1. R. Avanzi, On the complexity of multi-exponentiation techniques in cryptography, J. Cryptology, to appear, available at http://citeseer.nj.nec.com/ 545130.html (2003).
2. Barat G., Grabner P.J. Digital functions and distribution of binomial coefficients. J. London Math. Soc. 64:2001;523-547.
3. Berry A.C. The accuracy of the Gaussian approximation to the sum of independent variates. Trans. Amer. Math. Soc. 49:1941;122-136.
4. Booth A.D. A signed binary multiplication technique. Quart. J. Mech. Appl. Math. 4:1951;236-240.
5. Delange H. Sur les fonctions. q -additive ou q -multiplicatives Acta Arith. 21:1972;285-298.
6. Delange H. Sur la fonction sommatoire de la fonction "somme des chiffres" l'Enseignement Math. (2). 21:1975;31-47.
7. Esseen C.G. Fourier analysis of distribution functions. A mathematical study of the Laplace-Gaussian law. Acta Math. 77:1945;1-125.
8. Falconer K. Fractal geometry, Mathematical Foundations and Applications. 1990;Wiley, Chichester.
9. Falconer K. Techniques in Fractal Geometry. 1997;Wiley, Chichester.
10. Grabner P.J., Rigo M. Additive functions with respect to numeration systems on regular languages. Monatsh. Math. 139:2003;205-219.
11. Grabner P.J., Thuswaldner J.M. On the sum of digits function for number systems with negative bases. Ramanujan J. 4:2000;201-220.
12. Heuberger C., Prodinger H. On minimal expansions in redundant number systems. algorithms and quantitative analysis Computing. 66:2001;377-393.
13. D.E. Knuth, The art of computer programming, Seminumerical Algorithms, Vol. 2, 3rd ed. Addison-Wesley, London, 1998.
14. Morain F., Olivos J. Speeding up the computations on an elliptic curve using addition-subtraction chains. RAIRO Inform. Théor. Appl. 24:1990;531-543.
15. J.A. Solinas, Low-weight binary representations for pairs of integers, Tech. Rep. CORR 2001-41, University of Waterloo, available at http://www.cacr.math.uwaterloo.ca/techreports/2001/corr2001-41.ps (2001).
16. G. Tenenbaum, Sur la non-dérivabilité de fonctions périodiques associées à certaines formules sommatoires. In: R.L. Graham, J. Nešetřil (Eds.), The mathematics of Paul Erdos, I, Vol. 13, Algorithms Combin., Springer, Berlin, 1997, pp. 117-128.
17. Vaaler J.D. Some extremal functions in Fourier analysis. Bull. Amer. Math. Soc. 12:1985;183-216.
18. von zur Gathen J., Gerhard J. Modern Computer Algebra. 1999;Cambridge University Press, New York.