Introduction to Security Flashcards

1
Q

What is information security?

A

The protection of information and information systems

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

What is confidentiality?

A

the assurance that data cannot be viewed by an unauthorised user

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

What is data integrity?

A

the assurance that data has not been altered in an unauthorised manner (including accidental errors)

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

What is data origin authentication?

A

assurance that a given entity was the original source of a data

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

Another term for data origin authentication?

A

message authentication

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

What is entity authentication?

A

the assurance that a given entity is involved and currently active in a communication session

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

What is non-repudiation?

A

the assurance that an entity cannot deny a previous commitment or action (to a “third party”)

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

What is cryptography?

A

design and analysis of mechanisms based
on mathematical techniques that provide fundamental security services

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

What is cryptography primitive?

A

a cryptographic process that provides a number of specified security services

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

What is plaintext?

A

the raw data to be protected during transmission from sender to receiver

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

What is ciphertext?

A

the encrypted version of the plaintext that results from applying the encryption algorithm & the encryption key to the plaintext

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

What is an encryption algorithm?

A

the set of rules that determines, for any given plaintext and encryption key, a ciphertext

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

What is a decryption algorithm?

A

the set of rules that determines, for any given ciphertext and decryption key, a unique plaintext

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

What is an encryption key?

A

a value that the sender inputs into the encryption algorithm along with the plaintext in order to compute the ciphertext

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

What is a decryption key?

A

a value that the receiver inputs into the decryption algorithm along with the ciphertext in order to compute the plaintext

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

What is a keyspace?

A

the collection of all possible decryption keys

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

What is an interceptor?

A

an entity other than the sender or receiver who attempts to determine the plaintext

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

What is the difference between symmetric and public key encryption?

A

the encryption key and the decryption key are fundamentally different i.e., it is computationally infeasible to determine the decryption key from the encryption key

19
Q

What is the difference between passive and active message interception?

A

Passive interception involves the unauthorised access to data e.g. eavesdropping or copying restricted files whereas passive interception includes the unauthorised alteration, deletion, transmission or access prevention to data

20
Q

What does AES stand for?

A

Advanced Encryption Standard

21
Q

What is the difference regarding plaintext with steganography compared to encyption?

A

the adversary should not even notice that there is a plaintext at all, in contrast to encryption, where he knows there is a plaintext, but cannot compute it

22
Q

What is Kerchoff’s principle?

A

the cryptographic algorithm should not be required to be secret (it should stay secure even if the detail of the algorithm is revealed)

23
Q

What are the two ways to break an encryption algorithm?

A
  1. determining the decryption key directly
  2. deducing a plaintext from the corresponding ciphertext without first determining the decryption key
24
Q

What is a ciphertext-only attack?

A

where the attacker only knows the encryption algorithm and some ciphertext

25
Q

What is a known-plaintext attack?

A

attacks that assume the attacker knows the encryption algorithm and some arbitrary
plaintext/ciphertext pairs

26
Q

What is a chosen-plaintext attack?

A

attacks that assume the attacker knows the encryption algorithm and some arbitrary
plaintext/ciphertext pairs

27
Q

What is a chosen-ciphertext attack?

A

attacks that assume the attacker knows the encryption algorithm and some plaintext/ciphertext pairs that correspond either to plaintexts or to ciphertexts chosen by the attacker

28
Q

Examples of historical cryptosystems (4)

A
  • Caesar cipher
  • Simple substitution cipher
  • Playfair cipher
  • Vigenere cipher
29
Q

What is the keyspace of the Caesar cipher?

A

26

30
Q

What is the keyspace of the simple substitution cipher?

A

26!

31
Q

What makes historical cryptosystems unsuitable (3)

A
  1. They are all symmetric cryptosystems
  2. They are designed to provide confidentiality only
  3. They operate on alphabetic characters
32
Q

What can be used to break the simple substitution cipher?

A

Single-letter frequency analysis

33
Q

What can make an exhaustive key search impractical?

A

A large keyspace

34
Q

What are the classes of attack? (4)

A
  1. Generic attack - applies to a wide range of cryptographic primitives and do not require knowledge of the working promotive
  2. Primitive-specific attack - apply to a specific clas of cryptographic pimitives
  3. Algorithm-specific attack - designed for use against a specific cryptographic algorithm
  4. Side-channel attack - not directed against the theoretical design of a cryptographic primitive, but rather the way in which the primitive is implemented
35
Q

What is the aim of homophonic encoding?

A

to design a cryptosystem whose ciphertext alphabet histogram is close to being ‘flat’ (in other words, every ciphertext symbol occurs approximately equally often).

36
Q

Disadvantage of homophonic encoding?

A

Message expansion - it becomes more expensive to send messages across communication channel (more bits are needed to encode one of 1000 ciphertext symbols compared to one of 26 alphabetic characters)

37
Q

Why is the vignere cipher a more favoured defence against single-letter frequency analysis compared to homophonic encoding?

A

It does not involve message expansion

38
Q

What is positional dependency?

A

the characteristic of a cipher where the position or order of characters in the plaintext directly influences the position or order of characters in the corresponding ciphertext

39
Q

What is another name for confidentiality?

A

Secrecy

40
Q

How does homophonic encoding work?

A

Each character in the plaintext is mapped to one or more characters in the ciphertext and common characters in the plaintext may have multiple representations in the ciphertext, while less common characters may have fewer or even single representations

41
Q

What is another name for authentication?

A

Identification

42
Q

Which cipher takes advantage of positional dependency?

A

Vignere cipher

43
Q

How does the vignere cipher work?

A

Each letter of the plain text is shifted based on the corresponding letter of the keyword to which it is matched up

44
Q

How can the vignere cipher be broken?

A

If the length of the keyword is known, the ciphertext can be split into sections of the length of the keyword and single-letter frequency analysis can be used