Domain 3 - Cryptographic concepts | Crypto Attacks | PKI Infrastructure Flashcards

1
Q

Symmetric Encryption - Strengths

A

Speed, and strength per bit of key

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

Symmetric Encryption - Weakness

A

Key must be shared securely

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

Symmetric Encryption - Stream Cipher

A

Each bit is independently encrypted

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

Symmetric Encryption - Block cipher

A

Blocks of data are encrypted

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

Initialization Vector

A

Symmetric EncryptionEncryption step. Used on Symmetric ciphers to ensure that the first block of data is random

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

DES Encryption type

A

Symmetric

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

DES

A

Data Encryption Standard

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

DES Encryption dates

A

1976 US Fed standard

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

DES Encryption, who designed

A

IBM, based on older lucifer symmetric cipher

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

DES Encryption, block size

A

64 bit

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

DES Encryption, key size

A

56 bit

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

DES Modes

A

5 modes

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

Double DES

A

The DES encryption algorithm with two rounds, with two keys. Rendered unusable due to being susceptible to meet in the middle attacks.

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

Triple DES

A

Expands the size of the key by running the algorithm in succession with three different keys. It makes 48 passes through the algorithm, and the resulting key is 168 bits.

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

IDEA Encryption/Cipher Type

A

International Data Encryption Algorithm.Symmetric Block Cipher

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

IDEA - good or bad?

A

Held up to cryptanalysis

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

IDEA - drawback

A

Patent encumbrance (no longer an issue, not sure if tested as an issue or not) and slow speed

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

AES Acroynym and encryption type

A

Advanced Encryption Standard - Symmetric

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

AES Block and Key Size

A

128 bit block

Key - 128 bit to 256 bit.

128 with 10 rounds of encryption192 bit with 12 rounds of encryption 256 bit with 14 rounds of encryption

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

Blowfish cipher type

A

symmetric

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

RC5 and RC6 designed by

A

RSA Labs

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

Asymmetric Encryption Pros

A

Solves issues around preshared keys

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

Asymmetric key how many

A

two. Public/private key pair

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

hashing/one-way functions

A

easy to compute one way. VERY difficult to reverse

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

Asymmetric, factoring prime numbers. factorization.

A

Relies on strength of composite number. Example: 6269 x 7883 = 49418527.To crack, you must factor 49418527 to find which two prime numbers are factors.

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

Discrete logarithm

A

Basis of the Diffie-hellman and El Gamal asymmetric algs

Uses in Asymmetric algorithms. Way to ensure encryption.

More advanced than factorization and considered more secure.

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

Diffie-Hellman Key agreement protocol, and encryption type.

A

Asymmetric encryption algorithm.

Allows two parties to securely agree on a symmetric key via a public channel

Type of key exchange that is secure. If an attacker sniffs the whole conversation, they still can’t obtain the key.

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

Elliptic Curve Cryptography

A

Type of encryption. Uses discrete logarithms. Asymmetric encryption.

Stronger than factorization based encryption methods. Uses less computational power, and smaller key for equal strength.

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

Asymmetric and Symmetric tradeoffs

A

Asymmetric - slower, weaker on equal sized keys. Pro no need for preshared key

Both types are often used together Symmetric - faster, weak due to pre-shared keys.

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

Hash Functions

A

Encryption using algorithm, does not have a key. One Way. Impossible to reverse. Variable length plaintext is hashed into a fixed length hash

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

Collisions

A

This is what happens if two separate, and non-identical inputs to a hash algorithm result in identical hashes.

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

MD5 Acronym and type

A

Message Digest 5, hashing algorithm.

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

SHA-1 Acronym and type

A

Secure Hash Algorithm, hash

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

SHA2-224/SHA3-224SHA2-256/SHA3-256SHA2-384/SHA3-384SHA2-512/SHA3-512 lengths

A

Length of hash value is in the name.

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

HAVAL acronym and type

A

Hash of variable length. Hash

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

Brute force

A

attempts every possible valid combination for a key or password.

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

Known Plaintext

A

In the known plaintext attack, the attacker has a copy of the encrypted message along with the plaintext message used to generate the ciphertext (the copy).

If I know an input and output. I can potentially guess a key.

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

Chosen Plaintext and adaptive chosen plaintext

A

In this attack, the attacker obtains the ciphertexts corresponding to a set of plaintexts of their own choosing. This allows the attacker to attempt to derive the key used and thus decrypt other messages encrypted with that key.

analyst chooses plaintext to be encrypted.Analyst then changes further rounds of encryption based on previous round

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

Chosen Ciphertext

A

In a chosen ciphertext attack, the attacker has the ability to decrypt chosen portions of the ciphertext message and use the decrypted portion of the message to discover the key.

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

meet in the middle attack

A

Used to attack algorithms that use only two rounds of encryption.

the attacker uses a known plaintext message. They then encrypt using all possible keys, and decrypt using all possible keys. In this way they can find all possible key pairs, AND all possible cipher texts for the plaintext.

