Chapter 7 Flashcards
in asymmetric cryptography, which key is used to encrypt a message?
receiver’s public key
Which international standard was created by Rivest, Shamir, and Adleman?
RSA public key algorithm
which algorithm relies on a component of set theory known as super-increasing sets, rather than large prime numbers?
Merkle-Hellman
this algorithm is an extension of Diffie-Hallman, but its major disadvantage is that it doubles the size of any message that it encrypts
ElGamal
this algorithm involves the equation Q = xP; and even if Q and P are known, x is incredibly difficult to solve. The major advantage of this algorithm is that you do not need a large key size to obtain the same amount of security as very large keys used in other algorithms
Elliptic Curve
this algorithm relies on the ability of two users to generate a shared secret that they both know without ever actually transmitting it, and is used to set up TLS
Diffie-Hellman Key Exchange
5 requirements of hash functions
- input can be any length
- output is fixed length
- relatively easy to compute
- one-way function
- collision resistant
block size of HAVAL
1024-bit
hash values of HAVAL
128, 160, 192, 224, and 256-bits
SHA1 block size
512-bits
SHA-1 message digest size
160-bit
SHA-256 message digest size
256-bit
SHA-256 block size
512-bit
SHA-224 block size
512-bits
SHA-224 message digest size
224-bits
SHA-512 message digest size
512
SHA-512 block size
1024
SHA-384 message digest size
384
SHA-384 block size
1024-bits
which algorithm is the SHA-3 standard
Keccak
This standard provides the same security as SHA-2, but is slower so it is not commonly used
SHA-3
This hash algorithm was developed by Ronald Rivest, but collisions are possible
MD2, MD4, MD5
MD5 block size
512
MD5 message digest length
128 bits
what group of hashing functions is used as an alternative to SHA?
RIPEMD
RIPEMD message digest length
128-bit
Which variant of RIPEMD is still secure today?
RIPEMD-160
Which two major concepts do digital signature algorithms rely on?
public key encryption and hashing functions
4 steps of sending a digitally signed message
- hash the message
- encrypt the message digest using private key - this is the signature
- appends signature to plaintext message
- send the messages
3 steps of validating digital signatures.
- decrypt digital signature using sender’s public key
- hash the plaintext message
- compare the decrypted digest to the new digest to make sure they are the same
Which aspect of the CIA triad do digital signatures alone not address, and how can it be acheived?
they do not provide confidentiality. It can be acheived by encrypting the signed message with the receiver’s public key.
this signature algorithm is a partial digital signature. it guarantees the integrity of a message but not nonrepudiation.
HMAC
what is the FIPS standard for digital signatures?
DSS - Digital Signature Standard
what is the DSS for hashing functions?
SHA-3
what are the 3 acceptable DSS encryption algorithms?
DSA (Digital Signature Algorithm)
RSA
ECDSA
what are endorsed copies of a public key?
digital certificates
what is the international standard for digital certificates?
X.509
what information is included on a X.509 certificate? (7 items)
- version of X.509
- serial number
- signature algorithm
- issuer name (name of CA)
- validity period
- subject name (CN, DN)
- subject’s public key
what entities assist CAs by allowing them to remotely validate user identities?
Registration Authorities (RAs)