D830 - Introduction to Cryptography

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

1/108

encourage image

There's no tags or description

Looks like no tags are added yet.

Last updated 3:30 AM on 9/1/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai
Chat

No analytics yet

Send a link to your students to track their progress

109 Terms

1
New cards

Ceasar Cipher

Encryption technique that shifts the alphabet by a certain number of characters

2
New cards

Block Cipher

Breaks data into chunks and encrypts each chunk using a key.

3
New cards

Stream Cipher

Algorithm that takes one character and replaces it with one character.

4
New cards

Transposition Cipher

Encryption technique that only rearranges the characters themselves. Does not change them

5
New cards

One time pad

A type of Vernam Cipher that encrypts plaintext using XOR with a truly random key that is the same length as the plaintext. Used only once.

6
New cards

Vernam Cipher

Symmetric Encryption method that uses XOR with plaintext and a key. No restrictions

7
New cards

Quantum Computing

Perform complex, fast computations using Qubits. It threatens current encryption by rapidly solving mathematical factorization (RSA).

8
New cards

Quantum Cryptography

Method of secure communication that uses the laws of physics to detect eavesdropping and securely exchange keys.

9
New cards

Shannon's Principle

Always assume your adversary has a copy of your cipher text/algorithm, therefore key secrecy is the only thing that matters. Modern version

10
New cards

Cryptanalysis

Science of breaking cryptography, created by William Friedman

11
New cards

Alan Turning

introduced the concept that machines could perform mathematical computations. He broke the German Enigma code.

12
New cards

Kerckhoff's Principle

The strength of a cryptosystem depends on the secrecy of the key, not the algorithm itself.

13
New cards

Moore's Law

The number of transistors on a chip doubles every 18 months while prices half.

14
New cards

Shannon's confusion?

Hiding the relationship between the key and the ciphertext.

15
New cards

Shannon's diffusion

Spreading one plaintext across many ciphertext bits to hide patterns.

16
New cards

Diffie-Hellman revolution

Method that allows two parties to securely create a shared secret over a public channel.

17
New cards

Phil Zimmerman and PGP

Pretty Good Privacy encryption program created to secure messages, mainly email , using both symmetric and asymmetric encryption.

18
New cards

RSA Algorithm

Asymmetric encryption algorithm that uses a public key for encryption and private key for decryption.

19
New cards

Message (m)

Cleartext or Plaintext

20
New cards

Key Space

All possible keys that can be used with an algorithm.

21
New cards

Algorithm

Method used to encrypt and decrypt data.

22
New cards

Key

Secret value used by an algorithm to produce a unique encrypted result.

23
New cards

Initialization Vectors (iv)

A random starting value used in the first block of encryption to ensure identical plaintext produces different ciphertext.

24
New cards

Work Factor

Time and resources required to break cryptographic protection through unauthorized means.

25
New cards

Higher work factor means

More secure

26
New cards

Known Plaintext Attack (kpa)

When an attacker has both the plaintext and its corresponding ciphertext to discover a key.

27
New cards

IV attack

Attack that targets weak or reused initialization vectors to break encryption. Think of WEP

28
New cards

Timing attack

Attack that measures the time it takes to perform a cryptographic operation to gain info about a key.

29
New cards

Frequency Analysis

Attack that studies how often letters or patterns appear in ciphertext to guess plaintext.

30
New cards

Ciphertext-only attack

The attacker only has access to ciphertext and tries to recover the plaintext of a key.

31
New cards

Chosen Attack

Attack where the attacker chooses specific inputs to be encrypted or decrypted and see's how it behaves.

32
New cards

Chosen plaintext Attack (CPA)

Attacker chooses plaintext and sees how it encrypts

33
New cards

Chosen Ciphertext Attack (CCA)

Attacker chooses ciphertext and sees how it decrypts.

34
New cards

Mathematical analysis

Attack that uses math techniques to break an encryption algorithm or recover the key.

35
New cards

Linear Analysis / Cryptanalysis

Attack that uses linear approximations, aka pattern recognition thats almost true all the time, to describe patterns and relationships.

36
New cards

Differential Analysis / Cryptanalysis

Attack that studies how differences in plaintext affect differences in ciphertext to recover a key. Looks at how changes affect output.

37
New cards

Out-of-band key exchange

Method of sharing a key using a separate and secure communication channel outside the main network. Mostly for symmetric keys.

38
New cards

Symmetric Key advantages

Faster, encrypts larger bulks of data better, streaming media, and free algorithms like AES

39
New cards

RC4

Stream Cipher - encrypts data one bit at a time using a keystream. Fast but insecure. Used in WEP

40
New cards

RC6

Block Cipher - encrypts fixed-size blocks of data (128 bits) at a time. More complex and secure

41
New cards

DES

Outdated and weak block cipher, only 56 bits and can be easily brute forced.

42
New cards

AES

Secure and widely known block cipher considered strong and resistant to known practical attacks. Strong only if implemented correctly.

43
New cards

AES bit sizes

128/192/256 bits

44
New cards

Confusion vs Diffusion

Hides the relationship between the key and ciphertext vs Spreads the influence of one plaintext bit across many ciphertext bits.

45
New cards

ECB (Electronic Codebook)

Does not use an IV, which results in an identical plaintext being encrypted into identical ciphertext. BAD

46
New cards

ECB key weakness

Encrypts identical plaintext to identical cipher block texts.

