Section 25 Hashing Flashcards
A one way cryptographic function which takes on input and produces a unique message digest.
Hashing
Algorithm that creates a fixed length 128 bit hash value unique to the input file.
Message Digest 5 (MD 5)
Condition that occurs when two different files create the same hash digest.
Collision
Algorithm that creates a fixed length 160 bit hash value unique to the input file.
Secure Hash Algorithm (SHA-1)
Family of algorithms that includes SHA-224, SHA-256, SHA-348, and SHA 512.
Secure Hash Algorithm (SHA-2)
Family of algorithms that creates hash digests between 224 bits and 512 bits.
Secure Hash Algorithm (SHA-3)
An open source hash algorithm that creates a unique 160 bit, 256 bits, or 320 bit message digest for each input file.
RACE Integrity Primitive Evaluation Message Digest (RIPEMD)
Uses a hash algorithm to create a level of assurance as to the integrity and authenticity of a given messages or file.
Hash Based Message Authentication Code (HMAC)
Uses digital signatures to provide an assurance that the software code has not been modified after it was submitted by the developer.
Code Signing
Original version of password hashing used by windows that uses DES and is limited to 14 characters.
LAN MAN (LM Hash)
A technique that allows an attacker to authenticate to a remote server or service by using the underlying NTLM or LM hash instead of requiring the associated plaintext password.
Pass the Hash
A penetration testing tool used to automate the harvesting of hashes and conducting the pass the hash attack
Mimikatz
Technique used by an attacker to find two different message that have the same identical hash digest.
Birthday Attack
A technique that is used to mitigate a weaker key to increasing the time needed to crack it.
Key Stretching
Adding random data into a one way cryptographic hash to help protect against passwords cracking techniques.
Salting
