Abstract
Techniques for fast exponentiation (multiplication) in various groups have been extensively studied for use in cryptographic primitives. Specifically the joint expression of two exponents (multipliers) plays an important role in the performances of the algorithms used. The crucial optimization relies in general on minimizing the joint Hamming weight of the exponents (multipliers).
J.A.Solinas suggested an optimal signed binary representation for pairs of integers, which is called a Joint Sparse Form (JSF) [25]. JSF is at most one bit longer than the binary expansion of the larger of the two integers, and the average joint Hamming density among Joint Sparse Form representations is 1/2.
This paper extends the Joint Sparse Form by using a window method, namely, presents a new representation for pairs of integers, which is called Width-3 Joint Sparse Form (JSF3), and proves that the representation is at most one bit longer than the binary expansion of the larger of the two integers and its average joint Hamming density is 37.1% via the method of stochastic process. So, Computing the form of uP+vQ by using JSF3 is almost 8.6% faster than that by using JSF.
This work was supported by NSF(No.90204015), Found 973(No.G1999035804), and Elitist Youth Foundation of HeNan Province(No.021201400) in China.
Chapter PDF
Similar content being viewed by others
References
Avanzi, R.: On Multi-exponentiation in Cryptography (2003) (manuscript), Available at http://citeseer.nj.nec.com/545130.html
Bernstein, D.J.: Pippenger’2 exponentiation algorithm (2002), Available at http://cr.rp.to/papers.html
Brown, M., Hankerson, D., Lopez, J., Menezes, A.: Software Implementation of NIST Elliptic Curves Over Prime Fields. CACR Technical Reports. CORR 2000- 56, University of Waterloo (2000)
Crandall, R.: Method and Apparatus for Public Key Exchange in a Cryptographic System. U.S. Patent # 5, 159, 632 (October 27, 1992)
Cohen, H.: A Course in Computational Algebraic Number Theory. Graduate Texts in Mathematics, vol. 138. Springer, Heidelberg (1996)
ElGamal, T.: A Public-Key Cryptosystem and a Signature Scheme Based on Discrete logarithms. IEEE Trans. on Information Theory IT 31, 469–472 (1985)
Gallant, R., Lambert, R., Vanstone, S.: Faster Point Multiplication On Elliptic Curves with Efficient Endomorphisms. In: Kilian, J. (ed.) CRYPTO 2001. LNCS, vol. 2139, pp. 190–200. Springer, Heidelberg (2001)
Gordon, D.M.: A Survey of Fast Exponentiation Methods. Journal of Algorithms 27(1), 129–146 (1998)
Chung, K.: Elementary Probability Theory with Stochastic Processes. Springer- Verlag Berlin Heidelberg New York Toppan Company (S)Pte Ltd, Singapore (1978)
IEEEP 1363-2000. IEEE standard Specifications for Public-Key Cryptography. IEEE Computer Society (August 29,2000)
Knuth, D.E.: The Art of Computer Programming, 2nd edn. Semi numerical Algorithms, vol. 2. Addison-Wesley, Reading (1981)
Ciet, M., Lange, T., Sica, F., Quisquater, J.-J.: Improved Algorithms for Efficient Arithmetic on Elliptic Curves using Fast Endomorphisms. In: Biham, E. (ed.) EUROCRYPT 2003. LNCS, vol. 2656, pp. 388–400. Springer, Heidelberg (2003)
Koblitz, N.: Elliptic curve cryptosystems. Mathematics of Computation 48, 203–209 (1987)
Koblitz, N.: CM-Curves with Good Cryptographic Properties. In: Feigenbaum, J. (ed.) CRYPTO 1991. LNCS, vol. 576, pp. 279–287. Springer, Heidelberg (1992)
Miller, V.: Uses of elliptic curves in cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417–426. Springer, Heidelberg (1986)
Morain, F., Olivos, J.: Speeding Up the Computations on an Elliptic Curve Using Addition-Subtraction Chains. Inform.Theor. Appl. 24, 531–543 (1990)
Meier, W., Staffelbach, O.: Efficient Multiplication on Certain Nonsupersingular Elliptic Curves. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 333–344. Springer, Heidelberg (1993)
Muller, V.: Fast Multiplication on Elliptic Curves over Small Fields of Characteristic Two. Journal of Cryptology 11(4), 219–234 (1998)
Muller, V.: Efficient Point Multiplication for Elliptic Curves over Special Optimal Extension Fields. In: de Gruyter, W. (ed.) Public-Key Cryptography and Computational Number Theory, Warschau, Poland, September 11-15, pp. 197–207 (2001)
National Institute of Standards and Technology. FIPS – 186-2: Digital Signature Standard (DSS) (January 2000), Available at http://csrc.nist.gov/publications/fips
Park, Y.-H., Jeong, S., Kim, C., Lim, J.: An Alternate Decomposition of an Integer for Faster Point Multiplication on Certain Elliptic Curves. In: Naccache, D., Paillier, P. (eds.) PKC 2002. LNCS, vol. 2274, pp. 323–334. Springer, Heidelberg (2002)
Silverman, J.H.: The Arithmetic of Elliptic Curves. In: GTM 106, Springer-Verlag, Heidelberg (1986)
Solinas, J.: An Improved Algorithm for Arithmetic on a Family of Elliptic Curves. In: Kaliski Jr., B.S. (ed.) CRYPTO 1997. LNCS, vol. 1294, pp. 357–371. Springer, Heidelberg (1997)
Solinas, J.: Efficient Arithmetic on Koblitz Curves. Designs, Codes and Cryptography 19, 195–249 (2000)
Solinas, J.: Low-Weight Binary Representations for Pairs of Integers. CACR Technical Reports, CORR 2001-41 University of Waterloo (2001), Available at www.cacr.math.uwaterloo.ca/techreports/2001/corr2001-41.ps
Sakai, Y., Sakurai, K.: Algorithms for Efficient Simultaneous Elliptic Scalar Multiplication with Reduced Joint Hamming Weight Representation of Scalars. In: Chan, A.H., Gligor, V.D. (eds.) ISC 2002. LNCS, vol. 2433, pp. 484–499. Springer, Heidelberg (2002)
Smart, N.P.: Elliptic Curve Cryptosystems over Small Fields of Odd Characteristic. Journal of Cryptology 12(2), 141–151 (1999)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuang, B., Zhu, Y., Zhang, Y. (2004). An Improved Algorithm for uP+vQ Using JSF\(_{3}^{1}\) . In: Jakobsson, M., Yung, M., Zhou, J. (eds) Applied Cryptography and Network Security. ACNS 2004. Lecture Notes in Computer Science, vol 3089. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24852-1_34
Download citation
DOI: https://doi.org/10.1007/978-3-540-24852-1_34
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22217-0
Online ISBN: 978-3-540-24852-1
eBook Packages: Springer Book Archive