Security and Cryptography

IN4191
2020-2021 Academic Year
Lecture 1: Introduction

Zeki Erkin

Organization
Zeki Erkin
Head lecturer

Building 28
Room: E6.060

Online office hours:

Tue 15:30-16:00, using queue.tudelft.nl
Thu 17:30-18:00, using queue.tudelft.nl

Oguzhan Ersoy Miray Aysen Tianyu Li

Teaching Assistant Teaching Assistant Teaching Assistant

2
Organisation: Student TAs in Delft

Jehan Da Camara Ásta Magnúsdóttir Arpita Ravindranath

Geert Hebben Jansen Joel Abrahams Jelle Vos

Organisation: Student TAs in Twente

Diana Ion

4
IN4191-Course Details
• Lectures-recorded, tele-lectured
• Tuesdays: 13:45-15:30, online, collegerama
• Thursdays: 15:45-17:30, online, collegerama
• Practice session-not recorded
• Fridays: 8:45-10:30, online feedback, using queue.tudelft.nl

• Grading
• Written exam: 70%, simple calculators only, closed book, cheat sheet: A4,
hand-written, names on both sides.
• Assignments: 30%, 3 mandatory assignments (min grade 40%)

• REGISTER ON OSIRIS! Delft students in Delft, Twente students in Twente.

• Registration closes 2 weeks before the exam date!

• COVID-19 measure:
• Online exam: multiple-choice and open questions
• Randomised and customised

House Rules
• Don’t be late for the lectures.

• Limited laptop use: No playing games, tweeting, watching youtube

videos, updating your facebook page, or using your laptop in any
other way that might distract your classmates.

• Use Brightspace discussion forum for getting help from peers and
TAs (general check on Fridays)

• Check the FAQs on Brightspace before sending e-mails

• Important:
• Learn how to write technical reports:
• Formal language, references
• NO hand written text or scanned figures (not graded)

6
Communication

• All requests and questions should be sent to [email protected]

• Any other email to personal addresses will be ignored.

• Mails will be checked regularly during working hours: 9h-18h.

• Please don’t expect responses for questions sent at midnight on a

Sunday.

Course Material

• Nigel P. Smart, Cryptography Made

Simple, Second Edition, Springer, 2016

• Available online: http://dx.doi.org/

10.1007/978-3-319-21936-3

• Lectures slides available on Brightspace

• Examination over the specified book

chapters.

8
 Additional Materials

• Katz and Lindell, Introduction to Modern

Cryptography, CRC Press.

Topics
1) Introduction to Security and Cryptography Course
2) Classical Systems (Chapter 7)
3) Information Theoretic Security (Chapter 9)
4) Defining Security (Chapter 11)
5) Modern Stream Ciphers (Chapter 12)
6) Block Ciphers and Modes of Operation (Chapter 13)
7) Block Ciphers and Modes of Operation (Continued)
8) Hash Functions, MAC and Key Derivation Functions (Chapter 14)
9) Number Theory and Elliptic Curves (Chapters 1 and 4)
10) The RSA Algorithm (Chapter 15)
11) Public Key Encryption and Signature Algorithms (Chapter 16)
12) Public Key Encryption and Signature Algorithms (continued)
13) Certificates, Key Transport and Key Agreement (Chapter 18)
14) Secret Sharing Schemes (Chapter 19)

10
Requirements

• Probability and statistics

• (optional) Abstract algebra, discrete math or number theory
• Programming skills

11

Workload

• 5ECTS=140 hours

• 14 sessions=14x 90 min= 21 hours

• 7 practice sessions= 7x90 min = 10.5 hours
• Weekly Preparation= 7x3 hours =21 hours
• Assignments=3x20=60 hours
• Exam preparation= 20 hours
• Exam=3 hours

• Total=135 hours

• Expected 140 hours

• Some might need more, some might need less

12
Marketing

• BTC Blockchain Technology Certificate

• Security and Cryptography by Dr Erkin (IN4191, Q1)
• Distributed Algorithms by Prof Epema (IN4150, Q2)
• Blockchain Engineering by Dr Pouwelse (CS4160, Q3)

• Enrolment is open to all computer science master students from TU

Delft.
• Certificates are given in Q4 after resits
• Contact person: Sophie den Hartog [email protected]

13

Why are you here, taking this course?

14
Security and cryptography

We are doing business digitally…

Gartner says
“By 2020, 60 Percent of Digital Businesses Will Suffer Major
Service Failures Due to the Inability of IT Security Teams to
Manage Digital Risk”

15

Security? Where?

16
17

18
Digital Systems built on
ICT
Security is a must!

19

Security

• Security means:
• Confidentiality: Access to systems or data is limited to authorised
parties
• Integrity: When you receive data, you get the “right” data
• Availability: The system or data is there when you want it

• Security aspects of computing:

• Programs
• Operating systems
• Networks
• Internet applications
• Databases

20
Who is the enemy?

• Murphy
• Amateurs
• “Script kiddies”
• Crackers
• Organised crime
• Government “cyberwarriors”
• Terrorists

21

Methods of Defence

• Prevent it: prevent the attack

• Deter it: make the attack harder or more expensive

• Deflect it: make yourself less attractive to attacker

• Detect it: notice that attack is occurring (or has occurred)

• Recover from it: mitigate the effects of the attack

22
How secure should we make it?

• Principle of Easiest Penetration

• “A system is only as strong as its weakest link”
• The attacker will go after whatever part of the system
is easiest for him, not most convenient for you.
• In order to build secure systems, we need to learn how
to think like an attacker!
• How would you get private information from the US
Social Security Administration database?

• Principle of Adequate Protection

• “Security is economics”
• Don’t spend $100,000 to protect a system that can
only cause $1,000 in damage

