Cryptography Flashcards

1
Q

A developer wants to send a system administrator a message and wants to use a cipher that reorders the plaintext characters to create the ciphertext. Which cipher meets this requirement?

A

Transposition cipher is a method of encryption in which the location of the characters in the plaintext is rearranged throughout the ciphertext while the characters themselves are left unchanged.

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

A developer wants to encrypt a data stream using a symmetric key and wants to encrypt the data in such a way that the cipher method encrypts the individual bits. Which cipher method can the developer use to meet this requirement?

A

Stream cipher is an encryption algorithm that breaks a plaintext message down into single bits and encrypts 1 bit of plaintext at a time.

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

the science of keeping information secret and safe by transforming it into a form that unintended recipients cannot understand using an algorithm (a series of mathematical operations)

A

cryptography

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

the art of breaking or “cracking” the protection provided through cryptography algorithms

A

cryptanalysis

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

the study and practice of both cryptography and cryptanalysis

A

cryptology

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

a human-readable unencrypted message used as an input to a cipher (encryption algorithm) before encryption or after decryption

A

plaintext

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

unreadable encrypted message output after an encryption algorithm has been used on the plaintext

A

ciphertext

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

the process (or algorithm) used to encrypt and decrypt a message

A

cipher

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

what could you use to encrypt individual files?

A

Aescrypt

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

What would you use to encrypt full disks?

A

Bitlocker

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

where a single mapping from our alphabet to a cipher alphabet is created. Many early
cryptosystems used this

A

Mono-alphabetic

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

refers to the mapping of our alphabet to a number of cipher alphabets. This approach
added a bit of complexity to early cryptosystems

A

Polyalphabetic

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

considered to be unbreakable since it only uses its cipher code once

A

One-time pad

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

repeats the random numbers after a given time (periodic). They are
fast and are also deterministic and are useful in producing a repeatable set of random numbers

A

Pseudo-Random Number Generators (PRNGs)

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

This method generates a true random number and uses some form of random
process. One approach is to monitor the movements of a mouse pointer on a screen or from the pauses between keystrokes. Overall, the method is generally slow, especially if it involves human interaction, but is non-deterministic and aperiodic

A

True Random Number Generators

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

s cipher cracking methodology that involves identifying patterns and variations in the probability of codes.
i.e. a three-letter ciphered text combination spotted at the beginning of a string too often could tip us off that those three
letters correlate the letters THE in the English alphabet.

A

Frequency Analysis

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

measures the amount of unpredictability; in encryption relates to the degree of uncertainty of the encryption process.

A

Entropy

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

Two common binary to characters encoding methods are

A

ASCII and UTF-16

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

encoding method (8-bit values, up to 256 characters)

A

ASCII

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

Encoding method:16- bit values, up to 65,536 characters

A

UTF-16

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

which is more efficient? hardware or software encryption?

A

Hardware encryption is more efficient than software encryption.

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

tamper-evident and an intrusion-resistant physical device that safeguards and manages cryptographic keys and provides cryptographic processing

A

hardware security module (HSM)

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

a dedicated processor that handles hardware-level encryption. allows the use of full-disk encryption on a hard drive in a manner that minimizes the impact on system performance. contains encryption keys.

A

trusted platform module (TPM)

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

Simply divide the first number by the second and return the remainder. Annotated using the (mod) or (%). Example:
5 mod 2 = 1 [2 goes into 5 a max of twice (4), 5-4 = the remainder which is 1]

A

Modulus Operator Math

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

not concerned with the order

A

combinations

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

all options considered inlcuding sequence

A

permutations

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

determining the likelihood of an event happening

A

probability

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

single secret key for both encryption and decryption

A

secret key encryption (symmetric Cryptography)

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

challenges in secret key cryptography

A

finding a secure way to share or transport the key between encrypting and decrypting

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

widely used key exchange algorithm; used to exchange the secret key in symmetric cryptography

