Syllabus for Cryptology

Kryptologi

Syllabus

  • 5 credits
  • Course code: 1DT075
  • Education cycle: Second cycle
  • Main field(s) of study and in-depth level: Computer Science A1N, Technology A1N

    Explanation of codes

    The code indicates the education cycle and in-depth level of the course in relation to other courses within the same main field of study according to the requirements for general degrees:

    First cycle

    • G1N: has only upper-secondary level entry requirements
    • G1F: has less than 60 credits in first-cycle course/s as entry requirements
    • G1E: contains specially designed degree project for Higher Education Diploma
    • G2F: has at least 60 credits in first-cycle course/s as entry requirements
    • G2E: has at least 60 credits in first-cycle course/s as entry requirements, contains degree project for Bachelor of Arts/Bachelor of Science
    • GXX: in-depth level of the course cannot be classified

    Second cycle

    • A1N: has only first-cycle course/s as entry requirements
    • A1F: has second-cycle course/s as entry requirements
    • A1E: contains degree project for Master of Arts/Master of Science (60 credits)
    • A2E: contains degree project for Master of Arts/Master of Science (120 credits)
    • AXX: in-depth level of the course cannot be classified

  • Grading system: Fail (U), Pass (3), Pass with credit (4), Pass with distinction (5)
  • Established: 2010-03-18
  • Established by:
  • Revised: 2018-10-25
  • Revised by: The Faculty Board of Science and Technology
  • Applies from: week 27, 2019
  • Entry requirements: 120 credits including a second course in programming, Algorithms and Data Structures, Algebra I and Linear Algebra. Proficiency in English equivalent to the Swedish upper secondary course English 6.
  • Responsible department: Department of Information Technology

Learning outcomes

On completion of the course, the student shall be able to:

  • give examples of how theories, principles, and techniques based on cryptology can be used to achieve data security.
  • explain the theories underpinning common cryptographic methods, such as different types of hash-functions, symmetric and asymmetric ciphers, digital signatures and random numbers.
  • analyse, use and implement such methods and reflect on their limits and applicability.

Content

Theory and practice of different forms of ciphers, e.g. classical, block, flow, affine, and public. Hash-functions with and without keys, handling of keys, random numbers.

Instruction

Lecture, labs and seminars.

Assessment

Written exam and oral and written reports.

If there are special reasons for doing so, an examiner may make an exception from the method of assessment indicated and allow a student to be assessed by another method. An example of special reasons might be a certificate regarding special pedagogical support from the disability coordinator of the university.

Reading list

Reading list

Applies from: week 27, 2019

Some titles may be available electronically through the University library.

  • Stinson, Douglas R. Cryptography : theory and practice

    3. ed.: Boca Raton: Chapman & Hall/CRC, cop. 2006

    Find in the library