Reverse Hash Matching -
Reverse Hash Matching
Views: 0
Votes: 0 (Avg 0.0)
The process of discovering the original message that has been hashed by generating potential messages, hashing them, and comparing their hash value to the original. When H(M) = H(M-), then M = M-.
Average rating:
0.0
(0 reviews)
Sign in to manage your flashcard decks and leave a comment.
Discussion (0)
No comments yet. Be the first to share your experience with this term.