A

diffie-helman

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

two types of symmetric encryption

A

block and stream

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

stream encryption is ______ than block and be applied in real time applications

A

faster

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

In symmetric encryption; what is padding used for?

A

to fill blocks to operating size when the data does not fit properly

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

ECB, CBC, CFB, OFB, AND CTR

A

block cipher modes

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

CFB, OFB AND CTR essentially allow the block cipher to operate like a

A

stream cipher

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

secret key ciphers make use of ___________ to perform substitution as part of the encryption process

A

S-Boxes (substitution boxes)

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

take a given input and leverage look-up tables to produce a given output

A

S-Boxes

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

measure of the security of a code is __________

A

work factor

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

amount of time it would take to break the code based on computational power available.

A

work factor

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

process of adding an initialization vector to the ciphering process to change it’s operation and ensure that the ciphertext does not give the original plaintext when played back.

A

salting

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

involves the same key being applied to the encrypted data, in order that the original data is recovered. Methods: DES, 3-DES,RC2, AND AES.

A

symmetric key-based encryption

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

using a different key to decrypt the encrypted data, in order that the original data is recovered. Methods: RSA, DSA, and ElGamal

A

Asymmetric key-based encryption

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

with _______ it should not be mathematically possible to reverse the derived cipher back to the original data.

A

one way hash

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

how are one-way hashes broken?

A

by knowing the mapping of the data to the hashvalue, or by brute-force analysis on stored hash.

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

method of knowing the mapping between the hashed values and the original data

A

rainbow table attack

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

brute force analysis is also known as

A

dictionary-type attack

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

Major advantage secret key encryption has over public key

A

must faster to decrypt. can be used in real time encryption

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

stream cipher examples

A

RC4 and ChaCha

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

examples of block encryption

A

RC2, RC5, IDEA, DES, 3-DES, AES, Blowfish and Twofish

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

RC2 key size

A

40 bits

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

RC5 block size

A

variable

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

RC5 block sizes

A

32, 64 or 128

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

AES Key size

A

128, 192, or 256

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

AES block size

A

128 bits

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

DES key size

A

56 bits

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

DES Block size

A

64 bit

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

3-DES Key size

A

112 bit

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

3-DES Block size

A

64 bit

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

Blowfish block size

A

64-bits

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

This pads with the same value as the number of padding bytes. Defined in RFC 5652, PKCS#5, PKCS#7 and RFC 1423 PEM

A

CMS ( Cryptographic Message Syntax)

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

improvement over ECB; uses the IV for the first block, and then results from the previous block to encrypt the current block. the IV value must be sent w/ the ciphertext, in order to be deciphered.

A

Cipher Block Chaining

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

similar to CBC, but it makes the block cipher into a self-synchronising stream cipher

A

Cipher Feedback (CFB)

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

The first stage takes the data blocks and X-OR’s with the encrypted version of the IV value. The output of the first stage encryption is then feed into the next stage, and encrypted, with the output being X-OR’ed with the second block

A

Output Feedback

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

converts the block cipher into a stream cipher. With this it generates a counter value and a nonce, and encrypts this, in order to EX-OR with the plain text block

A

Counter mode

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

each column is taken one at a time and each byte within the column is transformed to a new value based on all four bytes in the column

A

Mix Column Transformation

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

In DES, The secret key has only __ useful bits, as eight of its bits are used for parity (which gives 256 or 1017 possible keys)

A

56

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

Uses a pseudo random number generator, and where the output of the generator is XOR’ed with the plaintext. It is a fast algorithm and can use a wide range of key length

A

RC4

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

IDEA key size

A

128

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

IDEA block size

A

64

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

secret key encryption algorithm, designed by the NSA, and was used with the Clipper chip

A

Skipjack

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

Skipjack key size

A

80

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

Skipjack block size

A

64 bit

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

