Information AboutUmac |
| CATEGORIES ABOUT UMAC | |
| message authentication codes | |
|
In Cryptography , a message authentication code based on universal hashing, or '''UMAC''', is a type of Message Authentication Code (MAC) calculated choosing a hash function from a class of hash functions according to some secret (random) process and applying it to the message. The resulting digest or fingerprint is then encrypted to hide the identity of the hash function used. As with any MAC, it may be used to simultaneously verify both the '' Data Integrity '' and the ''authenticity'' of a Message . A UMAC has provable cryptographic strength and is usually a lot less computationally intensive than other MACs. UNIVERSAL HASHING | ||
| :<math>Pr {h \in H} | "h(f)=dh(a)=c" class="copylinks" target="_blank">{Link without Title} </math> |
|
| It's Easy To Construct A Class Of Hash Functions When D Is | "http://wwwinformationdelightinfo/encyclopedia/entry/Finite_field" class="copylinks">Field For example if D is Prime , all the operations are taken Modulo D The message ''a'' is then encoded as an n-dimensional vector over D (a<sub>1</sub>,a<sub>2</sub>,,a<sub>n</sub>) H then has D<sup>n+1</sup> members, each corresponding to an n+1-dimensional vector over D (h<sub>0</sub>,h<sub>1</sub>,,h<sub>n</sub>) If we let |
|
|