Brainscape's Knowledge GenomeTM

Browse over 1 million classes created by top students, professors, publishers, and experts.


See full index

C839 Cryptography > Module 2- Applications of Cryptography > Flashcards

Module 2- Applications of Cryptography Flashcards

1
Q

The same key is used to encrypt and decrypt the message, faster than asymmetric but have an issue with key exchange

A

Symmetric Key Cryptography

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

Modern cryptography began in 1949 when Claude Shannon published a paper about the Mathematical Theory of Communication. This idea improved cryptography.

A

Information Theory

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

Changes to one character in the plain text affect multiple characters in the cipher text, unlike in historical algorithms where each plain text character only affect one cipher text character.

A

Diffusion

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

Occurs by using a complex substitution algorithm. Attempts to make the relationship between the statistical frequencies of the cipher text and the key as complex as possible.

A

Confusion

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

A desirable effect where a change to one bit leads to large change in output. This is Fiestel’s take on Claude Shannon’s concept of diffusion. Fiestel’s ideas are important when discussing block ciphers.

A

Avalanche

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

A cryptosystem should be secure, even if everything about the system is publicly known.

A

Kerckhoff’s Principle

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

How symmetric algorithm encryption is expressed mathematically

A

C=E(k,p)

Cipher Text (C) is equal to the encryption function (E) with the key (k) and plain text (p) being passed as parameters to that function.

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

Changing some part of the plain text for some matching part of cipher text. Historical algorithms typically use this.

A

Substitution

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

Two things all modern block cipher algorithms use

A

Substitution and Transposition

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

Asks if there is a one in both the first and second number. Numbers are compared one digit at a time.

Example:
Number A 1101
Number B 0110
returns a result of
Number C 0100
A

Binary AND

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

Asks if there is a one in the first number, or the second, or in both numbers. Each place is compared one at a time.

Example:
Number A 1101
Number B 1001
returns a result of
Number C 1101
A

Binary OR

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

Important because it reversible. Asks if there is a 1 in one of the numbers but not both. Each place is compared one at a time. To reverse your result back with your second number and you will get the first number.

Example:
Number A 1101
Number B 0110
returns a result of
Number C 1011
A

Binary XOR (exclusive OR)

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

Two types of symmetric algorithms

A

Block Ciphers and Stream Ciphers

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

This is how the substitution portion of symmetric key cryptography is accomplished

A

XORing the plain text message with the key

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

This is how transposition is done in symmetric key cryptography

A

Swapping blocks of text

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

The same key is used to both encrypt and decrypt a message

A

single-key encryption

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

List of popular symmetric block cipher algorithms

A

The Feistel Network, DES, 3DES, AES, Blowfish, Serpent, Twofish, Skipjack, IDEA, CAST, TEA, SHARK

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

Larger Block sizes increase security, Larger key size increases security, if the round function is secure then more rounds increase security

A

Feistel Function

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

The algorithm(s) needed to encrypt and decrypt a message

A

Cipher

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

Random bits used to encrypt a message

A

Key

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

The mathematical process used to alter a message and make it unintelligible to any but the intended party

A

Algorithm

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

Named after a German physicist named Horst ***. Forms the basis for most block ciphers. Splits a block of plain text data into two parts (L0 and R0). Round function is applied to one half. Output of each round function is XORed with the other half.

A

The Feistel Function

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

Uses a modified structure where L0 and R0 are not equal lengths. This variation is used with the Skipjack algorithm.

A

Unbalanced Feistel Cipher

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

Was the premier block cipher for many years but is now considered outdated.

A

Data Encryption Standard (DES)

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

Was selected as the Federal Information Processing Standard (FIPS) for the U.S. in 1976

A

Data Encryption Standard (DES)

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

This is a Feistel Cipher with 16 rounds and a 48bit key for each round. To generate round keys a 56bit key is slit into two 28bit halves. This Feistel Cipher uses 8 s-boxes.

A

Data Encryption Standard (DES)

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

Interim replacement for DES. Performs DES three times with three different 56bit keys.

A

3DES

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

Variation of DES that uses a technique called Key Whitening. XORs a key with text before or after the round function or both.

A

DESx

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

Also known as Rijndael block cipher.

A

Advanced Encryption Standard (AES)

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

