<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:creator="Professor Raj Jain" dc:date="2017-01-26 01:12:46 AM" dc:source="Camtasia,9.0.1,enu" dc:title="l_02et" tscDM:firstFrame="l_02et_First_Frame.png" tscDM:originId="2625EA67-814F-4A0C-B4C7-2902396CFF3B" tscDM:project="l_02et">
         <xmpDM:duration xmpDM:scale="1/1000" xmpDM:value="4169233"/>
         <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="Block Encryption and DES 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="Block 1 Block 2 Plain Text Block 3" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Overview Substitution and Transposition Techniques Block Cipher Principles Data Encryption Standard (DES) Differential and Linear Cryptanalysis Block Cipher Design Principles" xmpDM:startTime="30433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="These slides are based partly on Lawrie Brown’s slides supplied with William Stalling’s book “Cryptography and Network Security: Principles and" xmpDM:startTime="30433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Practice,” 7th Ed, 2017." xmpDM:startTime="30433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="30433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Symmetric Cipher Model Y = E(K, X) X = D(K, Y) K=Secret Key Same key is used for encryption and" xmpDM:startTime="66367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="decryption." xmpDM:startTime="66367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Single-key or private key encryption." xmpDM:startTime="66367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Example: Divide by 9." xmpDM:startTime="66367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="480=53£9+3 Þ 533" xmpDM:startTime="66367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Some Basic Terminology Plaintext: original message Ciphertext: coded message Cipher: algorithm for transforming plaintext to ciphertext Key: info used in" xmpDM:startTime="163767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="cipher known only to sender/receiver Encipher (encrypt): converting plaintext to ciphertext Decipher (decrypt): recovering ciphertext from plaintext Cryptography: study of" xmpDM:startTime="163767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="encryption principles/methods Cryptanalysis (code breaking): study of principles/ methods of deciphering ciphertext without knowing key Cryptology: field of both cryptography" xmpDM:startTime="163767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and cryptanalysis" xmpDM:startTime="163767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Substitution Caesar Cipher: Replaces each letter by 3rd letter on Example: meet me after the toga party PHHW PH DIWHU" xmpDM:startTime="247033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="WKH WRJD SDUWB Can define transformation as: a b c d e f g h i j k l m" xmpDM:startTime="247033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="n o p q r s t u v w x y z D E F G H I J" xmpDM:startTime="247033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="K L M N O P Q R S T U V W X Y Z A B C Mathematically" xmpDM:startTime="247033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="give each letter a number a b c d e f g h i j k l m n o" xmpDM:startTime="247033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="p q r s t u v w x y z 0 1 2 3 4 5 6 7 8" xmpDM:startTime="247033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 Then have Caesar" xmpDM:startTime="247033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="cipher as: c = E(k, p) = (p + k) mod (26) p = D(k, c) = (c – k)" xmpDM:startTime="247033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="mod (26) Weakness: Only 26 possible keys" xmpDM:startTime="247033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Substitution: Other forms Random substitution: Plain: abcdefghijklmnopqrstuvwxyz Cipher: DKVQFIBJWPESCXHTMYAUOLRGZN The key is 26 character long =&gt; 26! (= 4 x" xmpDM:startTime="433533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1026) Keys in place of 26 keys Letter frequencies to find common letters: E,T,R,N,I,O,A,S" xmpDM:startTime="433533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Substitution: Other forms (Cont) Use two-letter combinations: Playfair Cipher Use multiple letter combinations: Hill Cipher Poly-alphabetic Substitution Ciphers Use multiple" xmpDM:startTime="563333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ciphers." xmpDM:startTime="563333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Use a key to select which alphabet (code) is used for each letter of the message Vigenère Cipher: Example using" xmpDM:startTime="563333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="keyword deceptive key: deceptivedeceptivedeceptive plaintext: wearediscoveredsaveyourself ciphertext:ZICVTWQNGRZGVTWAVZHCQYGLMGJ" xmpDM:startTime="563333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Substitution: Other forms Random substitution: Plain: abcdefghijklmnopqrstuvwxyz Cipher: DKVQFIBJWPESCXHTMYAUOLRGZN The key is 26 character long =&gt; 26! (= 4 x" xmpDM:startTime="719967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1026) Keys in place of 26 keys Letter frequencies to find common letters: E,T,R,N,I,O,A,S" xmpDM:startTime="719967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Substitution Caesar Cipher: Replaces each letter by 3rd letter on Example: meet me after the toga party PHHW PH DIWHU" xmpDM:startTime="720367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="WKH WRJD SDUWB Can define transformation as: a b c d e f g h i j k l m" xmpDM:startTime="720367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="n o p q r s t u v w x y z D E F G H I J" xmpDM:startTime="720367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="K L M N O P Q R S T U V W X Y Z A B C Mathematically" xmpDM:startTime="720367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="give each letter a number a b c d e f g h i j k l m n o" xmpDM:startTime="720367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="p q r s t u v w x y z 0 1 2 3 4 5 6 7 8" xmpDM:startTime="720367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 Then have Caesar" xmpDM:startTime="720367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="cipher as: c = E(k, p) = (p + k) mod (26) p = D(k, c) = (c – k)" xmpDM:startTime="720367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="mod (26) Weakness: Only 26 possible keys" xmpDM:startTime="720367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Substitution: Other forms Random substitution: Plain: abcdefghijklmnopqrstuvwxyz Cipher: DKVQFIBJWPESCXHTMYAUOLRGZN The key is 26 character long =&gt; 26! (= 4 x" xmpDM:startTime="728100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1026) Keys in place of 26 keys Letter frequencies to find common letters: E,T,R,N,I,O,A,S" xmpDM:startTime="728100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Substitution: Other forms (Cont) Use two-letter combinations: Playfair Cipher Use multiple letter combinations: Hill Cipher Poly-alphabetic Substitution Ciphers Use multiple" xmpDM:startTime="728533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ciphers." xmpDM:startTime="728533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Use a key to select which alphabet (code) is used for each letter of the message Vigenère Cipher: Example using" xmpDM:startTime="728533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="keyword deceptive key: deceptivedeceptivedeceptive plaintext: wearediscoveredsaveyourself ciphertext:ZICVTWQNGRZGVTWAVZHCQYGLMGJ" xmpDM:startTime="728533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Transposition (Permutation) Ciphers Rearrange the letter order without altering the actual letters Rail Fence Cipher: Write message out diagonally as:" xmpDM:startTime="782467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="m e m a t r h t g p r y e t e f e t e o" xmpDM:startTime="782467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="a a t Giving ciphertext: MEMATRHTGPRYETEFETEOAAT Row Transposition Ciphers: Write letters in rows, reorder the columns according to the key" xmpDM:startTime="782467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="before reading off ." xmpDM:startTime="782467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Key: 4312567 Column Out 4 3 1 2 5 6 7 Plaintext: a t t a c k p o" xmpDM:startTime="782467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="s t p o n e d u n t i l t w o a m x y z" xmpDM:startTime="782467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Ciphertext: TTNAAPTMTSUOAODWCOIXKNLYPETZ" xmpDM:startTime="782467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Product Ciphers Use several ciphers in succession to make harder, but: Two substitutions make a more complex substitution Two transpositions" xmpDM:startTime="985700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="make more complex transposition But a substitution followed by a transposition makes a new much harder cipher This is a" xmpDM:startTime="985700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="bridge from classical to modern ciphers" xmpDM:startTime="985700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 2A This problem explores the use of a one-time pad version of the Vigenere cipher." xmpDM:startTime="1035067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In this scheme, the key is a stream of random numbers between 0 and 26." xmpDM:startTime="1035067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="For example, if the key is 3 19 5…, then the first letter of the plaintext is encrypted with a" xmpDM:startTime="1035067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="shift of 3 letters, the second with a shift of 19 letters, the third with a shift of 5 letters," xmpDM:startTime="1035067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and so on." xmpDM:startTime="1035067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A." xmpDM:startTime="1035067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Encrypt the plain text sendmoremoney with the key stream 9 0 1 7 23 15 21 14 11 11 2" xmpDM:startTime="1035067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="8 9 B." xmpDM:startTime="1035067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Using the ciphertext produced in part (a), find a key so that the cipher text decrypts to the plain text" xmpDM:startTime="1035067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="cashnotneeded." xmpDM:startTime="1035067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1035067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 2A This problem explores the use of a one-time pad version of the Vigenere cipher." xmpDM:startTime="1098767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In this scheme, the key is a stream of random numbers between 0 and 26." xmpDM:startTime="1098767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="For example, if the key is 3 19 5…, then the first letter of the plaintext is encrypted with a" xmpDM:startTime="1098767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="shift of 3 letters, the second with a shift of 19 letters, the third with a shift of 5 letters," xmpDM:startTime="1098767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and so on." xmpDM:startTime="1098767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="A." xmpDM:startTime="1098767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Encrypt the plain text sendmoremoney with the key stream 9 0 1 7 23 15 21 14 11 11 2" xmpDM:startTime="1098767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="8 9 B." xmpDM:startTime="1098767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Using the ciphertext produced in part (a), find a key so that the cipher text decrypts to the plain text" xmpDM:startTime="1098767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="cashnotneeded." xmpDM:startTime="1098767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1098767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Block vs." xmpDM:startTime="1177100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Stream Ciphers Stream: Bits and bytes are processed as they arrive Example: RC4 Block: Messages are broken into blocks of" xmpDM:startTime="1177100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="64-bit, 512-bit, … Example: DES, AES" xmpDM:startTime="1177100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Shannon’s S-P Networks Claude Shannon introduced idea of substitution-permutation (S-P) networks in his 1949 paper Two primitive cryptographic operations: Substitution" xmpDM:startTime="1291633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="(S-box) = Replace n-bits by another n-bits Þ Diffusion: Dissipate statistical structure of plaintext over bulk of ciphertext." xmpDM:startTime="1291633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="One bit change in plaintext changes many bits in ciphertext." xmpDM:startTime="1291633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Can not do frequency analysis." xmpDM:startTime="1291633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Permutation (P-box) = Bits are rearranged." xmpDM:startTime="1291633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="No bits are added/removed." xmpDM:startTime="1291633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Þ Confusion: Make relationship between ciphertext and key as complex as possible Combination S-P = Product cipher Plaintext Ciphertext" xmpDM:startTime="1291633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Feistel Cipher Structure A practical implementation of Shanon’s S-P Networks Partitions input block in 2 halves Perform a substitution on" xmpDM:startTime="1487800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="left data half based on a function of right half &amp; subkey (Round Function or Mangler function) Then permutation by" xmpDM:startTime="1487800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="swapping halves Repeat this “round” of S-P many times Invertible" xmpDM:startTime="1487800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Feistel Cipher Design Elements Most modern block ciphers are a variation of Feistel Cipher with different: Block size Key size" xmpDM:startTime="1767067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Number of rounds Subkey generation algorithm Round function Fast software en/decryption Ease of analysis" xmpDM:startTime="1767067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Data Encryption Standard (DES) Published by NIST in 1977 A variation of IBM’s Lucifer algorithm developed by Horst Feistel For" xmpDM:startTime="1852933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="commercial and unclassified government applications 8 octet (64 bit) key." xmpDM:startTime="1852933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Each octet with 1 odd parity bit Þ 56-bit key Efficient hardware implementation Used in most financial transactions Computing power" xmpDM:startTime="1852933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="goes up 1 bit every 2 years 56-bit was secure in 1977 but is not secure today Now we use" xmpDM:startTime="1852933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DES three times Þ Triple DES = 3DES" xmpDM:startTime="1852933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DES Encryption Overview 16 rounds using 64-bit block and 48-bit subkey Round Initial/Final Permutation Round Function Sub-key Generation" xmpDM:startTime="2144300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1." xmpDM:startTime="2371433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Initial and Final Permutation Input bit 58 goes to output bit 1 Input bit 50 goes to output bit 2," xmpDM:startTime="2371433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="… Even bits to Left half, odd bits to Right half Quite regular in structure (easy in h/w)" xmpDM:startTime="2371433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DES Encryption Overview 16 rounds using 64-bit block and 48-bit subkey Round Initial/Final Permutation Round Function Sub-key Generation" xmpDM:startTime="2377667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1." xmpDM:startTime="2388667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Initial and Final Permutation Input bit 58 goes to output bit 1 Input bit 50 goes to output bit 2," xmpDM:startTime="2388667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="… Even bits to Left half, odd bits to Right half Quite regular in structure (easy in h/w)" xmpDM:startTime="2388667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DES Encryption Overview 16 rounds using 64-bit block and 48-bit subkey Round Initial/Final Permutation Round Function Sub-key Generation" xmpDM:startTime="2557233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1." xmpDM:startTime="2575433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Initial and Final Permutation Input bit 58 goes to output bit 1 Input bit 50 goes to output bit 2," xmpDM:startTime="2575433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="… Even bits to Left half, odd bits to Right half Quite regular in structure (easy in h/w)" xmpDM:startTime="2575433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2." xmpDM:startTime="2576000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DES Round Structure 16 7 20 21 29 … 11 4 25 32 1 2 3 4 5 4 5" xmpDM:startTime="2576000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="6 7 8 9 8 9 10 11 12 13 Read 6 bits." xmpDM:startTime="2576000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Go back 2 bits." xmpDM:startTime="2576000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Repeat." xmpDM:startTime="2576000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Substitution Boxes Permutation" xmpDM:startTime="2576000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1." xmpDM:startTime="2658700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Initial and Final Permutation Input bit 58 goes to output bit 1 Input bit 50 goes to output bit 2," xmpDM:startTime="2658700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="… Even bits to Left half, odd bits to Right half Quite regular in structure (easy in h/w)" xmpDM:startTime="2658700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DES Encryption Overview 16 rounds using 64-bit block and 48-bit subkey Round Initial/Final Permutation Round Function Sub-key Generation" xmpDM:startTime="2659300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1." xmpDM:startTime="2681433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Initial and Final Permutation Input bit 58 goes to output bit 1 Input bit 50 goes to output bit 2," xmpDM:startTime="2681433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="… Even bits to Left half, odd bits to Right half Quite regular in structure (easy in h/w)" xmpDM:startTime="2681433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2." xmpDM:startTime="2681733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DES Round Structure 16 7 20 21 29 … 11 4 25 32 1 2 3 4 5 4 5" xmpDM:startTime="2681733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="6 7 8 9 8 9 10 11 12 13 Read 6 bits." xmpDM:startTime="2681733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Go back 2 bits." xmpDM:startTime="2681733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Repeat." xmpDM:startTime="2681733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Substitution Boxes Permutation" xmpDM:startTime="2681733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Substitution Boxes Map 6 to 4 bits Outer bits 1 &amp; 6 (row bits) select one row of 4 Inner" xmpDM:startTime="2790233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="bits 2-5 (column bits) are substituted Example:" xmpDM:startTime="2790233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="2." xmpDM:startTime="2825133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DES Round Structure 16 7 20 21 29 … 11 4 25 32 1 2 3 4 5 4 5" xmpDM:startTime="2825133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="6 7 8 9 8 9 10 11 12 13 Read 6 bits." xmpDM:startTime="2825133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Go back 2 bits." xmpDM:startTime="2825133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Repeat." xmpDM:startTime="2825133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Substitution Boxes Permutation" xmpDM:startTime="2825133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Substitution Boxes Map 6 to 4 bits Outer bits 1 &amp; 6 (row bits) select one row of 4 Inner" xmpDM:startTime="2832833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="bits 2-5 (column bits) are substituted Example:" xmpDM:startTime="2832833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="3." xmpDM:startTime="2897800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DES Sub-Key Generation Permutation PC1 divides 56-bits in two 28-bit halves Rotate each half separately either 1 or 2 places" xmpDM:startTime="2897800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="depending on the key rotation schedule K Select 24-bits from each half &amp; permute them by PC2" xmpDM:startTime="2897800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DES Decryption Decrypt with Feistel design: Do encryption steps again using sub-keys in reverse order (SK16 … SK1) IP undoes" xmpDM:startTime="3241667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="final FP step of encryption 1st round with SK16 undoes 16th encrypt round …." xmpDM:startTime="3241667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="16th round with SK1 undoes 1st encrypt round Then final FP undoes initial encryption IP thus recovering original data value" xmpDM:startTime="3241667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3241667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Avalanche Effect Key desirable property of encryption algorithm A change of one input or key bit results in changing approx" xmpDM:startTime="3255033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="half output bits = Diffusion Making attempts to “home-in” by guessing keys impossible DES exhibits strong avalanche" xmpDM:startTime="3255033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Avalanche in DES 3+4+3+3+1+0+2+3+2+3+1+2+2+2+1+1=33 bits" xmpDM:startTime="3307667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Strength of DES Bit-wise complement of plaintext with complement of key results in complement of ciphertext Brute force search requires" xmpDM:startTime="3412100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="255 keys Recent advances have shown, it is possible in 1997 on Internet in a few months in 1998 on" xmpDM:startTime="3412100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="dedicated h/w (EFF) in a few days in 1999 above combined in 22hrs! Statistical Attacks: Timing attacks: calculation time depends" xmpDM:startTime="3412100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="upon the key." xmpDM:startTime="3412100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Particularly problematic on smartcards Differential cryptanalysis Linear cryptanalysis" xmpDM:startTime="3412100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Differential Cryptanalysis Chosen Plaintext attack: Get ciphertext for a given plaintext Get the (DX, DY) pairs, where DX is the" xmpDM:startTime="3571433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="difference in plaintext and DY is the difference in ciphertext Some (DX, DY) pairs are more likely than others, if" xmpDM:startTime="3571433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="those pairs are found, some key values are more likely so you can reduce the amount of brute force search" xmpDM:startTime="3571433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Straightforward brute force attack on DES requires 255 plaintexts Using differential cryptanalysis, DES can be broken with 247 plaintexts." xmpDM:startTime="3571433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="But finding appropriate plaintexts takes some trials and so the total amount of effort is 255.1" xmpDM:startTime="3571433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="which is more than straight forward brute force attack Þ DES is resistant to differential cryptanalysis Ref: http://en.wikipedia.org/wiki/Differential_cryptanalysis" xmpDM:startTime="3571433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3571433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Linear Cryptanalysis Bits in plaintext, ciphertext, and keys may have a linear relationship." xmpDM:startTime="3743400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="For example: P1P2  C3=K2 K5 In a good cipher, the relationship should hold w probability ½." xmpDM:startTime="3743400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If any relationship has probability 1, the cipher is easy to break." xmpDM:startTime="3743400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If any relationship has probability 0, the cipher is easy to break." xmpDM:startTime="3743400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bias = |Probability of linear relationship – 0.5|" xmpDM:startTime="3743400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Find the linear approximation with the highest bias Þ Helps reduce the brute force search effort." xmpDM:startTime="3743400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This method can be used to find the DES key given 243 plaintexts." xmpDM:startTime="3743400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Ref: http://en.wikipedia.org/wiki/Linear_cryptanalysis" xmpDM:startTime="3743400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3743400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Block Cipher Design Principles Nonlinear S-Boxes: Resistant to linear cryptanalysis." xmpDM:startTime="3923467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Linear approximations between input and output bits of the S-boxes should have minimal bias Þ P ≈ ½ S-Boxes resistant" xmpDM:startTime="3923467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to differential cryptanalysis." xmpDM:startTime="3923467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="All (Input bit difference, output bit difference) pairs should be equally likely." xmpDM:startTime="3923467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Any output bit should change with probability ½ when any input bit is changed (strict avalanche criterion) Output bits j" xmpDM:startTime="3923467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and k should change independently when any input bit i is inverted for all i, j, k (bit independence criterion)" xmpDM:startTime="3923467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Permutation: Adjacent bits should affect different S-Boxes in the next round Þ Increase diffusion More rounds are better (but also" xmpDM:startTime="3923467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="more computation)" xmpDM:startTime="3923467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Linear Cryptanalysis Bits in plaintext, ciphertext, and keys may have a linear relationship." xmpDM:startTime="3947367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="For example: P1P2  C3=K2 K5 In a good cipher, the relationship should hold w probability ½." xmpDM:startTime="3947367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If any relationship has probability 1, the cipher is easy to break." xmpDM:startTime="3947367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If any relationship has probability 0, the cipher is easy to break." xmpDM:startTime="3947367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bias = |Probability of linear relationship – 0.5|" xmpDM:startTime="3947367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Find the linear approximation with the highest bias Þ Helps reduce the brute force search effort." xmpDM:startTime="3947367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This method can be used to find the DES key given 243 plaintexts." xmpDM:startTime="3947367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Ref: http://en.wikipedia.org/wiki/Linear_cryptanalysis" xmpDM:startTime="3947367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3947367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Differential Cryptanalysis Chosen Plaintext attack: Get ciphertext for a given plaintext Get the (DX, DY) pairs, where DX is the" xmpDM:startTime="3947733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="difference in plaintext and DY is the difference in ciphertext Some (DX, DY) pairs are more likely than others, if" xmpDM:startTime="3947733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="those pairs are found, some key values are more likely so you can reduce the amount of brute force search" xmpDM:startTime="3947733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Straightforward brute force attack on DES requires 255 plaintexts Using differential cryptanalysis, DES can be broken with 247 plaintexts." xmpDM:startTime="3947733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="But finding appropriate plaintexts takes some trials and so the total amount of effort is 255.1" xmpDM:startTime="3947733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="which is more than straight forward brute force attack Þ DES is resistant to differential cryptanalysis Ref: http://en.wikipedia.org/wiki/Differential_cryptanalysis" xmpDM:startTime="3947733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3947733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Strength of DES Bit-wise complement of plaintext with complement of key results in complement of ciphertext Brute force search requires" xmpDM:startTime="3948133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="255 keys Recent advances have shown, it is possible in 1997 on Internet in a few months in 1998 on" xmpDM:startTime="3948133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="dedicated h/w (EFF) in a few days in 1999 above combined in 22hrs! Statistical Attacks: Timing attacks: calculation time depends" xmpDM:startTime="3948133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="upon the key." xmpDM:startTime="3948133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Particularly problematic on smartcards Differential cryptanalysis Linear cryptanalysis" xmpDM:startTime="3948133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Avalanche in DES 3+4+3+3+1+0+2+3+2+3+1+2+2+2+1+1=33 bits" xmpDM:startTime="3948433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Avalanche Effect Key desirable property of encryption algorithm A change of one input or key bit results in changing approx" xmpDM:startTime="3948933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="half output bits = Diffusion Making attempts to “home-in” by guessing keys impossible DES exhibits strong avalanche" xmpDM:startTime="3948933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DES Decryption Decrypt with Feistel design: Do encryption steps again using sub-keys in reverse order (SK16 … SK1) IP undoes" xmpDM:startTime="3949267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="final FP step of encryption 1st round with SK16 undoes 16th encrypt round …." xmpDM:startTime="3949267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="16th round with SK1 undoes 1st encrypt round Then final FP undoes initial encryption IP thus recovering original data value" xmpDM:startTime="3949267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3949267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="3." xmpDM:startTime="3949600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DES Sub-Key Generation Permutation PC1 divides 56-bits in two 28-bit halves Rotate each half separately either 1 or 2 places" xmpDM:startTime="3949600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="depending on the key rotation schedule K Select 24-bits from each half &amp; permute them by PC2" xmpDM:startTime="3949600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Substitution Boxes Map 6 to 4 bits Outer bits 1 &amp; 6 (row bits) select one row of 4 Inner" xmpDM:startTime="3950100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="bits 2-5 (column bits) are substituted Example:" xmpDM:startTime="3950100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="3." xmpDM:startTime="3973433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DES Sub-Key Generation Permutation PC1 divides 56-bits in two 28-bit halves Rotate each half separately either 1 or 2 places" xmpDM:startTime="3973433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="depending on the key rotation schedule K Select 24-bits from each half &amp; permute them by PC2" xmpDM:startTime="3973433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DES Decryption Decrypt with Feistel design: Do encryption steps again using sub-keys in reverse order (SK16 … SK1) IP undoes" xmpDM:startTime="3974000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="final FP step of encryption 1st round with SK16 undoes 16th encrypt round …." xmpDM:startTime="3974000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="16th round with SK1 undoes 1st encrypt round Then final FP undoes initial encryption IP thus recovering original data value" xmpDM:startTime="3974000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3974000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Avalanche Effect Key desirable property of encryption algorithm A change of one input or key bit results in changing approx" xmpDM:startTime="3974433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="half output bits = Diffusion Making attempts to “home-in” by guessing keys impossible DES exhibits strong avalanche" xmpDM:startTime="3974433" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Avalanche in DES 3+4+3+3+1+0+2+3+2+3+1+2+2+2+1+1=33 bits" xmpDM:startTime="3974700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Strength of DES Bit-wise complement of plaintext with complement of key results in complement of ciphertext Brute force search requires" xmpDM:startTime="3975067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="255 keys Recent advances have shown, it is possible in 1997 on Internet in a few months in 1998 on" xmpDM:startTime="3975067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="dedicated h/w (EFF) in a few days in 1999 above combined in 22hrs! Statistical Attacks: Timing attacks: calculation time depends" xmpDM:startTime="3975067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="upon the key." xmpDM:startTime="3975067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Particularly problematic on smartcards Differential cryptanalysis Linear cryptanalysis" xmpDM:startTime="3975067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Differential Cryptanalysis Chosen Plaintext attack: Get ciphertext for a given plaintext Get the (DX, DY) pairs, where DX is the" xmpDM:startTime="3975400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="difference in plaintext and DY is the difference in ciphertext Some (DX, DY) pairs are more likely than others, if" xmpDM:startTime="3975400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="those pairs are found, some key values are more likely so you can reduce the amount of brute force search" xmpDM:startTime="3975400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Straightforward brute force attack on DES requires 255 plaintexts Using differential cryptanalysis, DES can be broken with 247 plaintexts." xmpDM:startTime="3975400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="But finding appropriate plaintexts takes some trials and so the total amount of effort is 255.1" xmpDM:startTime="3975400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="which is more than straight forward brute force attack Þ DES is resistant to differential cryptanalysis Ref: http://en.wikipedia.org/wiki/Differential_cryptanalysis" xmpDM:startTime="3975400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3975400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Linear Cryptanalysis Bits in plaintext, ciphertext, and keys may have a linear relationship." xmpDM:startTime="3975833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="For example: P1P2  C3=K2 K5 In a good cipher, the relationship should hold w probability ½." xmpDM:startTime="3975833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If any relationship has probability 1, the cipher is easy to break." xmpDM:startTime="3975833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If any relationship has probability 0, the cipher is easy to break." xmpDM:startTime="3975833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bias = |Probability of linear relationship – 0.5|" xmpDM:startTime="3975833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Find the linear approximation with the highest bias Þ Helps reduce the brute force search effort." xmpDM:startTime="3975833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This method can be used to find the DES key given 243 plaintexts." xmpDM:startTime="3975833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Ref: http://en.wikipedia.org/wiki/Linear_cryptanalysis" xmpDM:startTime="3975833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="3975833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Block Cipher Design Principles Nonlinear S-Boxes: Resistant to linear cryptanalysis." xmpDM:startTime="3976933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Linear approximations between input and output bits of the S-boxes should have minimal bias Þ P ≈ ½ S-Boxes resistant" xmpDM:startTime="3976933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to differential cryptanalysis." xmpDM:startTime="3976933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="All (Input bit difference, output bit difference) pairs should be equally likely." xmpDM:startTime="3976933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Any output bit should change with probability ½ when any input bit is changed (strict avalanche criterion) Output bits j" xmpDM:startTime="3976933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and k should change independently when any input bit i is inverted for all i, j, k (bit independence criterion)" xmpDM:startTime="3976933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Permutation: Adjacent bits should affect different S-Boxes in the next round Þ Increase diffusion More rounds are better (but also" xmpDM:startTime="3976933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="more computation)" xmpDM:startTime="3976933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary The key methods for cryptography are: Substitution and transposition Letter frequency can be used to break substitution Goal of" xmpDM:startTime="4016933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ciphers is to increase confusion and diffusion." xmpDM:startTime="4016933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Confusion = Complex relationship Diffusion = Each input bit affects many output bits Feistel cipher design divides blocks in left" xmpDM:startTime="4016933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and right halves, mangles the right half with a sub-key and swaps the two halves." xmpDM:startTime="4016933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DES consists of 16 rounds using a 56-bit key from which 48-bit subkeys are generated." xmpDM:startTime="4016933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Each round uses eight 6x4 S-Boxes followed by permutation." xmpDM:startTime="4016933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Differential cryptanalysis analyzes frequency of (DP, DC) pairs." xmpDM:startTime="4016933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Linear cryptanalysis analyzes frequency of linear relationships among plaintext, ciphertext, and key." xmpDM:startTime="4016933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4016933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 2B Suppose we use one round version of DES." xmpDM:startTime="4017300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Derive K1, the first-round subkey Derive L0, R0 Expand R0 to get E[R0], where E[.]" xmpDM:startTime="4017300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is the expansion function of Table S.1" xmpDM:startTime="4017300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Calculate A = E[R0] K1 Group the 48-bit result above into sets of 6 bits and evaluate the corresponding S-Box" xmpDM:startTime="4017300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="substitution Concatenate the results above to get a 32-bit result, B." xmpDM:startTime="4017300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Apply the permutation to get P(B) Calculate R1 = P(B) L0 Write down the ciphertext." xmpDM:startTime="4017300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Final Answer: F0AAF0AA 5E1CEC63" xmpDM:startTime="4017300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Acronyms 3DES Triple Data Encryption Standard AES Advanced Encryption Standard ASCII American Standard Code for Information Interchange CIA Confidentiality, Integrity," xmpDM:startTime="4018100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and Availability DES Data Encryption Standard EFF Electronic Frontier Foundation FP Final Permutation IP Initial Permutation LH Left-Half NIST National" xmpDM:startTime="4018100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Institute of Standards and Technology NSA National Security Agency PCn Permuted Choice n RC4 Ron's Code 4 RH Right-Half SKn" xmpDM:startTime="4018100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Sub-Key n" xmpDM:startTime="4018100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Scan This to Download These Slides Raj Jain http://rajjain.com" xmpDM:startTime="4018633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4018633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Acronyms 3DES Triple Data Encryption Standard AES Advanced Encryption Standard ASCII American Standard Code for Information Interchange CIA Confidentiality, Integrity," xmpDM:startTime="4019333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and Availability DES Data Encryption Standard EFF Electronic Frontier Foundation FP Final Permutation IP Initial Permutation LH Left-Half NIST National" xmpDM:startTime="4019333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Institute of Standards and Technology NSA National Security Agency PCn Permuted Choice n RC4 Ron's Code 4 RH Right-Half SKn" xmpDM:startTime="4019333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Sub-Key n" xmpDM:startTime="4019333" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 2B Suppose we use one round version of DES." xmpDM:startTime="4019533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Derive K1, the first-round subkey Derive L0, R0 Expand R0 to get E[R0], where E[.]" xmpDM:startTime="4019533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is the expansion function of Table S.1" xmpDM:startTime="4019533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Calculate A = E[R0] K1 Group the 48-bit result above into sets of 6 bits and evaluate the corresponding S-Box" xmpDM:startTime="4019533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="substitution Concatenate the results above to get a 32-bit result, B." xmpDM:startTime="4019533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Apply the permutation to get P(B) Calculate R1 = P(B) L0 Write down the ciphertext." xmpDM:startTime="4019533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Final Answer: F0AAF0AA 5E1CEC63" xmpDM:startTime="4019533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary The key methods for cryptography are: Substitution and transposition Letter frequency can be used to break substitution Goal of" xmpDM:startTime="4019700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ciphers is to increase confusion and diffusion." xmpDM:startTime="4019700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Confusion = Complex relationship Diffusion = Each input bit affects many output bits Feistel cipher design divides blocks in left" xmpDM:startTime="4019700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and right halves, mangles the right half with a sub-key and swaps the two halves." xmpDM:startTime="4019700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DES consists of 16 rounds using a 56-bit key from which 48-bit subkeys are generated." xmpDM:startTime="4019700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Each round uses eight 6x4 S-Boxes followed by permutation." xmpDM:startTime="4019700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Differential cryptanalysis analyzes frequency of (DP, DC) pairs." xmpDM:startTime="4019700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Linear cryptanalysis analyzes frequency of linear relationships among plaintext, ciphertext, and key." xmpDM:startTime="4019700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4019700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Block Cipher Design Principles Nonlinear S-Boxes: Resistant to linear cryptanalysis." xmpDM:startTime="4019833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Linear approximations between input and output bits of the S-boxes should have minimal bias Þ P ≈ ½ S-Boxes resistant" xmpDM:startTime="4019833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to differential cryptanalysis." xmpDM:startTime="4019833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="All (Input bit difference, output bit difference) pairs should be equally likely." xmpDM:startTime="4019833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Any output bit should change with probability ½ when any input bit is changed (strict avalanche criterion) Output bits j" xmpDM:startTime="4019833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and k should change independently when any input bit i is inverted for all i, j, k (bit independence criterion)" xmpDM:startTime="4019833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Permutation: Adjacent bits should affect different S-Boxes in the next round Þ Increase diffusion More rounds are better (but also" xmpDM:startTime="4019833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="more computation)" xmpDM:startTime="4019833" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Linear Cryptanalysis Bits in plaintext, ciphertext, and keys may have a linear relationship." xmpDM:startTime="4020000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="For example: P1P2  C3=K2 K5 In a good cipher, the relationship should hold w probability ½." xmpDM:startTime="4020000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If any relationship has probability 1, the cipher is easy to break." xmpDM:startTime="4020000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If any relationship has probability 0, the cipher is easy to break." xmpDM:startTime="4020000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bias = |Probability of linear relationship – 0.5|" xmpDM:startTime="4020000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Find the linear approximation with the highest bias Þ Helps reduce the brute force search effort." xmpDM:startTime="4020000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This method can be used to find the DES key given 243 plaintexts." xmpDM:startTime="4020000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Ref: http://en.wikipedia.org/wiki/Linear_cryptanalysis" xmpDM:startTime="4020000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4020000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Differential Cryptanalysis Chosen Plaintext attack: Get ciphertext for a given plaintext Get the (DX, DY) pairs, where DX is the" xmpDM:startTime="4020200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="difference in plaintext and DY is the difference in ciphertext Some (DX, DY) pairs are more likely than others, if" xmpDM:startTime="4020200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="those pairs are found, some key values are more likely so you can reduce the amount of brute force search" xmpDM:startTime="4020200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Straightforward brute force attack on DES requires 255 plaintexts Using differential cryptanalysis, DES can be broken with 247 plaintexts." xmpDM:startTime="4020200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="But finding appropriate plaintexts takes some trials and so the total amount of effort is 255.1" xmpDM:startTime="4020200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="which is more than straight forward brute force attack Þ DES is resistant to differential cryptanalysis Ref: http://en.wikipedia.org/wiki/Differential_cryptanalysis" xmpDM:startTime="4020200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4020200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Strength of DES Bit-wise complement of plaintext with complement of key results in complement of ciphertext Brute force search requires" xmpDM:startTime="4020400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="255 keys Recent advances have shown, it is possible in 1997 on Internet in a few months in 1998 on" xmpDM:startTime="4020400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="dedicated h/w (EFF) in a few days in 1999 above combined in 22hrs! Statistical Attacks: Timing attacks: calculation time depends" xmpDM:startTime="4020400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="upon the key." xmpDM:startTime="4020400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Particularly problematic on smartcards Differential cryptanalysis Linear cryptanalysis" xmpDM:startTime="4020400" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Avalanche in DES 3+4+3+3+1+0+2+3+2+3+1+2+2+2+1+1=33 bits" xmpDM:startTime="4020567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Avalanche Effect Key desirable property of encryption algorithm A change of one input or key bit results in changing approx" xmpDM:startTime="4020733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="half output bits = Diffusion Making attempts to “home-in” by guessing keys impossible DES exhibits strong avalanche" xmpDM:startTime="4020733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DES Decryption Decrypt with Feistel design: Do encryption steps again using sub-keys in reverse order (SK16 … SK1) IP undoes" xmpDM:startTime="4021100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="final FP step of encryption 1st round with SK16 undoes 16th encrypt round …." xmpDM:startTime="4021100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="16th round with SK1 undoes 1st encrypt round Then final FP undoes initial encryption IP thus recovering original data value" xmpDM:startTime="4021100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4021100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="3." xmpDM:startTime="4021300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DES Sub-Key Generation Permutation PC1 divides 56-bits in two 28-bit halves Rotate each half separately either 1 or 2 places" xmpDM:startTime="4021300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="depending on the key rotation schedule K Select 24-bits from each half &amp; permute them by PC2" xmpDM:startTime="4021300" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Substitution Boxes Map 6 to 4 bits Outer bits 1 &amp; 6 (row bits) select one row of 4 Inner" xmpDM:startTime="4021733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="bits 2-5 (column bits) are substituted Example:" xmpDM:startTime="4021733" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="3." xmpDM:startTime="4037867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DES Sub-Key Generation Permutation PC1 divides 56-bits in two 28-bit halves Rotate each half separately either 1 or 2 places" xmpDM:startTime="4037867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="depending on the key rotation schedule K Select 24-bits from each half &amp; permute them by PC2" xmpDM:startTime="4037867" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DES Decryption Decrypt with Feistel design: Do encryption steps again using sub-keys in reverse order (SK16 … SK1) IP undoes" xmpDM:startTime="4038200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="final FP step of encryption 1st round with SK16 undoes 16th encrypt round …." xmpDM:startTime="4038200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="16th round with SK1 undoes 1st encrypt round Then final FP undoes initial encryption IP thus recovering original data value" xmpDM:startTime="4038200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4038200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Avalanche Effect Key desirable property of encryption algorithm A change of one input or key bit results in changing approx" xmpDM:startTime="4038533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="half output bits = Diffusion Making attempts to “home-in” by guessing keys impossible DES exhibits strong avalanche" xmpDM:startTime="4038533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Avalanche in DES 3+4+3+3+1+0+2+3+2+3+1+2+2+2+1+1=33 bits" xmpDM:startTime="4038767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Strength of DES Bit-wise complement of plaintext with complement of key results in complement of ciphertext Brute force search requires" xmpDM:startTime="4039000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="255 keys Recent advances have shown, it is possible in 1997 on Internet in a few months in 1998 on" xmpDM:startTime="4039000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="dedicated h/w (EFF) in a few days in 1999 above combined in 22hrs! Statistical Attacks: Timing attacks: calculation time depends" xmpDM:startTime="4039000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="upon the key." xmpDM:startTime="4039000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Particularly problematic on smartcards Differential cryptanalysis Linear cryptanalysis" xmpDM:startTime="4039000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Differential Cryptanalysis Chosen Plaintext attack: Get ciphertext for a given plaintext Get the (DX, DY) pairs, where DX is the" xmpDM:startTime="4039267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="difference in plaintext and DY is the difference in ciphertext Some (DX, DY) pairs are more likely than others, if" xmpDM:startTime="4039267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="those pairs are found, some key values are more likely so you can reduce the amount of brute force search" xmpDM:startTime="4039267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Straightforward brute force attack on DES requires 255 plaintexts Using differential cryptanalysis, DES can be broken with 247 plaintexts." xmpDM:startTime="4039267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="But finding appropriate plaintexts takes some trials and so the total amount of effort is 255.1" xmpDM:startTime="4039267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="which is more than straight forward brute force attack Þ DES is resistant to differential cryptanalysis Ref: http://en.wikipedia.org/wiki/Differential_cryptanalysis" xmpDM:startTime="4039267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4039267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Linear Cryptanalysis Bits in plaintext, ciphertext, and keys may have a linear relationship." xmpDM:startTime="4039633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="For example: P1P2  C3=K2 K5 In a good cipher, the relationship should hold w probability ½." xmpDM:startTime="4039633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If any relationship has probability 1, the cipher is easy to break." xmpDM:startTime="4039633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If any relationship has probability 0, the cipher is easy to break." xmpDM:startTime="4039633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bias = |Probability of linear relationship – 0.5|" xmpDM:startTime="4039633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Find the linear approximation with the highest bias Þ Helps reduce the brute force search effort." xmpDM:startTime="4039633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This method can be used to find the DES key given 243 plaintexts." xmpDM:startTime="4039633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Ref: http://en.wikipedia.org/wiki/Linear_cryptanalysis" xmpDM:startTime="4039633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4039633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Block Cipher Design Principles Nonlinear S-Boxes: Resistant to linear cryptanalysis." xmpDM:startTime="4040133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Linear approximations between input and output bits of the S-boxes should have minimal bias Þ P ≈ ½ S-Boxes resistant" xmpDM:startTime="4040133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to differential cryptanalysis." xmpDM:startTime="4040133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="All (Input bit difference, output bit difference) pairs should be equally likely." xmpDM:startTime="4040133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Any output bit should change with probability ½ when any input bit is changed (strict avalanche criterion) Output bits j" xmpDM:startTime="4040133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and k should change independently when any input bit i is inverted for all i, j, k (bit independence criterion)" xmpDM:startTime="4040133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Permutation: Adjacent bits should affect different S-Boxes in the next round Þ Increase diffusion More rounds are better (but also" xmpDM:startTime="4040133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="more computation)" xmpDM:startTime="4040133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary The key methods for cryptography are: Substitution and transposition Letter frequency can be used to break substitution Goal of" xmpDM:startTime="4058367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ciphers is to increase confusion and diffusion." xmpDM:startTime="4058367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Confusion = Complex relationship Diffusion = Each input bit affects many output bits Feistel cipher design divides blocks in left" xmpDM:startTime="4058367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and right halves, mangles the right half with a sub-key and swaps the two halves." xmpDM:startTime="4058367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DES consists of 16 rounds using a 56-bit key from which 48-bit subkeys are generated." xmpDM:startTime="4058367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Each round uses eight 6x4 S-Boxes followed by permutation." xmpDM:startTime="4058367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Differential cryptanalysis analyzes frequency of (DP, DC) pairs." xmpDM:startTime="4058367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Linear cryptanalysis analyzes frequency of linear relationships among plaintext, ciphertext, and key." xmpDM:startTime="4058367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4058367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DES Decryption Decrypt with Feistel design: Do encryption steps again using sub-keys in reverse order (SK16 … SK1) IP undoes" xmpDM:startTime="4164800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="final FP step of encryption 1st round with SK16 undoes 16th encrypt round …." xmpDM:startTime="4164800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="16th round with SK1 undoes 1st encrypt round Then final FP undoes initial encryption IP thus recovering original data value" xmpDM:startTime="4164800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4164800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Avalanche Effect Key desirable property of encryption algorithm A change of one input or key bit results in changing approx" xmpDM:startTime="4165233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="half output bits = Diffusion Making attempts to “home-in” by guessing keys impossible DES exhibits strong avalanche" xmpDM:startTime="4165233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Avalanche in DES 3+4+3+3+1+0+2+3+2+3+1+2+2+2+1+1=33 bits" xmpDM:startTime="4165500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Strength of DES Bit-wise complement of plaintext with complement of key results in complement of ciphertext Brute force search requires" xmpDM:startTime="4165700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="255 keys Recent advances have shown, it is possible in 1997 on Internet in a few months in 1998 on" xmpDM:startTime="4165700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="dedicated h/w (EFF) in a few days in 1999 above combined in 22hrs! Statistical Attacks: Timing attacks: calculation time depends" xmpDM:startTime="4165700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="upon the key." xmpDM:startTime="4165700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Particularly problematic on smartcards Differential cryptanalysis Linear cryptanalysis" xmpDM:startTime="4165700" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Differential Cryptanalysis Chosen Plaintext attack: Get ciphertext for a given plaintext Get the (DX, DY) pairs, where DX is the" xmpDM:startTime="4166000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="difference in plaintext and DY is the difference in ciphertext Some (DX, DY) pairs are more likely than others, if" xmpDM:startTime="4166000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="those pairs are found, some key values are more likely so you can reduce the amount of brute force search" xmpDM:startTime="4166000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Straightforward brute force attack on DES requires 255 plaintexts Using differential cryptanalysis, DES can be broken with 247 plaintexts." xmpDM:startTime="4166000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="But finding appropriate plaintexts takes some trials and so the total amount of effort is 255.1" xmpDM:startTime="4166000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="which is more than straight forward brute force attack Þ DES is resistant to differential cryptanalysis Ref: http://en.wikipedia.org/wiki/Differential_cryptanalysis" xmpDM:startTime="4166000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4166000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Linear Cryptanalysis Bits in plaintext, ciphertext, and keys may have a linear relationship." xmpDM:startTime="4166233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="For example: P1P2  C3=K2 K5 In a good cipher, the relationship should hold w probability ½." xmpDM:startTime="4166233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If any relationship has probability 1, the cipher is easy to break." xmpDM:startTime="4166233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="If any relationship has probability 0, the cipher is easy to break." xmpDM:startTime="4166233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Bias = |Probability of linear relationship – 0.5|" xmpDM:startTime="4166233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Find the linear approximation with the highest bias Þ Helps reduce the brute force search effort." xmpDM:startTime="4166233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="This method can be used to find the DES key given 243 plaintexts." xmpDM:startTime="4166233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Ref: http://en.wikipedia.org/wiki/Linear_cryptanalysis" xmpDM:startTime="4166233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4166233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Block Cipher Design Principles Nonlinear S-Boxes: Resistant to linear cryptanalysis." xmpDM:startTime="4166533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Linear approximations between input and output bits of the S-boxes should have minimal bias Þ P ≈ ½ S-Boxes resistant" xmpDM:startTime="4166533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="to differential cryptanalysis." xmpDM:startTime="4166533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="All (Input bit difference, output bit difference) pairs should be equally likely." xmpDM:startTime="4166533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Any output bit should change with probability ½ when any input bit is changed (strict avalanche criterion) Output bits j" xmpDM:startTime="4166533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and k should change independently when any input bit i is inverted for all i, j, k (bit independence criterion)" xmpDM:startTime="4166533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Permutation: Adjacent bits should affect different S-Boxes in the next round Þ Increase diffusion More rounds are better (but also" xmpDM:startTime="4166533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="more computation)" xmpDM:startTime="4166533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary The key methods for cryptography are: Substitution and transposition Letter frequency can be used to break substitution Goal of" xmpDM:startTime="4166800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="ciphers is to increase confusion and diffusion." xmpDM:startTime="4166800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Confusion = Complex relationship Diffusion = Each input bit affects many output bits Feistel cipher design divides blocks in left" xmpDM:startTime="4166800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and right halves, mangles the right half with a sub-key and swaps the two halves." xmpDM:startTime="4166800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="DES consists of 16 rounds using a 56-bit key from which 48-bit subkeys are generated." xmpDM:startTime="4166800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Each round uses eight 6x4 S-Boxes followed by permutation." xmpDM:startTime="4166800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Differential cryptanalysis analyzes frequency of (DP, DC) pairs." xmpDM:startTime="4166800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Linear cryptanalysis analyzes frequency of linear relationships among plaintext, ciphertext, and key." xmpDM:startTime="4166800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4166800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 2B Suppose we use one round version of DES." xmpDM:startTime="4167033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Derive K1, the first-round subkey Derive L0, R0 Expand R0 to get E[R0], where E[.]" xmpDM:startTime="4167033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is the expansion function of Table S.1" xmpDM:startTime="4167033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Calculate A = E[R0] K1 Group the 48-bit result above into sets of 6 bits and evaluate the corresponding S-Box" xmpDM:startTime="4167033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="substitution Concatenate the results above to get a 32-bit result, B." xmpDM:startTime="4167033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Apply the permutation to get P(B) Calculate R1 = P(B) L0 Write down the ciphertext." xmpDM:startTime="4167033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Final Answer: F0AAF0AA 5E1CEC63" xmpDM:startTime="4167033" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Acronyms 3DES Triple Data Encryption Standard AES Advanced Encryption Standard ASCII American Standard Code for Information Interchange CIA Confidentiality, Integrity," xmpDM:startTime="4167633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="and Availability DES Data Encryption Standard EFF Electronic Frontier Foundation FP Final Permutation IP Initial Permutation LH Left-Half NIST National" xmpDM:startTime="4167633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Institute of Standards and Technology NSA National Security Agency PCn Permuted Choice n RC4 Ron's Code 4 RH Right-Half SKn" xmpDM:startTime="4167633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Sub-Key n" xmpDM:startTime="4167633" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Scan This to Download These Slides Raj Jain http://rajjain.com" xmpDM:startTime="4168100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4168100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Related Modules Audio/Video Recordings and Podcasts of Professor Raj Jain's Lectures, https://www.youtube.com/channel/UCN4-5wzNP9-ruOzQMs-8NUw" xmpDM:startTime="4168600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="CSE473S: Introduction to Computer Networks (Fall 2016), http://www.cse.wustl.edu/~jain/cse473-16/index.html" xmpDM:startTime="4168600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Wireless and Mobile Networking (Spring 2016), http://www.cse.wustl.edu/~jain/cse574-16/index.html" xmpDM:startTime="4168600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="CSE571S: Network Security (Fall 2014), http://www.cse.wustl.edu/~jain/cse571-14/index.html" xmpDM:startTime="4168600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="CSE571S: Network Security (Spring 2017), http://www.cse.wustl.edu/~jain/cse571-17/index.html" xmpDM:startTime="4168600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="4168600" 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="  1. Block Encryption and DES" xmpDM:startTime="0" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="0" tscDM:imageoffset="0" tscDM:imagerect="0, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="  2. Overview" xmpDM:startTime="30433" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="1" tscDM:imageoffset="0" tscDM:imagerect="75, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="  3. Symmetric Cipher Model" xmpDM:startTime="66367" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="2" tscDM:imageoffset="0" tscDM:imagerect="150, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="  4. Some Basic Terminology" xmpDM:startTime="163767" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="3" tscDM:imageoffset="0" tscDM:imagerect="225, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="  5. Substitution" xmpDM:startTime="247033" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="4" tscDM:imageoffset="0" tscDM:imagerect="300, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="  6. Substitution: Other forms" xmpDM:startTime="433533" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="5" tscDM:imageoffset="0" tscDM:imagerect="375, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="  7. Substitution: Other forms (Cont)" xmpDM:startTime="563333" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="6" tscDM:imageoffset="0" tscDM:imagerect="450, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="  8. Substitution: Other forms" xmpDM:startTime="719967" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="7" tscDM:imageoffset="0" tscDM:imagerect="525, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="  9. Substitution" xmpDM:startTime="720367" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="8" tscDM:imageoffset="0" tscDM:imagerect="600, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="10. Substitution: Other forms" xmpDM:startTime="728100" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="9" tscDM:imageoffset="0" tscDM:imagerect="675, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="11. Substitution: Other forms (Cont)" xmpDM:startTime="728533" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="10" tscDM:imageoffset="0" tscDM:imagerect="750, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="12. Transposition (Permutation) Ciphers" xmpDM:startTime="782467" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="11" tscDM:imageoffset="0" tscDM:imagerect="825, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="13. Product Ciphers" xmpDM:startTime="985700" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="12" tscDM:imageoffset="0" tscDM:imagerect="900, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="14. Homework 2A" xmpDM:startTime="1035067" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="13" tscDM:imageoffset="0" tscDM:imagerect="975, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="15. End of presentation" xmpDM:startTime="1077567" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="14" tscDM:imageoffset="0" tscDM:imagerect="1050, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="16. Homework 2A" xmpDM:startTime="1098767" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="15" tscDM:imageoffset="0" tscDM:imagerect="1125, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="17. Block vs. Stream Ciphers" xmpDM:startTime="1177100" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="16" tscDM:imageoffset="0" tscDM:imagerect="1200, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="18. Shannon’s S-P Networks" xmpDM:startTime="1291633" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="17" tscDM:imageoffset="0" tscDM:imagerect="1275, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="19. Feistel Cipher Structure" xmpDM:startTime="1487800" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="18" tscDM:imageoffset="0" tscDM:imagerect="1350, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="20. Feistel Cipher Design Elements" xmpDM:startTime="1767067" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="19" tscDM:imageoffset="0" tscDM:imagerect="1425, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="21. Data Encryption Standard (DES)" xmpDM:startTime="1852933" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="20" tscDM:imageoffset="0" tscDM:imagerect="1500, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="22. DES Encryption Overview" xmpDM:startTime="2144300" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="21" tscDM:imageoffset="0" tscDM:imagerect="1575, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="23. 1. Initial and Final Permutation" xmpDM:startTime="2371433" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="22" tscDM:imageoffset="0" tscDM:imagerect="1650, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="24. DES Encryption Overview" xmpDM:startTime="2377667" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="23" tscDM:imageoffset="0" tscDM:imagerect="1725, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="25. 1. Initial and Final Permutation" xmpDM:startTime="2388667" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="24" tscDM:imageoffset="0" tscDM:imagerect="1800, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="26. DES Encryption Overview" xmpDM:startTime="2557233" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="25" tscDM:imageoffset="0" tscDM:imagerect="1875, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="27. 1. Initial and Final Permutation" xmpDM:startTime="2575433" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="26" tscDM:imageoffset="0" tscDM:imagerect="1950, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="28. 2. DES Round Structure" xmpDM:startTime="2576000" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="27" tscDM:imageoffset="0" tscDM:imagerect="2025, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="29. 1. Initial and Final Permutation" xmpDM:startTime="2658700" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="28" tscDM:imageoffset="0" tscDM:imagerect="2100, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="30. DES Encryption Overview" xmpDM:startTime="2659300" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="29" tscDM:imageoffset="0" tscDM:imagerect="2175, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="31. 1. Initial and Final Permutation" xmpDM:startTime="2681433" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="30" tscDM:imageoffset="0" tscDM:imagerect="2250, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="32. 2. DES Round Structure" xmpDM:startTime="2681733" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="31" tscDM:imageoffset="0" tscDM:imagerect="2325, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="33. Substitution Boxes" xmpDM:startTime="2790233" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="32" tscDM:imageoffset="0" tscDM:imagerect="2400, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="34. 2. DES Round Structure" xmpDM:startTime="2825133" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="33" tscDM:imageoffset="0" tscDM:imagerect="2475, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="35. Substitution Boxes" xmpDM:startTime="2832833" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="34" tscDM:imageoffset="0" tscDM:imagerect="2550, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="36. 3. DES Sub-Key Generation" xmpDM:startTime="2897800" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="35" tscDM:imageoffset="0" tscDM:imagerect="2625, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="37. DES Decryption" xmpDM:startTime="3241667" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="36" tscDM:imageoffset="0" tscDM:imagerect="2700, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="38. Avalanche Effect " xmpDM:startTime="3255033" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="37" tscDM:imageoffset="0" tscDM:imagerect="2775, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="39. Avalanche in DES" xmpDM:startTime="3307667" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="38" tscDM:imageoffset="0" tscDM:imagerect="2850, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="40. Strength of DES" xmpDM:startTime="3412100" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="39" tscDM:imageoffset="0" tscDM:imagerect="2925, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="41. Differential Cryptanalysis" xmpDM:startTime="3571433" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="40" tscDM:imageoffset="0" tscDM:imagerect="3000, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="42. Linear Cryptanalysis" xmpDM:startTime="3743400" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="41" tscDM:imageoffset="0" tscDM:imagerect="3075, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="43. Block Cipher Design Principles" xmpDM:startTime="3923467" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="42" tscDM:imageoffset="0" tscDM:imagerect="3150, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="44. Linear Cryptanalysis" xmpDM:startTime="3947367" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="43" tscDM:imageoffset="0" tscDM:imagerect="3225, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="45. Differential Cryptanalysis" xmpDM:startTime="3947733" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="44" tscDM:imageoffset="0" tscDM:imagerect="3300, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="46. Strength of DES" xmpDM:startTime="3948133" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="45" tscDM:imageoffset="0" tscDM:imagerect="3375, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="47. Avalanche in DES" xmpDM:startTime="3948433" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="46" tscDM:imageoffset="0" tscDM:imagerect="3450, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="48. Avalanche Effect " xmpDM:startTime="3948933" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="47" tscDM:imageoffset="0" tscDM:imagerect="3525, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="49. DES Decryption" xmpDM:startTime="3949267" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="48" tscDM:imageoffset="0" tscDM:imagerect="3600, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="50. 3. DES Sub-Key Generation" xmpDM:startTime="3949600" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="49" tscDM:imageoffset="0" tscDM:imagerect="3675, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="51. Substitution Boxes" xmpDM:startTime="3950100" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="50" tscDM:imageoffset="0" tscDM:imagerect="3750, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="52. 3. DES Sub-Key Generation" xmpDM:startTime="3973433" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="51" tscDM:imageoffset="0" tscDM:imagerect="3825, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="53. DES Decryption" xmpDM:startTime="3974000" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="52" tscDM:imageoffset="0" tscDM:imagerect="3900, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="54. Avalanche Effect " xmpDM:startTime="3974433" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="53" tscDM:imageoffset="0" tscDM:imagerect="3975, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="55. Avalanche in DES" xmpDM:startTime="3974700" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="54" tscDM:imageoffset="0" tscDM:imagerect="50, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="56. Strength of DES" xmpDM:startTime="3975067" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="55" tscDM:imageoffset="0" tscDM:imagerect="125, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="57. Differential Cryptanalysis" xmpDM:startTime="3975400" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="56" tscDM:imageoffset="0" tscDM:imagerect="200, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="58. Linear Cryptanalysis" xmpDM:startTime="3975833" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="57" tscDM:imageoffset="0" tscDM:imagerect="275, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="59. Block Cipher Design Principles" xmpDM:startTime="3976933" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="58" tscDM:imageoffset="0" tscDM:imagerect="350, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="60. Summary" xmpDM:startTime="4016933" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="59" tscDM:imageoffset="0" tscDM:imagerect="425, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="61. Homework 2B" xmpDM:startTime="4017300" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="60" tscDM:imageoffset="0" tscDM:imagerect="500, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="62. Acronyms" xmpDM:startTime="4018100" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="61" tscDM:imageoffset="0" tscDM:imagerect="575, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="63. Scan This to Download These Slides" xmpDM:startTime="4018633" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="62" tscDM:imageoffset="0" tscDM:imagerect="650, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="64. Acronyms" xmpDM:startTime="4019333" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="63" tscDM:imageoffset="0" tscDM:imagerect="725, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="65. Homework 2B" xmpDM:startTime="4019533" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="64" tscDM:imageoffset="0" tscDM:imagerect="800, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="66. Summary" xmpDM:startTime="4019700" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="65" tscDM:imageoffset="0" tscDM:imagerect="875, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="67. Block Cipher Design Principles" xmpDM:startTime="4019833" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="66" tscDM:imageoffset="0" tscDM:imagerect="950, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="68. Linear Cryptanalysis" xmpDM:startTime="4020000" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="67" tscDM:imageoffset="0" tscDM:imagerect="1025, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="69. Differential Cryptanalysis" xmpDM:startTime="4020200" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="68" tscDM:imageoffset="0" tscDM:imagerect="1100, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="70. Strength of DES" xmpDM:startTime="4020400" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="69" tscDM:imageoffset="0" tscDM:imagerect="1175, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="71. Avalanche in DES" xmpDM:startTime="4020567" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="70" tscDM:imageoffset="0" tscDM:imagerect="1250, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="72. Avalanche Effect " xmpDM:startTime="4020733" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="71" tscDM:imageoffset="0" tscDM:imagerect="1325, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="73. DES Decryption" xmpDM:startTime="4021100" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="72" tscDM:imageoffset="0" tscDM:imagerect="1400, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="74. 3. DES Sub-Key Generation" xmpDM:startTime="4021300" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="73" tscDM:imageoffset="0" tscDM:imagerect="1475, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="75. Substitution Boxes" xmpDM:startTime="4021733" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="74" tscDM:imageoffset="0" tscDM:imagerect="1550, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="76. 3. DES Sub-Key Generation" xmpDM:startTime="4037867" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="75" tscDM:imageoffset="0" tscDM:imagerect="1625, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="77. DES Decryption" xmpDM:startTime="4038200" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="76" tscDM:imageoffset="0" tscDM:imagerect="1700, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="78. Avalanche Effect " xmpDM:startTime="4038533" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="77" tscDM:imageoffset="0" tscDM:imagerect="1775, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="79. Avalanche in DES" xmpDM:startTime="4038767" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="78" tscDM:imageoffset="0" tscDM:imagerect="1850, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="80. Strength of DES" xmpDM:startTime="4039000" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="79" tscDM:imageoffset="0" tscDM:imagerect="1925, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="81. Differential Cryptanalysis" xmpDM:startTime="4039267" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="80" tscDM:imageoffset="0" tscDM:imagerect="2000, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="82. Linear Cryptanalysis" xmpDM:startTime="4039633" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="81" tscDM:imageoffset="0" tscDM:imagerect="2075, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="83. Block Cipher Design Principles" xmpDM:startTime="4040133" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="82" tscDM:imageoffset="0" tscDM:imagerect="2150, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="84. Summary" xmpDM:startTime="4058367" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="83" tscDM:imageoffset="0" tscDM:imagerect="2225, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="85. DES Decryption" xmpDM:startTime="4164800" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="84" tscDM:imageoffset="0" tscDM:imagerect="2300, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="86. Avalanche Effect " xmpDM:startTime="4165233" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="85" tscDM:imageoffset="0" tscDM:imagerect="2375, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="87. Avalanche in DES" xmpDM:startTime="4165500" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="86" tscDM:imageoffset="0" tscDM:imagerect="2450, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="88. Strength of DES" xmpDM:startTime="4165700" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="87" tscDM:imageoffset="0" tscDM:imagerect="2525, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="89. Differential Cryptanalysis" xmpDM:startTime="4166000" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="88" tscDM:imageoffset="0" tscDM:imagerect="2600, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="90. Linear Cryptanalysis" xmpDM:startTime="4166233" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="89" tscDM:imageoffset="0" tscDM:imagerect="2675, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="91. Block Cipher Design Principles" xmpDM:startTime="4166533" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="90" tscDM:imageoffset="0" tscDM:imagerect="2750, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="92. Summary" xmpDM:startTime="4166800" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="91" tscDM:imageoffset="0" tscDM:imagerect="2825, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="93. Homework 2B" xmpDM:startTime="4167033" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="92" tscDM:imageoffset="0" tscDM:imagerect="2900, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="94. Acronyms" xmpDM:startTime="4167633" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="93" tscDM:imageoffset="0" tscDM:imagerect="2975, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="95. Scan This to Download These Slides" xmpDM:startTime="4168100" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="94" tscDM:imageoffset="0" tscDM:imagerect="3050, 56, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="96. Related Modules" xmpDM:startTime="4168600" tscDM:image="l_02et_Thumbnails.png" tscDM:imageindex="95" tscDM:imageoffset="0" tscDM:imagerect="3125, 56, 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="jumptourl"/><rdf:li xmpDM:name="endactionparam" xmpDM:value="http://www.rajjain.com"/><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_02et.mp4"/><rdf:li xmpDM:name="1" xmpDM:value="l_02et_First_Frame.png"/><rdf:li xmpDM:name="2" xmpDM:value="l_02et_Thumbnails.png"/></rdf:Seq>
               </tscDM:files>
            </rdf:Description>
         </tscDM:contentList>
      </rdf:Description>
   </rdf:RDF>
</x:xmpmeta>