Applied Cryptography – Lecture 0x02

0.0(0)
studied byStudied by 0 people
learnLearn
examPractice Test
spaced repetitionSpaced Repetition
heart puzzleMatch
flashcardsFlashcards
Card Sorting

1/39

flashcard set

Earn XP

Description and Tags

Question-and-answer flashcards covering key terms, algorithms, attacks and concepts from the Applied Cryptography lecture.

Study Analytics
Name
Mastery
Learn
Test
Matching
Spaced

No study sessions yet.

40 Terms

1
New cards

What are the four primary goals of cryptography?

Confidentiality, Integrity, Authenticity, and Non-Repudiation.

2
New cards

What is the difference between cryptography, cryptology, and cryptanalysis?

Cryptography is the practical engineering of encryption systems, cryptology is the mathematical study of them, and cryptanalysis is the art of breaking them.

3
New cards

In symmetric encryption, what is shared between sender and receiver?

A single secret key used for both encryption and decryption.

4
New cards

Why is availability NOT considered a goal of cryptography?

Cryptography focuses on protecting data (confidentiality, integrity, authenticity, non-repudiation) rather than ensuring systems are reachable.

5
New cards

Explain Kerckhoffs’s principle in one sentence.

An encryption system should remain secure even if everything about it except the key is public knowledge.

6
New cards

What Boolean operation underlies many stream ciphers and demonstrates perfect reversibility?

The XOR (exclusive OR) operation.

7
New cards

State two critical requirements for a one-time pad to provide perfect secrecy.

The key must be truly random and at least as long as the plaintext, and each key is used only once.

8
New cards

Why is an N-time pad (re-using a one-time-pad key) insecure?

Because XORing two ciphertexts encrypted with the same key reveals the XOR of the two plaintexts, enabling statistical recovery of both messages and the key.

9
New cards

Differentiate between block ciphers and stream ciphers.

Block ciphers encrypt fixed-size blocks of data; stream ciphers encrypt data bit-by-bit (or byte-by-byte) and are typically faster but generally considered less robust.

10
New cards

Name three common block cipher modes of operation.

ECB (Electronic Code Book), CBC (Cipher Block Chaining), and CTR (Counter) mode.

11
New cards

Why is ECB mode usually discouraged in practice?

Identical plaintext blocks produce identical ciphertext blocks, revealing patterns in the data.

12
New cards

What advantage does CBC mode provide over ECB?

It chains each ciphertext block with the next plaintext block using an IV, so repeated plaintext does not create repeated ciphertext.

13
New cards

What is a nonce in CTR mode and why is it important?

A unique value combined with a counter to ensure each keystream block is unique; re-using a nonce compromises security.

14
New cards

Give the key sizes for DES, 3DES, and AES (standard options).

DES – 56 bits, 3DES – 168/112/56 bits, AES – 128, 192, or 256 bits (block size 128 bits).

15
New cards

What mathematical problem underpins Diffie-Hellman key exchange?

The difficulty of computing discrete logarithms in modular arithmetic (finding a from A = g^a mod p).

16
New cards

Describe the main purpose of Diffie-Hellman.

To allow two parties to agree on a shared secret key over an insecure channel without prior shared secrets.

17
New cards

Why does symmetric key management scale poorly with many users?

N users need N(N-1)/2 unique shared keys, which grows quadratically.

18
New cards

How does asymmetric encryption solve key-distribution problems?

Each user publishes a public key for encryption while keeping a private key for decryption, eliminating the need for pairwise secret exchange.

19
New cards

What hard mathematical problem secures RSA?

Factoring a large composite number n into its prime factors p and q.

20
New cards

In RSA, what is signed to create a digital signature?

A message (or its hash) is encrypted with the sender’s private key.

21
New cards

Define a cryptographic hash function.

A one-way, fixed-length output function that is pre-image resistant, second-pre-image resistant, and collision resistant.

22
New cards

Give two popular but now-broken hash functions mentioned in the lecture.

MD5 and SHA-1 (both have practical collision attacks).

23
New cards

What real-world incident demonstrated MD5 collision attacks?

The Flame malware (2012) forged a Microsoft code-signing certificate using an MD5 collision.

24
New cards

Why are Certificate Authorities (CAs) essential in public key infrastructures?

They bind public keys to entity identities by issuing digitally signed certificates that others can verify.

25
New cards

Outline the three-step TLS handshake simplified in the lecture.

1) Client requests TLS and receives server certificate, 2) Client verifies certificate with CA, 3) Client sends session key encrypted with server’s public key; secure channel begins.

26
New cards

What four components make up a TLS cipher suite string?

(1) Key Exchange, (2) Authentication, (3) Symmetric Cipher/Mode, (4) Message Digest.

27
New cards

Give recommended key sizes from the lecture for symmetric, asymmetric, and hash algorithms.

Symmetric: AES-256, Asymmetric: RSA-2048, Hash: SHA-256 or SHA-512.

28
New cards

Why is simply encrypting stored passwords a bad practice?

If the encryption key is compromised, all passwords are exposed; plus identical passwords encrypt to identical ciphertext.

29
New cards

What is salting in password hashing?

Adding a random value to each password before hashing to prevent pre-computed and rainbow-table attacks.

30
New cards

Does salting make brute-forcing a single password harder?

No; it mainly thwarts large-scale pre-computation attacks but not per-password brute force.

31
New cards

Name two slow, adaptive password-hashing algorithms recommended in the lecture.

BCrypt and Argon2 (also SCrypt, PBKDF2).

32
New cards

How do slow hashes defend against GPU-accelerated cracking?

By iterating the hash thousands of times and/or requiring large memory, they drastically reduce guesses per second and hinder parallelisation.

33
New cards

What is a rainbow table?

A pre-computed table mapping plaintext passwords to their hashes, used to reverse unsalted hashes quickly.

34
New cards

Which properties of XOR make it suitable for encryption?

It is reversible (A⊕K⊕K = A), commutative, and associative, allowing decryption by applying the same key again.

35
New cards

Explain Shannon’s maxim in cryptography.

‘The enemy knows the system’; security must rely only on the secrecy of keys, not algorithms.

36
New cards

What is frequency analysis and which classical ciphers are vulnerable to it?

A technique using character frequency statistics to break substitution and Vigenère ciphers.

37
New cards

How does a transposition cipher differ from a substitution cipher?

Transposition ciphers rearrange the positions of characters without altering them; substitution ciphers replace characters with others.

38
New cards

Why is ECB mode still occasionally used despite its weakness?

It is simple, parallelisable, and sometimes acceptable for random or non-patterned data, though generally discouraged.

39
New cards

What does the term ‘nonce’ stand for and what is its critical property?

‘Number used once’; it must be unique for each encryption operation to prevent keystream reuse.

40
New cards

List two common password-cracking tools mentioned in the lecture.

John the Ripper and Hashcat (offline); THC-Hydra and Brutus (online).