Abstract
The most common method for computing exponentiation of random elements in Abelian groups are sliding window schemes, which enhance the efficiency of the binary method at the expense of some precomputation. In groups where inversion is easy (e.g. elliptic curves), signed representations of the exponent are meaningful because they decrease the amount of required precomputation. The asymptotic best signed method is wNAF, because it minimizes the precomputation effort whilst the non-zero density is nearly optimal. Unfortunately, wNAF can be computed only from the least significant bit, i.e. right-to-left. However, in connection with memory constraint devices left-to-right recoding schemes are by far more valuable.
In this paper we define the MOF (Mutual Opposite Form), a new canonical representation of signed binary strings, which can be computed in any order. Therefore we obtain the first left-to-right signed exponent-recoding scheme for general width w by applying the width w sliding window conversion on MOF left-to-right. Moreover, the analogue right-to-left conversion on MOF yields wNAF, which indicates that the new class is the natural left-to-right analogue to the useful wNAF. Indeed, the new class inherits the outstanding properties of wNAF, namely the required precomputation and the achieved non-zero density are exactly the same.
Chapter PDF
Similar content being viewed by others
Keywords
References
Aviziensis, A.: Signed digit number representations for fast parallel arithmetic. IRE Trans. Electron. Comput. 10, 389–400 (1961)
Blake, I., Seroussi, G., Smart, N.: Elliptic Curves in Cryptography. Cambridge University Press, Cambridge (1999)
Brown, M., Hankerson, D., Lopez, J., Menezes, A.: Software Implementation of the NIST Elliptic Curves Over Prime Fields. In: Naccache, D. (ed.) CT-RSA 2001. LNCS, vol. 2020, pp. 250–265. Springer, Heidelberg (2001)
Booth, A.: A signed binary multiplication technique. Journ. Mech. and Applied Math. 4(2), 236–240 (1951)
Cohen, H., Miyaji, A., Ono, T.: Efficient Elliptic Curve Exponentiation Using Mixed Coordinates, Advances in Cryptology. In: Ohta, K., Pei, D. (eds.) ASIACRYPT 1998. LNCS, vol. 1514, pp. 51–65. Springer, Heidelberg (1998)
Egecioglu, Ö., Koc, C.: Exponentiation using Canonical Recoding. Theoretical Computer Science 129(2), 407–417 (1994)
Gordon, D.: A survey of fast exponentiation methods. Journal of Algorithms 27, 129–146 (1998)
IEEE P1363, Standard Specifications for Public-Key Cryptography, http://groupe.ieee.org/groups/1363/
Jedwab, J., Mitchell, C.J.: Minimum Weight Modified Signed-digit Representations and Fast Exponentiation. Electronics Letters 25, 1171–1172 (1989)
Joye, M., Yen, S.-M.: Optimal Left-to-Right Binary Signed-digit Exponent Recoding. IEEE Transactions on Computers 49(7), 740–748 (2000)
Knuth, D.E.: The art of computer programmming, Seminumerical Algorithms, 2nd edn., vol. 2. Addison-Wesley, Reading (1981)
Koblitz, N.: Elliptic Curve Cryptosystems. Math. Comp. 48, 203–209 (1987)
Koyama, K., Tsuruoka, Y.: Speeding Up Elliptic Curve Cryptosystems using a Signed Binary Windows Method. In: Brickell, E.F. (ed.) CRYPTO 1992. LNCS, vol. 740, pp. 345–357. Springer, Heidelberg (1993)
Miller, V.S.: Use of Elliptic Curves in Cryptography. In: Williams, H.C. (ed.) CRYPTO 1985. LNCS, vol. 218, pp. 417–426. Springer, Heidelberg (1986)
Aviziensis, A.: Signed digit number representations for fast parallel arithmetic. IRE Trans. Electron. Comput. 10, 389–400 (1961)
Miyaji, A., Ono, T., Cohen, H.: Efficient Elliptic Curve Exponentiation, Information and Communication Security. In: Han, Y., Quing, S. (eds.) ICICS 1997. LNCS, vol. 1334, pp. 282–291. Springer, Heidelberg (1997)
Menezes, A., van Oorschot, P., Vanstone, S.: Handbook of Applied Cryptography. CRC Press, Boca Raton (1996)
Möller, B.: Improved Techniques for Fast Exponentiation. In: Lee, P.J., Lim, C.H. (eds.) ICISC 2002. LNCS, vol. 2587, pp. 298–312. Springer, Heidelberg (2003)
O’Connor, L.: An Analysis of Exponentiation Based on Formal Languages. In: Stern, J. (ed.) EUROCRYPT 1999. LNCS, vol. 1592, pp. 375–388. Springer, Heidelberg (1999)
Okeya, K., Schmidt-Samoa, K., Spahn, C., Takagi, T.: Signed Binary Representations Revisited, Cryptology ePrint Archive (2004), http://eprint.iacr.org/
Prodinger, H.: On Binary Representations of Integers with Digits {-1,0- 1}, Integers: Electronic Journal of Combinatorial Number Theory 0 (2000)
Reitwiesner, G.W.: Binary arithmetic. Advances in Computers 1, 231–308 (1960)
Solinas, J.A.: Efficient Arithmetic on Koblitz Curves, Designs, Codes and Cryptography, vol. 19, pp. 195–249 (2000)
Win, E., Mister, S., Preneel, B., Wiener, M.: On the Performance of Signature Schemes Based on Elliptic Curves. In: Buhler, J.P. (ed.) ANTS 1998. LNCS, vol. 1423, pp. 252–266. Springer, Heidelberg (1998)
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
Okeya, K., Schmidt-Samoa, K., Spahn, C., Takagi, T. (2004). Signed Binary Representations Revisited. In: Franklin, M. (eds) Advances in Cryptology – CRYPTO 2004. CRYPTO 2004. Lecture Notes in Computer Science, vol 3152. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-28628-8_8
Download citation
DOI: https://doi.org/10.1007/978-3-540-28628-8_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22668-0
Online ISBN: 978-3-540-28628-8
eBook Packages: Springer Book Archive