TABLE OF CONTENTS The reader familiar with the content of the present textbook may want to have a deeper look at some selected (or missing) topics here. We suggest the following references.
C. Boyd, A. Mathuria. Protocols for Authentication and Key Establishment. Springer-Verlag, NY, 2003. An excellent textbook on peer authentication and key establishment protocols.
R. Crandall, C. Pomerance. Prime Numbers: A Computational Perspective. Springer, NY, 2001. This book tells much more on primality tests and factoring algorithms.
M.R. Garey, D.S. Johnson. Computers and Intractability A Guide to the Theory of NP-Completeness. Freeman, NY, 1979. This is another fundamental reference about complexity theory. It contains a nice catalog of NP-complete problems.
O. Goldreich. Modern Cryptography, Probabilistic Proofs and Pseudorandomness. Algorithms and Combinatorics, vol. 17. Springer-Verlag, NY, 1999. A survey on the fascinating area of randomness and the power of interaction. It is more oriented to complexity theory, but it is hard to formally talk about randomness without it.
D. Gollman. Computer Security. John Wiley & Sons, NY, 1999. An excellent textbook on computer and network security. It is more oriented to the integration and the theory behind. It addresses aspects of security related to hardware, operation systems, networks and distributed systems, and management.
J.E. Hopcroft, J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison Wesley, London, 1979. This is an outstanding reference on the foundations of computer sciences. It contains necessary information about complexity theory (Turing machines, complexity, intractability).
S. Katzenbeisser.
