yuh

0.0(0)
Studied by 0 people
call kaiCall Kai
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
GameKnowt Play
Card Sorting

1/70

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 2:27 PM on 12/10/25
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

71 Terms

1
New cards

Why is Double DES insecure

It is vulnerable to the meet-in-the-middle attack, reducing its effective security to ~57 bits

2
New cards

What is the meet-in-the-middle attack?

An attack that compares all encryptions of the plaintext with all decryptions of the ciphertext to find a matching middle value

3
New cards

How does 3-key 3DES work?

It encrypts the plaintext using three keys using a sequence of encrypting, decrypting, and encrypting again, effectively creating a stronger encryption for DES

4
New cards

Effective key length of 3-key DES

168 bits

5
New cards

Main weakness of ECB

Patterns in plaintext remain in ciphertext. Not secure for multi-block data

6
New cards

How does Cipher Block Chaining work?

Plaintext block XOR previoous ciphertext block —> encrypt

7
New cards

What does Cipher FeedBack do?

Converts a block cipher into a stream cipher by feeding back ciphertext

8
New cards

Why is Output FeedBack good for noisy channels

No error propagation — errors do NOT affect future blocks

9
New cards

Why is Counter mode so widely used today?

It is parallelizable, fast, supports random access, and simple.

10
New cards

What is XTS-AES used for?

Encrypting data at rest on sector-based storage devices.

11
New cards

What special input does XTS-AES use?

A tweak, usually based on block position.

12
New cards

What is FPE

Encryption that keeps the same format and length as plaintext (e.g., credit card numbers stay 16 digits).

13
New cards

Why is FPE important

It allows encryption in legacy systems without changing database structure.

14
New cards

What structure do FPE algorithms like FF1/FF3 use

Feistel network

15
New cards

What are the two requirements for a random sequence?

Randomness (uniform + independent) and unpredictability.

16
New cards

What is the key difference between TRNG and PRNG?

TRNG → nondeterministic physical randomness.
PRNG → deterministic algorithm using a seed.

17
New cards

What is an entropy source

A nondeterministic physical process producing random bits (e.g., thermal noise, timing data).

18
New cards

Why do TRNGs use conditioning?

To remove bias and increase entropy rate.

19
New cards

Why must a PRNG seed be secure

If the seed is known, the attacker can reproduce the entire PRNG output.

20
New cards

What is forward unpredictability?

Next bit cannot be predicted without knowing the seed.

21
New cards

What is backward unpredictability?

Previous outputs cannot be used to recover the seed.

22
New cards

What does the Frequency Test check?

1s ≈ 0s (balanced distribution).

23
New cards

What does the Runs Test check?

Runs of identical bits occur as expected in random data.

24
New cards

What does Maurer's Universal Test detect?

Whether the sequence is too compressible → not random.

25
New cards

Which mode is recommended for cryptographic PRNGs?

CTR mode (NIST SP 800-90).

26
New cards

How does a stream cipher encrypt?

XOR plaintext with a pseudorandom keystream.

27
New cards

What must a secure stream cipher keystream have?

Large period + near-true randomness.

28
New cards

Why is RC4 no longer secure?

Key scheduling weaknesses + biased keystream → key recovery attacks.

29
New cards

What is the difference between LFSR and NFSR?

LFSR is linear; NFSR adds nonlinearity (more secure).

30
New cards

What components does Grain-128a use?

LFSR + NFSR + nonlinear filter, producing balanced, long-period keystream.

31
New cards

Purpose of the Repetition Count Test?

Detects if noise source becomes stuck on one value.

32
New cards

Purpose of Adaptive Proportion Test?

Detects entropy loss when a value occurs too frequently.

33
New cards

What problem does public-key cryptography primarily solve?

Key distribution + providing digital signatures.

34
New cards

What is the main difference between public-key and symmetric-key encryption?

Public-key uses two keys (public/private); symmetric uses one shared key.

