Security in Communications and Storage
| Lecturer (assistant) | |
|---|---|
| Number | 0000005241 |
| Type | lecture with integrated exercises |
| Duration | 4 SWS |
| Term | Winter semester 2026/27 |
| Language of instruction | English |
| Position within curricula | See TUMonline |
| Dates | See TUMonline |
- 14.10.2026 13:15-14:45 N2408, Seminarraum
- 16.10.2026 11:30-13:00 N2408, Seminarraum
- 21.10.2026 13:15-14:45 N2408, Seminarraum
- 23.10.2026 11:30-13:00 N2408, Seminarraum
- 28.10.2026 13:15-14:45 N2408, Seminarraum
- 30.10.2026 11:30-13:00 N2408, Seminarraum
- 04.11.2026 13:15-14:45 N2408, Seminarraum
- 06.11.2026 11:30-13:00 N2408, Seminarraum
- 11.11.2026 13:15-14:45 N2408, Seminarraum
- 13.11.2026 11:30-13:00 N2408, Seminarraum
- 18.11.2026 13:15-14:45 N2408, Seminarraum
- 20.11.2026 11:30-13:00 N2408, Seminarraum
- 25.11.2026 13:15-14:45 N2408, Seminarraum
- 27.11.2026 11:30-13:00 N2408, Seminarraum
- 02.12.2026 13:15-14:45 N2408, Seminarraum
- 04.12.2026 11:30-13:00 N2408, Seminarraum
- 09.12.2026 13:15-14:45 N2408, Seminarraum
- 11.12.2026 11:30-13:00 N2408, Seminarraum
- 16.12.2026 13:15-14:45 N2408, Seminarraum
- 18.12.2026 11:30-13:00 N2408, Seminarraum
- 23.12.2026 13:15-14:45 N2408, Seminarraum
- 08.01.2027 11:30-13:00 N2408, Seminarraum
- 13.01.2027 13:15-14:45 N2408, Seminarraum
- 15.01.2027 11:30-13:00 N2408, Seminarraum
- 20.01.2027 13:15-14:45 N2408, Seminarraum
- 22.01.2027 11:30-13:00 N2408, Seminarraum
- 27.01.2027 13:15-14:45 N2408, Seminarraum
- 29.01.2027 11:30-13:00 N2408, Seminarraum
- 03.02.2027 13:15-14:45 N2408, Seminarraum
- 05.02.2027 11:30-13:00 N2408, Seminarraum
Admission information
Description
- Motivation and practical need for secure systems
- Short overview of classical cryptography: symmetric and public-key cryptography
- Short introduction to linear error-correcting codes: generator and parity-check matrix, dual code, minimum distance, MDS codes
- Post-quantum cryptography: threat of a quantum computer
- Code-based cryptography (McEliece & Niederreiter schemes, attacks, other code-based systems)
- Lattice-based cryptography (Shortest Vector Problem, Closest Vector Problem, Subset-Sum cryptosystems, NTRU cryptosystem, Ring Learning with Errors)
- Private information retrieval: basic idea (security vs anonymity vs privacy as concepts), toy schemes for 1-3 servers; computational vs. information-theoretic PIR; review of communication complexity results
- Private information retrieval over coded databases: PIR rate and capacity results
- Short overview of classical cryptography: symmetric and public-key cryptography
- Short introduction to linear error-correcting codes: generator and parity-check matrix, dual code, minimum distance, MDS codes
- Post-quantum cryptography: threat of a quantum computer
- Code-based cryptography (McEliece & Niederreiter schemes, attacks, other code-based systems)
- Lattice-based cryptography (Shortest Vector Problem, Closest Vector Problem, Subset-Sum cryptosystems, NTRU cryptosystem, Ring Learning with Errors)
- Private information retrieval: basic idea (security vs anonymity vs privacy as concepts), toy schemes for 1-3 servers; computational vs. information-theoretic PIR; review of communication complexity results
- Private information retrieval over coded databases: PIR rate and capacity results
Prerequisites
- Mathematical basics (in particular linear algebra)
- Recommended: some knowledge in channel coding (can be taken in parallel to this lecture)
- Recommended: some knowledge in channel coding (can be taken in parallel to this lecture)
Teaching and learning methods
In an accompanying tutorial, the content of the lecture is applied by calculating problems and programming small tasks.