a general-purpose private key encryption algorithm, using either a 128-, 192- or a 256-bit encryption key. Unlikely many other encryption methods, it was unpatented, and could be freely used by anyone.

A

Blowfish

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

as a general-purpose private key encryption algorithm, using either a 128-, 192- or a 256-bit encryption key.

A

Twofish

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

block cipher created by Mitsubishi and NTT.

A

Camellia

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

XTEA (eXtended TEA) is a block cipher which uses a __-bit block size and a ___-bit key

A

64 and 128

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

diffie helman weaknesses?

A

easy to precompute on values for two popular parameters.

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

involves forcing the key negotiation process to default to 512-bit prime numbers. For this
the client only offers DHE_EXPORT for the key negotiation, and the server, if it is setup for this, will accept it. The
precomputation of 512-bit keys with g values of 2 and 5 (which are common) are within a reasonable time limits.

A

DHE_EXPORT Downgrade attack

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

three groups (bases): Group 1, Group 3 or Group 5, which vary in the size of the prime number used

A

diffie helman

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

What kind of attacks does diffie-helman suffer from?

A

man-in-the-middle attacks

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

the strength of the diffie-helman method relates to the ______ _____ _____ ______ _____- which are used in the public key exchange.

A

size of the prime number bases

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

involves first grouping data to be encrypted (typically your plaintext) into blocks of a specific size and then encrypting those blocks.

A

symmetric block encryption

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

Block cipher modes merely outline __ __ ___ ___ ___ ___depending on the implementation selected (i.e., which mode is used). Implementation selection can be based on anything just as type of cipher can. Factors can include security needs or not, processing capacity, organization preference and so on.

A

how the blocks will be handled

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

minor step up from ECB; incorporation of an IV

A

(CBC) Cipher Block Chaining

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

Converts the block cipher into a self-synchronizing stream

cipher. Current block takes the output of the XOR.

A

Cipher Feedback

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

difference between CFB(cipher block chaining) and OFB(Output feedback)

A

current block takes output of XOR vs from cipher stage of the previous block

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

Converts the block cipher into a stream cipher.
➢ Generates a counter value and a nonce, and encrypts this, in
order to EX-OR with the plain text block

A

Counter Mode (CTR) = block cipher mode

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

advantage of CTR Mode

A

