Cryptography Flashcards

1
Q
  1. Cryptography - Encryption of information
  2. Cryptanalysis - research into cryptographic methods
  3. Cryptolinguistics - Examination of language features
  4. Steganography - hiding information in information
  5. Alphabet - Finite amount of characters available for composing a message
  6. Plain message - message to be encrypted m
  7. Ciphertext - The encrypted message C
  8. Encryption Function E= (M, Ke) with Key E
A
  1. Decryption Function - D=(C, Kd) with Key D
  2. What does Kerkhoff’s principle state ?

The security of an encryption method is based solely on the secrecy of the key and not the secrecy of the encryption algorithm

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

Explain the substitution procedure .

A

Each element in a message is replaced by another element but is not moved in the text

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

What is codification

A

When whole words are replaced

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

What is ciphering and what are the 2 types of ciphering ?

A

If one replaces individual characters of an alphabet, it is a
matter of ciphering.

Types:

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

What is the mono alphabetic solution?

Example: Caesar shift/shift cipher

A

Each character of the plaintext alphabet is mapped to a character of the ciphertext alphabet

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

What are the two major groups of ciphers - hint from previous flashcard **

A
  1. Monoalphabetic ciphers
    - the whole text is encrypted with a
    fixed assignment table
  2. Polyalphabetic ciphers - several assignment tables in alteration
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

Transposition method

Example - Column Transposition: rows and columns are swapped

A

Each element of a message is moved to a different position within the text.

The element itself is not changed

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

Polyalphabetic substitution

A

Substitution by means of several ciphertext alphabets
– Plaintext character is not always replaced with the same ciphertext character
– Blurring of frequencies in plain text

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

Block ciphers - Explain the steps.

A

▪ Divide the plaintext into blocks of a certain size before encryption
▪ Each block has identical sizes in plaintext and ciphertext
▪ Blocks are encrypted with a secret key
▪ Decryption is done with the same key (symmetric encryption).
▪ If each block is encrypted independently of the others, this is called ECB mode (Electronic Codebook).
▪ ECB Mode is rarely used

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

Cipher Block Chaining (CBC Mode)

A
  • uses feedback (XOR linking of an encrypted block with the next block to be encrypted)
    ▪ This prevents that same plaintext block from always resulting in the same encrypted block
    ▪ The 1st block to be encrypted is linked to an initialization vector (IV), which must also be known to the recipient
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

What are Hash functions?

A

Mathematical one-way function - maps a file or message of arbitrary (random) length to a fixed-length value.

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

Characteristics of hash functions…

A
  1. Non-injective - (= each element of the target set is assumed to be a function value at most once)
  2. Even the smallest changes (bit) of the source file change the hash value (= avalanche effect).
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

2 Typical Hash algorithms

A

▪ MD5 - Message Digest 5

▪ SHA - Secure Hash Algorithm

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

Classification of cryptanalytic attacks

A

– Attack with known plain text
– Attack with freely selected plain text
– Attack with selected ciphertext

▪ Brute force
– systematically try out all possible keys

▪ Dictionary Attack
– Dictionary attack, password collections

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

What is confusion and diffusion in encryption procedures

A
  1. Diffusion - Statistical structure of the plaintext M scatter in ciphertext C
  2. Confusion - The relationship of the key K to the Ciphertext C must be maximally complex
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Requirements for Diffusion

A

▪ Dispersion of the structure (e.g. by transposition or permutation)
▪ small change in plaintext => big effect in ciphertext
▪ statistical analysis is made more difficult

17
Q

Requirements for confusion

A

▪ Complexity between key and ciphertext as large as possible
▪ It must not be possible to derive the key simply from ciphertext
▪ e.g. by means of substitution mechanisms