23

Defence of Computer Systems

• Protect hardware/software/data

• Ways to do so:
• Cryptography
• Software Controls
• Hardware Controls
• Physical Controls
• Policies and Procedures

24
Cryptography

“Secret Writing” in Greek

25

Cryptology

Cryptography Cryptanalysis

Security and Cryptography Network Security

Privacy Enhancing Technologies Advanced Network Security

Blockchain Engineering
Secure Data Management
Systems Security
Software Security

26
Objectives of Cryptography

• Protecting data privacy

• Authentication
• Message authentication: message modified?
• Data origin authentication: origin of the message?
• Entity authentication: authenticate each other for communication
• Non-repudiation: preventing the sender from later denying that he/
she sent the message

27

Kerkhoff’s principle

• The adversary knows all details about a crypto system except the
secret key.

28
 Eve

eavesdropping

communication

Alice Bob

29

Encryption

key k key k’

m c m
Encryption Decryption
plaintext ciphertext plaintext
(message)

30
 Encryption-definition

• Enck: plaintext to ciphertext

• Deck’: ciphertext to plaintext
• Encryption key: k
• Decryption key: k’

• if k=k’, symmetric key or private key encryption

• if k≠k’, asymmetric key or public key encryption

31

Private Key Encryption

Symmetric Encryption

key k key k

m c m
Encryption Decryption
plaintext ciphertext plaintext
(message)

Deck(Enck(m))=m

32
 Public Key Encryption
Asymmetric Encryption

key k key k’

m c m
Encryption Decryption
plaintext ciphertext plaintext
(message)

Deck’(Enck(m))=m

33

Classical Systems

34
Classical Systems

• Simple ciphers
• Relies on
• substitution
• permutation
• transposition
• Historical examples
• Caesar
• Vigenere

Substitution cipher used by Dutch Viceroy Willem Lodewijk

and his commander Fredrich von Vernou, 1593.

35

Information Theoretic Security

• Probability and ciphers

• Entropy

X
n
H(X) = − pi · log2 pi
i=1

• Claude Shannon (April 30, 1916 – February 24, 2001)

• 1948: Mathematical Theory of Communication
• 1948: Communication Theory of Secret Systems

36
Defining Security

• Pseudo-random functions
• One-way functions
• Trapdoor one-way functions
• Notions of security

37

Notions of Security

• Perfect secrecy

• Semantic security

• IND security (Polynomial security)

38
Attacks on Encryption Schemes

• Attacks
• Objective: partial information, full deciphering or obtain secret
key
• Levels of computing power
• Amount of information available

39

Different types of Attacks

• Ciphertext-only attack
• Known-plaintext attack
• Chosen-plaintext attack
• Chosen-ciphertext attack
• Adaptive attacks

• And security games!

40
Different Types of Adversaries

• The amount of computing resources available by the adversary

• The attacker has unbounded computing power
• The attacker only has polynomial (in some security parameter)
amount of computing power

41

Security

• Unconditional Security: Secure even if the adversary has infinite

computational resources (CPU and memory)

• Computational Security: Secure if the adversary has only

polynomial amount of computational resources

42
 “How to generate pseudo-random numbers?”

43

Modern Stream Ciphers

• Fast encryption, e.g. mobile communication
• Bits instead of blocks

plaintext
…001010110101…
ciphertext
⊕
…11010011…
Key stream Generator
…01011001…
key stream
key

44
Modern Block Ciphers

• Rely on block operations

• Feistel ciphers
• Data Encryption Standard (DES) Plaintext block
IP
• Advanced Encryption Standard (AES)
L0 R0
• Work on blocks
Li−1 Ri−1
• Several rounds
Iterate 16 !#
• S-boxes times ! F $ Ki
!
! #
• P-box %⊕
!
"
! #
• Cryptanalysis Li Ri
• Differential Rr Lr
• Linear IP−1
Ciphertext block

45

Modes of Operation

original image

• ECB-Electronic Code Book

• CBC-Cipher Block Chaining
ECB mode
• OFB-Output Feedback Mode
• CFB-Cipher Feedback Mode
• CTR-Counter Mode

Other secure modes

image source:wikipedia 46
Hash Functions, MACs and Key Derivation Functions

H(x) = y

• x is of arbitrary length
• y is of fixed length

• Collision resistance
• preimage resistance
• second preimage resistance

• Merkle-Damgard Construction
• MD-4 Family
• HMAC
• Key Derivation Functions

47

Number Theory and Elliptic Curves

• Integer arithmetic
• Elliptic Curves

y3 = x2 + ax + b mod n

y
y Q
P = ( x1 , y1 )
•
•
P
x
x R = ( x3 , y3 ) •

48
RSA Algorithm

• The “naive” RSA algorithm

• The “naive” RSA signature
• The security of RSA

49

Public Key Encryption and Signature Algorithms

• Goldwasser-Micali Encryption
• ElGamal Encryption
• Paillier Encryption

• The Digital Signature Algorithm

• EC-DSA
• Schnorr Signature
• Cramer-Shoup Signature

50
Certificates, Key Transport and Key Agreement

• Static keys
• Ephemeral keys

• Physical distribution
• Distribution using symmetric key protocols
• Distribution using asymmetric key protocols

• Certificates

• Diffie-Hellman key exchange

• Menezes-Qu-Vanstone protocol

51

Secret Sharing Schemes

• How can you split your key such that

• all N shares are needed to reconstruct the key,
• t out of N share are needed to reconstruct the key?

52
Summary

• A full program

• Read the book chapter(s) before the lecture

• Reserve regular hours for self-study each week
• Assignments take time, deadlines are firm! No exceptions

• Having problems? Approach us before the exam so that we can

help you in time

53