Domain 5 - Cryptography Flashcards

0
Q

An encrypted message

A

Ciphertext

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

An unencrypted message

A

Plaintext

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

The science of secure communication

A

Cryptology

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

Encryption that uses one key to encrypt and decrypt

A

Symmetric encryption

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

Encryption that uses two keys: if you encrypt with one, you may decrypt with other

A

Asymmetric encryption

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

One way encryption using algorithm but no key

A

Hash function

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

This creates messages whose meaning is hidden

A

Cryptography

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

The science of breaking encrypted messages ( recovering their meaning)

A

Cryptanalysis

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

—– is a cryptographic algorithm

A

Cipher

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

Converts the plaintext into a ciphertext

A

Encryption

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

Turns a cipher-text to a plaintext

A

Decryption

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

True or false. Cryptography can provide confidentiality and integrity and does not directly provide availability

A

True

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

True or false. Cryptography can also provide authentication and non repudiation

A

True

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

This means the order of the plaintext should be dispersed in the cipher text

A

Diffusion (transposition or permutation)

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

This means that the relationship between the plaintext and cipher-text should be confused (as random) as possible

A

Confusion (substitution)

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

It describes how long it will take to break a crypto systems ( decrypt a cipher-text without a key)

A

Work Factor

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

Is a cipher that uses one alphabet

A

Mono alphabetic cipher

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

It’s a cipher that uses multiple alphabets

A

Poly alphabetic cipher

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

Mono alphabetic ciphers are susceptible to frequency analysis. True or false

A

True

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

Three primary types of modern encryption

A

Symmetric
Asymmetric
Hashing

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

Describes the process of selecting the right method(cipher) and implementation for the right job, typically at an organisation wide scale

A

Cryptographic protocol governance

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

These are stylised pictorial writing used in ancient Egypt

A

Hieroglyphics

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

An ancient cryptography that uses strip of parchment that was wrapped around a rod

A

Spartan scytale

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

Is a mono alphabetic rotation cipher used by Julius Ceasar

A

Caesar cipher

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

This uses mono alphabetic cypher rotated 13 characters

A

Rot-13

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

Is a poly alphabetic cypher that is related 26 times to form a matrix

A

Vigenere cipher

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

These have two concentric disks, each with an alphabet around the periphery. They allow both mono-alphabetic and poly alphabetic encryption

A

Cipher disks

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

Also called wheel cypher. It had 36 wooden disks, each with 26 letters in random order

A

Jefferson disks

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

Is a cipher that uses whole words from a well known text such as a dictionary. To encode, agree on a text source, and note the page number, line, and word offset of each word you would like to encode

A

Book cipher

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

Is a cipher that uses well known texts as the basis for their keys but instead of using whole words, they use modulus math to add letters to each other

A

Running key cipher

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

This cipher assigns a code word for important people, locations , and terms

A

Code books

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

This uses identical paired pads of random characters, with a set amount of characters per page. It is the only encryption that is mathematically proven to be secure

A

One time pad

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

One time pad should meet the following three conditions to be secure

A
  1. The characters on the pad are truly random
  2. The pads are kept secure
  3. No page is ever used
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
33
Q

The first known use of one time pad

A

Vernam cipher

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

Is a class of cryptographic devices known as rotor machines

A

Hebert machines

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

This looks like a large typewriter and finger wheels added use in the World War Two for cryptanalysis

A

Enigma

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

Is a cryptography law that was designed to control the export of critical technologies to iron curtain countries during the Cold War

A

Coordinating committee for Multilateral Exports Control (COCOM)

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

This law was initiated in 1996 when COCOM ended. It involves many more countries including Soviet Union countries. It also relaxed many of the restrictions on exporting cryptography

A

Wassenaar Arrangement

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

Is a mode of symmetric encryption where each bit is independently encrypted

A

Stream cipher

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

Is a mode of symmetric encryption where blocks of data each round is encrypted

A

Block cipher

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

Is used in some symmetric cipher to ensure that the first encrypted block of data is random

A

Initialisation vector (IV)

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

This seeds the previous encrypted block into the next block to be encrypted. It destroys the patterns in the resulting ciphertext

A

Chaining (also called feedback in stream mode)

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

Is a form of encryption that uses a 64 bit block size ( meaning it encrypts 64 bits each round) and a 56 bit key

A

DES Data Encryption Algorithm - DEA

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

What are the five modes of DES?

A
  1. Electronic Code Book - ECB
  2. Cipher Block Chaining - CBC
  3. Cipher Feedback - CFB
  4. Output Feedback - OFB
  5. Counter Mode - CTR
44
Q

