Abstract
This paper considers the problem of finding a minimumweighted representation of an integer under any modified radix-r number system. Contrary to existing methods, the proposed transformation is carried out from the left to the right (i.e., from the most significant position). This feature finds numerous applications and especially in fast arithmetic techniques because it reduces both time and space complexities, which is particularly attractive for small devices like smart cards.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A. Avizienis, Signed-digit number representations for fast parallel arithmetic, IRE Transactions on Electronic Computers EC-10 (1961), 389–400, Reprinted in [Swa90, vol. II, pp. 54-65].
S. Arno and F.S. Wheeler, Signed digit representations of minimal Hamming weight, IEEE Transactions on Computers C-42 (1993), no. 8, 1007–1010.
E.F. Brickell, D.M. Gordon, K.S. McCurley, and D.B. Wilson, Fast exponentiation with precomputation, Advances in Cryptology — EUROCRYPT’92, Lecture Notes in Computer Science, vol. 658, Springer-Verlag, 1992, pp. 200–207.
A.D. Booth, A signed binary multiplication technique, The Quaterly Journal of Mechanics and Applied Mathematics 4 (1951), 236–240, Reprinted in [Swa90, vol. I, pp. 100-104].
W.E. Clark and J.J. Liang, On arithmetic weight for a general radix representation of integers, IEEE Transactions on Information Theory IT-19 (1973), 823–826.
H. Cohen, A course in computational algebraic number theory, Springer-Verlag, 1993.
Ö. Eğecioğlu and Ç.K. Koç, Exponentiation using canonical recoding, Theoretical Computer Science 129 (1994), no. 2, 407–417.
D. Gollmann, Y. Han, and C.J. Mitchell, Redundant integer representation and fast exponentiation, Designs, Codes and Cryptography 7 (1996), 135–151.
D.M. Gordon, A survey of fast exponentiation methods, Journal of Algorithms 27 (1998), 129–146.
M. Joye and S.-M. Yen, Optimal left-to-right binary signed-digit recoding, IEEE Transactions on Computers 49 (2000), no. 7, 740–748.
D.E. Knuth, The art of computer programming/Seminumerical algorithms, 2nd ed., vol. 2, Addison-Wesley, 1981.
K. Koyama and Y. Tsurukoa, Speeding up elliptic cryptosystems by using a signed binary window method, Advances in Cryptology — CRYPTO’92, Lecture Notes in Computer Science, vol. 740, Springer-Verlag, 1993, pp. 345–357.
F. Morain and J. Olivos, Speeding up the computations on an elliptic curve using addition-subtraction chains, Theoretical Informatics and Applications 24 (1990), 531–543.
A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone, Handbook of applied cryptography, ch. 14, CRC Press, 1997.
G.W. Reitwiesner, Binary arithmetic, Advances in Computers 1 (1960), 231–308.
E.E. Swartzlander, Jr. (ed.), Computer arithmetic, vol. I and II, IEEE Computer Society Press, 1990.
J.H. van Lint, Introduction to coding theory, Springer-Verlag, 1982.
H. Wu and M.A. Hasan, Efficient exponentiation of a primitive root in GF(2m), IEEE Transactions on Computers C-46 (1997), no. 2, 162–172.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Joye, M., Yen, SM. (2002). New Minimal Modified Radix-r Representation with Applications to Smart Cards. In: Naccache, D., Paillier, P. (eds) Public Key Cryptography. PKC 2002. Lecture Notes in Computer Science, vol 2274. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45664-3_27
Download citation
DOI: https://doi.org/10.1007/3-540-45664-3_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43168-8
Online ISBN: 978-3-540-45664-3
eBook Packages: Springer Book Archive