Chosen as a replacement for DES in 2001.

A

Advanced Encryption Standard (AES)

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

Advanced Encryption Standard (AES) key sizes and block size

A

128, 192, and 256. All three operate on a block size of 128 bits

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

Operates on a 4x4 column-major order matrix of bytes called the state.

A

Advanced Encryption Standard (AES)

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

Blowfish- who+when created/intended replacement for

A

1993 by Bruce Schneier/intended replacement for DES

34
Q

Blowfish type/block size/bit sizes

A

a 16 round Feistel working on 64bit blocks. Can have bit sizes 32bits to 448bits.

35
Q

BCrypt, CryptoDisk, DriveCrypt, Password Safe, Password Wallet, Backup for Workgroups, Crashplan

A

Some products Blowfish are used

36
Q

Serpent- type and created by

A

Symmetric key block cipher, created by Ross Anderson, Eli Biham, and Lars Knudsen

37
Q

Serpent- block size/key sizes/rounds

A

Block size of 128bits. Can have key sizes 128, 192, or 256bits. Uses 32 rounds working with a block of four 32bit words.

38
Q

Finalist to replace DES

A

Twofish

39
Q

Twofish designed by

A

Designed by Bruce Schneier, John Kelsey, Doug Whiting, David Wagner, Chris Hall, and Niels Ferguson.

40
Q

Twofish block and key sizes/type

A

Block size of 128bits and key sizes up to 256bits, it’s a Feistel cipher

41
Q

Developed by the NSA and was designed for the clipper chip, a chip with built in encryption.

A

Skipjack

42
Q

Decryption key was kept in escrow for law enforcement to decrypt the data without the owner’s cooperation, made this algorithm highly controversial.

A

Skipjack

43
Q

Skipjack block/key size/type

A

Uses an 80bit key to encrypt and decrypt 64bit data blocks. An unbalanced Feistel network with 32 rounds.

44
Q

International Data Encryption Algorithm (IDEA) block and key size/ type

A

A block cipher designed as a replacement for DES. 64bit blocks and a 128bit key. Uses a series of eight identical transformations.

45
Q

CAST-128 and CAST-256 type rounds/size/keysize

A

block cipher. There are two popular versions. The 128 version can use 12 or 16 rounds working on a 64bit block with key sizes ranging from 40bits to 128bits in 8 bit increments. This version is also used in some versions of PGP.

46
Q

A simple algorithm that is easy to implement in code, a Feistel Cipher that uses 64 rounds.

A

Tiny Encryption Algorithm (TEA)

47
Q

SHARK- block and size/rounds/type

A

Uses a 64bit block with a 128bit key in six rounds. Shares similarities with the Rijndael cipher such as the use of S-boxes.

48
Q

This is the most basic encryption mode. The message is divided into blocks and each block is encrypted separately.

A

Electronic Codebook (ECB)

49
Q

A weakness of this is that the same plain text always equals the same cipher text which gives the attacker a way to begin analyzing the cipher to derive the key.

A

Electronic Codebook (ECB)

50
Q

Each block of plaintext is XORed with the previous cipher text block before being encrypted. This creates significantly more randomness in the final cipher text.

A

Cipher-Block Chaining (CBC)- More secure than electronic codebook mode

51
Q

Designed to cause small changes in the cipher text to propagate indefinitely when decrypting, as well as encrypting, a variation of the CBC mode of operation, has not been published as a federal standard.

A

Propagating Cipher-Block Chaining (PCBC)

52
Q

In this mode the previous cipher text block is encrypted, the cipher text is XORed back with the plain text to produce the current cipher text block, essentially it loops back on itself increasing the randomness of the cipher text.

A

Cipher Feedback (CFB)

53
Q

Makes a block cipher into a synchronous stream cipher, generates keystream blocks, which are then XORed with the plain text blocks to get the cipher text.

A

Output Feedback (OFB)

54
Q

Used to turn a block cipher into a stream cipher, much like OFB mode. Generates the next keystream block by encrypting successive values of a “counter”. The counter can be any simple function that does not repeat for a long time.

A

Counter (CTR)

55
Q

Fixed size input to a cryptographic primitive that is random or pseudorandom. Called a ‘nonce’ if it is non-repeating and not truly random. Used along with a secret key for encryption.

