Skip to main content

Improving SSL Handshake Performance via Batching

  • Conference paper
  • First Online:
Topics in Cryptology — CT-RSA 2001 (CT-RSA 2001)

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

Included in the following conference series:

Abstract

We present an algorithmic approach for speeding up SSL’s performance on a web server. Our approach improves the performance of SSL’s handshake protocol by up to a factor of 2.5 for 1024-bit RSA keys. It is designed for heavily-loaded web servers handling many concurrent SSL sessions. We improve the server’s performance by batching the SSL handshake protocol. That is, we show that b SSL handshakes can be done faster as a batch than doing the b handshakes separately one after the other. Experiments show that taking b = 4 leads to optimal results, namely a speedup of a factor of 2.5. Our starting point is a technique due to Fiat for batching RSA decryptions. We improve the performance of batch RSA and describe an architecture for using it in an SSL web server. We give experimental results for all the proposed techniques.

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. M. Bellare and P. Rogaway. Optimal asymmetric encryption. In Proceedings of Eurocrypt’ 94, volume 950 of Lecture Notes in Computer Science, pages 92–111. Springer-Verlag, 1994.

    Google Scholar 

  2. D. Boneh and G. Durfee. Cryptanalysis of RSA with private key d less than n 0:292. In Proceedings of Eurocrypt’ 99, volume 1592 of Lecture Notes in Computer Science, pages 1–11. Springer-Verlag, 1999.

    Google Scholar 

  3. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press and McGraw-Hill Book Company, 6th edition, 1992.

    Google Scholar 

  4. T. Dierks and C. Allen. RFC 2246: The TLS Protocol Version 1, January 1999.

    Google Scholar 

  5. A. Fiat. Batch RSA. In Proceedings of Crypto’ 89, pages 175–185, 1989.

    Google Scholar 

  6. Donald Ervin Knuth. The Art of Computer Programming, volume 2: Seminumerical Algorithms. Addison-Wesley, 3rd edition, 1998.

    Google Scholar 

  7. RSA Labs. Public Key Cryptography Standards (PKCS), number 1.

    Google Scholar 

  8. A. J. (Alfred J.) Menezes, Paul C. Van Oorschot, and Scott A. Vanstone. Handbook of Applied Cryptography. The CRC Press series on discrete mathematics and its applications. CRC Press, 2000 N.W. Corporate Blvd., Boca Raton, FL 33431-9868, USA, 1997.

    Google Scholar 

  9. R. L. Rivest, A. Shamir, and L. Adleman. A method for obtaining digital signatures and public key cryptosystems. Commun. of the ACM, 21:120–126, 1978.

    Article  MATH  MathSciNet  Google Scholar 

  10. W. Richard Stevens. UNIX Network Programming, volume 1. Prentice Hall PTR, second edition, 1998.

    Google Scholar 

  11. M. Wiener. Cryptanalysis of short RSA secret exponents. IEEE Transactions on Info. Th., 36(3):553–558, 1990.

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2001 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shacham, H., Boneh, D. (2001). Improving SSL Handshake Performance via Batching. In: Naccache, D. (eds) Topics in Cryptology — CT-RSA 2001. CT-RSA 2001. Lecture Notes in Computer Science, vol 2020. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45353-9_3

Download citation

  • DOI: https://doi.org/10.1007/3-540-45353-9_3

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-41898-6

  • Online ISBN: 978-3-540-45353-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics