337: cryptography & hashing

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

1/49

flashcard set

Earn XP

Description and Tags

week 3

Last updated 9:27 PM on 4/21/26
Name
Mastery
Learn
Test
Matching
Spaced
Call with Kai

No analytics yet

Send a link to your students to track their progress

50 Terms

1
New cards

cryptography important point

“cryptography fails at the system + human layer, not just algorithm level”

2
New cards

crypto quote

“cryptographic security is determined by the weakest component in the system — not just the strength of the algorithm alone”

3
New cards

what is cryptography

the art of secret writing

4
New cards

cryptography

plaintext —-encryption—→ ciphertext —-decryption—→ plaintext

5
New cards

plaintext

the original message (msg/data which are in their normal, readable form)

6
New cards

encryption

encoding the contents of the message in such a way that hides its contents from outsiders

7
New cards

ciphertext

the encoded/encrypted message

8
New cards

decryption

the process of retrieving the plaintext back from the ciphertext

9
New cards

key

sequence of characters or bits used by an algorithm to encrypt or decrypt a message (key = secret value)

10
New cards

is it okay for the algorithm to be public?

yes, algorithm without the key doesn’t help unmangle the msg

11
New cards

should the crypto algorithms used for military secrets be public?

no

12
New cards

ceaser cipher

given a key, move each letter [key] places to the right to encrypt and [key] places to the left to decrypt

13
New cards

break ceaser cipher (long method)

try all possible keys

14
New cards

public key AKA

asymmetric cryptography

15
New cards

private key AKA

symmetric cryptography

16
New cards

public key: how many keys?

one public key and one private key

17
New cards

private key: how many keys?

one secret key

18
New cards

asymmetric crypto public key role

use reciever’s key to encrypt

19
New cards

asymmetric crypto private key role

use receivers keys to decrypt

20
New cards

which is slower to compute?

asymmetric crypto

21
New cards

symmetric cryptography private key role

use same key to encrypt and decrypt (both sender and receiver know what the key is)

22
New cards

key distribution problem

challenge of securely sharing secret keys between parties in symmetric cryptography without an eavesdropper intercepting them

23
New cards

stream cipher (symmetric crypto)

encrypt bit-by-bit for smooth, fast encryption good for data in-transit

24
New cards

how does stream cipher work?

cipher generates a keystream (random letters) and adds it to the plaintext

25
New cards

block cipher (symmetric crypto)

plaintext is sliced into 128 bit chunks and encrypts those chunks one at a time

26
New cards

hybrid cryptography

public key used to establish temporary shared key. symmetric (so secret key) used for remainder

27
New cards

are hash functions random

no, they are always the same when given the same input

28
New cards

are hash inputs fixed size?

yes, they are always one fixed length (depending on which hashing algorithm you use)

29
New cards

hash input term

message

30
New cards

hash output term

message digests

31
New cards

hashes are one-way functions

meaning you cannot decrypt like encryption algorithms

32
New cards

hashes return _ if the message is even number of digits/letters

0

33
New cards

hashes return _ if the message is odd number of digits/letters

1

34
New cards

avalanche effect

even the smallest change causes a huge change in the output (ex. T vs t)

35
New cards

cryptographic hash

designed for data integrity and security, resisting reversal and collision attacks. so more security reasons

36
New cards

hashing security goal

integrity

37
New cards

encryption security goal

confidentiality

38
New cards

digital signature

guarantees that the contents of a message have not been altered in transit

39
New cards

which security goal is digital signature

non-repudiation

40
New cards

what kind of encryption do digital signatures use

asymmetric cryptography

how: recipient uses their private key to view, sign, etc so obvi they can’t deny

41
New cards

collision attack

occurs when an attacker finds two different messages that hash to the same value

42
New cards

how to conduct collision attack

very difficult and requires generating a separate algorithm

43
New cards

what does hashing algorithm MD stand for

message digest

44
New cards

how does MD work

use a secure method to compress the file and generate a computed output of a specified number of bits

45
New cards

MD2

takes a data of any length and produces a hash output of 128 bits

46
New cards

MD4

was subject to collision attack but was fast. not is use anymore and if is shouldn’t be

47
New cards

MD5

creates a 128-bit hash of a message of any length and segments the message into 512-bit blocks (similar to MD4 but slightly slower and more secure)

48
New cards

what does hashing algorithm SHA stand for

secure hash algorithm

49
New cards

SHA-3

latest and most secure

50
New cards

block method

splitting your input into chunks and repeatedly mixing each chunk into a running value with heavy scrambling math until one fixed-size final hash comes out