<x:xmpmeta tsc:version="2.0.1" xmlns:x="adobe:ns:meta/" xmlns:tsc="http://www.techsmith.com/xmp/tsc/">
   <rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:xmp="http://ns.adobe.com/xap/1.0/" xmlns:xmpDM="http://ns.adobe.com/xmp/1.0/DynamicMedia/" xmlns:xmpG="http://ns.adobe.com/xap/1.0/g/" xmlns:xmpMM="http://ns.adobe.com/xap/1.0/mm/" xmlns:tscDM="http://www.techsmith.com/xmp/tscDM/" xmlns:tscIQ="http://www.techsmith.com/xmp/tscIQ/" xmlns:tscHS="http://www.techsmith.com/xmp/tscHS/" xmlns:stDim="http://ns.adobe.com/xap/1.0/sType/Dimensions#" xmlns:stFnt="http://ns.adobe.com/xap/1.0/sType/Font#" xmlns:exif="http://ns.adobe.com/exif/1.0" xmlns:dc="http://purl.org/dc/elements/1.1/">
      <rdf:Description dc:date="2017-02-20 12:23:21 AM" dc:source="Camtasia,9.0.1,enu" dc:title="l_09pkc1" tscDM:firstFrame="l_09pkc1_First_Frame.png" tscDM:originId="2625EA67-814F-4A0C-B4C7-2902396CFF3B" tscDM:project="l_09pkc1.tscproj">
         <xmpDM:duration xmpDM:scale="1/1000" xmpDM:value="1408733"/>
         <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="Public Key Cryptography and RSA Raj Jain Washington University in Saint Louis Saint Louis, MO 63130 Jain@cse.wustl.edu" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Audio/Video recordings of this lecture are available at: http://www.cse.wustl.edu/~jain/cse571-17/" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Overview Public Key Encryption Symmetric vs." xmpDM:startTime="18933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Public-Key RSA Public Key Encryption RSA Key Construction Optimizing Private Key Operations RSA Security These slides are based partly on" xmpDM:startTime="18933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Lawrie Brown’s slides supplied with William Stallings’s book “Cryptography and Network Security: Principles and Practice,” 7th Ed, 2017." xmpDM:startTime="18933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="18933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Public Key Encryption Invented in 1975 by Diffie and Hellman at Stanford Encrypted_Message = Encrypt(Key1, Message) Message = Decrypt(Key2, Encrypted_Message)" xmpDM:startTime="58367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Keys are interchangeable: One key is made public while the other is kept private Sender knows only public key of" xmpDM:startTime="58367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="the receiver Þ Asymmetric Text Ciphertext Text Key1 Key2 Text Ciphertext Text Key2 Key1 Ref: http://en.wikipedia.org/wiki/Public-key_cryptography" xmpDM:startTime="58367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="58367" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Public Key Encryption Example Rivest, Shamir, and Adleman at MIT RSA: Encrypted_Message = m3 mod 187 Message = Encrypted_Message107 mod" xmpDM:startTime="196133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="187 Key1 = &lt;3,187&gt;, Key2 = &lt;107,187&gt; Message = 5 Encrypted Message = 53 = 125 Message = 125107 mod" xmpDM:startTime="196133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="187 = 5 = 125(64+32+8+2+1) mod 187 = {(12564 mod 187)(12532 mod 187)..." xmpDM:startTime="196133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="(1252 mod 187)(125 mod 187)} mod 187 Ref: http://en.wikipedia.org/wiki/RSA" xmpDM:startTime="196133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="196133" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Symmetric vs." xmpDM:startTime="462900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Public-Key" xmpDM:startTime="462900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Public-Key Authentication and Secrecy A encrypts the message with its private key and then with B’s public key B can" xmpDM:startTime="636800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="decrypt it with its private key and A’s public key No one else can decrypt Þ Secrecy No one else" xmpDM:startTime="636800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="can send such a message Þ B is assured that the message was sent by A Þ Authentication Message A’s" xmpDM:startTime="636800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Private Key B’s Public Key A B" xmpDM:startTime="636800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Public-Key Applications 3 Categories: Encryption/decryption (provide secrecy) Digital signatures (provide authentication) Key exchange (of session keys) Some algorithms are suitable" xmpDM:startTime="996233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="for all uses, others are specific to one" xmpDM:startTime="996233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Public-Key Requirements Need a trapdoor one-way function One-way function has Y = f(X) easy X = f–1(Y) infeasible A trap-door" xmpDM:startTime="1163200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="one-way function has Y = fk(X) easy, if k and X are known X = fk–1(Y) easy, if k and" xmpDM:startTime="1163200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Y are known X = fk–1(Y) infeasible, if Y known but k not known A practical public-key scheme depends on" xmpDM:startTime="1163200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="a suitable trap-door one-way function" xmpDM:startTime="1163200" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Security of Public Key Schemes Like private key schemes brute force exhaustive search attack is always theoretically possible But keys" xmpDM:startTime="1242233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="used are too large (&gt;512bits) Security relies on a large enough difference in difficulty between easy (en/decrypt) and hard (cryptanalyse)" xmpDM:startTime="1242233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="problems More generally the hard problem is known, but is made hard enough to be impractical to break Requires the" xmpDM:startTime="1242233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="use of very large numbers Hence is slow compared to private key schemes" xmpDM:startTime="1242233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Public-Key Requirements Need a trapdoor one-way function One-way function has Y = f(X) easy X = f–1(Y) infeasible A trap-door" xmpDM:startTime="1245000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="one-way function has Y = fk(X) easy, if k and X are known X = fk–1(Y) easy, if k and" xmpDM:startTime="1245000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Y are known X = fk–1(Y) infeasible, if Y known but k not known A practical public-key scheme depends on" xmpDM:startTime="1245000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="a suitable trap-door one-way function" xmpDM:startTime="1245000" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Security of Public Key Schemes Like private key schemes brute force exhaustive search attack is always theoretically possible But keys" xmpDM:startTime="1245767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="used are too large (&gt;512bits) Security relies on a large enough difference in difficulty between easy (en/decrypt) and hard (cryptanalyse)" xmpDM:startTime="1245767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="problems More generally the hard problem is known, but is made hard enough to be impractical to break Requires the" xmpDM:startTime="1245767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="use of very large numbers Hence is slow compared to private key schemes" xmpDM:startTime="1245767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1327100" 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="Public Key Cryptography and RSA" xmpDM:startTime="0" tscDM:image="l_09pkc1_Thumbnails.png" tscDM:imageindex="0" tscDM:imageoffset="0" tscDM:imagerect="0, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Overview" xmpDM:startTime="18933" tscDM:image="l_09pkc1_Thumbnails.png" tscDM:imageindex="1" tscDM:imageoffset="0" tscDM:imagerect="75, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Public Key Encryption" xmpDM:startTime="58367" tscDM:image="l_09pkc1_Thumbnails.png" tscDM:imageindex="2" tscDM:imageoffset="0" tscDM:imagerect="150, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Public Key Encryption Example" xmpDM:startTime="196133" tscDM:image="l_09pkc1_Thumbnails.png" tscDM:imageindex="3" tscDM:imageoffset="0" tscDM:imagerect="225, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Symmetric vs. Public-Key" xmpDM:startTime="462900" tscDM:image="l_09pkc1_Thumbnails.png" tscDM:imageindex="4" tscDM:imageoffset="0" tscDM:imagerect="300, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Public-Key Authentication and Secrecy" xmpDM:startTime="636800" tscDM:image="l_09pkc1_Thumbnails.png" tscDM:imageindex="5" tscDM:imageoffset="0" tscDM:imagerect="375, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Public-Key Applications" xmpDM:startTime="996233" tscDM:image="l_09pkc1_Thumbnails.png" tscDM:imageindex="6" tscDM:imageoffset="0" tscDM:imagerect="450, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Public-Key Requirements" xmpDM:startTime="1163200" tscDM:image="l_09pkc1_Thumbnails.png" tscDM:imageindex="7" tscDM:imageoffset="0" tscDM:imagerect="525, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Security of Public Key Schemes" xmpDM:startTime="1242233" tscDM:image="l_09pkc1_Thumbnails.png" tscDM:imageindex="8" tscDM:imageoffset="0" tscDM:imagerect="600, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Public-Key Requirements" xmpDM:startTime="1245000" tscDM:image="l_09pkc1_Thumbnails.png" tscDM:imageindex="9" tscDM:imageoffset="0" tscDM:imagerect="675, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Security of Public Key Schemes" xmpDM:startTime="1245767" tscDM:image="l_09pkc1_Thumbnails.png" tscDM:imageindex="10" tscDM:imageoffset="0" tscDM:imagerect="750, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="RSA Public Key Encryption" xmpDM:startTime="1327100" tscDM:image="l_09pkc1_Thumbnails.png" tscDM:imageindex="11" tscDM:imageoffset="0" tscDM:imagerect="825, 0, 75, 56"/></rdf:li></rdf:Seq>
                     </xmpDM:markers>
                  </rdf:Description>
               </rdf:li>
            </rdf:Bag>
         </xmpDM:Tracks>
         <tscDM:controller>
            <rdf:Description xmpDM:name="tscplayer">
               <tscDM:parameters>
                  <rdf:Bag>
                     <rdf:li xmpDM:name="autohide" xmpDM:value="false"/><rdf:li xmpDM:name="autoplay" xmpDM:value="true"/><rdf:li xmpDM:name="loop" xmpDM:value="false"/><rdf:li xmpDM:name="searchable" xmpDM:value="true"/><rdf:li xmpDM:name="captionsenabled" xmpDM:value="false"/><rdf:li xmpDM:name="sidebarenabled" xmpDM:value="false"/><rdf:li xmpDM:name="unicodeenabled" xmpDM:value="false"/><rdf:li xmpDM:name="backgroundcolor" xmpDM:value="000000"/><rdf:li xmpDM:name="sidebarlocation" xmpDM:value="left"/><rdf:li xmpDM:name="endaction" xmpDM:value="stop"/><rdf:li xmpDM:name="endactionparam" xmpDM:value="true"/><rdf:li xmpDM:name="locale" xmpDM:value="en-US"/></rdf:Bag>
               </tscDM:parameters>
               <tscDM:controllerText>
                  <rdf:Bag>
                  </rdf:Bag>
               </tscDM:controllerText>
            </rdf:Description>
         </tscDM:controller>
         <tscDM:contentList>
            <rdf:Description>
               <tscDM:files>
                  <rdf:Seq>
                     <rdf:li xmpDM:name="0" xmpDM:value="l_09pkc1.mp4"/><rdf:li xmpDM:name="1" xmpDM:value="l_09pkc1_First_Frame.png"/><rdf:li xmpDM:name="2" xmpDM:value="l_09pkc1_Thumbnails.png"/></rdf:Seq>
               </tscDM:files>
            </rdf:Description>
         </tscDM:contentList>
      </rdf:Description>
   </rdf:RDF>
</x:xmpmeta>