Ch7 Flashcards
What is the largest of the four variables in RSA cryptography
n
what attack demonstrated that 2DES took the same computational power as DES to defeat
meet-in-the-middle
what relies on the difficulty of factoring super-increasing sets and has been broken by cryptanalysis
Knapsack algorithm
what are fundamentals of Hash functions
- must allow input of any length
- fixed length output
- easy to compute
- one-way functionality
- collision free
hashing algorithms
SHA-1 160 bit message digest
SHA-2 variable up to 512 bits
how do cryptographic salts improve security
adding salts to passwords before hashing reduces the effectiveness of rainbow table attacks
how are digital signatures generated and verified
- use hashing function to generate message digest
- encrypt MD using your privkey
to verify… - decrypt signature using public key of sender
- compare MD to one you generate yourself, if they match the message is authentic
what are the components of the Digital Signature Standard
-uses SHA-1 & SHA-2 along with one of the three encryption algorithms (DSA, RSA or ECDSA)
what is the standard for securing web traffic
HTTP over TLS …not SSL
name the attack that finds collisions in hash functions
birthday attack
name attack that reuses authentication requests
replay attack
attacker has a copy of the encrypted message along with the plaintext message used to generate the ciphertext
known plaintext attack
attacker has the ability to decrypt chosen portions of the ciphertext message and use the decrypted portion of the message to discover the key.
chosen ciphertext attack
attacker has the ability to encrypt plaintext messages of their choosing and can then analyze the ciphertext output of the encryption algorithm
chosen plaintext attack
