<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-22 01:59:37 AM" dc:source="Camtasia,9.0.1,enu" dc:title="l_09pkc2" tscDM:firstFrame="l_09pkc2_First_Frame.png" tscDM:originId="2625EA67-814F-4A0C-B4C7-2902396CFF3B" tscDM:project="l_09pkc2.tscproj">
         <xmpDM:duration xmpDM:scale="1/1000" xmpDM:value="2903233"/>
         <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="" xmpDM:startTime="0" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Finding d and e de = 1 mod F(n) Select e first, e.g.," xmpDM:startTime="218167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="e=21+1, 24+1 or 216+1 Þ Exponentiation is easy." xmpDM:startTime="218167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Find inverse of e using Euclid's algorithm The public key can be small." xmpDM:startTime="218167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The private key should be large Þ Don't select d=3." xmpDM:startTime="218167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Can be attacked using Chinese remainder theorem &amp; 3 messages with different modulii Both d and n are 512 bit" xmpDM:startTime="218167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="(150 digits) numbers." xmpDM:startTime="218167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="218167" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="377567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="480900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Finding d and e de = 1 mod F(n) Select e first, e.g.," xmpDM:startTime="547600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="e=21+1, 24+1 or 216+1 Þ Exponentiation is easy." xmpDM:startTime="547600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Find inverse of e using Euclid's algorithm The public key can be small." xmpDM:startTime="547600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The private key should be large Þ Don't select d=3." xmpDM:startTime="547600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Can be attacked using Chinese remainder theorem &amp; 3 messages with different modulii Both d and n are 512 bit" xmpDM:startTime="547600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="(150 digits) numbers." xmpDM:startTime="547600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="547600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="547767" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="848467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Finding d and e de = 1 mod F(n) Select e first, e.g.," xmpDM:startTime="850533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="e=21+1, 24+1 or 216+1 Þ Exponentiation is easy." xmpDM:startTime="850533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Find inverse of e using Euclid's algorithm The public key can be small." xmpDM:startTime="850533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The private key should be large Þ Don't select d=3." xmpDM:startTime="850533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Can be attacked using Chinese remainder theorem &amp; 3 messages with different modulii Both d and n are 512 bit" xmpDM:startTime="850533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="(150 digits) numbers." xmpDM:startTime="850533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="850533" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="851067" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Exponentiation Can use the Square and Multiply Algorithm E.g.," xmpDM:startTime="871233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="3129 = 3128×31 = 5×3 = 4 mod 11 Takes log (b) operations for ab To compute ab mod n:" xmpDM:startTime="871233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Expand b as a binary number: bkbk-1 … b2b1b0 k= Number of bits in b c = 0; f =" xmpDM:startTime="871233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1 for i = k downto 0 do c = 2  c f = (f  f) mod n" xmpDM:startTime="871233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="if bi == 1 then c = c + 1 f = (f  a) mod n return f Excel" xmpDM:startTime="871233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="871233" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Optimizing Private Key Operations 1." xmpDM:startTime="1184900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="cd mod n = cd mod pq Compute cd mod p and cd mod q Use Chinese remainder theorem to" xmpDM:startTime="1184900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="compute cd mod pq 2." xmpDM:startTime="1184900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Chinese remainder theorem requires p-1 mod q and q-1 mod p." xmpDM:startTime="1184900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Compute them once and store." xmpDM:startTime="1184900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="3." xmpDM:startTime="1184900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Since d is much bigger than p, cd mod p = cr mod p where r= d mod (p-1) d" xmpDM:startTime="1184900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= k(p-1)+r Mod p: ad = ak(p-1)+r = akF(p) ar = ar [Euler's Theorem] Only owner of the private key" xmpDM:startTime="1184900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="knows p and q and can optimize" xmpDM:startTime="1184900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Optimization Example &lt;e, n&gt; = &lt;7, 187&gt;, &lt;d, n&gt; = &lt;23, 187&gt; 17-1 mod 11 = 2 and 11-1 mod" xmpDM:startTime="1371800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="17 =14 cd mod pq = [(cd mod p) q (q-1 mod p) + (cd mod q) p (p-1 mod" xmpDM:startTime="1371800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="q)] mod n 10123 mod 11 = 1013 mod 11 = 2×4=8 10123 mod 17 = 1017 mod 17 =" xmpDM:startTime="1371800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="1014+2+1 mod 17 = 16 × 162 × 164 mod 17 = 16 × 1 × 1=16 10123 mod 187" xmpDM:startTime="1371800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="= [(10123 mod 11)17(2)] + (10123 mod 17)11(14)] mod 187 = [8 ×34 + (167 mod 17)×154] mod 187 =" xmpDM:startTime="1371800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="[8 × 34 + 16 × 154]mod 187 = [272+2464] mod 187 =2736 mod 187 = 118 Verification: 1012 mod" xmpDM:startTime="1371800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="187 = 10201 mode 187 = 103 1014 mod 187 = 1032 mod 187 = 10609 mod 187 =137 1018" xmpDM:startTime="1371800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="mod 187 = 1372 mod 187 =18769 mod 187 = 69 10116 mod 187 = 692 mod 187 = 4761" xmpDM:startTime="1371800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="mod 187 = 86 10123 mod 187 = 10116×1014×1012×101=86 ×137 ×103 ×101 mod 187 = 86 ×137 ×10403 mod 187=86" xmpDM:startTime="1371800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="×137 ×118 mod 187 = 86 ×16166 mod 187 = 86 ×84 mod 187 = 7224 mod 187 = 118" xmpDM:startTime="1371800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1371800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="RSA Issues RSA is computationally intense." xmpDM:startTime="1693967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Commonly used key lengths are 1024 bits The plain text should be smaller than the key length The encrypted text" xmpDM:startTime="1693967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is same size as the key length Generally used to encrypt secret keys." xmpDM:startTime="1693967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Potential Attacks: Brute force key search - infeasible given size of numbers Timing attacks - on running of decryption Can" xmpDM:startTime="1693967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Infer operand size based on time taken Þ Use constant time Mathematical attacks - based on difficulty of computing ø(n)," xmpDM:startTime="1693967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="by factoring modulus n Chosen ciphertext attacks" xmpDM:startTime="1693967" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Progress in Factoring Ref: The RSA Factoring Challenge FAQ, http://www.rsa.com/rsalabs/node.asp?id=2094" xmpDM:startTime="1839800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1839800" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="RSA Issues RSA is computationally intense." xmpDM:startTime="1845100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Commonly used key lengths are 1024 bits The plain text should be smaller than the key length The encrypted text" xmpDM:startTime="1845100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="is same size as the key length Generally used to encrypt secret keys." xmpDM:startTime="1845100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Potential Attacks: Brute force key search - infeasible given size of numbers Timing attacks - on running of decryption Can" xmpDM:startTime="1845100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Infer operand size based on time taken Þ Use constant time Mathematical attacks - based on difficulty of computing ø(n)," xmpDM:startTime="1845100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="by factoring modulus n Chosen ciphertext attacks" xmpDM:startTime="1845100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Progress in Factoring Ref: The RSA Factoring Challenge FAQ, http://www.rsa.com/rsalabs/node.asp?id=2094" xmpDM:startTime="1883933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="1883933" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Optimal Asymmetric Encryption Padding (OAEP) RSA is susceptible to “Chosen Ciphertext Attack” E(PU, M) = Me mod n E(PU, M1)" xmpDM:startTime="2012500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="E(PU, M2) = E(PU, M1M2) E(PU, 2M)=2e E(PU, M) Submit 2e  Ciphertext and get back 2M Þ know Plaintext" xmpDM:startTime="2012500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M OAEP: Let k =# bits in RSA modulus Plaintext m is k-k0-k1 bit string G and H are Cryptographic" xmpDM:startTime="2012500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="fn G expands k0 bits to k-k0 bits H reduces k-k0 bits to k0 bits r is a random k0" xmpDM:startTime="2012500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="bit seed Need to recover entire X and Y m 000 r G H X Y   k-k0-k1 k1" xmpDM:startTime="2012500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="k0 k-k0 Ref: http://en.wikipedia.org/wiki/Optimal_asymmetric_encryption_padding" xmpDM:startTime="2012500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="PU=Public Key Parameters hash" xmpDM:startTime="2012500" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary Public key encryption uses two keys: one to encrypt and the other to decrypt." xmpDM:startTime="2373100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The keys are interchangeable." xmpDM:startTime="2373100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="One key is public." xmpDM:startTime="2373100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Other is private." xmpDM:startTime="2373100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="RSA uses exponentiation in GF(n) for a large n." xmpDM:startTime="2373100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="n is a product of two large primes." xmpDM:startTime="2373100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="RSA keys are &lt;e, n&gt; and &lt;d, n&gt; where ed mod F(n)=1 Given the keys, both encryption and decryption are" xmpDM:startTime="2373100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="easy." xmpDM:startTime="2373100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="But given one key finding the other key is hard." xmpDM:startTime="2373100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The message size should be less than the key size." xmpDM:startTime="2373100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Use large keys 512 bits and larger." xmpDM:startTime="2373100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2373100" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Optimal Asymmetric Encryption Padding (OAEP) RSA is susceptible to “Chosen Ciphertext Attack” E(PU, M) = Me mod n E(PU, M1)" xmpDM:startTime="2374267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="E(PU, M2) = E(PU, M1M2) E(PU, 2M)=2e E(PU, M) Submit 2e  Ciphertext and get back 2M Þ know Plaintext" xmpDM:startTime="2374267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M OAEP: Let k =# bits in RSA modulus Plaintext m is k-k0-k1 bit string G and H are Cryptographic" xmpDM:startTime="2374267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="fn G expands k0 bits to k-k0 bits H reduces k-k0 bits to k0 bits r is a random k0" xmpDM:startTime="2374267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="bit seed Need to recover entire X and Y m 000 r G H X Y   k-k0-k1 k1" xmpDM:startTime="2374267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="k0 k-k0 Ref: http://en.wikipedia.org/wiki/Optimal_asymmetric_encryption_padding" xmpDM:startTime="2374267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="PU=Public Key Parameters hash" xmpDM:startTime="2374267" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary Public key encryption uses two keys: one to encrypt and the other to decrypt." xmpDM:startTime="2399467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The keys are interchangeable." xmpDM:startTime="2399467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="One key is public." xmpDM:startTime="2399467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Other is private." xmpDM:startTime="2399467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="RSA uses exponentiation in GF(n) for a large n." xmpDM:startTime="2399467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="n is a product of two large primes." xmpDM:startTime="2399467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="RSA keys are &lt;e, n&gt; and &lt;d, n&gt; where ed mod F(n)=1 Given the keys, both encryption and decryption are" xmpDM:startTime="2399467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="easy." xmpDM:startTime="2399467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="But given one key finding the other key is hard." xmpDM:startTime="2399467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The message size should be less than the key size." xmpDM:startTime="2399467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Use large keys 512 bits and larger." xmpDM:startTime="2399467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2399467" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Optimal Asymmetric Encryption Padding (OAEP) RSA is susceptible to “Chosen Ciphertext Attack” E(PU, M) = Me mod n E(PU, M1)" xmpDM:startTime="2401600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="E(PU, M2) = E(PU, M1M2) E(PU, 2M)=2e E(PU, M) Submit 2e  Ciphertext and get back 2M Þ know Plaintext" xmpDM:startTime="2401600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="M OAEP: Let k =# bits in RSA modulus Plaintext m is k-k0-k1 bit string G and H are Cryptographic" xmpDM:startTime="2401600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="fn G expands k0 bits to k-k0 bits H reduces k-k0 bits to k0 bits r is a random k0" xmpDM:startTime="2401600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="bit seed Need to recover entire X and Y m 000 r G H X Y   k-k0-k1 k1" xmpDM:startTime="2401600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="k0 k-k0 Ref: http://en.wikipedia.org/wiki/Optimal_asymmetric_encryption_padding" xmpDM:startTime="2401600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="PU=Public Key Parameters hash" xmpDM:startTime="2401600" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary Public key encryption uses two keys: one to encrypt and the other to decrypt." xmpDM:startTime="2569567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The keys are interchangeable." xmpDM:startTime="2569567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="One key is public." xmpDM:startTime="2569567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Other is private." xmpDM:startTime="2569567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="RSA uses exponentiation in GF(n) for a large n." xmpDM:startTime="2569567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="n is a product of two large primes." xmpDM:startTime="2569567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="RSA keys are &lt;e, n&gt; and &lt;d, n&gt; where ed mod F(n)=1 Given the keys, both encryption and decryption are" xmpDM:startTime="2569567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="easy." xmpDM:startTime="2569567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="But given one key finding the other key is hard." xmpDM:startTime="2569567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="The message size should be less than the key size." xmpDM:startTime="2569567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Use large keys 512 bits and larger." xmpDM:startTime="2569567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="" xmpDM:startTime="2569567" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 9 In an RSA system, the public key is {31, 3599}." xmpDM:startTime="2655667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="What is the private Key? Perform encryption and decryption using RSA algorithm using the following parameters: p=3; q=11; e=7; M=5" xmpDM:startTime="2655667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="p=5; q=11; e=3; M=9 p=7; q=11; e=17; M=8 p=11; q=13; e=11; M=7 p=17; q=31; e=7; M=2 Try all." xmpDM:startTime="2655667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Submit answer to 1 only." xmpDM:startTime="2655667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="In a public key system using RSA, you intercept the ciphertext C=10 set to a user whose public key is" xmpDM:startTime="2655667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="{5,35}." xmpDM:startTime="2655667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="What is the private key and the plaintext M? Compute 5596 mod 1234" xmpDM:startTime="2655667" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Lab 9: Key Logger Download the key logger from: https://kidlogger.net" xmpDM:startTime="2874900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Use the version for Mac or Windows." xmpDM:startTime="2874900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Install the key logger Go to any financial/bank web site and try to login with a fake user name and" xmpDM:startTime="2874900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="password." xmpDM:startTime="2874900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Print the key log and underline the password you used and submit." xmpDM:startTime="2874900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Note that this works even though the site uses https." xmpDM:startTime="2874900" xmpDM:duration="1000"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Remember to uninstall the key logger" xmpDM:startTime="2874900" 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="RSA Public Key Encryption" xmpDM:startTime="0" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="0" tscDM:imageoffset="0" tscDM:imagerect="0, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Finding d and e" xmpDM:startTime="218167" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="1" tscDM:imageoffset="0" tscDM:imagerect="75, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="RSA Key Construction: Example" xmpDM:startTime="377567" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="2" tscDM:imageoffset="0" tscDM:imagerect="150, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="End of presentation" xmpDM:startTime="471733" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="3" tscDM:imageoffset="0" tscDM:imagerect="225, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="RSA Key Construction: Example" xmpDM:startTime="480900" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="4" tscDM:imageoffset="0" tscDM:imagerect="300, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Finding d and e" xmpDM:startTime="547600" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="5" tscDM:imageoffset="0" tscDM:imagerect="375, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="RSA Public Key Encryption" xmpDM:startTime="547767" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="6" tscDM:imageoffset="0" tscDM:imagerect="450, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="End of presentation" xmpDM:startTime="638533" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="7" tscDM:imageoffset="0" tscDM:imagerect="525, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="RSA Public Key Encryption" xmpDM:startTime="848467" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="8" tscDM:imageoffset="0" tscDM:imagerect="600, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Finding d and e" xmpDM:startTime="850533" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="9" tscDM:imageoffset="0" tscDM:imagerect="675, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="RSA Key Construction: Example" xmpDM:startTime="851067" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="10" tscDM:imageoffset="0" tscDM:imagerect="750, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Exponentiation" xmpDM:startTime="871233" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="11" tscDM:imageoffset="0" tscDM:imagerect="825, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Optimizing Private Key Operations" xmpDM:startTime="1184900" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="12" tscDM:imageoffset="0" tscDM:imagerect="900, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Optimization Example" xmpDM:startTime="1371800" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="13" tscDM:imageoffset="0" tscDM:imagerect="975, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="RSA Issues" xmpDM:startTime="1693967" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="14" tscDM:imageoffset="0" tscDM:imagerect="1050, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Progress in Factoring" xmpDM:startTime="1839800" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="15" tscDM:imageoffset="0" tscDM:imagerect="1125, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="RSA Issues" xmpDM:startTime="1845100" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="16" tscDM:imageoffset="0" tscDM:imagerect="1200, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Progress in Factoring" xmpDM:startTime="1883933" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="17" tscDM:imageoffset="0" tscDM:imagerect="1275, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Optimal Asymmetric Encryption Padding (OAEP)" xmpDM:startTime="2012500" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="18" tscDM:imageoffset="0" tscDM:imagerect="1350, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary" xmpDM:startTime="2373100" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="19" tscDM:imageoffset="0" tscDM:imagerect="1425, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Optimal Asymmetric Encryption Padding (OAEP)" xmpDM:startTime="2374267" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="20" tscDM:imageoffset="0" tscDM:imagerect="1500, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary" xmpDM:startTime="2399467" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="21" tscDM:imageoffset="0" tscDM:imagerect="1575, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Optimal Asymmetric Encryption Padding (OAEP)" xmpDM:startTime="2401600" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="22" tscDM:imageoffset="0" tscDM:imagerect="1650, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Summary" xmpDM:startTime="2569567" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="23" tscDM:imageoffset="0" tscDM:imagerect="1725, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Homework 9" xmpDM:startTime="2655667" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="24" tscDM:imageoffset="0" tscDM:imagerect="1800, 0, 75, 56"/></rdf:li><rdf:li><rdf:Description xmpDM:name="Lab 9: Key Logger" xmpDM:startTime="2874900" tscDM:image="l_09pkc2_Thumbnails.png" tscDM:imageindex="25" tscDM:imageoffset="0" tscDM:imagerect="1875, 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_09pkc2.mp4"/><rdf:li xmpDM:name="1" xmpDM:value="l_09pkc2_First_Frame.png"/><rdf:li xmpDM:name="2" xmpDM:value="l_09pkc2_Thumbnails.png"/></rdf:Seq>
               </tscDM:files>
            </rdf:Description>
         </tscDM:contentList>
      </rdf:Description>
   </rdf:RDF>
</x:xmpmeta>