Cissp Flash Cards

Front 1

What OSI layer is Serial Communication Between Nodes

Back 1

Data Link Layer

Front 2

What OSI layer is End-to-End Service

Back 2

Transport Layer

Front 3

What OSI layer is Logical Persistent Connection Between Hosts

Back 3

Session Layer

Front 4

What OSI layer does Routing and Switching take place?

Back 4

Network Layer

Front 5

No Write DOWN/No read UP/Nothing Higher, Nothing Lower

Back 5

Bell-LaPadula

Front 6

No Write UP/No read DOWN/Dirty data should not mix with clean data

Back 6

Biba

Front 7

Access Triple (user, TP, CDI)/separation of duties

Back 7

Clark-Wilson

Front 8

What is the science of codes

Back 8

Cryptography

Front 9

What is the science of breaking codes

Back 9

Cryptanalysis

Front 10

Estimate of time needed to break a protective measure

Back 10

Work Factor

Front 11

What is the individual application of encryption to data on each link of a network

Back 11

Link encryption

Front 12

What is encryption of data from source system to end system

Back 12

End-to-end encryption

Front 13

What is called when each block is encrypted separately with DES

Back 13

Block code cipher

Front 14

What is called when a message is broken into characters or bits and enciphered with a key stream using XOR

Back 14

Stream cipher

Front 15

What are contained within the Process of establishing a session key

Back 15

Key Exchange, Negotiation, or Distribution

Front 16

What is a Private/Secret Key

Back 16

Symmetric Key Cryptography

Front 17

What system uses Symmetric key for bulk data encryption
and Asymmetric key for key distribution?

Back 17

Hybrid Systems

Front 18

What cryptography system uses two keys?

Back 18

Asymmetric Key Cryptography

Front 19

What is 1,000 or more times faster than public key

Back 19

Symmetric Key Cryptography

Front 20

What is a shift alphabet or scramble alphabet that utilizes character substitution?

Back 20

Substitution cipher

Front 21

What cryptography system where the position of letters is permutated?

Back 21

Transposition cipher

Front 22

What is one of the weaknesses of Symmetric Key cryptography?

Back 22

Key Management because it requires secure key distribution

Front 23

What cryptography system uses multiple substitution ciphers with different alphabets to defeat frequency analysis?

Back 23

Polyalphabetic cipher

Front 24

What cryptography system uses written text from a source, such as a book, to encrypt the plaintext – key is known to sender and receiver – page, line, and character number

Back 24

Running key cipher

Front 25

What crytography system is a key that is a random set of non-repeating characters and each key bit is used only once and each key bit is XORed with a message bit to produce a ciphertext?

Back 25

One time pad

Front 26

What is data hidden in a picture files (least significant bits of bitmap image), sound files and slack space on disks?

Back 26

Steganography

Front 27

What is a block cipher — symmetric key —56 bit key, plus 8 parity bits — 16 rounds of transpositions and substitutions
list of codes or phrases and their corresponding code group

Back 27

DES

Front 28

What is 64-bit data blocks processed at one time — same message and key produce same ciphertext

Back 28

Electronic Code Book (ECB)

Front 29

What is called when the first 64-bit plaintext block is XORed with an initializing vector and processed with key to produce ciphertext which is then XORed with second 64-bit plaintext block to produce second ciphertext block

Back 29

Cipher Block Chaining (CBC)

Front 30

What is called when the first 64-bit plaintext block is XORed with the key-ciphered initialization vector to produce the ciphertext – this ciphertext is encrypted with key and XORed with second 64-bit plaintext block to product second ciphertext block

Back 30

Cipher Feedback (CFB)

Front 31

What is similar to CFB except the XORed bits are not a function of either the plaintext of the ciphertext – initialization vector is used to seed the process – IV is DES encrypted and XORed with first data block to produce first ciphertext – the DES encrypted IV is DES encrypted again for the second block

Back 31

Output Feedback (OFB)

Front 32

What is a block cipher — symmetric key — 112 bit key and no more secure than DES

Back 32

Double DES

Front 33