47
New cards

CBC (Cipher Block Chaining)

Mode where each plaintext block is XORed with the previous ciphertext block, creating an avalanche chain. Older.

48
New cards

XOR

A way to combine 2 bits. Returns 1 if they're different, 0 if they are the same. The mixing tool.

49
New cards

Keystream

Output generated by an algorithm using a key.

50
New cards

Counter Mode (CTR)

Uses a different IV for each block, plus a counter (number). Most common today and is focused on speed.

51
New cards

What is the problem with Symmetric encryption

Scalability, due to the need of keys for both parties. Had to use Out-of-Band key options.

52
New cards

Implementation is

critical compared to mathematics alone for encryption.

53
New cards

S/MIME

Standard for public key encryption and digital signing of email.

54
New cards

Asymmetric Key bit sizes

1024, 2048, 4096

55
New cards

3DES

Symmetric, 64 block bits. 112 - 168 Key bits. 48 rounds

56
New cards

Key size

refers to the length of the encryption key, which determines the strength of the encryption itself.

57
New cards

Blowfish

Older symmetric block cipher with a 64-bit block size

58
New cards

Twofish

More modern design with a 128-bit block size, offering improved security and a strong alternative to AES.

59
New cards

DEREK

High speed encryption design optimized for cloud systems and scalability.

60
New cards

23BRAIDS

Lightweight encryption design for low power devices like IoT.

61
New cards

HSM (Hardware Security Module)

A cryptographic module that can generate cryptographic keys.

62
New cards

SPECK

light-weight block cipher designed by the NSA for IoT

63
New cards

SHA-1

Produces a 160-bit hash value and is used in DSS

64
New cards

Encryption technique that is based on factoring large prime numbers

RSA

65
New cards

Method for verifying the integrity of a message

Digital Signature

66
New cards

Perfect Forward Secrecy (PFS)

Past communications remain secure even if long-term keys are compromised.

67
New cards

Homomorphic Encryption

Encryption method that allows calculations to be performed on data without decrypting it first

68
New cards

Output Feedback (OFB)

Transforms a block cipher into a stream cipher

69
New cards

Benefit of using elliptic curve cryptography (ECC) over RSA?

Uses smaller keys for the same level of security

70
New cards

Elliptic Curve Cryptography (ECC)

Algorithm that uses mathematical operations on elliptic curves to generate secure keys, offering strong security with smaller key sizes. Good for blockchain technologies like bitcoin.

71
New cards

Blockchain technologies

Systems that use hashing and digital signatures to securely record and verify data.

72
New cards

Which stream cipher is commonly used in Wi-Fi encryption under WPA2?

RC4, Stream Cipher commonly used in WEP and WPA

73
New cards

Which encryption method is most commonly used to encrypt individual files in modern OS's?

AES

74
New cards

In asymmetric cryptography, which key is used to decrypt a message thats been encrypted with the recipient's public key.

The recipient's private key

75
New cards

What is a nonce?

A number used once, typically with cryptography.

76
New cards

Which algorithm supports homomorphic encryption?

RSA

77
New cards

Stream Cipher used in WEP, WPA, and WPA2?

RC4

78
New cards

Main purpose of the modulus operator (mod) in cryptography?

Returns the remainder and keeps numbers within a fixed range

79
New cards

Which protocols uses symmetric encryption to secure communication between two parties?

TLS, SSL, and IPsec with session keys being negotiated through asymmetric methods.

80
New cards

Dictionary Attack

Tries a list of commonly known passwords

81
New cards

Brute Force

To try every possible combination of characters until the correct password is found.

82
New cards

What does logarithms mean

Think of exponents. Find the exponent to get a number

83
New cards

What does Mod mean

Divide the first number by the second; the remainder is the result of mod.

84
New cards

Rule for SHA bit sizes

Number after SHA indicates the bits amount, except for SHA-1

85
New cards

Ephemeral Key

A temporary key that is used only once before it is discarded.

86
New cards

Collision attack

An attack where an attacker finds 2 different inputs that produce the same hash value.

87
New cards

Replay Attack

An attack where an attacker captures a valid message and retransmits it, making it seem like you.

88
New cards

Cipher Feedback (CFB)

Block cipher mode where each ciphertext depends on the previous ciphertext to encrypt or decrypt the next part. Also a weakness.

89
New cards

Playfair Cipher

Substitution cipher that encrypts pairs of letters (digraphs) using a 5x5 grid

90
New cards

Permutation

Rearrange positions.

91
New cards

Key Exhaustion Attack

Involves trying all possible keys to discover the correct one, often exploiting weaknesses in the key generation process.

92
New cards

Modular Arithmetic in cryptographic algorithms?

Performing calculations within a finite set of numbers

93
New cards

How is lattice based cryptography applied in modern encryption?

Uses geometric structures (grid) for cryptographic algorithms.

94
New cards

Which role do large prime numbers play in cryptographic algorithms

Ensure

95
New cards

What is a cryptosystem?

96
New cards

Nonrepudiation

97
New cards

Types of homomorphic encryption?

AHE, FHE, SHE, SHE? (need to check)

98
New cards

Stream ciphers use which type of key?

Symmetric, therefore they use both the same key for encryption and decryption.

99
New cards

What distinguishes CBC mode in a cryptographic system?

100
New cards

Which term refers to the blocks in a blockchain containing cryptographic proof of work?