It is the simplest and weakest form of DES. It does not use IV or chaining. Identical plain text encrypted with identical keys produces identical cipher-text. It is the original mode of DES

A

Electronic Code Book (ECB)

45
Q

Is a block mode of DES that XORs the previous encrypted block of ciphertext to the next block of plaintext to be encrypted. It’s limitation is that encryption errors will propagate as its cascade through subsequent blocks

A

Cipher Block Chaining

46
Q

Is a DES stream mode that uses IV and feedback to destroy patterns and errors propagate

A

Cipher Feedback

47
Q

Is a DES stream mode where it uses the subkey before it is XORed to the plaintext. Because the subkey is not affected by encryption errors, errors will not propagate

A

Output feedback

48
Q

Is a DES stream mode that uses counter as a feedback. It destroys patterns and errors do not propagate

A

Counter mode

49
Q

Is the original implementation of DES , encrypting 64 bit blocks of data with 56 bit key, using 16 rounds of encryption

A

Single DES

50
Q

Is a single DES that is encrypted 3 times. It’s primary weakness is it too slow and complex

A

Triple DES

51
Q

3 forms of Triple DES Encryption

A

1TDES EDE
2 TDES EDE
3 TDES EDE

52
Q

Is the strongest form of DES with 168 bits of key length

A

3TDES EDE (three different keys)

53
Q

Is a symmetric block cipher designed as an international replacement for DES. It uses 128 bit key and 64 block size. It primary drawbacks are patent encumbrance and slow speed

A

International Data Encryption Algorithm (IDEA)

54
Q

Is the current US standard symmetric block cipher. It’s uses 128, 192, or 256 bit keys. It is an open algorithm, free to use and free of any intellectual restriction.

A

Advanced Encryption Standard - AES

55
Q

Five AES Finalist

A
MARS
RC6
Rijndael
Serpent
Twofish
56
Q

Four functions of AES

A

ShiftRows
MixColumns
SubBytes
AddRoundKey

57
Q

Is an AES function that provides diffusion by shifting rows of the state

A

ShiftRows

58
Q

An AES function that provides diffusion by mixing the columns of the state via finite field mathematics

A

MixColumns

59
Q

An AES function that provides confusion by substituting the bytes of the state

A

SubBytes

60
Q

Is the final function applied in each round of AES. It XORs the state of the subkey

A

AddRoundKey

61
Q

Is a symmetric block cipher created by teams lead by Bruce Schneier. It was an AES finalist. It uses from 32 to 448 bit keys to encrypt 64 bits of data.

A

Blowfish

62
Q

Is a symmetric block cipher created by teams lead by Bruce Schneier. It was an AES finalist encrypting 128 bit blocks using 128 to 256 bit keys.

A

Twofish

63
Q

An example of asymmetric one way function is factoring a composite numbers into its primes.

A

Factoring Prime Numbers

64
Q

An example of asymmetric algorithm one way function which is the basis of Diffie-Hellman and ElGamal asymmetric algorithm

A

Discrete Logarithm

65
Q

This allows two parties to securely agree on a symmetric key via public channel such as internet, with no prior key exchange.

A

Diffie-Hellman Key agreement protocol

66
Q

Another asymmetric encryption that leverages a one way function that uses discrete logarithms as applied to elliptic curves. It requires less computational resources because shorter keys can be used. It is often used in low power devices for this reason

A

Elliptic Curve Cryptography

67
Q

True or False. Asymmetric encryption is slower and weaker than per bit of key length than symmetric .

A

True

68
Q

True or False. The strength of asymmetric algorithm is its ability to securely communicate without pre-sharing a key

A

True

69
Q

This happens when two hashes are the same from different plaintext.

A

Collision

70
Q

This creates a 128 bit hash value based on any input

A

MD5

71
Q

Is the newest version of the MD hash family algorithm

A

MD6

72
Q

Is a hash algorithm that creates 160 bit hash value and was also found to be weak collision avoidance

A

SHA-1

73
Q

Is Secure Hash Algorithm -SHA that includes 224, 256, 384 and 512 bit hash value

A

SHA-2

74
Q

Is a hash algorithm that creates message digests of 128, 160, 192,224 or 256 bit key lengths using 3, 4 or 5 rounds. It’s faster than MD5

A

Hash of Variable Length (HAVAL)

75
Q

Is a cryptographic attack that generates the entire keys pace which is every possible key

A

Brute force attack

76
Q

Is a cryptographic attack that uses the human mind to bypass security controls. It maybe use to recover a key by tricking the key holder into revealing the key

A

Social engineering

77
Q

Is pre computed compilation of plaintexts and matching cipher texts

A

Rainbow Tables

78
Q

