OUTLINE OF THE BOOK

The rest of this book is organized as follows:

• In Chapter 2, Cryptographic Systems, we introduce, briefly overview, and put into perspective the three classes of cryptographic systems (i.e., unkeyed cryptosystems, secret key cryptosystems, and public key cryptosystems) and some major representatives.

• In Chapter 3, Discrete Mathematics, we begin the part on mathematical fundamentals (i.e., Part I) by discussing the aspects of discrete mathematics that are relevant for contemporary cryptography.

• In Chapter 4, Probability Theory, we elaborate on probability theory as far as it is relevant for contemporary cryptography.

• In Chapter 5, Information Theory, we use probability theory to quantify information and to introduce the aspects of information theory that are used in contemporary cryptography.

• In Chapter 6, Complexity Theory, we provide a brief introduction to complex- ity theory as far as it is relevant for contemporary cryptography.

• In Chapter 7, One-Way Functions, we begin the part on unkeyed cryptosys- tems (i.e., Part II) by elaborating on one-way functions and discussing some candidate one-way functions that are frequently used in cryptography.

• In Chapter 8, Cryptographic Hash Functions, we overview and discuss cryp- tographic hash functions and their use in contemporary cryptography.

• In Chapter 9, Random Bit Generators, we elaborate on random bit generators and discuss some possible realizations and implementations.

18 The most important trade show is the RSA Conference held annually in ths United States, Europe, and Asia. Refer to http://www.rsaconference.com for more information.

• In Chapter 10, Symmetric Encryption Systems, we begin the part on secret key cryptosystems (i.e., Part III) by overviewing and discussing some symmetric encryption systems.

• In Chapter 11, Message Authentication Codes, we address message authenti- cation and explain how secret key cryptography can be used to generate and verify message authentication codes (MACs).

• In Chapter 12, Pseudorandom Bit Generators, we explore the notion and elab- orate on possible constructions for pseudorandom bit generators (PRBGs).

• In Chapter 13, Pseudorandom Functions, we introduce, discuss, and put into perspective pseudorandom functions (PRFs).

• In Chapter 14, Asymmetric Encryption Systems, we begin the part on public key cryptosystems (i.e., Part IV) by overviewing and discussing some asym- metric encryption systems.

• In Chapter 15, Digital Signature Systems, we elaborate on digital signatures and digital signature systems (DSSs) as an increasingly important application of public key cryptography.

• In Chapter 16, Key Establishment, we address key establishment and elaborate on corresponding key distribution and key agreement protocols.

• In Chapter 17, Entity Authentication, we elaborate on entity authentication in general and (cryptographic) authentication protocols that implement a proof by knowledge in particular.

• In Chapter 18, Secure Multiparty Computation, we address the problem of how mutually distrusting parties can compute a function without revealing their individual arguments to one another.

• In Chapter 19, Key Management, we begin the epilogue (i.e., Part V) by discussing some aspects related to key management.

• In Chapter 20, Conclusions, we conclude with some remarks about the current state of the art in cryptography.

• In Chapter 21, Outlook, we provide an outlook about possible and likely developments and trends in the future.

Last but not least, the book includes two appendixes (i.e., a list of abbreviations and acronyms and a summary of the mathematical notation used in the book), a page about the author, and an index.

Note that cryptography is a field of study that is far too broad to be addressed in a single book and that you have to refer to additional material, such as the literature referenced at the end of each chapter, if you want to learn more about a particular topic. The aims of this book are to provide an overview, to give an introduction into each of the previously mentioned topics and areas of research and development, and to put everything into perspective. Most importantly, we want to ensure that you no longer cannot see the forest for the trees.

References

[1] Shirey, R., Internet Security Glossary, Request for Comments 2828, May 2000.

[2] Menezes, A., P. van Oorschot, and S. Vanstone, Handbook of Applied Cryptography. CRC Press, Boca Raton, FL, 1996.

[3] Wayner, P., Disappearing Cryptography, 2nd edition. Morgan Kaufmann Publishers, San Fran- cisco, CA, 2002.

[4] Cole, E., Hiding in Plain Sight: Steganography and the Art of Covert Communication. John Wiley & Sons, New York, 2003.

[5] Katzenbeisser, S., and F. Petitcolas (Eds.), Information Hiding Techniques for Steganography and

Digital Watermarking. Artech House Publishers, Norwood, MA, 2000.

[6] Arnold, M., M. Schmucker, and S.D. Wolthusen, Techniques and Applications of Digital Water-

marking and Content Protection. Artech House Publishers, Norwood, MA, 2003.

[7] Kelsey, J., B. Schneier, and D. Wagner, “Protocol Interactions and the Chosen Protocol Attack,”