A

Initialization Vector (IV)

56
Q

Encryption of the same plain text with the same key results in the same cipher text. Use of an IV that is XORed with the first block of plain text solves this problem.

A

ECB Mode

57
Q

Sometimes called a state cipher. Random key is XORed with stream of plain text.

A

Symmetric Stream Ciphers

58
Q

A stream of pseudorandom digits is generated independently. That stream is then combined with the plain text (encrypt) or the cipher text (decrypt).

A

Synchronous Stream Cipher

59
Q

Uses several of the previous N cipher text digits to compute the key stream.

A

Self-synchronizing Stream Cipher

60
Q

A Symmetric Stream Cipher created by Ron Rivest in 1987. Most widely used software stream cipher. Identically used for encryption and decryption, the data stream is simply XORed with the key.

A

RC4

61
Q

Uses a variable length key from 1 to 256 bytes.

A

RC4

62
Q

A symmetric Stream Cipher published by the German engineering firm Seimans in 1993. A software based stream cipher that uses a Lagged Fibonacci generator along with concepts borrowed from shrinking generator ciphers.

A

FISH

63
Q

Uses an H function that takes a variable size input (m) and returns a fixed size string.

A

Hash Function

64
Q

Can be expressed mathematically as h=H(m)

A

hash function

65
Q

You can’t undo it. It is also collision resistant

A

Hash Function

66
Q

Random bits that are used as one of the inputs to a hash. Complicates dictionary attacks.

A

Salt

67
Q

128bit hash specified by RFC1321.

A

MD5

68
Q

This hash is also not collision resistant. Recommended to use SHA-1 instead.
Breaks down message into 512 byte chunks, padded with 0s if needed to reach 512.
Length of the message is appended as the last 64bits.
Operates on a 128bit state, divided into 4 32bit words.
Four nonlinear function (F) rounds.

A

MD5

69
Q

This hash uses a Merkle Tree like structure to allow for immense parallel computation of hashes for very long inputs. Was submitted to the NIST SHA-3 competition. In 2009 Rivest stated that this hash is not ready to be a candidate for SHA-3 because of speed issues and other concerns.

A

MD6

70
Q

Most widely used hash algorithm.

A

Secure Hash Algorithm (SHA)

71
Q

A 160bit hash function that resembles earlier MD5 algorithm. Designed by the NSA to be part of the Digital Signature Algorithm.

A

SHA-1

72
Q

Two similar hash functions with different block sizes, known as SHA-256 and SHA-512. Uses 64 byte (512bit) words.

A

SHA-2

73
Q

A proposed hash function still in development. Will be given name in 2012 by NIST.

A

SHA-3

74
Q

This hash is in analysis phase and not in widespread use. Uses 512bit blocks and implements preset constants that change after each repetition. Each block is hashed into a 256bit block through four branches that divides each 512 block into sixteen 32bit words that are further encrypted and rearranged. Branches are used in parallel making it hard to analyze.

A

FORK-256

75
Q

RACE Integrity Primitives Evaluation Message Digest is a 160bit hash algorithm created by Hans Dobbertin, Antoon Bosselaers and Bart Preneel. Also has 128, 256, and 320bit versions which replace the original version because of collision issues. Doesn’t follow any standard security policies or guidelines.

A

RIPEMD-160

76
Q

Hash algortihm created by the Russians.

A

GOST

77
Q

Produces a fixed length output of 256bits. Input message is broken up into 256 bit blocks. If block is less than 256 bits then it is padded with 0s.

A

GOST

78
Q

192bit hash function created by Ross Anderson and Eli Biham in 1995.

A

Tiger

79
Q

Designed using the Merkle-Damgard construction (collision resistant hash functions). One way compression function operates on 64bit words, maintaining 3 words of state and processing 8 words of data. 24 rounds and 8 input words.

A

Tiger

80
Q

One uses a block cipher in in CBC mode to improve integrity. The other adds a key to a hash to improve integrity.

A

MAC and HMAC (Message Authentication Mode) and (Hash Message Authentication Mode)

C839 Cryptography (6 decks)

Brainscape helps you reach your goals faster, through stronger study habits.
© 2024 Bold Learning Solutions. Terms and Conditions