Is an cryptographic attack that relies on recovering and analysing a matching plaintext and ciphertext pair. The goal is to derive the key that was used

A

Known Plaintext

79
Q

Is a cryptographic attack that chooses the plaintext to be encrypted ; the goal is to derive the key.

A

Chosen Plaintext

80
Q

It’s a cryptographic attack that mirrors chosen plaintext attacks; the difference is that the cryptanalyst ciphertext to be decrypted

A

Chosen Ciphertext

81
Q

Cryptographic attack that attack encrypts on one side, decrypts on the other side and meet in the middle

A

Meet in the middle attack

82
Q

Is a cryptographic attack where cryptanalyst knows something about the key to reduce the efforts used to attack it

A

Known Key

83
Q

This seeks to find the difference between related plaintexts that are encrypted. Using statistical analysis to search for signs of randomness in the ciphertext.

A

Differential cryptanalysis

84
Q

Is a known plaintext attack where cryptanalyst finds large amount of plaintext/ciphertext pairs created with the same key. The pairs are studied to derive information about the key used to create them

A

Linear cryptanalysis

85
Q

This uses physical data to break crypto system such as monitoring CPU cycle or power consumption while encrypting of decrypting.

A

Side Channel attacks

86
Q

This attack exploits a mistake (vulnerability) made while implementing an application,service or a system.

A

Implementation attacks

87
Q

This occurs when two symmetric keys applied to the same plaintext produce the same ciphertext.

A

Key Clustering

88
Q

These are use to cryptographically sign documents. It provide non repudiation which includes authentication of the identity of the signer and proof of the document’s integrity

A

Digital Signatures

89
Q

True or false. Digital signatures provide authentication and integrity which forms non repudiation. They do not provide confidentiality as the plaintext remains unencrypted

A

True

90
Q

Is a hash function that uses a key

A

Message Authentication Code - MAC

91
Q

This combines a shared key with hashing. Two parties must pre-share a secret key (Symmetric). XOR the plaintext with the key then hashes the output and then the hash is combine again with the key.

A

Hashed Message Authentication Code (HMAC)

92
Q

These leverages all the three forms of encryption to provide and managed digital certificate. A digital certificate is a public key signed with a digital signature

A

PKI - Public Key Infrastructure

93
Q

5 Components of PKI

A

CA - the issue and revoke of certificates
Organisational Registration Authority -ORA - vouch for the binding between public keys and certificate holder identities
Certificate holders - that are issued certificate and can sign digital documents
Clients - that validate the digital signatures and their certification paths from a know public key of a trusted CA
Repositories that store and make available certificates and CRLs

94
Q

This means the organisation that issued the public/private key pairs retains a copy.

A

Key Storage

95
Q

True or false. A retired key may not be used for new transactions but may be used to decrypt previously encrypted plaintext.

A

True

96
Q

Is a suite of protocols that provide a cryptographic layer to both IPv4 and IPv6. It is one of the methods used to establish VPNs which allow you to send private data over insecure network

A

IPSec

97
Q

Is one IPSec protocols that provide authentication and integrity for each packet of network data. It does not provide confidentiality; it acts as a digital signature for data. It also protects against replay attacks

A

Authentication Header - AH

98
Q

One IPSec primary protocol that provides the confidentiality by encrypting the packet data

A

Encapsulating Security Payload

99
Q

In IPSec, this is a simple or one way connection that may be used to negotiate ESP or AH parameters

A

Security Association - SA

100
Q

Is an IPSec mode used by security gateways which can provide point to point IPSec tunnels. It encrypts the entire packet, including original packet headers

A

ESP Tunnel Mode

101
Q

This is an IPSec mode that only encrypts the data(not the original headers); this Is commonly used when the sending and receiving system can speak IPSec natively

A

Transport Mode

102
Q

This negotiates the algorithm selection process in IPSec

A

Internet Key Exchange - IKE

103
Q

This brought the asymmetric encryption to the masses. It provides the modern suite of cryptography: confidentiality, integrity, authentication, and non repudiation. It can be used to encrypt emails, documents, or the entire disk drive

A

Pretty Good Privacy (PGP)

104
Q

This provides a standard way to format email, including characters, sets and attachments. It leverages PKI to encrypt and authenticate MIMe encoded email

A

S/MIME

105
Q

This means a 3rd party organisation holds a copy of a public/private key pair

A

Escrowed Encryption

106
Q

The name of the technology used in the Escrowed Encryption Standard, an effort by the US government to deploy escrowed encryption in telecommunications devices.

A

Clipper Chip

107
Q

This encode data into a file. It maybe hidden using steganography. It is often used to fingerprint files.

A

Digital Watermarks