Algorithms for IT Security

	Directors:		Prof. Dr. Y. Matiyasevich, Steklov Institute of Mathematics, St. Petersburg
			Prof. Dr. E.W. Mayr, Institut für Informatik, Technische Universität München
			Prof. Dr. J.V. Romanovsky, State University, St. Petersburg
	Contact:		Johannes Nowak, Email: nowakj@in.tum.de
	Organization:		Every participant is expected to give a talk and to prepare a paper on one of the topics below. Some help is provided on the organizational matters page.

Topics are divided between St. Petersburg and Munich Participants.

1. Classical Cryptography. Presentation of simple, historical cryptosystems and their analysis.

   Article: . Book chapter: 1 of [Sti02].

2. Information-Theoretic Cryptography. Shannon's results had great influence on the scientific study of cryptography. The One-Time Pad is basic private key protocol based on these results.

   Article: [Sha49]. Book chapter: 2 of [Sti02].

3. Practical Private Key Cryptography. The Data Encryption Standard (DES) was proposed in 1975 and is still one of the most widely used cryptosystems. DES is an iterated block cipher and based on the combination of the simple operations xor, substitution, and permutation.

   Article: [Mat94,BS91,BDJR97]. Book chapter: 6 of [Sti02]

4. The Merkle-Hellman Public Key Cryptosystem.

   Article: []. Book: chapter 5 of [Pfl96].

5. The ElGamal Cryptosystem, the Discrete Logarithm Problem, and Secret Key Exchange. The ElGamal Cryptosystem is based on the difficulty of the discrete logarithm problem.

   Article: [ElG85,GM84]. Book chapter: 6 of [Sti02].

6. Complexity-Theoretic Cryptography. Introduction to the theory of One-Way functions and permutations which serve as a basis of a lot of cryptographic results.

   Article: [DH76,Yao82,GL89]. Book chapter: 2 of [GB01], 2 of [Gol01].

7. Pseudorandom Generators. A pseudorandom generator is an algorithm that expands a short random seed into much longer bit sequences that appear to be random. Random selection of keys is central to many cryptographic applications.

   Article: [HILL99]. Book chapter: 3 of [GB01], 3 of [Gol01].

8. One-Way Encryption and Message Authentication. Cryptographic Hash Functions.

   Book chapter: 4 of [Sti02]

9. Digital Signatures. Digital Signatures based on elliptic curves and the RSA cryptosystem

   Article: [DJV01]. Book chapter: 5 and 6 of [Sti02].

10. Two- and Multi-Party Protocols. Bit Commitment, Oblivious Transfer, Coin-Flipping over the Telephone, and Secret Sharing.

    Article: . Book chapter: 11 of [GB01], 7 of [Gol04].

11. Zero-Knowledge Proofs and Protocols. Loosely speaking, zero-knowledge proofs are proofs that yield nothing beyond the verification of the considered assertion. The theory leads to provably secure cryptographic protocols, e.g. the Feige-Fiat-Shamir protocol.

    Article: [GMR89,UFS88]. Book chapter: 4 of [Gol01].

12. Information Hiding. Steganography and Watermarking

    Article: . Books chapter: [JJD00, KP00].

13. Alternative Approaches in Cryptography.Bounded Storage Models and/or Quantum Cryptography

    Article: . Book chapter: