Third-Cycle Courses

Faculty of Engineering | Lund University

Details for the Course Syllabus for Course EDIN05F valid from Spring 2013

Printable view

  • English
  • Every spring semester
  • The purpose of the course is to demonstrate how advanced mathematical theory has important applications in cryptology and security.
  • The course contains a number of mathematical tools with many applications, not only in cryptology and security. Most schemes addressed in the course are standards in different communication systems, e.g., elliptic curve cryptosystems. Few people have the mathematical background to be able to understand how such systems work. We also look at models for proving that a cryptographic scheme or protocol is secure.

    The content of the course is more specifically most of the following topics: cryptosystems based on discrete logarithms, elliptic curve cryptography, factoring and the discrete log problem, symmetric ciphers, digital signatures and hash functions, authentication, secret sharing, complexity theory, provable security and random oracles.
Knowledge and Understanding
  • For a passing grade the doctoral student must
  • •be able to describe the role of mathematics in cryptology,
    •be able to explain mathematical principles used in various cryptografic primitives,
    •be able to describe and compare different solutions to a given cryptologic problem.
Competences and Skills
  • For a passing grade the doctoral student must
  • •be able to identify and formulate relevant mathematical problems in cryptology,
    •be able to describe how difficult mathematical problems can be used to construct cryptographic primitives,
    •be able to mathematically analyze possible constructions from a security perspective.
Judgement and Approach
  • For a passing grade the doctoral student must
  • •be able to classify the level of difficulty of problems related to the his/her own level of knowledge,
    •be aware of how problems and their parameters are connected to different security levels.
Types of Instruction
  • Lectures
  • Exercises
  • Project
Examination Formats
  • Written exam
  • Written assignments
  • Written exam and mandatory home exercises.
  • Failed, pass
Admission Requirements
Assumed Prior Knowledge
  • Basic math courses. Basic programming.
Selection Criteria
  • Smart, N.: Cryptography: An introduction (tredje upplagan tillgänglig för nedladdning). McGraw-Hill. ISBN 0077099877.
  • Some additional lecture notes.
Further Information
  • Course coordinator: Professor Thomas Johansson
Course code
  • EDIN05F
Administrative Information
  •  -06-07
  • FN1/Anders Gustafsson

All Published Course Occasions for the Course Syllabus

1 course occasion.

Start Date End Date Published
2014‑01‑21 2014‑03‑08

Printable view