each block is processed independent of the others; ability to conduct parallel processing of blocks. (feedback from other stages to feed into the current one is not required.

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

_____ _____encryption makes use of a key pair (one public, one private) to perform encryption and
decryption. If a given key in a key pair is used for encryption, only the opposite key in that key pair can perform the reverse decryption.

A

Public Key

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

Public-key encryption is an excellent method of keeping data secure, but it is often_____ _____ for real-time communications

A

too slow

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

Two main applications of public key encryption are

A

identity checking and key protection

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

____ leverages the fact that products of large prime numbers are difficult to factorize as basis of its encryption

A

RSA

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

With ______ -________, we can perform mathematical operations on ciphered values i.e., before decryption.

A

homomorphic encryption

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

RSA has a ____ _____ on processor loading

A

heavy overhead

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

RSA is not well suited for ______ _____ (as the power drain can be high, along
with heavy requirements for processing and memory).

A

embedded systems

96
Q

an improved solution over RSA is _________ -________-

A

elliptic curve

97
Q

Elliptic curve encryption is used in ______ _____ ______ and for the creation of _____ _____

A

key exchange methods / digital signatures

98
Q

The main advantages of Elliptic Curve methods are:

A

Much smaller keys, more difficult to crack than RSA, and can be used to factorize values.

99
Q

El Gamal is a public key method that is used in both ______ and _________.

A

encryption and digial signing

100
Q

El gamal uses discrete __________

A

logarithms

101
Q

public key encryption method that is an extension of El Gamal but adds a one-way hashing method which protects
against an adaptive chosen ciphertext attack

A

Cramer-shoup

102
Q

The Paillier cryptosystem supports __________ encryption

A

homomorphic

103
Q

DES Key and Block Size

A

56 bit (Key) and 64 bit (block)

104
Q

1993 by Bruce Schneider. Key size 32 to 448 bits.

A

Blowfish

105
Q

Bruce Schneider, Neil Ferguson; designed to replace DES. Key size of 80 bits.

A

Skipjack

106
Q

Symmetric Block Cipher ; James Massey ; Key Size 128 bits

A

IDEA

107
Q

CAST Key Size

A

128 or 256 Bits

108
Q

Symmetric Block Cipher: 128 bit key ; Vincent Rijmen

A

SHARK

109
Q

RC5 & RC6 Key Size

A

up to 2048

110
Q

Symmetric Block Cipher : Key size 128,192 & 256 bits : Ross Anderson

A

SERPEANT

111
Q

RCA Key Size

A

1-256

112
Q

Asymmetric / Leverages prime number characteristics, 1024-4096 bit variable key size, 1 round

A

RSA

113
Q

Asymmetric Cipher: Leverages discrete logarithm characteristics /provides authentication and encryption/ faster than RSA / Uses less resources than RSA (Used in smaller devices like smartphones) / authentication through digital signatures

A

ECC

114
Q

Used in recent versions of PGP / Extension of Diffie Hellman (DH)/ Similar level of protection as RSA and ECC/ usually the slowest

A

El Gamal

115
Q

A Federal Information Processing Standard for digital signatures (FIPS 186)

A

DSA

116
Q

4 Basic Steps to send a digitally signed message using public key cryptography.

A

Step 1: Sender signs w own private key.
Step 2: Sender Encrypts message w/ receiver’s public key
Step 3: Receiver decrypts message w/ receiver’s own private key
Step 4: Receiver verifies message w/ senders public key.

117
Q

Server authentication, Client authentication, Code signing, Email signing, Time stamping,
IP security, Windows hardware driver verification, Smart card logon, Document signing, Public key transport

A

Common Certificate Applications

118
Q

IKE, PKCS #7, PKCS #10, RSA signatures, X.509v3.

A

common certificate types

119
Q

Step 1: Requester generates a key-pair (one public, one private).
▪ Step 2: Requester creates a Certificate Signing Request (CSR).
▪ Step 3: Trusted CA generates the digital certificate for the requester.
▪ Step 4: Trusted CA signs the requester’s digital certificate with the CA’s own private key

A

4 Basic steps for obtaining a digital certificate signed by a trusted Certificate Authority (CA):

120
Q

Two major encoding schemes for X.509 certificates

A

PEM (Base64 ASCII text) format, and DER (binary) format

121
Q

describes one-way or irreversible encryption used for protecting the integrity of data and in authentication applications. Hashing is
normally used to either hide the original contents of a message (such as hiding a password), or to check the integrity of data

A

hashing

122
Q

Hashing involves taking a ___ _____ input and producing a _____ ____ output (message digest)

A

variable length / fixed length

123
Q

A weakness of one-way hashing is that the same piece of plaintext will result in the _____ ______ (unless salt is applied)

A

same ciphertext

124
Q

This is where another match is found, no matter the similarity of the original message. Collision attacks exploit this

A

Collision

125
Q

This is where part of the message has some significance to the original and generates the same hash signature. This is
defined as a Pre-image attack

A

Similar context

126
Q

This is where an alternative message is created with the same hash signature and has a direct relation to the original
message. This is an extension to a Pre-image attack

A

full context

127
Q

is a message authentication code (MAC) that can be used to verify the integrity and authentication of the message. It involves
hashing the message with a secret key, and thus differs from standard hashing, which is purely a one-way function.

A

HMAC

128
Q

This includes the main standardized hashing techniques, such as MD5, SHA1, SHA256 and SHA512.

A

general hashes

129
Q

(with salt). This includes ARP1, PBKDF2, PHPASS, DES, MD5, Bcrypt, Sun MD5, SHA1, SHA256 and SHA512.

A

UNIX hases

130
Q

This includes LM, NTLM, DCC and DCC2

A

Microsoft Windows hashes

131
Q

This includes MD5, MD5 (Salted), SHA, SHA (Salted), MD5 (Crypt).

A

LDAP hashes

132
Q

This includes MS SQL 2000, MS SQL 2005, My SQL 323, My SQL 41, Postgres, Oracle 10, and Oracle 11.

A

database hashes

133
Q

128 BIT HASH, RFC 1321

A

MD5

134
Q

SUBMITED TO THE NIST SHA-3 COMPETITION (HASH)

A

MD6

135
Q

160 bit hash, SHA-1, SHA-2(SHA-224, SHA-256, SHA-384, SHA-512), SHA3.

A

SHA

136
Q

HASH USES A 512 BITS BLOCKS/ 256 bit Hash Value

A

Fork 256

137
Q

160 BIT HASH, EXIST 128, 256 AND 320 VERSIONS

A

RIPEMD-160

138
Q

HASH: Defined by Russian Nat’l Standard ; 256 bits output

A

GOST

139
Q

Hash / 192 bit function

A

Tiger

140
Q

Hash ; uses a block cipher in CBC nmode to improve integrity

A

MAC and HMAC

141
Q

relationship with prime numbers, security derives from large prime numbers

A

RSA

142
Q

Group of PRNGs. 3 main components: generator, entropy accumulator and seed file.

A

Fortuna

143
Q

BY Bruce Schneider, john Kesley & Niels Ferguson, supplanted by Fortuna

A

Yarrow

144
Q

The three most common tunneling protocols are

A

PPTP (Point-to-point Tunneling Protocol), L2TP (Layer 2 Tunneling Protocol) and IPSec

145
Q

One of the greatest flaws of ___ ___ was the usage of “export-grade ciphersuites” – which were created to comply with US Export
regulations, and which made sure that the keys were crackable. This included a small key size, such as using a 40-bit session key for a
connection. Additional SSL risks include DROWN, POODLE, and FREAK.

A

SSL v2

146
Q

the tunnel is created with a symmetric key method (such as with RC4 or AES), and then a signature is created with a
defined hashing method (such as SHA-1 or MD5)

A

SSL/TLS

147
Q

we aim to create a connection from a host machine to a trusted network, and which is
tunneled through a public network

A

VPN

148
Q

The IPSec protocol includes two mechanisms which can be used separately or together

A

ESP and AH

149
Q

takes the original data packet, and breaks off the IP header. The rest of the packet is
encrypted, with the original header added at the start, along with a new field at the start, and one at the end. It is important that
the IP header is not encrypted as the data packet must still be read by routers as it travels over the Internet. Only the host at the
other end of the IPSec tunnel can decrypt the contents of the IPSec data packet

A

ESP (Encapsulated Security Protocol)

150
Q

Encrypts the complete contents of the IP data packet, and adds a new packet header

A

authenication header

151
Q

Authentication header weakness

A

intruder can replay previously sent data,

152
Q

Two Main Phases in setting up an IPsec connection

A

1) define internet key exchange

