Type or paste question here

Question 1 What are the ingredients used in the encrypted shadow file that makes the decryption particularly hard? Question 2 Would an exhaustive search attack be realistic on this shadow file? Why? Question 3 Describe your chosen method of attack. Question 4 Explain the thinking, and the heuristics behind your chosen method. Question 5 Provide a time and space analysis of the attack with reference to lines in your code, and state the average running time to crack one, and all 26 passwords. Question 6 How can you optimise the attack and what are the trade-offs of the optimisation? Question 7 Explain, in practical terms and with an example from Carl Davis's solutions and the actual encryption function used in the exercise, how rainbow table attacks work. Question 8 Would a rainbow table attack be practical in this case? Why? Question 9 Explain how you worked around the password salting. Question 10 Describe briefly with the aid of diagrams the architecture and design of your code. Have you relied on any external system