Domain 3. Sec Architecture and Engineering - Algorithms Flashcards

1
Q

DES

A

Symmetric

64 bit cipher block size and 56 bit key
with 8 bits parity.
* 16 rounds of transposition and
substitution
(ECB, CBC, CFB, OFB, CTR)

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

AES

A

Symmetric Block cipher.

Use 3 different bit size keys 128, 192, 256
Examples Bitlocker, Microsoft EFS
Fast, secure 10,12, and 14
transformation rounds

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

3DES

A

Symmetric

DES x3, 56 bit keys not 64 bit

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

IDEA

A

Symmetric

128 bit key

64 bit cipher blocks
each block divide to 16 smaller
blocks
Each block undergo 8 rounds of
transformation
Example PGP

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

SkipJack

A

Symmetric

Uses Key Escrow

80 bit

64 bit cipher block

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

Blowfish

A

Symmetric

32 bit to 448 bit key

64 bit block cipher

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

TwoFish

A

Symmetric

128, 192, 256 bit key options

128 bit block

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

RC4

A

Symmetric Stream cipher

40-2048 key size.

Example SSL and WEP
* Stream cipher
* 256 Rounds of transformation

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

RC5

A

Symmetric Block cipher

2048 bit key

255 rounds transformation
* 32, 64 & 128 bit block sizes

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

CAST

A

Symmetric

Keys: CAST 128(40 to 128 bit)
CAST 256 (128 to 256 bit)

64 bit block 12 transformation rounds
128 bit block 48 rounds
transformation

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

Diffie-Hellman

A

Technically Asymmetric.

No confidentiality, authentication, or
non-repudiation
* Secure key transfer

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

RSA

A

Asymmetric

4096 bit key

  • Public key and one-way function for
    encryption and digital signature
    verification
  • Private key and one-way function for
    decryption and digital signature
    generation
  • Used for encryption, key exchange and dig. signatures.
How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

El-Gamal

A

Asymmetric

Used for encryption, key exchange
and digital signatures
* Slower

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

Elliptic Curve Cryptosystem

A

Used for encryption, key exchange
and digital signatures
* Speed and efficiency and better
security

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

MD5

A

Hash

It is one of the most popular hashing algorithms.MD5 produces a 128-bit digest. Messages are processed in 512-bit blocks, using four rounds of transformation. The resulting hash is typically represented as a 32-digit hexadecimal number. MD5 is susceptible to collision.

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

MD6

A

Hash

It uses very large input message blocks (up to 512 bytes) and produces variable-length digests (up to 512 bits).

17
Q

SHA1

A

Hash

Published in 1995, it takes a variable size input (message) and produces a fixed-size output (160-bit message digest, versus MD5’s 128-bit message digest). SHA-1 processes messages in 512-bit blocks and adds padding to a message length, if necessary, to produce a total message length that’s a multiple of 512. This algorithm is not stable, so it is recommended not to use it.

18
Q

SHA2

A

Hash

Published in 2001, it consists of four hash functions — SHA-224, SHA-256, SHA-384, and SHA-512 — that have digest lengths of 224, 256, 384, and 512 bits, respectively. SHA-2 processes messages in 512-bit blocks for the 224, 256, and 384 variants, and 1,024-bit blocks for SHA-512.

19
Q

SHA3

A

Hash

Published in 2015, SHA-3 includes SHA3-224, SHA3-256, SHA3-384, and SHA3-512, which produce digests of 224, 256, 384, and 512 bits, respectively. SHAKE128 and SHAKE256 are also variants of SHA3.

20
Q

Do SSL and TLS both us Asymmetric AND symmetric encryption?

A

Yes- Assymmetric Encryption is used to pass a shared key across, then the session shifts to symmetric encryption.

21
Q

Homomorphic encryption

A

A unique type of encryption which supports the ability to perform computations on its encrypted data fields WITHOUT decrypting it first. When the resulting output is decrypted, it will yield accurate computational results that are identical to what would’ve been obtained if the same computations had been performed on the unencrypted data.

22
Q

What is cryptographic Confusion?

A

Confusion is introduced using Substitution. Confusion means each bit of the ciphertext depends on multiple parts of the key. This obscures the connections between the two and decreases the likelihood it can be reversed.

23
Q

Cryptographic Diffusion

A

Diffusion is introduced using Transposition. Diffusion means that if a single change in the plaintext occurs, multiple ciphertext changes will also occur. Transposition is the rearrangement of data.

24
Q

Key Escrow

A

When multiple parties each have part of the key, OR when one impartial third party has the key.

25
Q

Transposition cipher

A

Re-arranges EXISTING text to create the ciphertext.

Vulnerable to character frequency analysis.

26
Q

Is a one-time pad considered a type of stream cipher?

A

Yes, most of the time.

CISSP Certified Information Systems Security Professional Official Study Guide, 9th Edition. Pg 234-236, 237.

27
Q

A Block cipher breaks down the message into blocks of _____?

A

Bits. I.e. RC5 can break down encryption into 32, 64, or 128 bit blocks.

28
Q

Merkle-Hellman Knapsack

A

Yes, this is actually an algorithm.

Now considered insecure.

29
Q

Initialization vector

A

Picks an arbitrary point or piece of data to start the chain of encryption. Primarily used to prevent patterns from being observed in ciphertext.

30
Q

Does Elliptic Curve Cryptography use prime number factoring?

A

No.