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.
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
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.
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.
T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press and McGraw-Hill Book Company, 6th edition, 1992.
T. Dierks and C. Allen. RFC 2246: The TLS Protocol Version 1, January 1999.
A. Fiat. Batch RSA. In Proceedings of Crypto’ 89, pages 175–185, 1989.
Donald Ervin Knuth. The Art of Computer Programming, volume 2: Seminumerical Algorithms. Addison-Wesley, 3rd edition, 1998.
RSA Labs. Public Key Cryptography Standards (PKCS), number 1.
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.
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.
W. Richard Stevens. UNIX Network Programming, volume 1. Prentice Hall PTR, second edition, 1998.
M. Wiener. Cryptanalysis of short RSA secret exponents. IEEE Transactions on Info. Th., 36(3):553–558, 1990.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights 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