Only takes twice as long as breaking a single round of encryption.

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

Known Key

A

Analyst knows something about the key, and can use that to reduce efforts used to attack it.

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

Side Channel Attacks

A

Use physical data to break cryptosystem. Monitoring CPU cycles or power consumption used while encrypting/decrypting.

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

Birthday Attack

A

Create hash collisions and break the key

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

Key clustering

A

When two different symmetric keys run on same plaintext and algorithm produce same ciphertext.

Analogous to collisions in hashing, but in relation to symmetric encryption.

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

Digital signatures

A

Method of authentication and non-repudiation.

Process:

  1. Sender hashes their message, and appends hash to email
  2. Sender then encrypts entire email using their private key.
  3. Receiver decrypts message using public key (they now know the sender is authentic - only the sender could have encrypted).
  4. Receiver then hashes the message on their own - if the hash is the same as appended to the email they know that integrity has been preserved.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
46
Q

HMAC Acronym and length

A

Hash Message Authentication Code - Variable length hash value

Used to implement a partial digitial signature. Combines hashing and symmetric encryption (full digital signature uses asymmetric).

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

PKI Public Key Infrastructure Process of key exchange.

A

leverages all three forms of encryption. Symmetric, asymmetric, and hashing.

  1. Certificate requestor opens an asymmetric channel w/server to verify identity, and to share symmetric key.
  2. server accept asymmetric channel. Agree on an ephemeral key.
  3. Server hashes and encrypt the certificate.
  4. Recipient decrpypts cert, and checks hash for integrity.
  5. Recipient checks certificate against the CA.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
48
Q

Cert Authorities

A

Digitals certs are signed by CAs. They authenticate identity of orgs before issuing a certsMay be private, or public

49
Q

Cert Revocation lists

A

Lists revoked certs. Maintained by CAs

50
Q

IPSec

A

Suite of protocols to provide cryptographic IPV4 and v6. Used to build VPNs

51
Q

IPSec primary components of SA’s

A

Security Associations:

AH - Authentication Header
ESP - Encapsulating Security Payload

52
Q

ISAKMP

A

Sub component of IKE. Used to organize and manage the encryption keys that have been generated and exchanged by OAKLYEY AND SKEME. Manages SAs.

53
Q

IKE

A

Mechanism of IPsec that manages cryptography keys. Internet key exchange.

IKE Consists of three elements. OAKLEY, SKEME, AND ISAKMP.

54
Q

AH

A

Authentication header provides authentication and integrity for each packet of net data. NO CONFIDENTIALITY

55
Q

ESP

A

provides confidentiality and integrity by encrypting packet data. Does not provide strong authentication.

56
Q

IPSec Security Association (ISAKMP)

A

Security Associations are managed by ISAKMP.

Each SA is a one way/simplex connection used to negotiate ESP or AH Parameters. Each side of the IPSec session transmits and receives using different keys. So, this results in up to 4 SAs in use for a two way communication. Each side has a SA for outgoing and incoming traffic.

57
Q

SA Identification index

A

Identifies the SA. 32 bits

58
Q

ESP Tunnel mode

A

Encrypts everything

59
Q

ESP Transport mode

A

only encrypts data, not IP headers. May use AH to authenticate the un-encrypted headers.

60
Q

IKE vs ISAKMP

A

IKE - Encryption algorithm negotiation protocol. Allows both sided to select and agree upon the best encryption that both sides support.ISAKMP - Manages Security Associations.

61
Q

IKE

A

Another way to manage key exchanges. Both sides will use IKE to negotiate fastest and highest sec level.

62
Q

SSL and TLS

A

TSL succeeds SSL. Commonly used for HTTPS. Encrypted out of the gate. Uses Asymmetric encryption to exchange a key, for a subsequent symmetrically encrypted data session.

63
Q

PGP

A

pretty good privacy.

64
Q

PGP year

A

1991

65
Q

PGP

A

uses web-of-trust instead of cert authority.

66
Q

S/MIME

A

Email encryption and authentication

67
Q

Escrowed Encryption

A

splits private key into two or more parts. Will only release their part of the key on a court order.

68
Q

Clipper Chip

A

Name of tech used in the Escrowed Encryption Standard. Allows backdoor to govt while encrypting voice.

69
Q

Steganography

A

Science of hidden communication. Hiding information into other media.

70
Q

Digital watermaks

A

encode data in a file. Watermark is probably hidden

71
Q

Mantrap

A

Two doors requireing separate authentication to open

72
Q

Bollard

A

Post designed to stop a car

73
Q

Smart card

A

physical access card containing integrated circuit

74
Q

tailgating

A

following an auth person into building w/o providing creds

75
Q

Perimeter defenses

A

fence doors, walls, locks

76
Q

Class 1 gate

A

residential

77
Q

class 2 gate

A

Commercial, general access

78
Q

Class 3 gate

A

