Skip to main content

RSA Signature Algorithm for Microcontroller Implementation

  • Conference paper
Book cover Smart Card Research and Applications (CARDIS 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1820))

Abstract

In this paper, we present a fast method for generating RSA signature. The method is based on the Chinese Remainder Theorem and Wiener’s conjecture. Using this method, one can efficiently generate a RSA signature on a low-cost microcontroller. Hence it is suitable for the MCU IC in a typical smart card.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Wiener, M.J.: Cryptanalysis of short RSA secret exponents. IEEE Trans. Information Theory IT-36, 553–558 (1990)

    Article  MathSciNet  Google Scholar 

  2. Burns, J., Mitchell, C.J.: Parameter Selection for Server-aided RSA Computation Schemes. IEEE Trans. on Computers 43, 163–174 (1994)

    Article  Google Scholar 

  3. Quisquater, J.J., Couvreur, C.: Fast Decipherment Algorithm for RSA Publickey Cryptosystem. Electron. Lett. 18(21), 905–907 (1982)

    Article  Google Scholar 

  4. Koc, C.K., Acar, T., Kaliski, B.S.: Analyzing and Comparing Montgomery Multiplication Algorithms, IEEE Micro, pp.26-33 (June 1996)

    Google Scholar 

  5. Menezes, A.J.: Elliptic Curve Public Key Cryptosystems, p. 50. Kluwer Academic Publishers, Dordrecht (1993)

    MATH  Google Scholar 

  6. Beguin, P., Quisquater, J.J.: Fast server-aided RSA signatures secure against active attacks. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 57–69. Springer, Heidelberg (1995)

    Google Scholar 

  7. Lim, C.H., Lee, P.J.: Security and performance of server-aided RSA computation protocols. In: Coppersmith, D. (ed.) CRYPTO 1995. LNCS, vol. 963, pp. 70–83. Springer, Heidelberg (1995)

    Google Scholar 

  8. Strassen, V.: Einige Resultate über Berechnungskomplexität. Jahresber. Deutsch. Math.-Verein. 78, 1–8 (1976/1977)

    MATH  MathSciNet  Google Scholar 

  9. R.P.E. Pinch, Private Communication (May 1997)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Qiao, G., Lam, KY. (2000). RSA Signature Algorithm for Microcontroller Implementation. In: Quisquater, JJ., Schneier, B. (eds) Smart Card Research and Applications. CARDIS 1998. Lecture Notes in Computer Science, vol 1820. Springer, Berlin, Heidelberg. https://doi.org/10.1007/10721064_32

Download citation

  • DOI: https://doi.org/10.1007/10721064_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67923-3

  • Online ISBN: 978-3-540-44534-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics