Crypto Flashcards

1
Q

CIA model

A

C - confidentiality
I - integrity
A - availability

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Confidentiality

A

information is only disclosed to those authorized to know it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

Integrity

A

Only modify information in allowed ways by authorized parties

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

Availability

A

Those authorized for access are not prevented from it

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

Threats against CIA model

A

C - classified information leak
I - fake images/videos
A - Denial-of-Service attacks

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

Cryptographic algorithms goal:

A
  1. Given a key, it should be easy to compute
  2. Without the key it should be hard to compute/invert
  3. The strength of security is based on the length of a key
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Window of validity

A

The minimum time to compromise a cryptographic algorithm

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Three types of cryptography

A
  1. Cryptographic hash functions - 0 keys
  2. Secret-key functions - 1 key
  3. Public key functions - 2 keys
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

Cryptographic hash function

A

Function - h()
Takes a message m and produces a smaller number h(m)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Properties of cryptographic hash functions

A
  1. Should be easy to compute h(m)
  2. Given h(x) it should be hard to find x
  3. Weak + strong collision resistance
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Weak collision resistance

A

Given x, it should be difficult to find x’ such that h(x’) == h(x)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Strong collision resistance

A

Give a hash function h(), it should be hard to find two messages x1 and x2 such that h(x1) == h(x2)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Private/symmetric key crypto

A

One key is shared between encryption and decryption, assuming there is a way to keep the secret key in a secure fashion.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Public/asymmetric key crypto

A

Two keys:
Public - can be known to anybody, used to encrypt/verify signatures
Private - should be known only to the owner of the key, used to decrypt messages and sign signatures

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

Secure digest

A

Often used to verify a downloaded file
A secure digest is a summary of a message, it is a fixed length that characterizes an arbitrary length message
Usually produced by a cryptographic hash function i.e. SHA-256

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Digital signature

A

Verifies a message is an unaltered copy

Signer: writes a message m
- computes digest h(m)
- encrypts digest w/ private key enc(h(m)) (signing)
- sends the message and signature <m, enc(h(m)>

Verifier: receives <m, enc(h(m))>
- takes message m and computes digest, h(m) == h’
- decrypts h(m) from message
- verifies h’ == h(m) i.e. the message has not been altered

17
Q

Digital certificate

A

Idk go read the notes about this one