cnsppch12Hash and MAC Algorithms概要1.ppt

Guide to Information Security Instructor: Hou Mengbo Email: houmb AT sdu.edu.cn Office: Information Security Research Group Hash and MAC Algorithms Hash Functions condense arbitrary size message to fixed size by processing message in blocks through some compression function either custom or block cipher based Message Authentication Code (MAC) fixed sized authenticator for some message to provide authentication for message by using block cipher mode or hash function Hash Algorithms see similarities in the evolution of hash functions block ciphers increasing power of brute-force attacks leading to evolution in algorithms from DES to AES in block ciphers from MD4 MD5 to SHA-1 RIPEMD-160 in hash algorithms likewise tend to use common iterative structure as do block ciphers MD5* designed by Ronald Rivest (the R in RSA) latest in a series of MD2, MD4 produces a 128-bit hash value until recently was the most widely used hash algorithm in recent times have both brute-force cryptanalytic concerns specified as Internet standard RFC1321 MD5 Overview pad message so its length is 448 mod 512 append a 64-bit length value to message initialise 4-word (128-bit) MD buffer (A,B,C,D) process message in 16-word (512-bit) blocks: using 4 rounds of 16 bit operations on message block buffer add output to buffer input to form new buffer value output hash value is the final buffer value MD5 Overview MD5 Compression Function each round has 16 steps of the form: a = b+((a+g(b,c,d)+X[k]+T[i])s) (a,b,c,d) cycled right shift one word a,b,c,d refer to the 4 words of the buffer, but used in varying permutations note this updates 1 word only of the buffer after 16 steps each word is updated 4 times where g(b,c,d) is a different nonlinear function in each round (F,G,H,I) T[i] is a constant value derived from sin Single Step of MD5 Compression Function MD4 precursor to MD5 also produces a 128-bit hash of message has 3 rounds of 16 steps vs 4 in MD5 design goals: co