2) defines the policies to be used for the tunnel

153
Q

e, where the hashing method, and encryption and key exchange methods are defined

A

Internet key exchange

154
Q

With _______ __ _____, we have end-to-end tunneling, where the encryption scope spans across of the network, and where no
intermediate scanning is possible for the content stored within the packets.

A

IPsec transport mode

155
Q

the connection is tunneled over a public network, but the network traffic is unprotected on either side of
the connection. This mode allows for the inspection of network packets on either side

A

tunnel mode

156
Q

involves using subscriber computers to route data packets over the internet, instead of using publicly available routers.

A

Onion routing

157
Q

With the ____ network, the routing is done using computers of volunteers around the world to route the traffic around the Internet, and
within each hop the chances to trace the original source significantly reduces.

A

Tor

158
Q

In terms of a backdoor in cryptography, the two main methods which could be used are:

A

Key escrow and NOBUS

159
Q

This is where a copy of the encryption key is kept in escrow so that it can be used by a government agent.

A

Key escrow

160
Q

(‘nobody but us’) backdoor. This is where it is mathematically possible for government agents to crack the encryption, but
no-one else can

A

NOBUS

161
Q

Where the intruder uses brute force to decrypt the ciphertext and tries every possible key

A

exhaustive search

162
Q

intruder knows part of the ciphertext and the corresponding plaintext. The known ciphertext and plaintext can then be used to decrypt the rest of the ciphertext.

