Skip to main content
IBM 
ShopSupportDownloads
IBM HomeProductsConsultingIndustriesNewsAbout IBM
IBM : developerWorks : Security : Education - online courses
Introduction to cryptology: Pt. 1
Download tutorial zip fileView letter-sized PDF fileView A4-sized PDF fileE-mail this tutorial to a friend
Main menuSection menuGive feedback on this tutorialPrevious
Next Section
2. Basic concepts
  


Cryptographic hashes, part 2 page 12 of 12


In some cases, cryptographic hashes will be keyed in much the same way that encryption functions are. If so, only someone who possesses the key can verify the hash's accuracy. In practical terms, it is generally possible to create a keyed hash function by simply prepending or appending a key onto the message M prior to hashing it (that is, 'H(k+M)'). However, some keyed hashes utilize a key value in a more deeply integrated way within the algorithm.


Next Section
Main menuSection menuGive feedback on this tutorialPrevious
PrivacyLegalContact