{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

lecture11_alomari_Compatibility_Mode_2

# lecture11_alomari_Compatibility_Mode_2 - CLASS IN...

This preview shows pages 1–4. Sign up to view the full content.

Copyrights are reserved @ 2011 for Dr. Alomari, CIS, JU 1 C LASS IN I NFORMATION S ECURITY AND C RYPTOGRAPHY 1902322 L11: H ASH F UNCTIONS : M ODIFICATION D ETECTION C ODES (MDC S ) By Dr. Raja S. Alomari Fall 2011 R ECAP : H ASH F UNCTIONS ring4 H: D barb2right R where D = {0,1}* and R={0,1} n for some integer n > 0 ring4 Iterated Hash functions. ring4 Bit Padding Methods: circle5 Method 1: Ambiguous. circle5 Method 2: non-Ambiguous. 2 Copyrights are reserved @ 2011 for Dr. Alomari, CIS, JU

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
Copyrights are reserved @ 2011 for Dr. Alomari, CIS, JU 2 MDC HASHING ring4 Single-length MDCs circle5 Matyas-Meyer-Oseas circle5 Davies-Meyer hash circle5 Miyaguchi-Preneel hash ring4 Double-length MDCs: circle5 MDC-2 circle5 MDC-4 ring4 MD4 family circle5 MD4, MD5 circle5 SHA-1 circle5 RIPEMD, RIPEMD-128, RIPEMD-160 ring4 Modular Arithmetic Hash functions: circle5 MASH, MASH-2 3 Copyrights are reserved @ 2011 for Dr. Alomari, CIS, JU S INGLE - LENGTH MDC S Common Definitions: ring4 E k : block cipher Symmetric-key Encryption functions. ring4 g : maps n-bit input to a key K suitable for E k . circle5 If K is n-bit length, g might be identity. ring4 IV : initial value suitable for E k usually of n-bit length. Fed at H 0 . 4 Copyrights are reserved @ 2011 for Dr. Alomari, CIS, JU
Copyrights are reserved @ 2011 for Dr.

This preview has intentionally blurred sections. Sign up to view the full version.

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}