<x:xmpmeta tsc:version="2.0.1" xmlns:x="adobe:ns:meta/" xmlns:tsc="http://www.techsmith.com/xmp/tsc/">
   <rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:xmp="http://ns.adobe.com/xap/1.0/" xmlns:xmpDM="http://ns.adobe.com/xmp/1.0/DynamicMedia/" xmlns:xmpG="http://ns.adobe.com/xap/1.0/g/" xmlns:xmpMM="http://ns.adobe.com/xap/1.0/mm/" xmlns:tscDM="http://www.techsmith.com/xmp/tscDM/" xmlns:tscIQ="http://www.techsmith.com/xmp/tscIQ/" xmlns:tscHS="http://www.techsmith.com/xmp/tscHS/" xmlns:stDim="http://ns.adobe.com/xap/1.0/sType/Dimensions#" xmlns:stFnt="http://ns.adobe.com/xap/1.0/sType/Font#" xmlns:exif="http://ns.adobe.com/exif/1.0" xmlns:dc="http://purl.org/dc/elements/1.1/">
      <rdf:Description dc:date="2017-03-06 12:46:40 AM" dc:source="Camtasia,9.0.1,enu" dc:title="l_11chf" tscDM:firstFrame="l_11chf_First_Frame.png" tscDM:originId="2625EA67-814F-4A0C-B4C7-2902396CFF3B" tscDM:project="l_11chf.tscproj">
         <xmpDM:duration xmpDM:scale="1/1000" xmpDM:value="4784100"/>
         <xmpDM:videoFrameSize stDim:unit="pixel" stDim:h="1080" stDim:w="1440"/>
         <tsc:langName>
            <rdf:Bag>
               <rdf:li xml:lang="en-US">English</rdf:li></rdf:Bag>
         </tsc:langName>
         <xmpDM:Tracks>
            <rdf:Bag>
               <rdf:li>
                  <rdf:Description xmpDM:trackType="ScreenText" xmpDM:frameRate="f1000" xmpDM:trackName="Screen Text">
                     <xmpDM:markers>
                        <rdf:Seq>
                           <rdf:li><rdf:Description xmpDM:name="Cryptographic Hash Functions Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse571-17/" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Overview Cryptographic Hash Functions Applications of Crypto Hash Functions Birthday Problem Secure Hash Algorithm (SHA) These slides are based partly" xmpDM:startTime="10767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="on Lawrie Brown’s slides supplied with William Stallings’s book “Cryptography and Network Security: Principles and Practice,” 7th Ed, 2017." xmpDM:startTime="10767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="10767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hash Function Hash tables used in data searches The hash function should Take variable size input Produce fixed output size" xmpDM:startTime="31433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="(Size of the table) Be easy to compute Be pseudorandom so that it distributes uniformly over the table Þ Minimizes" xmpDM:startTime="31433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="collisions Hash Fn Data" xmpDM:startTime="31433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Cryptographic Hash Functions 1." xmpDM:startTime="205367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Variable Size Input 2." xmpDM:startTime="205367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Fixed output size 3." xmpDM:startTime="205367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Efficient computation 4." xmpDM:startTime="205367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Pseudorandom 5." xmpDM:startTime="205367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Pre-image Resistant = one-way It is not possible to find any M, given h." xmpDM:startTime="205367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="6." xmpDM:startTime="205367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2nd Pre-image Resistant = Weak Collision Resistant It is not possible to find y, such that h(y)=h(x) 7." xmpDM:startTime="205367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Strong Collision Resistant: It is not possible to find any two x and y, such that h(y)=h(x) Pre-image Resistant Collision" xmpDM:startTime="205367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Resistant 2nd Pre-Image Resistant" xmpDM:startTime="205367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Cryptographic Hash Functions 1." xmpDM:startTime="231567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Variable Size Input 2." xmpDM:startTime="231567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Fixed output size 3." xmpDM:startTime="231567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Efficient computation 4." xmpDM:startTime="231567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Pseudorandom 5." xmpDM:startTime="231567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Pre-image Resistant = one-way It is not possible to find any M, given h." xmpDM:startTime="231567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="6." xmpDM:startTime="231567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2nd Pre-image Resistant = Weak Collision Resistant It is not possible to find y, such that h(y)=h(x) 7." xmpDM:startTime="231567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Strong Collision Resistant: It is not possible to find any two x and y, such that h(y)=h(x) Pre-image Resistant Collision" xmpDM:startTime="231567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Resistant 2nd Pre-Image Resistant" xmpDM:startTime="231567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hash Function Hash tables used in data searches The hash function should Take variable size input Produce fixed output size" xmpDM:startTime="232133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="(Size of the table) Be easy to compute Be pseudorandom so that it distributes uniformly over the table Þ Minimizes" xmpDM:startTime="232133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="collisions Hash Fn Data" xmpDM:startTime="232133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Cryptographic Hash Functions 1." xmpDM:startTime="236300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Variable Size Input 2." xmpDM:startTime="236300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Fixed output size 3." xmpDM:startTime="236300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Efficient computation 4." xmpDM:startTime="236300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Pseudorandom 5." xmpDM:startTime="236300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Pre-image Resistant = one-way It is not possible to find any M, given h." xmpDM:startTime="236300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="6." xmpDM:startTime="236300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2nd Pre-image Resistant = Weak Collision Resistant It is not possible to find y, such that h(y)=h(x) 7." xmpDM:startTime="236300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Strong Collision Resistant: It is not possible to find any two x and y, such that h(y)=h(x) Pre-image Resistant Collision" xmpDM:startTime="236300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Resistant 2nd Pre-Image Resistant" xmpDM:startTime="236300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples of Crypto Hash Functions MD4 = Message Digest 4 [RFC 1320] - 32b operations MD5 = Message Digest 5" xmpDM:startTime="411567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="[RFC 1321] - 32b operations SHA = Secure hash algorithm [NIST] SHA-1 = Updated SHA SHA-2 = SHA-224, SHA-256, SHA-384," xmpDM:startTime="411567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 SHA-512 uses 64-bit operations" xmpDM:startTime="411567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Applications of Crypto Hash Fn 1." xmpDM:startTime="489533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Message Authentication = Integrity+Source Repudiation MD5 has is used to check if a file has been modified." xmpDM:startTime="489533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Use a secret value before hashing so that no one else can modify M and hash Can encrypt Message, hash," xmpDM:startTime="489533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="or both for confidentiality 2." xmpDM:startTime="489533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Digital Signatures: Encrypt hash with private key 3." xmpDM:startTime="489533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Password storage: Hash of the user’s password is compared with that in the storage." xmpDM:startTime="489533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hackers can not get password from storage." xmpDM:startTime="489533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="4." xmpDM:startTime="489533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Pseudorandom number generation: Hash an IV, Hash the hash, …, repeat M E(PRA, H(M)) M H(M)" xmpDM:startTime="489533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Birthday Problem What is the probability that two people have the same birthday (day and month) TP_tmp TP_tmp" xmpDM:startTime="986900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Birthday Problem (Cont) With 22 people in a room, there is better than 50% chance that two people have a" xmpDM:startTime="1250400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="common birthday With 40 people in a room there is almost 90% chance that two people have a common birthday" xmpDM:startTime="1250400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If there k people, there are k(k-1)/2 pairs In general, n possibilities Þ n trials to find a collision TP_tmp" xmpDM:startTime="1250400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="TP_tmp TP_tmp" xmpDM:startTime="1250400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Probability of Hash Collisions Arbitrary length message Þ Fixed length hash Þ Many messages will map to the same hash" xmpDM:startTime="1316333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Given 1000 bit messages Þ 21000 messages 128 bit hash Þ 2128 possible hashes Þ 21000/2128 = 2872 messages/hash value" xmpDM:startTime="1316333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="n-bit hash Þ Need avg 2n/2 tries to find two messages with same hash 64 bit hash Þ 232 tries" xmpDM:startTime="1316333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="(feasible) 128 bit hash Þ 264 tries (not feasible)" xmpDM:startTime="1316333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Birthday Problem (Cont) With 22 people in a room, there is better than 50% chance that two people have a" xmpDM:startTime="1414300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="common birthday With 40 people in a room there is almost 90% chance that two people have a common birthday" xmpDM:startTime="1414300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If there k people, there are k(k-1)/2 pairs In general, n possibilities Þ n trials to find a collision TP_tmp" xmpDM:startTime="1414300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="TP_tmp TP_tmp" xmpDM:startTime="1414300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Birthday Problem (Cont) With 22 people in a room, there is better than 50% chance that two people have a" xmpDM:startTime="1499733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="common birthday With 40 people in a room there is almost 90% chance that two people have a common birthday" xmpDM:startTime="1499733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If there k people, there are k(k-1)/2 pairs In general, n possibilities Þ n trials to find a collision TP_tmp" xmpDM:startTime="1499733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="TP_tmp TP_tmp" xmpDM:startTime="1499733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Probability of Hash Collisions Arbitrary length message Þ Fixed length hash Þ Many messages will map to the same hash" xmpDM:startTime="1511600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Given 1000 bit messages Þ 21000 messages 128 bit hash Þ 2128 possible hashes Þ 21000/2128 = 2872 messages/hash value" xmpDM:startTime="1511600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="n-bit hash Þ Need avg 2n/2 tries to find two messages with same hash 64 bit hash Þ 232 tries" xmpDM:startTime="1511600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="(feasible) 128 bit hash Þ 264 tries (not feasible)" xmpDM:startTime="1511600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hash Function Cryptanalysis Hash functions use iterative structure Process message in blocks Compression function f takes previous output and next" xmpDM:startTime="1558833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="block to produce next output If compression function is collision resistant, the entire structure is collision resistant [Merkle 89]" xmpDM:startTime="1558833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Block Ciphers as Hash Functions Can use block ciphers as hash functions Using H0=0 and zero-pad of final block Compute:" xmpDM:startTime="1632100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hi = EMi [Hi-1] And use final block as the hash value Similar to CBC but without a key Resulting" xmpDM:startTime="1632100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="hash is too small (64-bit) Both due to direct birthday attack And to “meet-in-the-middle” attack Other variants also susceptible to" xmpDM:startTime="1632100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="attack" xmpDM:startTime="1632100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hash Function Cryptanalysis Hash functions use iterative structure Process message in blocks Compression function f takes previous output and next" xmpDM:startTime="1762467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="block to produce next output If compression function is collision resistant, the entire structure is collision resistant [Merkle 89]" xmpDM:startTime="1762467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Block Ciphers as Hash Functions Can use block ciphers as hash functions Using H0=0 and zero-pad of final block Compute:" xmpDM:startTime="1765133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hi = EMi [Hi-1] And use final block as the hash value Similar to CBC but without a key Resulting" xmpDM:startTime="1765133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="hash is too small (64-bit) Both due to direct birthday attack And to “meet-in-the-middle” attack Other variants also susceptible to" xmpDM:startTime="1765133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="attack" xmpDM:startTime="1765133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hash Function Cryptanalysis Hash functions use iterative structure Process message in blocks Compression function f takes previous output and next" xmpDM:startTime="1767600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="block to produce next output If compression function is collision resistant, the entire structure is collision resistant [Merkle 89]" xmpDM:startTime="1767600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Block Ciphers as Hash Functions Can use block ciphers as hash functions Using H0=0 and zero-pad of final block Compute:" xmpDM:startTime="2029700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hi = EMi [Hi-1] And use final block as the hash value Similar to CBC but without a key Resulting" xmpDM:startTime="2029700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="hash is too small (64-bit) Both due to direct birthday attack And to “meet-in-the-middle” attack Other variants also susceptible to" xmpDM:startTime="2029700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="attack" xmpDM:startTime="2029700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Secure Hash Algorithm (SHA) Successor to and similar to MD5 (by Ron Rivest) SHA-0: FIPS PUB 180, 1993." xmpDM:startTime="2182900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Withdrawn shortly after publ." xmpDM:startTime="2182900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1: FIPS PUB 180-1, 1995." xmpDM:startTime="2182900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="160 bit hash SHA-2: FIPS PUB 180-2, 2002 SHA-224 SHA-256 SHA-384 SHA-512 SHA-1 is used in TLS, SSL, PGP, SSH," xmpDM:startTime="2182900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="S/MIME, and IPsec Required by law in US Govt applications Used in Digital Signature Standard Pseudo-codes for SHA algorithms are" xmpDM:startTime="2182900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="available." xmpDM:startTime="2182900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="NIST certifies implementations." xmpDM:startTime="2182900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2182900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1 Algorithm 160 bit hash using 512 bit blocks and 32 bit operations Five passes (4 in MD5 and 3" xmpDM:startTime="2598500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="in MD4) of 16 operations each Maximum message size is 264 bit 512 bits are expanded to 5x512 bits: nth" xmpDM:startTime="2598500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="word = xor of n-3, n-8, n-14, and n-16 In SHA-1 these words are rotated left by one bit before" xmpDM:startTime="2598500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="xor Total 80 words: W0, ...," xmpDM:startTime="2598500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="W79 FIG05_09" xmpDM:startTime="2598500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2 SHA-256 uses 32-bit operations SHA-512 uses 64-bit operations Use different shift amounts and additive constants SHA-224 and SHA-384 are" xmpDM:startTime="2791633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="simply truncated versions of SHA-256 and SHA-512 using different initial values." xmpDM:startTime="2791633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-224 matches the key length of two-key triple-DES [Source: Wikipedia]" xmpDM:startTime="2791633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1 Algorithm 160 bit hash using 512 bit blocks and 32 bit operations Five passes (4 in MD5 and 3" xmpDM:startTime="2793000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="in MD4) of 16 operations each Maximum message size is 264 bit 512 bits are expanded to 5x512 bits: nth" xmpDM:startTime="2793000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="word = xor of n-3, n-8, n-14, and n-16 In SHA-1 these words are rotated left by one bit before" xmpDM:startTime="2793000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="xor Total 80 words: W0, ...," xmpDM:startTime="2793000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="W79 FIG05_09" xmpDM:startTime="2793000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Secure Hash Algorithm (SHA) Successor to and similar to MD5 (by Ron Rivest) SHA-0: FIPS PUB 180, 1993." xmpDM:startTime="2925667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Withdrawn shortly after publ." xmpDM:startTime="2925667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1: FIPS PUB 180-1, 1995." xmpDM:startTime="2925667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="160 bit hash SHA-2: FIPS PUB 180-2, 2002 SHA-224 SHA-256 SHA-384 SHA-512 SHA-1 is used in TLS, SSL, PGP, SSH," xmpDM:startTime="2925667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="S/MIME, and IPsec Required by law in US Govt applications Used in Digital Signature Standard Pseudo-codes for SHA algorithms are" xmpDM:startTime="2925667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="available." xmpDM:startTime="2925667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="NIST certifies implementations." xmpDM:startTime="2925667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2925667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Block Ciphers as Hash Functions Can use block ciphers as hash functions Using H0=0 and zero-pad of final block Compute:" xmpDM:startTime="2926167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hi = EMi [Hi-1] And use final block as the hash value Similar to CBC but without a key Resulting" xmpDM:startTime="2926167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="hash is too small (64-bit) Both due to direct birthday attack And to “meet-in-the-middle” attack Other variants also susceptible to" xmpDM:startTime="2926167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="attack" xmpDM:startTime="2926167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hash Function Cryptanalysis Hash functions use iterative structure Process message in blocks Compression function f takes previous output and next" xmpDM:startTime="2926700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="block to produce next output If compression function is collision resistant, the entire structure is collision resistant [Merkle 89]" xmpDM:startTime="2926700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Block Ciphers as Hash Functions Can use block ciphers as hash functions Using H0=0 and zero-pad of final block Compute:" xmpDM:startTime="2941933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hi = EMi [Hi-1] And use final block as the hash value Similar to CBC but without a key Resulting" xmpDM:startTime="2941933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="hash is too small (64-bit) Both due to direct birthday attack And to “meet-in-the-middle” attack Other variants also susceptible to" xmpDM:startTime="2941933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="attack" xmpDM:startTime="2941933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Secure Hash Algorithm (SHA) Successor to and similar to MD5 (by Ron Rivest) SHA-0: FIPS PUB 180, 1993." xmpDM:startTime="2942600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Withdrawn shortly after publ." xmpDM:startTime="2942600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1: FIPS PUB 180-1, 1995." xmpDM:startTime="2942600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="160 bit hash SHA-2: FIPS PUB 180-2, 2002 SHA-224 SHA-256 SHA-384 SHA-512 SHA-1 is used in TLS, SSL, PGP, SSH," xmpDM:startTime="2942600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="S/MIME, and IPsec Required by law in US Govt applications Used in Digital Signature Standard Pseudo-codes for SHA algorithms are" xmpDM:startTime="2942600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="available." xmpDM:startTime="2942600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="NIST certifies implementations." xmpDM:startTime="2942600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2942600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1 Algorithm 160 bit hash using 512 bit blocks and 32 bit operations Five passes (4 in MD5 and 3" xmpDM:startTime="2943700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="in MD4) of 16 operations each Maximum message size is 264 bit 512 bits are expanded to 5x512 bits: nth" xmpDM:startTime="2943700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="word = xor of n-3, n-8, n-14, and n-16 In SHA-1 these words are rotated left by one bit before" xmpDM:startTime="2943700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="xor Total 80 words: W0, ...," xmpDM:startTime="2943700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="W79 FIG05_09" xmpDM:startTime="2943700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2 SHA-256 uses 32-bit operations SHA-512 uses 64-bit operations Use different shift amounts and additive constants SHA-224 and SHA-384 are" xmpDM:startTime="3013033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="simply truncated versions of SHA-256 and SHA-512 using different initial values." xmpDM:startTime="3013033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-224 matches the key length of two-key triple-DES [Source: Wikipedia]" xmpDM:startTime="3013033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview 1." xmpDM:startTime="3287267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append padding bits 2." xmpDM:startTime="3287267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append length 80 Rounds" xmpDM:startTime="3287267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function Conditional fn Ch(e,f,g): if e then f else g = (e AND f) (Not e and g)" xmpDM:startTime="3429533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Majority Fn Maj(a, b, c): True if 2 of 3 args are true =(a AND b) (a AND c) (b" xmpDM:startTime="3429533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="AND c) Input sequence word Constant (see table)" xmpDM:startTime="3429533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview 1." xmpDM:startTime="3435967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append padding bits 2." xmpDM:startTime="3435967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append length 80 Rounds" xmpDM:startTime="3435967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2 SHA-256 uses 32-bit operations SHA-512 uses 64-bit operations Use different shift amounts and additive constants SHA-224 and SHA-384 are" xmpDM:startTime="3436267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="simply truncated versions of SHA-256 and SHA-512 using different initial values." xmpDM:startTime="3436267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-224 matches the key length of two-key triple-DES [Source: Wikipedia]" xmpDM:startTime="3436267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1 Algorithm 160 bit hash using 512 bit blocks and 32 bit operations Five passes (4 in MD5 and 3" xmpDM:startTime="3436500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="in MD4) of 16 operations each Maximum message size is 264 bit 512 bits are expanded to 5x512 bits: nth" xmpDM:startTime="3436500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="word = xor of n-3, n-8, n-14, and n-16 In SHA-1 these words are rotated left by one bit before" xmpDM:startTime="3436500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="xor Total 80 words: W0, ...," xmpDM:startTime="3436500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="W79 FIG05_09" xmpDM:startTime="3436500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2 SHA-256 uses 32-bit operations SHA-512 uses 64-bit operations Use different shift amounts and additive constants SHA-224 and SHA-384 are" xmpDM:startTime="3440033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="simply truncated versions of SHA-256 and SHA-512 using different initial values." xmpDM:startTime="3440033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-224 matches the key length of two-key triple-DES [Source: Wikipedia]" xmpDM:startTime="3440033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview 1." xmpDM:startTime="3440367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append padding bits 2." xmpDM:startTime="3440367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append length 80 Rounds" xmpDM:startTime="3440367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function Conditional fn Ch(e,f,g): if e then f else g = (e AND f) (Not e and g)" xmpDM:startTime="3440800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Majority Fn Maj(a, b, c): True if 2 of 3 args are true =(a AND b) (a AND c) (b" xmpDM:startTime="3440800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="AND c) Input sequence word Constant (see table)" xmpDM:startTime="3440800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview 1." xmpDM:startTime="3789167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append padding bits 2." xmpDM:startTime="3789167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append length 80 Rounds" xmpDM:startTime="3789167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2 SHA-256 uses 32-bit operations SHA-512 uses 64-bit operations Use different shift amounts and additive constants SHA-224 and SHA-384 are" xmpDM:startTime="3789767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="simply truncated versions of SHA-256 and SHA-512 using different initial values." xmpDM:startTime="3789767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-224 matches the key length of two-key triple-DES [Source: Wikipedia]" xmpDM:startTime="3789767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview 1." xmpDM:startTime="3815400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append padding bits 2." xmpDM:startTime="3815400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append length 80 Rounds" xmpDM:startTime="3815400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function Conditional fn Ch(e,f,g): if e then f else g = (e AND f) (Not e and g)" xmpDM:startTime="3815800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Majority Fn Maj(a, b, c): True if 2 of 3 args are true =(a AND b) (a AND c) (b" xmpDM:startTime="3815800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="AND c) Input sequence word Constant (see table)" xmpDM:startTime="3815800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="80-Word Input Sequence Wt= s1(Wt-2)+Wt-7+s0(Wt-15)+Wt-16 s0(x)=ROTR1(x)+ROTR8(x)+SHR7(x) s1(x)=ROTR19(x)+ROTR61(x)+SHR6(x) ROTRn(x)=rotate right by n bits SHRn(x)=Left shift n bits with padding by 0’s" xmpDM:startTime="3829600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="on the right + = Addition modulo 264" xmpDM:startTime="3829600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function Conditional fn Ch(e,f,g): if e then f else g = (e AND f) (Not e and g)" xmpDM:startTime="3973500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Majority Fn Maj(a, b, c): True if 2 of 3 args are true =(a AND b) (a AND c) (b" xmpDM:startTime="3973500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="AND c) Input sequence word Constant (see table)" xmpDM:startTime="3973500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="80-Word Input Sequence Wt= s1(Wt-2)+Wt-7+s0(Wt-15)+Wt-16 s0(x)=ROTR1(x)+ROTR8(x)+SHR7(x) s1(x)=ROTR19(x)+ROTR61(x)+SHR6(x) ROTRn(x)=rotate right by n bits SHRn(x)=Left shift n bits with padding by 0’s" xmpDM:startTime="3993667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="on the right + = Addition modulo 264" xmpDM:startTime="3993667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function Conditional fn Ch(e,f,g): if e then f else g = (e AND f) (Not e and g)" xmpDM:startTime="4018967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Majority Fn Maj(a, b, c): True if 2 of 3 args are true =(a AND b) (a AND c) (b" xmpDM:startTime="4018967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="AND c) Input sequence word Constant (see table)" xmpDM:startTime="4018967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="80-Word Input Sequence Wt= s1(Wt-2)+Wt-7+s0(Wt-15)+Wt-16 s0(x)=ROTR1(x)+ROTR8(x)+SHR7(x) s1(x)=ROTR19(x)+ROTR61(x)+SHR6(x) ROTRn(x)=rotate right by n bits SHRn(x)=Left shift n bits with padding by 0’s" xmpDM:startTime="4030533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="on the right + = Addition modulo 264" xmpDM:startTime="4030533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3 SHA-2 (esp." xmpDM:startTime="4031067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512) seems secure Shares same structure and mathematical operations as predecessors so have concern NIST announced in 2007 a competition" xmpDM:startTime="4031067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="for the SHA-3 Has had 3 rounds of narrowing down the selections Five algorithms advanced to the third (and final)" xmpDM:startTime="4031067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="round in December 2010 Final selection announced in 2012 Ref: http://en.wikipedia.org/wiki/NIST_hash_function_competition" xmpDM:startTime="4031067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4031067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3 Requirements Replace SHA-2 with SHA-3 in any use So use same hash sizes Preserve the online nature of SHA-2" xmpDM:startTime="4086233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="So must process small blocks (512 / 1024 bits) Evaluation criteria Security close to theoretical max for hash sizes Cost" xmpDM:startTime="4086233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="in time &amp; memory Characteristics: such as flexibility &amp; simplicity" xmpDM:startTime="4086233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3 SHA-2 (esp." xmpDM:startTime="4123667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512) seems secure Shares same structure and mathematical operations as predecessors so have concern NIST announced in 2007 a competition" xmpDM:startTime="4123667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="for the SHA-3 Has had 3 rounds of narrowing down the selections Five algorithms advanced to the third (and final)" xmpDM:startTime="4123667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="round in December 2010 Final selection announced in 2012 Ref: http://en.wikipedia.org/wiki/NIST_hash_function_competition" xmpDM:startTime="4123667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4123667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3 Requirements Replace SHA-2 with SHA-3 in any use So use same hash sizes Preserve the online nature of SHA-2" xmpDM:startTime="4135133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="So must process small blocks (512 / 1024 bits) Evaluation criteria Security close to theoretical max for hash sizes Cost" xmpDM:startTime="4135133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="in time &amp; memory Characteristics: such as flexibility &amp; simplicity" xmpDM:startTime="4135133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary Hash functions are used to get a digest of a message Must take variable size input, produce fixed size" xmpDM:startTime="4135667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="pseudorandom output, be efficient to compute Cryptographic hash functions should be preimage resistant, 2nd preimage resistant, and collision resistant Cryptographic" xmpDM:startTime="4135667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="hashes are used for message authentication, digital signatures, password storage SHA-1 produces 160 bit output, SHA-224, SHA-256, SHA-384, and SHA-512" xmpDM:startTime="4135667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="produce 224, 256, 384, and 512 bit outputs." xmpDM:startTime="4135667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="All consist of 80 rounds." xmpDM:startTime="4135667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3 designed but not yet required." xmpDM:startTime="4135667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4135667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3 Requirements Replace SHA-2 with SHA-3 in any use So use same hash sizes Preserve the online nature of SHA-2" xmpDM:startTime="4223000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="So must process small blocks (512 / 1024 bits) Evaluation criteria Security close to theoretical max for hash sizes Cost" xmpDM:startTime="4223000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="in time &amp; memory Characteristics: such as flexibility &amp; simplicity" xmpDM:startTime="4223000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3 SHA-2 (esp." xmpDM:startTime="4223333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512) seems secure Shares same structure and mathematical operations as predecessors so have concern NIST announced in 2007 a competition" xmpDM:startTime="4223333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="for the SHA-3 Has had 3 rounds of narrowing down the selections Five algorithms advanced to the third (and final)" xmpDM:startTime="4223333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="round in December 2010 Final selection announced in 2012 Ref: http://en.wikipedia.org/wiki/NIST_hash_function_competition" xmpDM:startTime="4223333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4223333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="80-Word Input Sequence Wt= s1(Wt-2)+Wt-7+s0(Wt-15)+Wt-16 s0(x)=ROTR1(x)+ROTR8(x)+SHR7(x) s1(x)=ROTR19(x)+ROTR61(x)+SHR6(x) ROTRn(x)=rotate right by n bits SHRn(x)=Left shift n bits with padding by 0’s" xmpDM:startTime="4223633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="on the right + = Addition modulo 264" xmpDM:startTime="4223633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function Conditional fn Ch(e,f,g): if e then f else g = (e AND f) (Not e and g)" xmpDM:startTime="4224133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Majority Fn Maj(a, b, c): True if 2 of 3 args are true =(a AND b) (a AND c) (b" xmpDM:startTime="4224133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="AND c) Input sequence word Constant (see table)" xmpDM:startTime="4224133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview 1." xmpDM:startTime="4224633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append padding bits 2." xmpDM:startTime="4224633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append length 80 Rounds" xmpDM:startTime="4224633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2 SHA-256 uses 32-bit operations SHA-512 uses 64-bit operations Use different shift amounts and additive constants SHA-224 and SHA-384 are" xmpDM:startTime="4225067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="simply truncated versions of SHA-256 and SHA-512 using different initial values." xmpDM:startTime="4225067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-224 matches the key length of two-key triple-DES [Source: Wikipedia]" xmpDM:startTime="4225067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview 1." xmpDM:startTime="4242033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append padding bits 2." xmpDM:startTime="4242033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append length 80 Rounds" xmpDM:startTime="4242033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function Conditional fn Ch(e,f,g): if e then f else g = (e AND f) (Not e and g)" xmpDM:startTime="4242367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Majority Fn Maj(a, b, c): True if 2 of 3 args are true =(a AND b) (a AND c) (b" xmpDM:startTime="4242367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="AND c) Input sequence word Constant (see table)" xmpDM:startTime="4242367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="80-Word Input Sequence Wt= s1(Wt-2)+Wt-7+s0(Wt-15)+Wt-16 s0(x)=ROTR1(x)+ROTR8(x)+SHR7(x) s1(x)=ROTR19(x)+ROTR61(x)+SHR6(x) ROTRn(x)=rotate right by n bits SHRn(x)=Left shift n bits with padding by 0’s" xmpDM:startTime="4242533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="on the right + = Addition modulo 264" xmpDM:startTime="4242533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3 SHA-2 (esp." xmpDM:startTime="4242733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512) seems secure Shares same structure and mathematical operations as predecessors so have concern NIST announced in 2007 a competition" xmpDM:startTime="4242733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="for the SHA-3 Has had 3 rounds of narrowing down the selections Five algorithms advanced to the third (and final)" xmpDM:startTime="4242733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="round in December 2010 Final selection announced in 2012 Ref: http://en.wikipedia.org/wiki/NIST_hash_function_competition" xmpDM:startTime="4242733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4242733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3 Requirements Replace SHA-2 with SHA-3 in any use So use same hash sizes Preserve the online nature of SHA-2" xmpDM:startTime="4243133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="So must process small blocks (512 / 1024 bits) Evaluation criteria Security close to theoretical max for hash sizes Cost" xmpDM:startTime="4243133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="in time &amp; memory Characteristics: such as flexibility &amp; simplicity" xmpDM:startTime="4243133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary Hash functions are used to get a digest of a message Must take variable size input, produce fixed size" xmpDM:startTime="4243667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="pseudorandom output, be efficient to compute Cryptographic hash functions should be preimage resistant, 2nd preimage resistant, and collision resistant Cryptographic" xmpDM:startTime="4243667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="hashes are used for message authentication, digital signatures, password storage SHA-1 produces 160 bit output, SHA-224, SHA-256, SHA-384, and SHA-512" xmpDM:startTime="4243667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="produce 224, 256, 384, and 512 bit outputs." xmpDM:startTime="4243667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="All consist of 80 rounds." xmpDM:startTime="4243667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3 designed but not yet required." xmpDM:startTime="4243667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4243667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 11 Compute the following hash function: for a 4-byte message M={m1, m2, m3, m4}={128, 252, 33, 19} All are" xmpDM:startTime="4248700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="decimal numbers." xmpDM:startTime="4248700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Check if the hash function is: A." xmpDM:startTime="4248700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Collision Resistant B." xmpDM:startTime="4248700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Pre-image resistant C." xmpDM:startTime="4248700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Second Pre-image Resistant Show counter examples for any property that is not satisfied." xmpDM:startTime="4248700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="TP_tmp" xmpDM:startTime="4248700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary Hash functions are used to get a digest of a message Must take variable size input, produce fixed size" xmpDM:startTime="4253367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="pseudorandom output, be efficient to compute Cryptographic hash functions should be preimage resistant, 2nd preimage resistant, and collision resistant Cryptographic" xmpDM:startTime="4253367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="hashes are used for message authentication, digital signatures, password storage SHA-1 produces 160 bit output, SHA-224, SHA-256, SHA-384, and SHA-512" xmpDM:startTime="4253367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="produce 224, 256, 384, and 512 bit outputs." xmpDM:startTime="4253367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="All consist of 80 rounds." xmpDM:startTime="4253367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3 designed but not yet required." xmpDM:startTime="4253367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4253367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3 Requirements Replace SHA-2 with SHA-3 in any use So use same hash sizes Preserve the online nature of SHA-2" xmpDM:startTime="4261433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="So must process small blocks (512 / 1024 bits) Evaluation criteria Security close to theoretical max for hash sizes Cost" xmpDM:startTime="4261433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="in time &amp; memory Characteristics: such as flexibility &amp; simplicity" xmpDM:startTime="4261433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3 SHA-2 (esp." xmpDM:startTime="4261767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512) seems secure Shares same structure and mathematical operations as predecessors so have concern NIST announced in 2007 a competition" xmpDM:startTime="4261767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="for the SHA-3 Has had 3 rounds of narrowing down the selections Five algorithms advanced to the third (and final)" xmpDM:startTime="4261767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="round in December 2010 Final selection announced in 2012 Ref: http://en.wikipedia.org/wiki/NIST_hash_function_competition" xmpDM:startTime="4261767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4261767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="80-Word Input Sequence Wt= s1(Wt-2)+Wt-7+s0(Wt-15)+Wt-16 s0(x)=ROTR1(x)+ROTR8(x)+SHR7(x) s1(x)=ROTR19(x)+ROTR61(x)+SHR6(x) ROTRn(x)=rotate right by n bits SHRn(x)=Left shift n bits with padding by 0’s" xmpDM:startTime="4262133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="on the right + = Addition modulo 264" xmpDM:startTime="4262133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function Conditional fn Ch(e,f,g): if e then f else g = (e AND f) (Not e and g)" xmpDM:startTime="4262633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Majority Fn Maj(a, b, c): True if 2 of 3 args are true =(a AND b) (a AND c) (b" xmpDM:startTime="4262633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="AND c) Input sequence word Constant (see table)" xmpDM:startTime="4262633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview 1." xmpDM:startTime="4265067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append padding bits 2." xmpDM:startTime="4265067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append length 80 Rounds" xmpDM:startTime="4265067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2 SHA-256 uses 32-bit operations SHA-512 uses 64-bit operations Use different shift amounts and additive constants SHA-224 and SHA-384 are" xmpDM:startTime="4265700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="simply truncated versions of SHA-256 and SHA-512 using different initial values." xmpDM:startTime="4265700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-224 matches the key length of two-key triple-DES [Source: Wikipedia]" xmpDM:startTime="4265700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1 Algorithm 160 bit hash using 512 bit blocks and 32 bit operations Five passes (4 in MD5 and 3" xmpDM:startTime="4266533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="in MD4) of 16 operations each Maximum message size is 264 bit 512 bits are expanded to 5x512 bits: nth" xmpDM:startTime="4266533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="word = xor of n-3, n-8, n-14, and n-16 In SHA-1 these words are rotated left by one bit before" xmpDM:startTime="4266533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="xor Total 80 words: W0, ...," xmpDM:startTime="4266533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="W79 FIG05_09" xmpDM:startTime="4266533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Secure Hash Algorithm (SHA) Successor to and similar to MD5 (by Ron Rivest) SHA-0: FIPS PUB 180, 1993." xmpDM:startTime="4266867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Withdrawn shortly after publ." xmpDM:startTime="4266867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1: FIPS PUB 180-1, 1995." xmpDM:startTime="4266867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="160 bit hash SHA-2: FIPS PUB 180-2, 2002 SHA-224 SHA-256 SHA-384 SHA-512 SHA-1 is used in TLS, SSL, PGP, SSH," xmpDM:startTime="4266867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="S/MIME, and IPsec Required by law in US Govt applications Used in Digital Signature Standard Pseudo-codes for SHA algorithms are" xmpDM:startTime="4266867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="available." xmpDM:startTime="4266867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="NIST certifies implementations." xmpDM:startTime="4266867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4266867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Block Ciphers as Hash Functions Can use block ciphers as hash functions Using H0=0 and zero-pad of final block Compute:" xmpDM:startTime="4267633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hi = EMi [Hi-1] And use final block as the hash value Similar to CBC but without a key Resulting" xmpDM:startTime="4267633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="hash is too small (64-bit) Both due to direct birthday attack And to “meet-in-the-middle” attack Other variants also susceptible to" xmpDM:startTime="4267633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="attack" xmpDM:startTime="4267633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hash Function Cryptanalysis Hash functions use iterative structure Process message in blocks Compression function f takes previous output and next" xmpDM:startTime="4268033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="block to produce next output If compression function is collision resistant, the entire structure is collision resistant [Merkle 89]" xmpDM:startTime="4268033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Probability of Hash Collisions Arbitrary length message Þ Fixed length hash Þ Many messages will map to the same hash" xmpDM:startTime="4268267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Given 1000 bit messages Þ 21000 messages 128 bit hash Þ 2128 possible hashes Þ 21000/2128 = 2872 messages/hash value" xmpDM:startTime="4268267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="n-bit hash Þ Need avg 2n/2 tries to find two messages with same hash 64 bit hash Þ 232 tries" xmpDM:startTime="4268267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="(feasible) 128 bit hash Þ 264 tries (not feasible)" xmpDM:startTime="4268267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hash Function Cryptanalysis Hash functions use iterative structure Process message in blocks Compression function f takes previous output and next" xmpDM:startTime="4271033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="block to produce next output If compression function is collision resistant, the entire structure is collision resistant [Merkle 89]" xmpDM:startTime="4271033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Block Ciphers as Hash Functions Can use block ciphers as hash functions Using H0=0 and zero-pad of final block Compute:" xmpDM:startTime="4381300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hi = EMi [Hi-1] And use final block as the hash value Similar to CBC but without a key Resulting" xmpDM:startTime="4381300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="hash is too small (64-bit) Both due to direct birthday attack And to “meet-in-the-middle” attack Other variants also susceptible to" xmpDM:startTime="4381300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="attack" xmpDM:startTime="4381300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Secure Hash Algorithm (SHA) Successor to and similar to MD5 (by Ron Rivest) SHA-0: FIPS PUB 180, 1993." xmpDM:startTime="4381500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Withdrawn shortly after publ." xmpDM:startTime="4381500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1: FIPS PUB 180-1, 1995." xmpDM:startTime="4381500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="160 bit hash SHA-2: FIPS PUB 180-2, 2002 SHA-224 SHA-256 SHA-384 SHA-512 SHA-1 is used in TLS, SSL, PGP, SSH," xmpDM:startTime="4381500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="S/MIME, and IPsec Required by law in US Govt applications Used in Digital Signature Standard Pseudo-codes for SHA algorithms are" xmpDM:startTime="4381500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="available." xmpDM:startTime="4381500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="NIST certifies implementations." xmpDM:startTime="4381500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4381500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1 Algorithm 160 bit hash using 512 bit blocks and 32 bit operations Five passes (4 in MD5 and 3" xmpDM:startTime="4381633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="in MD4) of 16 operations each Maximum message size is 264 bit 512 bits are expanded to 5x512 bits: nth" xmpDM:startTime="4381633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="word = xor of n-3, n-8, n-14, and n-16 In SHA-1 these words are rotated left by one bit before" xmpDM:startTime="4381633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="xor Total 80 words: W0, ...," xmpDM:startTime="4381633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="W79 FIG05_09" xmpDM:startTime="4381633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2 SHA-256 uses 32-bit operations SHA-512 uses 64-bit operations Use different shift amounts and additive constants SHA-224 and SHA-384 are" xmpDM:startTime="4381767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="simply truncated versions of SHA-256 and SHA-512 using different initial values." xmpDM:startTime="4381767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-224 matches the key length of two-key triple-DES [Source: Wikipedia]" xmpDM:startTime="4381767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview 1." xmpDM:startTime="4382167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append padding bits 2." xmpDM:startTime="4382167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append length 80 Rounds" xmpDM:startTime="4382167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function Conditional fn Ch(e,f,g): if e then f else g = (e AND f) (Not e and g)" xmpDM:startTime="4382667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Majority Fn Maj(a, b, c): True if 2 of 3 args are true =(a AND b) (a AND c) (b" xmpDM:startTime="4382667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="AND c) Input sequence word Constant (see table)" xmpDM:startTime="4382667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview 1." xmpDM:startTime="4417400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append padding bits 2." xmpDM:startTime="4417400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append length 80 Rounds" xmpDM:startTime="4417400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2 SHA-256 uses 32-bit operations SHA-512 uses 64-bit operations Use different shift amounts and additive constants SHA-224 and SHA-384 are" xmpDM:startTime="4417700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="simply truncated versions of SHA-256 and SHA-512 using different initial values." xmpDM:startTime="4417700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-224 matches the key length of two-key triple-DES [Source: Wikipedia]" xmpDM:startTime="4417700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1 Algorithm 160 bit hash using 512 bit blocks and 32 bit operations Five passes (4 in MD5 and 3" xmpDM:startTime="4418367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="in MD4) of 16 operations each Maximum message size is 264 bit 512 bits are expanded to 5x512 bits: nth" xmpDM:startTime="4418367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="word = xor of n-3, n-8, n-14, and n-16 In SHA-1 these words are rotated left by one bit before" xmpDM:startTime="4418367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="xor Total 80 words: W0, ...," xmpDM:startTime="4418367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="W79 FIG05_09" xmpDM:startTime="4418367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Secure Hash Algorithm (SHA) Successor to and similar to MD5 (by Ron Rivest) SHA-0: FIPS PUB 180, 1993." xmpDM:startTime="4418967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Withdrawn shortly after publ." xmpDM:startTime="4418967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1: FIPS PUB 180-1, 1995." xmpDM:startTime="4418967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="160 bit hash SHA-2: FIPS PUB 180-2, 2002 SHA-224 SHA-256 SHA-384 SHA-512 SHA-1 is used in TLS, SSL, PGP, SSH," xmpDM:startTime="4418967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="S/MIME, and IPsec Required by law in US Govt applications Used in Digital Signature Standard Pseudo-codes for SHA algorithms are" xmpDM:startTime="4418967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="available." xmpDM:startTime="4418967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="NIST certifies implementations." xmpDM:startTime="4418967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4418967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Block Ciphers as Hash Functions Can use block ciphers as hash functions Using H0=0 and zero-pad of final block Compute:" xmpDM:startTime="4419467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hi = EMi [Hi-1] And use final block as the hash value Similar to CBC but without a key Resulting" xmpDM:startTime="4419467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="hash is too small (64-bit) Both due to direct birthday attack And to “meet-in-the-middle” attack Other variants also susceptible to" xmpDM:startTime="4419467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="attack" xmpDM:startTime="4419467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hash Function Cryptanalysis Hash functions use iterative structure Process message in blocks Compression function f takes previous output and next" xmpDM:startTime="4420167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="block to produce next output If compression function is collision resistant, the entire structure is collision resistant [Merkle 89]" xmpDM:startTime="4420167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Block Ciphers as Hash Functions Can use block ciphers as hash functions Using H0=0 and zero-pad of final block Compute:" xmpDM:startTime="4453500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hi = EMi [Hi-1] And use final block as the hash value Similar to CBC but without a key Resulting" xmpDM:startTime="4453500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="hash is too small (64-bit) Both due to direct birthday attack And to “meet-in-the-middle” attack Other variants also susceptible to" xmpDM:startTime="4453500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="attack" xmpDM:startTime="4453500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Secure Hash Algorithm (SHA) Successor to and similar to MD5 (by Ron Rivest) SHA-0: FIPS PUB 180, 1993." xmpDM:startTime="4454033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Withdrawn shortly after publ." xmpDM:startTime="4454033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1: FIPS PUB 180-1, 1995." xmpDM:startTime="4454033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="160 bit hash SHA-2: FIPS PUB 180-2, 2002 SHA-224 SHA-256 SHA-384 SHA-512 SHA-1 is used in TLS, SSL, PGP, SSH," xmpDM:startTime="4454033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="S/MIME, and IPsec Required by law in US Govt applications Used in Digital Signature Standard Pseudo-codes for SHA algorithms are" xmpDM:startTime="4454033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="available." xmpDM:startTime="4454033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="NIST certifies implementations." xmpDM:startTime="4454033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4454033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1 Algorithm 160 bit hash using 512 bit blocks and 32 bit operations Five passes (4 in MD5 and 3" xmpDM:startTime="4455533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="in MD4) of 16 operations each Maximum message size is 264 bit 512 bits are expanded to 5x512 bits: nth" xmpDM:startTime="4455533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="word = xor of n-3, n-8, n-14, and n-16 In SHA-1 these words are rotated left by one bit before" xmpDM:startTime="4455533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="xor Total 80 words: W0, ...," xmpDM:startTime="4455533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="W79 FIG05_09" xmpDM:startTime="4455533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2 SHA-256 uses 32-bit operations SHA-512 uses 64-bit operations Use different shift amounts and additive constants SHA-224 and SHA-384 are" xmpDM:startTime="4456033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="simply truncated versions of SHA-256 and SHA-512 using different initial values." xmpDM:startTime="4456033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-224 matches the key length of two-key triple-DES [Source: Wikipedia]" xmpDM:startTime="4456033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview 1." xmpDM:startTime="4457167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append padding bits 2." xmpDM:startTime="4457167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append length 80 Rounds" xmpDM:startTime="4457167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function Conditional fn Ch(e,f,g): if e then f else g = (e AND f) (Not e and g)" xmpDM:startTime="4458000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Majority Fn Maj(a, b, c): True if 2 of 3 args are true =(a AND b) (a AND c) (b" xmpDM:startTime="4458000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="AND c) Input sequence word Constant (see table)" xmpDM:startTime="4458000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview 1." xmpDM:startTime="4475767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append padding bits 2." xmpDM:startTime="4475767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append length 80 Rounds" xmpDM:startTime="4475767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2 SHA-256 uses 32-bit operations SHA-512 uses 64-bit operations Use different shift amounts and additive constants SHA-224 and SHA-384 are" xmpDM:startTime="4476400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="simply truncated versions of SHA-256 and SHA-512 using different initial values." xmpDM:startTime="4476400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-224 matches the key length of two-key triple-DES [Source: Wikipedia]" xmpDM:startTime="4476400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1 Algorithm 160 bit hash using 512 bit blocks and 32 bit operations Five passes (4 in MD5 and 3" xmpDM:startTime="4477367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="in MD4) of 16 operations each Maximum message size is 264 bit 512 bits are expanded to 5x512 bits: nth" xmpDM:startTime="4477367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="word = xor of n-3, n-8, n-14, and n-16 In SHA-1 these words are rotated left by one bit before" xmpDM:startTime="4477367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="xor Total 80 words: W0, ...," xmpDM:startTime="4477367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="W79 FIG05_09" xmpDM:startTime="4477367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2 SHA-256 uses 32-bit operations SHA-512 uses 64-bit operations Use different shift amounts and additive constants SHA-224 and SHA-384 are" xmpDM:startTime="4522333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="simply truncated versions of SHA-256 and SHA-512 using different initial values." xmpDM:startTime="4522333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-224 matches the key length of two-key triple-DES [Source: Wikipedia]" xmpDM:startTime="4522333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview 1." xmpDM:startTime="4522767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append padding bits 2." xmpDM:startTime="4522767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append length 80 Rounds" xmpDM:startTime="4522767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function Conditional fn Ch(e,f,g): if e then f else g = (e AND f) (Not e and g)" xmpDM:startTime="4523400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Majority Fn Maj(a, b, c): True if 2 of 3 args are true =(a AND b) (a AND c) (b" xmpDM:startTime="4523400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="AND c) Input sequence word Constant (see table)" xmpDM:startTime="4523400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="80-Word Input Sequence Wt= s1(Wt-2)+Wt-7+s0(Wt-15)+Wt-16 s0(x)=ROTR1(x)+ROTR8(x)+SHR7(x) s1(x)=ROTR19(x)+ROTR61(x)+SHR6(x) ROTRn(x)=rotate right by n bits SHRn(x)=Left shift n bits with padding by 0’s" xmpDM:startTime="4524000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="on the right + = Addition modulo 264" xmpDM:startTime="4524000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function Conditional fn Ch(e,f,g): if e then f else g = (e AND f) (Not e and g)" xmpDM:startTime="4542200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Majority Fn Maj(a, b, c): True if 2 of 3 args are true =(a AND b) (a AND c) (b" xmpDM:startTime="4542200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="AND c) Input sequence word Constant (see table)" xmpDM:startTime="4542200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview 1." xmpDM:startTime="4563067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append padding bits 2." xmpDM:startTime="4563067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append length 80 Rounds" xmpDM:startTime="4563067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function Conditional fn Ch(e,f,g): if e then f else g = (e AND f) (Not e and g)" xmpDM:startTime="4563967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Majority Fn Maj(a, b, c): True if 2 of 3 args are true =(a AND b) (a AND c) (b" xmpDM:startTime="4563967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="AND c) Input sequence word Constant (see table)" xmpDM:startTime="4563967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="80-Word Input Sequence Wt= s1(Wt-2)+Wt-7+s0(Wt-15)+Wt-16 s0(x)=ROTR1(x)+ROTR8(x)+SHR7(x) s1(x)=ROTR19(x)+ROTR61(x)+SHR6(x) ROTRn(x)=rotate right by n bits SHRn(x)=Left shift n bits with padding by 0’s" xmpDM:startTime="4566400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="on the right + = Addition modulo 264" xmpDM:startTime="4566400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3 SHA-2 (esp." xmpDM:startTime="4587500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512) seems secure Shares same structure and mathematical operations as predecessors so have concern NIST announced in 2007 a competition" xmpDM:startTime="4587500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="for the SHA-3 Has had 3 rounds of narrowing down the selections Five algorithms advanced to the third (and final)" xmpDM:startTime="4587500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="round in December 2010 Final selection announced in 2012 Ref: http://en.wikipedia.org/wiki/NIST_hash_function_competition" xmpDM:startTime="4587500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4587500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="80-Word Input Sequence Wt= s1(Wt-2)+Wt-7+s0(Wt-15)+Wt-16 s0(x)=ROTR1(x)+ROTR8(x)+SHR7(x) s1(x)=ROTR19(x)+ROTR61(x)+SHR6(x) ROTRn(x)=rotate right by n bits SHRn(x)=Left shift n bits with padding by 0’s" xmpDM:startTime="4588400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="on the right + = Addition modulo 264" xmpDM:startTime="4588400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function Conditional fn Ch(e,f,g): if e then f else g = (e AND f) (Not e and g)" xmpDM:startTime="4588900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Majority Fn Maj(a, b, c): True if 2 of 3 args are true =(a AND b) (a AND c) (b" xmpDM:startTime="4588900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="AND c) Input sequence word Constant (see table)" xmpDM:startTime="4588900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="80-Word Input Sequence Wt= s1(Wt-2)+Wt-7+s0(Wt-15)+Wt-16 s0(x)=ROTR1(x)+ROTR8(x)+SHR7(x) s1(x)=ROTR19(x)+ROTR61(x)+SHR6(x) ROTRn(x)=rotate right by n bits SHRn(x)=Left shift n bits with padding by 0’s" xmpDM:startTime="4654233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="on the right + = Addition modulo 264" xmpDM:startTime="4654233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function Conditional fn Ch(e,f,g): if e then f else g = (e AND f) (Not e and g)" xmpDM:startTime="4661133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Majority Fn Maj(a, b, c): True if 2 of 3 args are true =(a AND b) (a AND c) (b" xmpDM:startTime="4661133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="AND c) Input sequence word Constant (see table)" xmpDM:startTime="4661133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview 1." xmpDM:startTime="4667400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append padding bits 2." xmpDM:startTime="4667400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append length 80 Rounds" xmpDM:startTime="4667400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2 SHA-256 uses 32-bit operations SHA-512 uses 64-bit operations Use different shift amounts and additive constants SHA-224 and SHA-384 are" xmpDM:startTime="4667900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="simply truncated versions of SHA-256 and SHA-512 using different initial values." xmpDM:startTime="4667900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-224 matches the key length of two-key triple-DES [Source: Wikipedia]" xmpDM:startTime="4667900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1 Algorithm 160 bit hash using 512 bit blocks and 32 bit operations Five passes (4 in MD5 and 3" xmpDM:startTime="4668367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="in MD4) of 16 operations each Maximum message size is 264 bit 512 bits are expanded to 5x512 bits: nth" xmpDM:startTime="4668367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="word = xor of n-3, n-8, n-14, and n-16 In SHA-1 these words are rotated left by one bit before" xmpDM:startTime="4668367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="xor Total 80 words: W0, ...," xmpDM:startTime="4668367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="W79 FIG05_09" xmpDM:startTime="4668367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2 SHA-256 uses 32-bit operations SHA-512 uses 64-bit operations Use different shift amounts and additive constants SHA-224 and SHA-384 are" xmpDM:startTime="4678267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="simply truncated versions of SHA-256 and SHA-512 using different initial values." xmpDM:startTime="4678267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-224 matches the key length of two-key triple-DES [Source: Wikipedia]" xmpDM:startTime="4678267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview 1." xmpDM:startTime="4678567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append padding bits 2." xmpDM:startTime="4678567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Append length 80 Rounds" xmpDM:startTime="4678567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function Conditional fn Ch(e,f,g): if e then f else g = (e AND f) (Not e and g)" xmpDM:startTime="4678867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Majority Fn Maj(a, b, c): True if 2 of 3 args are true =(a AND b) (a AND c) (b" xmpDM:startTime="4678867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="AND c) Input sequence word Constant (see table)" xmpDM:startTime="4678867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="80-Word Input Sequence Wt= s1(Wt-2)+Wt-7+s0(Wt-15)+Wt-16 s0(x)=ROTR1(x)+ROTR8(x)+SHR7(x) s1(x)=ROTR19(x)+ROTR61(x)+SHR6(x) ROTRn(x)=rotate right by n bits SHRn(x)=Left shift n bits with padding by 0’s" xmpDM:startTime="4679167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="on the right + = Addition modulo 264" xmpDM:startTime="4679167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3 SHA-2 (esp." xmpDM:startTime="4679467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512) seems secure Shares same structure and mathematical operations as predecessors so have concern NIST announced in 2007 a competition" xmpDM:startTime="4679467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="for the SHA-3 Has had 3 rounds of narrowing down the selections Five algorithms advanced to the third (and final)" xmpDM:startTime="4679467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="round in December 2010 Final selection announced in 2012 Ref: http://en.wikipedia.org/wiki/NIST_hash_function_competition" xmpDM:startTime="4679467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4679467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3 Requirements Replace SHA-2 with SHA-3 in any use So use same hash sizes Preserve the online nature of SHA-2" xmpDM:startTime="4679933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="So must process small blocks (512 / 1024 bits) Evaluation criteria Security close to theoretical max for hash sizes Cost" xmpDM:startTime="4679933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="in time &amp; memory Characteristics: such as flexibility &amp; simplicity" xmpDM:startTime="4679933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary Hash functions are used to get a digest of a message Must take variable size input, produce fixed size" xmpDM:startTime="4680200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="pseudorandom output, be efficient to compute Cryptographic hash functions should be preimage resistant, 2nd preimage resistant, and collision resistant Cryptographic" xmpDM:startTime="4680200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="hashes are used for message authentication, digital signatures, password storage SHA-1 produces 160 bit output, SHA-224, SHA-256, SHA-384, and SHA-512" xmpDM:startTime="4680200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="produce 224, 256, 384, and 512 bit outputs." xmpDM:startTime="4680200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="All consist of 80 rounds." xmpDM:startTime="4680200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3 designed but not yet required." xmpDM:startTime="4680200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4680200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 11 Compute the following hash function: for a 4-byte message M={m1, m2, m3, m4}={128, 252, 33, 19} All are" xmpDM:startTime="4680500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="decimal numbers." xmpDM:startTime="4680500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Check if the hash function is: A." xmpDM:startTime="4680500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Collision Resistant B." xmpDM:startTime="4680500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Pre-image resistant C." xmpDM:startTime="4680500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Second Pre-image Resistant Show counter examples for any property that is not satisfied." xmpDM:startTime="4680500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="TP_tmp" xmpDM:startTime="4680500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Lab 11: Man-in-the-Middle Attack In this lab, you will perform man-in-the-middle-attack using Kali Linux Please do it on your network" xmpDM:startTime="4682133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="at home and don’t do it when connected to WUSTL network You need to have two computers or a computer" xmpDM:startTime="4682133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="for Kali and your phone/iPad as a target https://en.wikipedia.org/wiki/Man-in-the-middle_attack" xmpDM:startTime="4682133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4682133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 11 Compute the following hash function: for a 4-byte message M={m1, m2, m3, m4}={128, 252, 33, 19} All are" xmpDM:startTime="4683433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="decimal numbers." xmpDM:startTime="4683433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Check if the hash function is: A." xmpDM:startTime="4683433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Collision Resistant B." xmpDM:startTime="4683433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Pre-image resistant C." xmpDM:startTime="4683433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Second Pre-image Resistant Show counter examples for any property that is not satisfied." xmpDM:startTime="4683433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="TP_tmp" xmpDM:startTime="4683433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Lab 11: Man-in-the-Middle Attack In this lab, you will perform man-in-the-middle-attack using Kali Linux Please do it on your network" xmpDM:startTime="4699967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="at home and don’t do it when connected to WUSTL network You need to have two computers or a computer" xmpDM:startTime="4699967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="for Kali and your phone/iPad as a target https://en.wikipedia.org/wiki/Man-in-the-middle_attack" xmpDM:startTime="4699967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4699967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Lab 11 (Cont) Login to Kali Linux from live USB Install bettercap program to Kali apt-get install bettercap Explore bettercap" xmpDM:startTime="4726533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="options using help option Know your target’s IP address Use ipconfig/ifconfig on laptops iPhone/iPad: Settings WiFi touch (i) symbol on" xmpDM:startTime="4726533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="the network name Use an app on other mobiles Run bettercap sniffer with the right options to explore devices in" xmpDM:startTime="4726533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="your network." xmpDM:startTime="4726533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="These are the devices that you can target." xmpDM:startTime="4726533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Some devices on your network may not be seen by bettercap." xmpDM:startTime="4726533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Those devices can not be targeted." xmpDM:startTime="4726533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Stop bettercap" xmpDM:startTime="4726533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Lab 11 (Cont) Find the correct options in bettercap that define the target, interface and parsers Run the following command" xmpDM:startTime="4729433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="bettercap -X1 YOUR_TARGET_IP –X2 YOUR_INTERFACE --proxy –X3 POST Here, X1 is the option for target, X2 is the option for" xmpDM:startTime="4729433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="the interface, and X3 is the option for parsers On your target, access https://login.libproxy.wustl.edu/login" xmpDM:startTime="4729433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Note that this is https Login with your username and a random password Capture Kali output." xmpDM:startTime="4729433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Submit a screen shot of the output along with all the commands you used in Kali" xmpDM:startTime="4729433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Lab 11 (Cont) Login to Kali Linux from live USB Install bettercap program to Kali apt-get install bettercap Explore bettercap" xmpDM:startTime="4760800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="options using help option Know your target’s IP address Use ipconfig/ifconfig on laptops iPhone/iPad: Settings WiFi touch (i) symbol on" xmpDM:startTime="4760800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="the network name Use an app on other mobiles Run bettercap sniffer with the right options to explore devices in" xmpDM:startTime="4760800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="your network." xmpDM:startTime="4760800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="These are the devices that you can target." xmpDM:startTime="4760800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Some devices on your network may not be seen by bettercap." xmpDM:startTime="4760800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Those devices can not be targeted." xmpDM:startTime="4760800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Stop bettercap" xmpDM:startTime="4760800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Lab 11: Man-in-the-Middle Attack In this lab, you will perform man-in-the-middle-attack using Kali Linux Please do it on your network" xmpDM:startTime="4761000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="at home and don’t do it when connected to WUSTL network You need to have two computers or a computer" xmpDM:startTime="4761000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="for Kali and your phone/iPad as a target https://en.wikipedia.org/wiki/Man-in-the-middle_attack" xmpDM:startTime="4761000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4761000" xmpDM:duration="1000"/></rdf:li></rdf:Seq>
                     </xmpDM:markers>
                  </rdf:Description>
               </rdf:li>
               <rdf:li>
                  <rdf:Description xmpDM:trackType="TableOfContents" xmpDM:frameRate="f1000" xmpDM:trackName="Table of Contents">
                     <xmpDM:markers>
                        <rdf:Seq>
                           <rdf:li><rdf:Description xmpDM:name="Cryptographic Hash Functions" xmpDM:startTime="0" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="0" tscDM:imageoffset="0" tscDM:imagerect="0, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Overview" xmpDM:startTime="10767" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="1" tscDM:imageoffset="0" tscDM:imagerect="75, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hash Function" xmpDM:startTime="31433" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="2" tscDM:imageoffset="0" tscDM:imagerect="150, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Cryptographic Hash Functions" xmpDM:startTime="205367" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="3" tscDM:imageoffset="0" tscDM:imagerect="225, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="End of presentation" xmpDM:startTime="205433" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="4" tscDM:imageoffset="0" tscDM:imagerect="300, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Cryptographic Hash Functions" xmpDM:startTime="231567" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="5" tscDM:imageoffset="0" tscDM:imagerect="375, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hash Function" xmpDM:startTime="232133" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="6" tscDM:imageoffset="0" tscDM:imagerect="450, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Cryptographic Hash Functions" xmpDM:startTime="236300" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="7" tscDM:imageoffset="0" tscDM:imagerect="525, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Examples of Crypto Hash Functions" xmpDM:startTime="411567" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="8" tscDM:imageoffset="0" tscDM:imagerect="600, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Applications of Crypto Hash Fn" xmpDM:startTime="489533" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="9" tscDM:imageoffset="0" tscDM:imagerect="675, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Birthday Problem" xmpDM:startTime="986900" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="10" tscDM:imageoffset="0" tscDM:imagerect="750, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Birthday Problem (Cont)" xmpDM:startTime="1250400" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="11" tscDM:imageoffset="0" tscDM:imagerect="825, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Probability of Hash Collisions" xmpDM:startTime="1316333" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="12" tscDM:imageoffset="0" tscDM:imagerect="900, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Birthday Problem (Cont)" xmpDM:startTime="1414300" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="13" tscDM:imageoffset="0" tscDM:imagerect="975, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="End of presentation" xmpDM:startTime="1451467" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="14" tscDM:imageoffset="0" tscDM:imagerect="1050, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Birthday Problem (Cont)" xmpDM:startTime="1499733" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="15" tscDM:imageoffset="0" tscDM:imagerect="1125, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Probability of Hash Collisions" xmpDM:startTime="1511600" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="16" tscDM:imageoffset="0" tscDM:imagerect="1200, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hash Function Cryptanalysis" xmpDM:startTime="1558833" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="17" tscDM:imageoffset="0" tscDM:imagerect="1275, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Block Ciphers as Hash Functions" xmpDM:startTime="1632100" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="18" tscDM:imageoffset="0" tscDM:imagerect="1350, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hash Function Cryptanalysis" xmpDM:startTime="1762467" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="19" tscDM:imageoffset="0" tscDM:imagerect="1425, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Block Ciphers as Hash Functions" xmpDM:startTime="1765133" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="20" tscDM:imageoffset="0" tscDM:imagerect="1500, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hash Function Cryptanalysis" xmpDM:startTime="1767600" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="21" tscDM:imageoffset="0" tscDM:imagerect="1575, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Block Ciphers as Hash Functions" xmpDM:startTime="2029700" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="22" tscDM:imageoffset="0" tscDM:imagerect="1650, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Secure Hash Algorithm (SHA)" xmpDM:startTime="2182900" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="23" tscDM:imageoffset="0" tscDM:imagerect="1725, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1 Algorithm" xmpDM:startTime="2598500" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="24" tscDM:imageoffset="0" tscDM:imagerect="1800, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2" xmpDM:startTime="2791633" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="25" tscDM:imageoffset="0" tscDM:imagerect="1875, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1 Algorithm" xmpDM:startTime="2793000" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="26" tscDM:imageoffset="0" tscDM:imagerect="1950, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Secure Hash Algorithm (SHA)" xmpDM:startTime="2925667" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="27" tscDM:imageoffset="0" tscDM:imagerect="2025, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Block Ciphers as Hash Functions" xmpDM:startTime="2926167" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="28" tscDM:imageoffset="0" tscDM:imagerect="2100, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hash Function Cryptanalysis" xmpDM:startTime="2926700" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="29" tscDM:imageoffset="0" tscDM:imagerect="2175, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Block Ciphers as Hash Functions" xmpDM:startTime="2941933" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="30" tscDM:imageoffset="0" tscDM:imagerect="2250, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Secure Hash Algorithm (SHA)" xmpDM:startTime="2942600" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="31" tscDM:imageoffset="0" tscDM:imagerect="2325, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1 Algorithm" xmpDM:startTime="2943700" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="32" tscDM:imageoffset="0" tscDM:imagerect="2400, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2" xmpDM:startTime="3013033" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="33" tscDM:imageoffset="0" tscDM:imagerect="2475, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview" xmpDM:startTime="3287267" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="34" tscDM:imageoffset="0" tscDM:imagerect="2550, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function" xmpDM:startTime="3429533" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="35" tscDM:imageoffset="0" tscDM:imagerect="2625, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview" xmpDM:startTime="3435967" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="36" tscDM:imageoffset="0" tscDM:imagerect="2700, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2" xmpDM:startTime="3436267" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="37" tscDM:imageoffset="0" tscDM:imagerect="2775, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1 Algorithm" xmpDM:startTime="3436500" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="38" tscDM:imageoffset="0" tscDM:imagerect="2850, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2" xmpDM:startTime="3440033" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="39" tscDM:imageoffset="0" tscDM:imagerect="2925, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview" xmpDM:startTime="3440367" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="40" tscDM:imageoffset="0" tscDM:imagerect="3000, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function" xmpDM:startTime="3440800" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="41" tscDM:imageoffset="0" tscDM:imagerect="3075, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview" xmpDM:startTime="3789167" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="42" tscDM:imageoffset="0" tscDM:imagerect="3150, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2" xmpDM:startTime="3789767" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="43" tscDM:imageoffset="0" tscDM:imagerect="3225, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview" xmpDM:startTime="3815400" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="44" tscDM:imageoffset="0" tscDM:imagerect="3300, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function" xmpDM:startTime="3815800" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="45" tscDM:imageoffset="0" tscDM:imagerect="3375, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="80-Word Input Sequence" xmpDM:startTime="3829600" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="46" tscDM:imageoffset="0" tscDM:imagerect="3450, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function" xmpDM:startTime="3973500" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="47" tscDM:imageoffset="0" tscDM:imagerect="3525, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="80-Word Input Sequence" xmpDM:startTime="3993667" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="48" tscDM:imageoffset="0" tscDM:imagerect="3600, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function" xmpDM:startTime="4018967" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="49" tscDM:imageoffset="0" tscDM:imagerect="3675, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="80-Word Input Sequence" xmpDM:startTime="4030533" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="50" tscDM:imageoffset="0" tscDM:imagerect="3750, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3" xmpDM:startTime="4031067" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="51" tscDM:imageoffset="0" tscDM:imagerect="3825, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3 Requirements" xmpDM:startTime="4086233" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="52" tscDM:imageoffset="0" tscDM:imagerect="3900, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3" xmpDM:startTime="4123667" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="53" tscDM:imageoffset="0" tscDM:imagerect="3975, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3 Requirements" xmpDM:startTime="4135133" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="54" tscDM:imageoffset="0" tscDM:imagerect="50, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary" xmpDM:startTime="4135667" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="55" tscDM:imageoffset="0" tscDM:imagerect="125, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3 Requirements" xmpDM:startTime="4223000" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="56" tscDM:imageoffset="0" tscDM:imagerect="200, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3" xmpDM:startTime="4223333" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="57" tscDM:imageoffset="0" tscDM:imagerect="275, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="80-Word Input Sequence" xmpDM:startTime="4223633" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="58" tscDM:imageoffset="0" tscDM:imagerect="350, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function" xmpDM:startTime="4224133" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="59" tscDM:imageoffset="0" tscDM:imagerect="425, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview" xmpDM:startTime="4224633" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="60" tscDM:imageoffset="0" tscDM:imagerect="500, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2" xmpDM:startTime="4225067" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="61" tscDM:imageoffset="0" tscDM:imagerect="575, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview" xmpDM:startTime="4242033" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="62" tscDM:imageoffset="0" tscDM:imagerect="650, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function" xmpDM:startTime="4242367" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="63" tscDM:imageoffset="0" tscDM:imagerect="725, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="80-Word Input Sequence" xmpDM:startTime="4242533" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="64" tscDM:imageoffset="0" tscDM:imagerect="800, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3" xmpDM:startTime="4242733" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="65" tscDM:imageoffset="0" tscDM:imagerect="875, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3 Requirements" xmpDM:startTime="4243133" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="66" tscDM:imageoffset="0" tscDM:imagerect="950, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary" xmpDM:startTime="4243667" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="67" tscDM:imageoffset="0" tscDM:imagerect="1025, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 11" xmpDM:startTime="4248700" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="68" tscDM:imageoffset="0" tscDM:imagerect="1100, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary" xmpDM:startTime="4253367" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="69" tscDM:imageoffset="0" tscDM:imagerect="1175, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3 Requirements" xmpDM:startTime="4261433" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="70" tscDM:imageoffset="0" tscDM:imagerect="1250, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3" xmpDM:startTime="4261767" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="71" tscDM:imageoffset="0" tscDM:imagerect="1325, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="80-Word Input Sequence" xmpDM:startTime="4262133" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="72" tscDM:imageoffset="0" tscDM:imagerect="1400, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function" xmpDM:startTime="4262633" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="73" tscDM:imageoffset="0" tscDM:imagerect="1475, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview" xmpDM:startTime="4265067" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="74" tscDM:imageoffset="0" tscDM:imagerect="1550, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2" xmpDM:startTime="4265700" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="75" tscDM:imageoffset="0" tscDM:imagerect="1625, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1 Algorithm" xmpDM:startTime="4266533" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="76" tscDM:imageoffset="0" tscDM:imagerect="1700, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Secure Hash Algorithm (SHA)" xmpDM:startTime="4266867" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="77" tscDM:imageoffset="0" tscDM:imagerect="1775, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Block Ciphers as Hash Functions" xmpDM:startTime="4267633" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="78" tscDM:imageoffset="0" tscDM:imagerect="1850, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hash Function Cryptanalysis" xmpDM:startTime="4268033" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="79" tscDM:imageoffset="0" tscDM:imagerect="1925, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Probability of Hash Collisions" xmpDM:startTime="4268267" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="80" tscDM:imageoffset="0" tscDM:imagerect="2000, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hash Function Cryptanalysis" xmpDM:startTime="4271033" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="81" tscDM:imageoffset="0" tscDM:imagerect="2075, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Block Ciphers as Hash Functions" xmpDM:startTime="4381300" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="82" tscDM:imageoffset="0" tscDM:imagerect="2150, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Secure Hash Algorithm (SHA)" xmpDM:startTime="4381500" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="83" tscDM:imageoffset="0" tscDM:imagerect="2225, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1 Algorithm" xmpDM:startTime="4381633" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="84" tscDM:imageoffset="0" tscDM:imagerect="2300, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2" xmpDM:startTime="4381767" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="85" tscDM:imageoffset="0" tscDM:imagerect="2375, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview" xmpDM:startTime="4382167" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="86" tscDM:imageoffset="0" tscDM:imagerect="2450, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function" xmpDM:startTime="4382667" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="87" tscDM:imageoffset="0" tscDM:imagerect="2525, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview" xmpDM:startTime="4417400" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="88" tscDM:imageoffset="0" tscDM:imagerect="2600, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2" xmpDM:startTime="4417700" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="89" tscDM:imageoffset="0" tscDM:imagerect="2675, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1 Algorithm" xmpDM:startTime="4418367" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="90" tscDM:imageoffset="0" tscDM:imagerect="2750, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Secure Hash Algorithm (SHA)" xmpDM:startTime="4418967" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="91" tscDM:imageoffset="0" tscDM:imagerect="2825, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Block Ciphers as Hash Functions" xmpDM:startTime="4419467" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="92" tscDM:imageoffset="0" tscDM:imagerect="2900, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Hash Function Cryptanalysis" xmpDM:startTime="4420167" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="93" tscDM:imageoffset="0" tscDM:imagerect="2975, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Block Ciphers as Hash Functions" xmpDM:startTime="4453500" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="94" tscDM:imageoffset="0" tscDM:imagerect="3050, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Secure Hash Algorithm (SHA)" xmpDM:startTime="4454033" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="95" tscDM:imageoffset="0" tscDM:imagerect="3125, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1 Algorithm" xmpDM:startTime="4455533" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="96" tscDM:imageoffset="0" tscDM:imagerect="3200, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2" xmpDM:startTime="4456033" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="97" tscDM:imageoffset="0" tscDM:imagerect="3275, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview" xmpDM:startTime="4457167" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="98" tscDM:imageoffset="0" tscDM:imagerect="3350, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function" xmpDM:startTime="4458000" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="99" tscDM:imageoffset="0" tscDM:imagerect="3425, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview" xmpDM:startTime="4475767" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="100" tscDM:imageoffset="0" tscDM:imagerect="3500, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2" xmpDM:startTime="4476400" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="101" tscDM:imageoffset="0" tscDM:imagerect="3575, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1 Algorithm" xmpDM:startTime="4477367" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="102" tscDM:imageoffset="0" tscDM:imagerect="3650, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2" xmpDM:startTime="4522333" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="103" tscDM:imageoffset="0" tscDM:imagerect="3725, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview" xmpDM:startTime="4522767" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="104" tscDM:imageoffset="0" tscDM:imagerect="3800, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function" xmpDM:startTime="4523400" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="105" tscDM:imageoffset="0" tscDM:imagerect="3875, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="80-Word Input Sequence" xmpDM:startTime="4524000" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="106" tscDM:imageoffset="0" tscDM:imagerect="3950, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function" xmpDM:startTime="4542200" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="107" tscDM:imageoffset="0" tscDM:imagerect="25, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview" xmpDM:startTime="4563067" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="108" tscDM:imageoffset="0" tscDM:imagerect="100, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function" xmpDM:startTime="4563967" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="109" tscDM:imageoffset="0" tscDM:imagerect="175, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="80-Word Input Sequence" xmpDM:startTime="4566400" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="110" tscDM:imageoffset="0" tscDM:imagerect="250, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3" xmpDM:startTime="4587500" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="111" tscDM:imageoffset="0" tscDM:imagerect="325, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="80-Word Input Sequence" xmpDM:startTime="4588400" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="112" tscDM:imageoffset="0" tscDM:imagerect="400, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function" xmpDM:startTime="4588900" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="113" tscDM:imageoffset="0" tscDM:imagerect="475, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="80-Word Input Sequence" xmpDM:startTime="4654233" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="114" tscDM:imageoffset="0" tscDM:imagerect="550, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function" xmpDM:startTime="4661133" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="115" tscDM:imageoffset="0" tscDM:imagerect="625, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview" xmpDM:startTime="4667400" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="116" tscDM:imageoffset="0" tscDM:imagerect="700, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2" xmpDM:startTime="4667900" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="117" tscDM:imageoffset="0" tscDM:imagerect="775, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-1 Algorithm" xmpDM:startTime="4668367" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="118" tscDM:imageoffset="0" tscDM:imagerect="850, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-2" xmpDM:startTime="4678267" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="119" tscDM:imageoffset="0" tscDM:imagerect="925, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Overview" xmpDM:startTime="4678567" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="120" tscDM:imageoffset="0" tscDM:imagerect="1000, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-512 Round Function" xmpDM:startTime="4678867" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="121" tscDM:imageoffset="0" tscDM:imagerect="1075, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="80-Word Input Sequence" xmpDM:startTime="4679167" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="122" tscDM:imageoffset="0" tscDM:imagerect="1150, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3" xmpDM:startTime="4679467" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="123" tscDM:imageoffset="0" tscDM:imagerect="1225, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="SHA-3 Requirements" xmpDM:startTime="4679933" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="124" tscDM:imageoffset="0" tscDM:imagerect="1300, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary" xmpDM:startTime="4680200" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="125" tscDM:imageoffset="0" tscDM:imagerect="1375, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 11" xmpDM:startTime="4680500" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="126" tscDM:imageoffset="0" tscDM:imagerect="1450, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Lab 11: Man-in-the-Middle Attack" xmpDM:startTime="4682133" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="127" tscDM:imageoffset="0" tscDM:imagerect="1525, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 11" xmpDM:startTime="4683433" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="128" tscDM:imageoffset="0" tscDM:imagerect="1600, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Lab 11: Man-in-the-Middle Attack" xmpDM:startTime="4699967" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="129" tscDM:imageoffset="0" tscDM:imagerect="1675, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Lab 11 (Cont)" xmpDM:startTime="4726533" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="130" tscDM:imageoffset="0" tscDM:imagerect="1750, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Lab 11 (Cont) " xmpDM:startTime="4729433" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="131" tscDM:imageoffset="0" tscDM:imagerect="1825, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Lab 11 (Cont)" xmpDM:startTime="4760800" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="132" tscDM:imageoffset="0" tscDM:imagerect="1900, 112, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Lab 11: Man-in-the-Middle Attack" xmpDM:startTime="4761000" tscDM:image="l_11chf_Thumbnails.png" tscDM:imageindex="133" tscDM:imageoffset="0" tscDM:imagerect="1975, 112, 75, 56"/></rdf:li></rdf:Seq>
                     </xmpDM:markers>
                  </rdf:Description>
               </rdf:li>
            </rdf:Bag>
         </xmpDM:Tracks>
         <tscDM:controller>
            <rdf:Description xmpDM:name="tscplayer">
               <tscDM:parameters>
                  <rdf:Bag>
                     <rdf:li xmpDM:name="autohide" xmpDM:value="false"/><rdf:li xmpDM:name="autoplay" xmpDM:value="true"/><rdf:li xmpDM:name="loop" xmpDM:value="false"/><rdf:li xmpDM:name="searchable" xmpDM:value="true"/><rdf:li xmpDM:name="captionsenabled" xmpDM:value="false"/><rdf:li xmpDM:name="sidebarenabled" xmpDM:value="false"/><rdf:li xmpDM:name="unicodeenabled" xmpDM:value="false"/><rdf:li xmpDM:name="backgroundcolor" xmpDM:value="000000"/><rdf:li xmpDM:name="sidebarlocation" xmpDM:value="left"/><rdf:li xmpDM:name="endaction" xmpDM:value="stop"/><rdf:li xmpDM:name="endactionparam" xmpDM:value="true"/><rdf:li xmpDM:name="locale" xmpDM:value="en-US"/></rdf:Bag>
               </tscDM:parameters>
               <tscDM:controllerText>
                  <rdf:Bag>
                  </rdf:Bag>
               </tscDM:controllerText>
            </rdf:Description>
         </tscDM:controller>
         <tscDM:contentList>
            <rdf:Description>
               <tscDM:files>
                  <rdf:Seq>
                     <rdf:li xmpDM:name="0" xmpDM:value="l_11chf.mp4"/><rdf:li xmpDM:name="1" xmpDM:value="l_11chf_First_Frame.png"/><rdf:li xmpDM:name="2" xmpDM:value="l_11chf_Thumbnails.png"/></rdf:Seq>
               </tscDM:files>
            </rdf:Description>
         </tscDM:contentList>
      </rdf:Description>
   </rdf:RDF>
</x:xmpmeta>