A

Known plaintext attack

163
Q

Where the intruder sends a message to the target, this is then encrypted with the target’s private-key and the
intruder then analyses the encrypted message. For example, an intruder may send an e-mail to the encryption file server and the
intruder spies on the delivered message

A

Chosen-ciphertext attack

164
Q

Where the intruder inserts or modifies messages.

A

active attack

165
Q

Where the intruder takes a legitimate message and sends it into the network at some future time.

A

replay system

166
Q

Where the intruder mixes parts of two different encrypted messages and is able to create a new message. This
message is likely to make no sense but may trick the receiver into doing something that helps the intruder.

A

cut-and-paste

167
Q

Some encryption schemes use the time of the computer to create the key. Resetting this time or determining the time
that the message was created can give some useful information to the intruder

A

Time resetting

168
Q

This involves determining the amount of time that a user takes to decrypt the message; from this the key could be found

A

time attack

169
Q

AES has proven to be free from major vulnerabilities, but poor implementation of the _____________ method leaves it susceptible to attacks
such as: Brute force, use of Non-Random Numbers, and copy-and-paste

A

encryption

170
Q

consists of cryptosystems able to support IoT, embedded systems, RFID etc. (i.e.
provide cryptographic functions but require less processing power, physical space, and battery power than conventional
cryptosystems).

A

Light-weight cryptography

171
Q

NIST outlines the device spectrum as:

▪ Conventional cryptography which includes….

A

servers and desktops. tablets and smart phones.

172
Q

have fast multiplication circuits, and thus can be used to perform multiplications and search a
range of prime numbers at a speed which would break most existing RSA implementations

A

quantum computers

173
Q

a tree that defines each non-leaf node with a value or a label and contains a hash of its children. This
builds a hash trees and is used to provide a verification of large-scale data structures

A

Merkle tree

174
Q

uses asymmetric cryptographic primitives based on lattices. It has been known about for
several decades, and is now being investigated because of its quantum robustness, whereas many of the existing public
key methods such as RSA and Diffie-Hellman cryptosystems can be broken with quantum computers

A

Lattice-based cryptography

175
Q

(Light-Weight Symmetric Methods) Another contender for light-weight cryptography is the super-fast ______ method. block cipher which uses a 64-bit block size and a 64-bit key. It was designed by David Wheeler and Roger Needham at the Cambridge Computer Laboratory, and part of an unpublished technical report in 1997. The amazing thing about ______ is that it does its operations with just a few lines of code

A

XTEA

176
Q

. A key focus for the crypto-currency to protect against someone
spending money that they do not have, so Bitcoin uses __________

A

Blockchain

177
Q

is a publicly available ledger of transactions that allows the Bitcoin network to know the number of bitcoins
that a given user has in their account. Can be public or private.

A

blockchain

178
Q

Conventional currencies usually have a central bank that creates money and then controls its supply. The Bitcoin
currency is instead created when users _____ ____ ___

A

mine for it

179
Q