What is a block cipher — symmetric key — 168 bit key with different modes:

a. 3 DES encryptions with 3 different keys

b. Encrypt – decrypt – encrypt with three different keys

Back 33

Triple DES

Front 34

What is a block cipher — symmetric — 128-bit key — 8 rounds of transpositions and substitutions — three mathematical functions:

XOR, Addition mod 65536, and Multiplication mod 65537

Back 34

International Data Encryption Algorithm (IDEA)

Front 35

What is a variable block size — symmetric — variable key size — data dependent rotations — variable number of rounds and used primarily software implementation

Back 35

Rivest Cipher 5 (RC5)

Front 36

What is based on the Rijndael Block Cipher — symmetric — variable block and key length
(128, 192, 256)

Back 36

Advanced Encryption Standard (AES)

Front 37

What is it called when a message uses asymmetric crypto where the sender encodes a message with a receiver's public key and the receiver decodes it with their private key and

Back 37

Secure Message

Front 38

What does a Secure Message Provide:

Confidentiality
Integrity
Availability
Authentication
Non-repudiation

Back 38

Confidentiality

Front 39

What is it called when a message uses asymmetric crypto and the sender encodes message with sender’s private key and receiver decodes with sender’s public key.

Back 39

Open Message

Front 40

What does a Open Message Provide:

Confidentiality
Integrity
Availability
Authentication
Non-repudiation

Back 40

Authentication
Non-repudiation

Front 41

What cryptosystem is asymmetric — factoring large prime integers — services:

encryption, key distribution of symmetric keys, and digital signatures — 512-bit and 768-bit keys are weak, but 1024-bit key is moderately secure

Back 41

RSA: (Rivest, Shamir, and Adleman)

Front 42

What cryptosystem is asymmetric — based on mathematical problem of factors that are coordinate pairs that fall on an elliptical curve — services: encryption, key distribution of symmetric keys, and digital signatures — highest strength per bit of public key systems

Back 42

Elliptical Curve Cryptosystem (ECC)

Front 43

What cryptosystem was the first public key algorithm where the patent expired in 1997 that provided key exchange algorithm

Back 43

Diffie-Hellman

Front 44

What is a asymmetric — based on difficulty in calculating discrete logarithms in a finite field — services: encryption and digital signatures

Back 44

El Gamal

Front 45

What is a asymmetric — based on subset of sum problem in combinatorics — has been broken Q. Time stamps can be used to prevent replay attacks R. Elliptic curve – best bandwidth, computation, and storage — Wireless S. Key escrow: Clipper chip with Skipjack algorithm (80 bit key, 64 bit block) — Key split in two and held by to escrows

Back 45

Merkle-Hellman Knapsack

Front 46

What is used to detect unauthorized modifications and authenticate sender — provides non-repudiation — private key signs and public key verifies — used to authenticate software, data images, users, machines Steps: 1. Compute message digest 2. Digest is fed into digital signature algorithm with sender’s private key to generate digital signature 3. Message and attached digital signature sent to recipient

Back 46

Digital Signature

Front 47

What is based on the Digital Signature Standard (DSS) — uses secure hash algorithm (SHA-1) and condenses message to 160 bits — Key size 512 to 1024

Back 47

Digital Signature Algorithm (DSA)

Front 48

What:
1. Condenses arbitrary length messages to fixed length – usually for subsequent signing by a digital signature algorithm

2. Output is message digest, Two files cannot have same hash, Can’t create file from hash

3. MD5 – 128 bit digest of input message, uses blocks of 512, 4 rounds of transformation 4. SHA-1 (by NIST) — SHA-256, SHA-384, SHA-512 supports AES — HAVAL 5. HMAC — hashed MAC more secure and more rapid message digest

Back 48

Hash Function

Front 49

What is used when sender only wants one person to be able to view the hash value – the value is encrypted with a symmetric key — similar to a CRC — weak form of authentication X. Clustering: plaintext message generates identical ciphertext using the same transformation algorithm, but with different keys (cryptovariables)

Back 49

Message Authentication Code (MAC)