industrial limited access - loading dock for 18 wheeler

79
Q

Class 4 gate

A

restricted access. Prison or airport

80
Q

Lights

A

detective and/or deterrant

81
Q

vigenere cipher

A
  • Vigenère ciphero Polyalphabetico Repeated 26 times to form a matrix
82
Q

Jefferson disks

A

o Tommy Jo 36 wooden disks

83
Q

Caesar cipher

A
  • Caesar ciphero Monoalphabetico Simple substitutiono Rotated 3 times
84
Q

book cipher and running key cipher

A
  • Book cipher and running key ciphero Use well known texts as the basis for keys
85
Q

Codebooks

A

assign codeword for important people/locations/terms

86
Q

one time pad

A

o one time pad uses identical paird pads one page is used to encrypte same page to decrypt pages are then discarded, never reused only one mathematically proven to be secure

87
Q

project VERONA

A

o Broke KGB encryption in 1940s o KGB used one time padso KGB violated one of the three rules thougho Reused pads.

88
Q

Hebern Machines and PURPLE

A

o Class of cryptographic deviceso Large manual typewriter looking devices electrified with rotorso Used through WWII

89
Q

ENIGMA

A

doi

90
Q

SIGABA

A

o Rotor machine used by US through 1950so More complex and covered weaknesses of the Enigmao Large complex and heavyo Never known to be broken

91
Q

PURPLE

A

japanese version of enigma

92
Q

COCOM

A

o Coordinating comeittee for multilateral export controls Designed to control export of critical technologies to iron curtain countries

93
Q

Wassenaar arrangement

A

o After COCOM endedo Created in 1996o Many iron curtain countries includedo Relaxed restriction on exporting cryptography.

94
Q

DEA

A

Data Encryption Algorithm described by DES (Data Encryption Standard)

95
Q

PKI standard

A

X.509

96
Q

CAs and ORAs

A

Certificate Authority (Issues Certs)Organizational Registration Authority (authenticates client certs)

97
Q

OCSP

A

Online Certificate Status Protocol - Replacement for CRL (Cert Revocation Lists). Scales beeter than CRL

98
Q

CRL

A

Certificate Revocation Lists

99
Q

PGP encryption type

A

Symmetric

100
Q

RC4, RC5, RC6 encryption type

A

Symmetric

101
Q

Rijndael Encryption type

A

Symmetric

102
Q

Skipjack Encryption Type

A

Symmetric

103
Q

CAST-128 Encryption type

A

Symmetric

104
Q

CAST-256 Encryption type

A

Symmetric

105
Q
RIPEMD-128
RIPEMD-160
RIPEMD-256
RIPEMD-320
Type and key length
A

Hashing algorithms. Key length is in the name.

106
Q

RSA Type

A

Asymmetric. Used for encrypting and signing data.

107
Q

ElGamal type

A

Asymmetrc. Used for transmitting digital signatures, and key exchanges.

108
Q

IDEA and PGP relationship

A

PGP (pretty good privacy) uses IDEA (international data encryption algorithm) for symmetric encryption.

109
Q

Work function/work factor

A

Way to measure the strength of a cryptography system. Measures the effort in terms of time and/or cost of brute forcing a crypto system.

110
Q

one-time pad/Vernam cipher

A

Uses a different substitution alphabet for each letter of the plaintext message.

111
Q

Implementation Attack

A

exploits weaknesses in the implementation of a cryptography system. It focuses on exploiting the software code, not just errors and flaws but the methodology employed to program the encryption system

112
Q

Statistical Attack

A

A statistical attack exploits statistical weaknesses in a cryptosystem, such as floating-point errors and inability to produce truly random numbers. Statistical attacks attempt to find a vulnerability in the hardware or operating system hosting the cryptography application.

113
Q

Fault Injection Attack

A

the attacker attempts to compromise the integrity of a cryptographic device by causing some type of external fault. For example, they might use high-voltage electricity, high or low temperature, or other factors to cause a malfunction that undermines the security of the device.

114
Q

Side-Channel Attack

A

Computer systems generate characteristic footprints of activity, such as changes in processor utilization, power consumption, or electromagnetic radiation. Side-channel attacks seek to use this information to monitor system activity and retrieve information that is actively being encrypted.

115
Q

Timing Attack

A

Timing attacks are an example of a side-channel attack where the attacker measures precisely how long cryptographic operations take to complete, gaining information about the cryptographic process that may be used to undermine its security.

116
Q

Man in the middle

A

a malicious individual sits between two communicating parties and intercepts all communications. They set up two separate encrypted sessions, posing as the legitimate endpoints. Can then see all communications.

117
Q

Birthday Attack

A

a malicious individual sits between two communicating parties and intercepts all communications

118
Q

Replay attack

A

The replay attack is used against cryptographic algorithms that don’t incorporate temporal protections. In this attack, the malicious individual intercepts an encrypted message between two parties (often a request for authentication) and then later “replays” the captured message to open a new session