New Minimal Modified Radix-r Representation with Applications to Smart Cards

  • Marc Joye
  • Sung-Ming Yen
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2274)


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.


Smart Card Elliptic Curf Minimal Representation Small Device Elementary Block 
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.


  1. Avi61.
    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].MathSciNetCrossRefGoogle Scholar
  2. AW93.
    S. Arno and F.S. Wheeler, Signed digit representations of minimal Hamming weight, IEEE Transactions on Computers C-42 (1993), no. 8, 1007–1010.CrossRefGoogle Scholar
  3. BGMW92.
    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.Google Scholar
  4. Boo51.
    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].zbMATHCrossRefMathSciNetGoogle Scholar
  5. CL73.
    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.CrossRefMathSciNetGoogle Scholar
  6. Coh93.
    H. Cohen, A course in computational algebraic number theory, Springer-Verlag, 1993.Google Scholar
  7. EK94.
    Ö. Eğecioğlu and Ç.K. Koç, Exponentiation using canonical recoding, Theoretical Computer Science 129 (1994), no. 2, 407–417.CrossRefMathSciNetGoogle Scholar
  8. GHM96.
    D. Gollmann, Y. Han, and C.J. Mitchell, Redundant integer representation and fast exponentiation, Designs, Codes and Cryptography 7 (1996), 135–151.zbMATHMathSciNetGoogle Scholar
  9. Gor98.
    D.M. Gordon, A survey of fast exponentiation methods, Journal of Algorithms 27 (1998), 129–146.zbMATHCrossRefMathSciNetGoogle Scholar
  10. JY00.
    M. Joye and S.-M. Yen, Optimal left-to-right binary signed-digit recoding, IEEE Transactions on Computers 49 (2000), no. 7, 740–748.CrossRefGoogle Scholar
  11. Knu81.
    D.E. Knuth, The art of computer programming/Seminumerical algorithms, 2nd ed., vol. 2, Addison-Wesley, 1981.Google Scholar
  12. KT93.
    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.Google Scholar
  13. MO90.
    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.zbMATHMathSciNetGoogle Scholar
  14. MvOV97.
    A.J. Menezes, P.C. van Oorschot, and S.A. Vanstone, Handbook of applied cryptography, ch. 14, CRC Press, 1997.Google Scholar
  15. Rei60.
    G.W. Reitwiesner, Binary arithmetic, Advances in Computers 1 (1960), 231–308.MathSciNetGoogle Scholar
  16. Swa90.
    E.E. Swartzlander, Jr. (ed.), Computer arithmetic, vol. I and II, IEEE Computer Society Press, 1990.Google Scholar
  17. vL82.
    J.H. van Lint, Introduction to coding theory, Springer-Verlag, 1982.Google Scholar
  18. WH97.
    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.MathSciNetGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Marc Joye
    • 1
  • Sung-Ming Yen
    • 2
  1. 1.Card Security GroupGemplus Card InternationalGémenos CedexFrance
  2. 2.Laboratory of Cryptography and Information Security (LCIS) Dept of Computer Science and Information EngineeringChung-LiTaiwan, ROC

Personalised recommendations