Diese Seite auf DE

Event

Asymmetric Encryption Schemes [WS1924115]

Type
lecture (V)
Term
WS 19/20
SWS
2
Language
Deutsch
Appointments
15
Links
ILIAS

Lecturers

Organisation

  • KIT-Fakultät für Informatik

Part of

Literature

- Skript zur Vorlesung, http://iks.kit.edu/ (Zugangsdaten werden in der Vorlesung bekanntgegeben)

Weiterführende Literatur

- M. Bishop, Introduction to Computer Security, Addison-Wesley, Boston, 2005.
- J. Buchmann, Introduction to Cryptography, Springer, Heidelberg, 2003.
- J.D. Lipson, Elements of Algebra and Algebraic Computing, Addison-Wesley, 1981.
- A.J. Menezes, P.C. van Oorschot, S.A. Vanstone Handbook of Applied Cryptography CRC Press, 1997.
- W. Stallings, Cryptography and Network Security, Prentice Hall, New Jersey, 1999.
- W. Trappe, L. Washington, Introduction to Cryptography with Coding Theory, Prentice Hall, New Jersey, 2002.

Appointments

  • 17.10.2019 11:30 - 13:00 - Room: 50.34 Raum -101
  • 24.10.2019 11:30 - 13:00 - Room: 50.34 Raum -101
  • 31.10.2019 11:30 - 13:00 - Room: 50.34 Raum -101
  • 07.11.2019 11:30 - 13:00 - Room: 50.34 Raum -101
  • 14.11.2019 11:30 - 13:00 - Room: 50.34 Raum -101
  • 21.11.2019 11:30 - 13:00 - Room: 50.34 Raum -101
  • 28.11.2019 11:30 - 13:00 - Room: 50.34 Raum -101
  • 05.12.2019 11:30 - 13:00 - Room: 50.34 Raum -101
  • 12.12.2019 11:30 - 13:00 - Room: 50.34 Raum -101
  • 19.12.2019 11:30 - 13:00 - Room: 50.34 Raum -101
  • 09.01.2020 11:30 - 13:00 - Room: 50.34 Raum -101
  • 16.01.2020 11:30 - 13:00 - Room: 50.34 Raum -101
  • 23.01.2020 11:30 - 13:00 - Room: 50.34 Raum -101
  • 30.01.2020 11:30 - 13:00 - Room: 50.34 Raum -101
  • 06.02.2020 11:30 - 13:00 - Room: 50.34 Raum -101

Note

This course presents the theoretical and practical aspects of Public Key Cryptography.

  • The most important primitives of cryptography will be covered, as there are: one-way function, hash function, digital signature, public key encryption and digital signatures (RSA, ElGamal), and various methods of key exchange (e.g. Diffie-Hellman) with their strengths and weaknesses.
  • In addition to public-key systems, the lecture provides knowledge about algorithms to solve number-theoretic problems on which the security of the systems is based. Thus the choice of parameters and the related level of security of a cryptographic system can be estimated.
  • Furthermore, an introduction to provable security is provided, which presents some of the key security concepts (e.g. IND-CCA).
  • The combination of cryptographic primitives will be treated on currently used protocols.