Security of many cryptographic techniques

Question

Assignment 1: Diffie­Hellman key exchange protocol

The security of many cryptographic techniques depends on a challenging mathematical concept—the discrete log problem (Anderson, 2008, Section 5.7.2). For this Assignment, you will review the Diffie­Hellman key exchange protocol and describe how to address common attacks on that protocol. You will also perform some basic calculations.

To complete this Assignment:

For this Assignment, submit a single document with your answers to the following: Review the Diffie­Hellman key exchange protocol discussed in the lecture and list some of the attacks on Diffie­Hellman. Explain your solutions for avoiding such attacks. Calculate the value of the symmetric key and the values of R1 and R2 in the Diffie­Helman Protocol for the set of given values.

Assignment 2: Cryptosystems

ABC Company is to develop a secure message and file exchange application to enable its remote teams to collaborate securely. The company uses a PKI as part of its cryptosystem where each employee has its own public/private key pair. The public keys are stored on a local key server. Files could range from small ones to very large multimedia files (e.g. video presentations). Messages exchanged through the system are of a short length and a high sensitivity.

To complete this Assignment:

Analyse how ABC Company utilises a PKI. Recommend a cryptosystem for the company and explain your recommendation. Identify the weakest links in the system. Recommend solutions for those weak links and explain how your solutions address the problems. Evaluate the applicability of the Enigmail add­ons for Thunderbird as a preferred choice, compared with the burden of developing a new system (Brunschwig, 2013).

For all Assignments:

Your document must have 750 to ­1,000 words (not comprising the list of works cited), however it is the quality of the answer that matters, not the number of words. Cite and reference all sources use the Harvard Liverpool Referencing System.