Bitcoin transactions will be captured by _______ who will compile a list of the latest transactions. If valid, the transaction
is then recorded within a mining process, where mining nodes gather new transactions and compute a hash of the new
block, and which should also contain the hash of the previous block, and then build a transaction log. Once complete,
this becomes part of the official Blockchain in the network, and the miners reach a consensus on the current
Blockchain. _____________ receive rewards for successful mining efforts.

A

miners

180
Q

built on the Bitcoin/Blockchain concept but included the concept of smart contracts

A

Ethereum

181
Q

he unit that is used to measure the amount

of work that is required to perform a single Keccak-256 hash

A

Gas (Ethereum)

182
Q

are programs stored on a blockchain that run when predetermined conditions are met; they typically
are used to automate the execution of an agreement so that all participants can be immediately certain of the outcome,
without an intermediary’s involvement or time loss

A

smart contracts

183
Q

Along with creating a new currency (Ether), the main contribution of Ethereum is to create the concept of _____ ____ _____ _____ _____s which enables users to create their own contracts, and which will be strictly abided to

A

peer-to-peer smart contracts

184
Q

Encryption schemes commonly used with Wi-Fi include

A
40-bit RC4 (WEP), 128-bit RC4 (WPA – Wi-Fi Protected Access), or 128-bit/ 256-
bit AES (WPA-2)
185
Q

Because of export restrictions, the size of the original key in RC4 was limited to _________ and was then increased to

A

40 bits (WEP) ; 128 bits (TKIP)

186
Q

Overall WEP is weak from a number of viewpoints:

A

▪ Small value of IV (24 bits). This meant that it repeated within a reasonable time, and the key could then be attacked.
▪ Construction of keys made it susceptible to the weak key attacks (FMS attack).
▪ Lack of protection against message replay. There was no protection against cipher streams being played back over the network.
▪ Lack of message tampering identification. The method did not support the detection of message tampering.
▪ Directly used a master key. The method had no way of updating the keys.

187
Q

After WEP, there was a strong need to fix the problems, but to keep compatibility, thus WPA supported ____, and which increased the
IV value to 48 bits (rather than 24 bits)

A

TKIP

188
Q

WPA addressed the weaknesses of WEP, and without requiring significant hardware changes, and focused on two main methods:

A

WPAPSK and WPA Enterprise

189
Q

advanced the WPA standard, by keeping compatibility with WPA, but adding AES-CCMP (AES-Counter Mode
CBCMAC Protocol), which is a block encryption method. Again, it supported two modes: Personal (with a pre-shared key) and
Enterprise.

A

WPA-2

190
Q

as with WPA, no pre-shared key is used, and it also includes a MIC (Message Integrity Check). The MIC mainly
guards against the bit flipping attacks identified within WEP

A

WPA Enterprise

191
Q

Mobile phone networks/GSM typically uses the ____ _____ _____ _____ _____ encryption method, but almost on its first day of operation it has
been a target for crackers, and the source code to crack A5/2 was released within one month of being made public.

A

A5/1 or A5/2 stream

192
Q

known as KASUMI – the Japanese word for “mist” – is the upgrade to A5/1 and uses a block cipher. A5/1
is designed to be used for the GSM networ

A

A5/3

193
Q

for 3GPP, and is based on the MISTY1 cipher. 128-bit key

A

A5/3

194
Q

While WEP contains many weaknesses, a properly defined stream cipher can be

A