35
New cards

36
New cards

What is the main difference between public-key and symmetric-key encryption?

Public-key uses two keys (public/private); symmetric uses one shared key.

37
New cards

What is a trap-door one-way function?

A function easy to compute forward but infeasible to reverse unless you know secret information (the trap-door).

38
New cards

What is RSA’s core security assumption?

The difficulty of factoring a large number n = p × q.

39
New cards

RSA encryption formula?

C = M^e mod n

40
New cards

RSA decryption formula?

M = C^d mod n

41
New cards

What are the RSA public and private keys?

Public key: (e, n)
Private key: (d, n)

42
New cards

What is φ(n) in RSA and how is it computed?

φ(n) = (p − 1)(q − 1)

43
New cards

What is OAEP used for in RSA?

To defend against chosen-ciphertext attacks (CCA).

44
New cards

What is a timing attack?

An attack that recovers the private key by measuring how long decryption operations take.

45
New cards

What is the purpose of Diffie–Hellman?

To securely exchange a shared secret key over an insecure channel.

46
New cards

What is DH security based on?

The difficulty of the discrete logarithm problem.

47
New cards

What is a major vulnerability of Diffie–Hellman?

Man-in-the-middle attacks due to lack of authentication.

48
New cards

What cryptographic assumption does ElGamal rely on?

The discrete logarithm problem.

49
New cards

Where is ElGamal commonly used?

Digital Signature Standard (DSS) and S/MIME.

50
New cards

What is the main advantage of ECC over RSA?

Equal security with much smaller key sizes, reducing computation.

51
New cards

What is the hard problem underlying ECC security?

The elliptic curve discrete logarithm problem (ECDLP).

52
New cards

What operation in ECC is equivalent to modular exponentiation in RSA?

Scalar multiplication (repeated point addition).

53
New cards

What are the two main types of elliptic curves used in crypto?

  • Prime curves (Zₚ) — best for software

  • Binary curves (GF(2ᵐ)) — best for hardware

54
New cards

Why can ECC use shorter keys than RSA?

ECDLP is much harder than integer factoring, so smaller keys provide strong security.

55
New cards

What is the ECC equivalent to a 3072-bit RSA key?

Approximately 256 bits.

56
New cards

What is the main purpose of a cryptographic hash function?

To provide data integrity by producing a fixed-size hash value from variable-length input.

57
New cards

What is the one-way property of a hash function?

It is computationally infeasible to find an input that maps to a given hash value (preimage resistance).

58
New cards

What is a collision in hash functions?

When two different inputs produce the same hash value.

59
New cards

What is a Message Authentication Code (MAC)?

A keyed hash function used between parties sharing a secret to authenticate messages.

60
New cards

How does a digital signature use hash functions?

The hash of a message is encrypted with the sender’s private key to create a signature.

61
New cards

What is the advantage of hashing passwords instead of storing them in plaintext?

It creates a one-way password file, increasing security if the database is compromised.

62
New cards

What three resistance properties define a secure hash function?

  • Preimage resistant

  • Second preimage resistant

  • Collision resistant

63
New cards

Which SHA version is considered insecure?

SHA-1

64
New cards

What family are SHA-256, SHA-384, and SHA-512 part of?

SHA-2

65
New cards

What structure does SHA-3 use?

The sponge construction, which absorbs input blocks and squeezes out the hash value.

66
New cards
67
New cards

What attack exploits the birthday paradox?

Collision attacks, where attackers search for two messages with the same hash output.

68
New cards

What is the block size of SHA-256?

512 bits

69
New cards

Why must hash functions for authentication be secure?

To prevent attackers from forging messages or signatures by finding collisions.

70
New cards

What is a pseudorandom function (PRF)?

A function that outputs apparently random values, sometimes built using hash functions.

71
New cards

What is cryptanalysis in the context of hash functions?

Attacks that exploit algorithm weaknesses rather than brute force.