Front 50

What binds public key to a person, provides a Certificate revocation list and the X.509 provides format for digital certificates

Back 50

Certificate Authority (CA)

Front 51

What was proposed by IETF to comply with Public Key Cryptography Standards (PKCS) developed by Microsoft, Novell and Sun — Uses MD2/MD5 for message digest, DES-CBC or triple DES-EDE for text encryption and RSA for digital signature and key distribution — certificates based on X.509 1. Privacy, message integrity, authentication and non-repudiation

Back 51

Privacy Enhanced E-mail (PEM)

Front 52

1. Privacy, integrity, identification authentication, and policy enforcement 2. Symmetric encryption — 3DES, DES, IDEA 3. RSA, DSS, and Diffie-Hellman for the symmetric key exchange 4. SHA-1 and MD5 for hashing 5. Web of trust instead of CA BB. Attacks on Symmetric Block Ciphers 1. Differential Cryptanalysis — private key cryptography — looks at ciphertext pairs with specific differences and analyzes the effects of these differences 2. Linear Cryptanalysis — uses known plaintext and corresponding ciphertext to generate a linear approximation of a portion of the key 3. Differential Linear Cryptanalysis — combination of both 4. Algebraic Attacks — relies on block ciphers displaying high degree of mathematical structure

Back 52

Pretty Good Privacy (PGP)

Front 53

What is used to detect unauthorized modifications and authenticate sender — provides non-repudiation — private key signs and public key verifies — used to authenticate software, data images, users, machines Steps: 1. Compute message digest 2. Digest is fed into digital signature algorithm with sender’s private key to generate digital signature 3. Message and attached digital signature sent to recipient

Back 53

Digital Signature

Front 54

What is based on the Digital Signature Standard (DSS) — uses secure hash algorithm (SHA-1) and condenses message to 160 bits — Key size 512 to 1024

Back 54

Digital Signature Algorithm (DSA)

Front 55

What:
1. Condenses arbitrary length messages to fixed length – usually for subsequent signing by a digital signature algorithm

2. Output is message digest, Two files cannot have same hash, Can’t create file from hash

3. MD5 – 128 bit digest of input message, uses blocks of 512, 4 rounds of transformation 4. SHA-1 (by NIST) — SHA-256, SHA-384, SHA-512 supports AES — HAVAL 5. HMAC — hashed MAC more secure and more rapid message digest

Back 55

Hash Function

Front 56

What is used when sender only wants one person to be able to view the hash value – the value is encrypted with a symmetric key — similar to a CRC — weak form of authentication X. Clustering: plaintext message generates identical ciphertext using the same transformation algorithm, but with different keys (cryptovariables)

Back 56

Message Authentication Code (MAC)

Front 57

What binds public key to a person, provides a Certificate revocation list and the X.509 provides format for digital certificates

Back 57

Certificate Authority (CA)

Front 58

What was proposed by IETF to comply with Public Key Cryptography Standards (PKCS) developed by Microsoft, Novell and Sun — Uses MD2/MD5 for message digest, DES-CBC or triple DES-EDE for text encryption and RSA for digital signature and key distribution — certificates based on X.509 1. Privacy, message integrity, authentication and non-repudiation

Back 58

Privacy Enhanced E-mail (PEM)

Front 59

What provides:
1. Privacy, integrity, identification authentication, and policy enforcement 2. Symmetric encryption — 3DES, DES, IDEA 3. RSA, DSS, and Diffie-Hellman for the symmetric key exchange 4. SHA-1 and MD5 for hashing 5. Web of trust instead of CA BB. Attacks on Symmetric Block Ciphers 1. Differential Cryptanalysis — private key cryptography — looks at ciphertext pairs with specific differences and analyzes the effects of these differences 2. Linear Cryptanalysis — uses known plaintext and corresponding ciphertext to generate a linear approximation of a portion of the key 3. Differential Linear Cryptanalysis — combination of both 4. Algebraic Attacks — relies on block ciphers displaying high degree of mathematical structure

Back 59

Pretty Good Privacy (PGP)