much faster than block ciphers ( they just have to

create a key stream from an IV (also known as a nonce value) and a key.

195
Q

Google proposed ______ ___ – named as it has 20 rounds – as an
alternative to AES to be used with TLS connections

A

ChaCha20

196
Q

Mono- alphabetic substitution cipher that makes use of mapping plaintext characters to graphical characters rather than to alphabetic
ones. i.e. A=(pick a symbol), vs A=(pick a letter). Disadvantage: once the mapping is known, it is difficult to keep the message secret

A

Pigpen

197
Q

Employs a method to scramble text by writing it in a sequence across a number of rails.

A

Rail code

198
Q

Makes use of a grid and which maps the letters into numeric values

A

BFID

199
Q

5 × 5 matrix containing the alphabet less the letter J. Cipher/decipher process consists of a set of rules outlining use of column and row
combinations.

A

Playfair

200
Q

Polyalphabetic cipher that involves using a different mapping, based on a keyword, for each character of the cipher. An advantage of
this type of cipher is that the same plaintext character is likely to be coded to different mappings, depending on the position of the
keyword, making guessing more difficult

A

Vigenere

201
Q

Cipher code mapping that is used only once. Advantage is it is essentially unbreakable, disadvantage is it takes lots of work as you’d
have to generate the pad to be used, each time

A

One Time Pad

202
Q

Uses four 5 × 5 matrices arranged in a square, are where each matrix contains 25 letters for encoding and decoding operations

A

Four-square cipher

203
Q

Used a polyalphabetic substitution cipher, which did not repeat within a reasonable time period, along with a secret key. For the
cracking of the Enigma cipher, the challenge was thus to determine both the algorithm used and the key. Enigma’s main weakness,
though, was that none of the plain text letters could be ciphered as itself

A

Enigma Machine

204
Q

DES: Rounds?

A

16

205
Q

DES: Key Size?

A

56

206
Q

3DES Key size?

A

112

207
Q

3DES rounds?

A

48

208
Q

IDEA KEY SIZE

A

128

209
Q

MD4 HASH VALUE

A

128

210
Q

MD5 HASH VALUE

A

128

211
Q

SHA-1 HAS VALUE

A

160

212
Q

Partially homomorphic crypto system that leverages prime number characteristics, 1024-4096
bits variable key size, 1 round

A

RSA

213
Q

Partially homomorphic crypto system that leverages prime number characteristics, 1024-4096
bits variable key size, 1 round

A

ECC

214
Q

Federal Information Processing Standard (FIPS 186) for digital signatures, based on the
mathematical concept of modular exponentiation and the discrete logarithm problem

A

DSA

215
Q

PRESENT BLOCK SIZE

A

64

216
Q

PRESENT KEY SIZE

A

80 OR 128

217
Q

PRESENT ROUNDS

A

32

218
Q

Relatively small key and block sizes. Uses an SPN
(substitution permutation network) method. One of the
1st considered as an AES replacement for use in lightweight implementations.

A

PRESENT

219
Q

XTEA BLOCK SIZE

A

64

220
Q

SIMON LBOCK SIZE

A

32,48,64,96,128

221
Q

(Light weight)Variable block sizes key sizes, and rounds. Optimized for
hardware implementations

A

SIMON

222
Q

CLEFIA BLOCK SIZE

A

128

223
Q

Rabbit key size

A

128

224
Q

mickey v2 key size

A

80

225
Q

trivium key size

A

80

226
Q

(lightweight) Grain key size

A

80

227
Q

(lightweight) enocoro key size

A

128

228
Q

Rabbit IV size

A

64

229
Q

Mickey v2 IV size

A

Variable up to 80

230
Q

Trivium IV size

A

80

231
Q

Enocoro IV size

A

64

232
Q

Lightweight Hashing- Quark Hash value

A

64 or 112

233
Q

Light-weight cryptography method for signing messages (MAC).
Relatively undemanding hardware implementation (only ~3,333
gates required at 1MHz clock rate) making it suitable for IoT
implementation. 128 bit key.

A

Chaskey

234
Q

Light-Weight public key solution. Short for “Elliptic Light”. Uses Elliptic
Curves along with a Diffie-Hellman related handshake between the RFID
tag and the RFID reader in RFID implementations

A

Elli

235
Q

Which lightweight symmetric encryption method operates on a 64-bit block using rounds of substitution boxes (S-boxes) and permutation boxes (P-boxes)?

A

PRESENT

236
Q

shuffles the input bits around to provide diffusion

A

p-box