As usual, the following clarification should be made clear before given the details of the rubrics.
1. Creating rubrics for a math problem are tricky, as most of the time, the rubrics itself will reflects how to work out the answer.
For example, if the questions ask: Find x such that 3x = 24 mod 41. (5 marks)
And if the rubrics reads like, there will be 2 marks for the baby step lists, 2 marks for the giant step lists and 1 mark for the final answer.
Then these rubrics actually tell everyone how to solve this problem, and the question becomes how to use calculators but not how to apply cryptographical knowledge. This will be avoided in the rubrics.
2. There is no difference between HD, D, C… rubrics, as it cannot be applied here. If your answer is correct and complete, then you get all the marks for this question. In other words, if you have more than 80% marks of this assignment, then you are a HD for this assignment. Note that, by saying HD tasks in some assignments, it merely because those problems doesn’t appear in the lecture notes or workshops. Note that these HD tasks examines how to apply knowledge to solve problems, and you cannot expect that you can copy the method from a 99%-similar (only differ in numbers and wording) question in the lecture notes or workshops. All the questions not listed as HD tasks have been discussed in the class.
Detailed rubrics for Assignment 3: Question 1:
Part A: Correctly apply the formula of point addition of EC; Work out the correct numbers in a detailed and step-by-step manner; show the verification in a clear way.
Part B: Use maple command to find all the points on the specified curve, you need to show a screenshot of the command as well as present the final answers.
Part B: Use maple command to plot the curve as required, you are assumed to show both the command and the figure.
Question 2:
You must follow the instructions given in the question to get the composite number n = p * q. And you are asked to specify two random curves, and you need to use the two different curves you chose to factorize n and answer questions. Note that, even though the question says that the EC-based method can be parallelized, it is clear that it doesn’t ask you to write a parallelized maple program.
Questions 3-6:
All these questions are marked as HD, so there will not be direct answers or 99%-similar questions from the lecture notes or workshops. They are created for testing your knowledge about cryptography and real problem-solving skills. To solve all these questions, you have to read the questions with care and come up with your own understanding. Note that copy some similar definitions from other textbooks/blogs/wiki will make you lose quite a few marks, as I have rephrased the definitions. More importantly, you must be careful with academic integrity if you copy anything. Moreover, you also
need to do some research to the international standard NIST SP800-38A and link your own understanding to this standard.
For Q3, you have to prove that OTP satisfy the given definition.
For Q4, you have to show how to modify OTP to have COA-IND and you need to explain why.
For Q5, you need to define KPA-IND, CPA-IND, CCA-IND in a way similar to the COA-game. Note that both the non-adaptive and adaptive versions of CPA will be fully marked, so does CCA.
For Q6, you need to do a naïve research of NIST SP800-38A and find the mode of operation of AES, and answer which mode achieves which security definition.
Good Luck!