Reading...
Play button
Play button
Use LEFT and RIGHT arrow keys to navigate between flashcards;
Use UP and DOWN arrow keys to flip the card;
H to show hint;
A reads text to speech;
12 Cards in this Set
- Front
- Back
|
Acronyms
|
in slides, on quizzes, in book; we need to know these things
|
|
|
True/False
|
qill be in quizzes, final exam
|
|
|
naming people
|
famous it security people
|
|
|
confidentiality / integrity / availability
|
need to know what type of violation is taking place in each situation
|
|
|
modes of operation in block ciphers
|
given one of diagrams; which mode was depicted? majority of points given for stepping through encryption and decryption with 3 small block, as well as error propagation
|
|
|
hash functions
|
what is a cryptographic hash function (3 properties + definitions)
|
|
|
hash and sign paradigm
|
taking hash and combining views of digital signatures with RSA; apply hash and sign paradigm to sign a message; sig = (h(m))^d mod n
|
|
|
implication of using h(x) = 2x+1 mod 33, h'(x) = (2x-2) mod 33
|
very simple to find collisions, making it not a cryptographic hash function
|
|
|
birthday paradox
|
connection to cryptographic hash functions
|
|
|
diiffe helmman key exhange protocol
|
know how to recognize it, what it is
|
|
|
main in the middle
|
recognize it, understand it, explain it; diffe-hellman is prone to MITM attacks
|
|
|
RSA
|
homomorphic; semantically secure; is semantically secure RSA with padding homormorphic or not (it is not; padding destroys multiplicative property)
|
