FlashKeepers

CISSP · CISSP · Professional Certifications

CISSP Cryptography and PKI Deep Dive

Symmetric and asymmetric algorithms, hashing, digital signatures, and public key infrastructure concepts tested across CISSP domains, beyond the architecture overview deck.

About this set

41 basic cards for CISSP CISSP. It opens with "What are the block size and key size of DES?" and "How does 3DES strengthen DES?". More Professional Certifications decks are listed below.

41 cards · basic cards · AI-written, checked twice. Edit anything.

Study this set free Look inside first Get FlashKeepers for iPhone

Opens in your browser, no account. Get the iPhone and iPad app · Android app

What are the block size and key size of DES?
Show answer64-bit block size, 56-bit effective key size (64 bits with 8 parity bits)
How does 3DES strengthen DES?
Show answerApplies DES encryption three times using two or three different keys, creating effective key lengths of 112 or 168 bits
What are the block size and key size options for AES?
Show answer128-bit block size with key sizes of 128, 192, or 256 bits
How many rounds does AES-128 perform?
Show answer10 rounds
What is a major cryptographic weakness of RC4?
Show answerKeystream bias and weak initial bytes; certain plaintext patterns can leak information about the key
Which asymmetric algorithms base their security on the discrete logarithm problem?
Show answerDSA (Digital Signature Algorithm) and Diffie-Hellman
What is RSA based on?
Show answerThe mathematical difficulty of factoring large composite numbers into their prime factors
What mathematical problem does Elliptic Curve Cryptography (ECC) rely on?
Show answerThe elliptic curve discrete logarithm problem
What is the primary purpose of Diffie-Hellman?
Show answerTo allow two parties to securely establish a shared secret key over an insecure channel
What is the output size of SHA-256?
Show answer256 bits, or 32 bytes
Why is SHA-1 considered cryptographically broken?
Show answerPractical collision attacks have been published; collisions can be found in less than 2^63 operations instead of the theoretical 2^80
Why is MD5 unsuitable for digital signatures?
Show answerPractical collision attacks have been demonstrated; collisions can be computed in seconds on modern hardware
What is a hash collision?
Show answerTwo different inputs that produce the same hash output
What does HMAC add to a standard hash function?
Show answerA secret key, allowing the function to provide both message integrity and message authentication
What is preimage resistance in a cryptographic hash function?
Show answerIt is computationally infeasible to find any input that produces a specific hash output

26 more cards in the app

Study this set free