Proceedings of the 5th International Workshop on Security Protocols, Springer-Verlag, 1997, pp.

91–104.

[8] Stinson, D., Cryptography: Theory and Practice, 2nd edition. Chapman & Hall/CRC, Boca Raton, FL, 2002.

[9] Diffie, W., and M.E. Hellman, “New Directions in Cryptography,” IEEE Transactions on Infor-

mation Theory, IT-22(6), 1976, pp. 644–654.

[10] Maurer, U.M., “Towards the Equivalence of Breaking the Diffie-Hellman Protocol and Comput- ing Discrete Logarithms,” Proceedings of CRYPTO ’94, Springer-Verlag, LNCS 839, 1994, pp. 271–281.

[11] Rabin, M.O., “Digitalized Signatures and Public-Key Functions as Intractable as Factorization,” MIT Laboratory for Computer Science, MIT/LCS/TR-212, 1979.

[12] Kerckhoffs, A., “La Cryptographie Militaire,” Journal des Sciences Militaires, Vol. IX, January 1883, pp. 5-38, February 1883, pp. 161-191.

[13] Kocher, P., “Timing Attacks on Implementations of Diffie-Hellman, RSA, DSS, and other Systems,” Proceedings of CRYPTO ’96, Springer-Verlag, LNCS 1109, 1996, pp. 104–113.

[14] Boneh, D., R. DeMillo, and R. Lipton, “On the Importance of Checking Cryptographic Protocols for Faults,” Proceedings of EUROCRYPT ’97, Springer-Verlag, LNCS 1233, 1997, pp. 37–51. [15] Biham, E., and A. Shamir, “Differential Fault Analysis of Secret Key Cryptosystems,” Proceed-

ings of CRYPTO ’97, Springer-Verlag, LNCS 1294, 1997, pp. 513–525.

[16] Bleichenbacher, D., “Chosen Ciphertext Attacks Against Protocols Based on the RSA Encryption Standard PKCS #1,” Proceedings of CRYPTO ’98, Springer-Verlag, LNCS 1462, 1998, pp. 1–12. [17] Kocher, P., J. Jaffe, and B. Jun, “Differential Power Analysis,” Proceedings of CRYPTO ’99,

Springer-Verlag, LNCS 1666, 1999, pp. 388–397.

[18] Anderson, R., and M. Kuhn, “Tamper Resistance — A Cautionary Note,” Proceedings of the 2nd

USENIX Workshop on Electronic Commerce, November 1996, pp. 1–11.

[19] Anderson, R., and M. Kuhn, “Low Cost Attacks on Tamper Resistant Devices,” Proceedings of

the 5th International Workshop on Security Protocols, Springer-Verlag, LNCS 1361, 1997, pp.

125–136.

[20] Anderson, R., “Why Cryptosystems Fail,” Communications of the ACM, Vol. 37, No. 11, Novem- ber 1994, pp. 32–40.

[21] Kahn, D., The Codebreakers: The Comprehensive History of Secret Communication from Ancient

Times to the Internet. Scribner, New York, 1996.

[22] Bauer, F.L., Decrypted Secrets: Methods and Maxims of Cryptology, 2nd edition. Springer-Verlag, New York, 2000.

[23] Levy, S., Crypto: How the Code Rebels Beat the Government—Saving Privacy in the Digital Age. Viking Penguin, New York, 2001.

[24] Shannon, C.E., “A Mathematical Theory of Communication,” Bell System Technical Journal, Vol. 27, No. 3/4, July/October 1948, pp. 379–423/623–656.

[25] Shannon, C.E., “Communication Theory of Secrecy Systems,” Bell System Technical Journal, Vol. 28, No. 4, October 1949, pp. 656–715.

[26] Merkle, R.C., “Secure Communication over Insecure Channels,” Communications of the ACM, 21(4), April 1978 (submitted in 1975), pp. 294–299.

[27] Rivest, R.L., A. Shamir, and L. Adleman, “A Method for Obtaining Digital Signatures and Public- Key Cryptosystems,” Communications of the ACM, 21(2), February 1978, pp. 120–126. [28] ElGamal, T., “A Public Key Cryptosystem and a Signature Scheme Based on Discrete Logarithm,”

IEEE Transactions on Information Theory, IT-31(4), 1985, pp. 469–472.

[29] Oppliger, R., Secure Messaging with PGP and S/MIME. Artech House Publishers, Norwood, MA, 2001.

[30] Oppliger, R., Internet and Intranet Security, 2nd edition. Artech House Publishers, Norwood, MA, 2002.

[31] Oppliger, R., Security Technologies for the World Wide Web, 2nd edition. Artech House Publish- ers, Norwood, MA, 2003.