Skip to main content

Speeding Up RSA and Elliptic Curve Systems by Choosing Suitable Moduli

  • Conference paper
Coding, Cryptography and Combinatorics

Part of the book series: Progress in Computer Science and Applied Logic ((PCS,volume 23))

  • 537 Accesses

Abstract

In this paper we propose a method to speed up the modular operation by choosing suitable moduli. When the modulus N can be represented as a sum of a few positive or negative powers of 2, we show that a modular operation (X mod N),where X is not greater than the square of the modulus N,can be computed with a few addition/subtraction operations with the operands of about the same size as the modulus. No evidence has been shown that use of such moduli in RSA and elliptic curve cryptosystems can compromise the security of the systems.

Mathematics Subject Classification (2000). Primary 68W99; Secondary 94A60.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover 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. A. Bosselaers, R. Govaerts, and J. Vandewalle. Comparison of three modular reduction functions. In Crypto 1993 pp. 175–186. Springer-Verlag, Berlin, 1993.

    Google Scholar 

  2. R.E. Crandall. Method and apparatus for public key exchange in a cryptographic system. U.S. Patent No. 5159632, 1992.

    Google Scholar 

  3. S.W. Colomb. Properties of the sequences 3.2n+ 1. Math. Comp.,30:657–663, 1976.

    MathSciNet  Google Scholar 

  4. D.E. Knuth. The Art of Computer Programming: Seminumerical Algorithms.Addison-Wesley Publ. Co., Reading, MA, 1981.

    MATH  Google Scholar 

  5. C.K. Koc and C.Y. Hung. A fast algorithm for modular reduction. IEE Proc.: Computers and Digital Techniques 145(4):265–271, 1998.

    Article  Google Scholar 

  6. J.M. Pollard. Implementation of number-theoretic transforms. Electronics Letters 15(12):378–379, 1976.

    Article  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer Basel AG

About this paper

Cite this paper

Wu, H., Hasan, M.A., Blake, I.F. (2004). Speeding Up RSA and Elliptic Curve Systems by Choosing Suitable Moduli. In: Feng, K., Niederreiter, H., Xing, C. (eds) Coding, Cryptography and Combinatorics. Progress in Computer Science and Applied Logic, vol 23. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-7865-4_26

Download citation

  • DOI: https://doi.org/10.1007/978-3-0348-7865-4_26

  • Publisher Name: Birkhäuser, Basel

  • Print ISBN: 978-3-0348-9602-3

  • Online ISBN: 978-3-0348-7865-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics