ALL THE BEST

List of Assignments (In Reverse Chronological Order)

    1. First Assignment. Part 1 and 2 due 15th Aug Friday midnight.
         1. A  terrorist  transmits  the  same message m to each of his 3
            accompliers  across the globe. The accomplies have differeent
            private  keys  (d1, n1), (d2, n2) and (d3, n3). They have the
            same  encryption key 3. Further, n1, n2 and n3 are relatively
            prime to each other.
            The terrorist encrypts the message m before transmission. All
            the  three encrypted messages, c1, c2 and c3, are intercepted
            during transmission.
            Show  how to recover m without being able to factorize n1, n2
            or n3.
            Hint: Use Chineese Remainder Theorem.
         2. Using the Java BigInteger class,
              1. Generate an RSA Public-Private key pair.
              2. Encrypt an arbitrary message using the public key.
              3. Decrypt the message using the private key.
            Experiment the above with
              1. Different  key sizes (128, 256, 512, 768, 1024 bits) and
                 determine the time for each of the above operations as a
                 function of key size.
              2. Different  message  sizes  from 0 to 4KB for any two key
                 sizes   of  your  choice  and  determine  the  time  for
                 encrypting/decrypting  those  messages  as a function of
                 message size.
              3. Different  values  for  the  "probability  of P, Q being
                 prime"  variable  in  the  constructor of the BigInteger
                 class  and  determine  the  time  for key generation for
                 different value of this variable.
            In  addition  to  the  time  measurements for key generation,
            encryption  and  decryption  AND  analysis  of results please
            submit an appendix which includes:
               o Your Java code.
               o A  sample  key  and message with key generation time and
                 encryption / decryption time.
               o A script file to execute your program.
            Here  is  the source code of the java program demonstrated in
                                                          Assignments (p5 of 5)
            the class for implementation of RSA.
            Here  is  a  link  to  the  local copy of Java 2 Platform API
            doccumentation.
            Here   is   a  link  directly  to  the  page  containing  the
            documentation for BigInteger class.
         3. To be put up soon.




                                ALL THE BEST

List of Assignments (In Reverse Chronological Order)

    1. First Assignment. Part 1 and 2 due 15th Aug Friday midnight.
         1. A  terrorist  transmits  the  same message m to each of his 3
            accompliers  across the globe. The accomplies have differeent
            private  keys  (d1, n1), (d2, n2) and (d3, n3). They have the
            same  encryption key 3. Further, n1, n2 and n3 are relatively
            prime to each other.
            The terrorist encrypts the message m before transmission. All
            the  three encrypted messages, c1, c2 and c3, are intercepted
            during transmission.
            Show  how to recover m without being able to factorize n1, n2
            or n3.
            Hint: Use Chineese Remainder Theorem.
         2. Using the Java BigInteger class,
              1. Generate an RSA Public-Private key pair.
              2. Encrypt an arbitrary message using the public key.
              3. Decrypt the message using the private key.
            Experiment the above with
              1. Different  key sizes (128, 256, 512, 768, 1024 bits) and
                 determine the time for each of the above operations as a
                 function of key size.
              2. Different  message  sizes  from 0 to 4KB for any two key
                 sizes   of  your  choice  and  determine  the  time  for
                 encrypting/decrypting  those  messages  as a function of
                 message size.
              3. Different  values  for  the  "probability  of P, Q being
                 prime"  variable  in  the  constructor of the BigInteger
                 class  and  determine  the  time  for key generation for
                 different value of this variable.
            In  addition  to  the  time  measurements for key generation,
            encryption  and  decryption  AND  analysis  of results please
            submit an appendix which includes:
               o Your Java code.
               o A  sample  key  and message with key generation time and
                 encryption / decryption time.
               o A script file to execute your program.
            Here  is  the source code of the java program demonstrated in
                                                          Assignments (p5 of 5)
            the class for implementation of RSA.
            Here  is  a  link  to  the  local copy of Java 2 Platform API
            doccumentation.
            Here   is   a  link  directly  to  the  page  containing  the
            documentation for BigInteger class.
         3. To be put up soon.