辅导COSC2536a编程、写作Java编程设计

” 辅导COSC2536a编程、写作Java编程设计COSC2536/2537 Security in Computing and InformationTechnologyAssignment 1Assessment Type: Individual assignment; no group work. Submit online via CanvasAssignmentsAssignment1.Marks awarded for meeting requirements as closely as possible. Clarifications/updates may be made viaannouncements/relevant discussion forums.Due date: Week 4, Friday the 14th Aug 2020 11:59pmDeadlines will not be advanced, but they may be extended. Please check CanvasSyllabus or viaCanvasAssignmentsAssignment 1 for the most up to date information.As this is a major assignment in which you demonstrate your understanding, a university standard late penalty of 10% pereach working day applies for up to 5 working days late, unless special consideration has been granted.Weighting: 15 marks (Contributes 15% of the total Grade)1. OverviewThe objective of Assignment 1 is evaluating your knowledge on the topics covered in Lecture 1-4. Topics include BasicCryptographic Techniques (symmetric-key cryptography, hash, and cryptanalysis), and Public-Key Cryptography (RSA,ElGamal and Paillier cryptosystems). Assignment 1 will focus on developing your abilities in application of knowledge,critical analysis and decision making. Assignment 1 contains several problems related to the topics mentioned above. Youare required to prepare the solutions and upload them as a single PDF or Word document in CANVAS.In this assignment, There are 4 (four) questions in total. The first question Q1 is on designing a cryptographic algorithmfor a secure vault with A sophisticated digital keypad. In this question, a scenario is given that describes how a secret keyfor the digital keypad is generated and the digital keypad works. You need to design an algorithm that satisfies therequirements of the Security of the digital keypad.The second question Q2 is about designing an algorithm to perform cryptanalysis on a captured encrypted text. The termCryptanalysis is used to breach cryptographic security systems and gain access to the contents of encrypted messages,even if the cryptographic key is unknown. Therefore, you are expected to apply cryptanalysis in to obtain plaintext fromthe given ciphertext in Q2. 辅导COSC2536作业、写作Java编程设计作业The third question Q3 is about the designing a Secure Online Property Auction System using the hash algorithm. In Q3,you are expected to design an Online Bidding System where an attacker cannot determine the bid values of participantsand the hash algorithm based bidding would work.The fourth question Q4 is related to breaking the RSA Encryption algorithm. Only for this question, you can submit thesolution individually or in a group. In the case of a group submission, the maximum group members can be 3 (three),and you must mention the names of group members in the solution of this question. In this question, you are expectedto design an algorithm that would perform prime factorization using the computational power of 10 computers anddetermine the Private-key d from the public-key (n, e). You should demonstrate the detail steps with explanations howthe RSA encryption algorithm can be broken. Marks will be deducted if you fail to show the detail computations correctly,skip the computational steps, or do not provide explanations.Develop this assignment in an iterative fashion (as opposed to completing it in one sitting). You should be able to startpreparing your answers immediately after the Lecture-1 (in Week-1). At the end of each week starting from Week-1 toWeek-4, you should be able to solve at least one question.If there are questions, you must ask via the relevant Canvas discussion forums in a general manner.Submission instructions are detailed in Section 2.,Page 2 of 82. Submission InstructionsOverall, you must follow the following special instructions: You Must use the values provided in the questions. Hand-written answers are not allowed and will not be assessed. Compose your answers using anyword processing software (e.g. MS Word or Latex). You are required to show All of the steps and intermediate results for each question. Upload your solution as a single PDF or Word document in CANVAS.3. Assessment CriteriaThis assessment will determine your ability to: Follow requirements provided in this document and in the lessons. Independently Solve a problem by using cryptography and cryptanalysis concepts taught over the first four weeks of thecourse. Meeting deadlines.4. Learning OutcomesThis assessment is relevant to the following Learning Outcomes:1. CLO 1: explain the functioning of security services in computing environments and the security issues innetworked applications.2. CLO 2: discuss various types of data integrity and confidentiality mechanisms including public key cryptography.3. CLO 3: describe basic system security mechanisms and protocols, such as those used in operating systems, filesystems and computer networks.5. Assessment detailsPlease ensure that you have read Section 1 to 3 of this document before going further. Assessment details (i.e. questionQ1 to Q4) are provided in the next page.,Page 3 of 8Q1. Designing Cryptographic Algorithm for Secure Vault (3 Marks)One day, three friends (Alice, Bob, and Laura) miraculously found huge number of ancient gold coinsof equal size while bushwalking. They decided to equally divide those coins and bring them home.However, given that Homes may not be safe to store the coins, they decided to put them in a strongvault in a bank (see Figure-1.1).Figure-1.1: A vault with digital keypadFigure-1.2: Master Key generation at vault from three keysThe vault has a digital keypad (see Figure-1.1) which is used to enter secret password for opening it.However, this keypad is very sophisticated and specially designed for the three friends. It can acceptthree secret keys one after another. Each secret key is an integer number of 5 digits.When the keypad is initialized each friend enters individual secret key without anyone knowing thatnumber. Once all three friends enter their secret numbers, the sophisticated logic in the keypadperforms a mathematical operation and generates a master key by using the three numbers (seeFigure-1.2). It then stores the master key in the memory and deletes the individual secret keys.Digital Keypad,Page 4 of 8Once the digital keypad is initialized, they can come anytime but they must come all at the same timeand enter the secret keys one after another. Similar to the initialization phase, keypad performs amathematical operation and generates a new master key by using the three numbers. The new masterkey is then compared With old master key saved in the keypad. If they are same, the vault opens.Explain the algorithm with an example to design the sophisticated keypad for the excellentvault which has gold coins![Note: If you are interested to implement a broader version of this system as a Capstone project, pleasecontact the Lecturer]Q2. Designing Algorithm for Cryptanalysis with Missing Encrypted Text (3 Marks)On January 16, 1917, British code breakers intercepted an encrypted message from Zimmermannintended for Heinrich von Eckardt, the German ambassador to Mexico. The challenge was, theencrypted message had many missing ciphertext. The ciphertext and decoded message ofZimmermann is shown in Figure-2. In spite of missing encrypted text, the British cryptographic officeknown as Room 40 Decoded the Zimmermann Telegram and handed it over to the United States inlate-February 1917.(a) Encoded Message (b) Decoded MessageFigure-2: Zimmermann TelegramIn this task, you have to decrypt an encrypted message. However, here we have encrypted a longEnglish message a bit differently. Every single alphabet in the message has been substituted byanother unique alphabet. While the encrypted message was captured, some of the alphabets weremissing. A missing encrypted alphabet is marked as _. The encrypted message is shown below:EFA OBE_HA FBK OA_D IBNGDN BHH JBM G_ EFA JGKEBDRA BDJ _ BP SDBOHA ECBKRAIEBGD LFAEFAI BDMEFGDN FBK OAAD NBGDAJ CI DCE. _ FCL G HCDN QCI EFGK LBIEC ADJ. FCL G HC_N QCI TABRA. FCL LG_H G FBGH EFA JBM LFAD G IAESID EC EFA OCKCPCQ PM QBPGHM. P_ JABI G FCTA EC KAA MCS.You need to perform the followings:a) Decipher and find out the actual message. Show step-by-step processes.b) Provide the decryption algorithm (in pseudocode or actual code in any programming language).,Page 5 of 8Q3. Designing Secure Online Property Auction System using Hash Algorithm(4 Marks)Covid-19 has changed the way we conduct business these days. This is true for property auctions aswell. The Prime minister of Australia recently announced a ban on in-person auctions and open-forinspections.Large number of sellers and property agents are opting for online auctions. Based on anarticle published (URL: httpss://www.domain.com.au/news/saturday-auctions-how-will-they-work-now-they-are-allonline-944545/),we would like to highlight few facts about the current practice in online auctions: Online auctions Run like a mix between a live stream and a traditional auction, with buyersregistering and placing bids while watching the video as if they were there. Another method involves buyers sending off bids, similar to eBay, and the time allotted for theauction is extended by five minutes every time a bid is entered.Obviously, there are many issues with online auction, but one of the critical issues is trust the wayonline bidding process is conducted. We want to make sure the online bidding process is trustworthy,and nobody can cheat to win.Figure-3: Cryptographic Hash Function based Online Bidding ApplicationDesign a cheating-proof online property auction system using cryptographic hash function with thefollowing requirements: A bidder can Only bid with the hash value of the bid amount. The bidder can bid only once. Guessing the plaintext bid amount should be difficult.Show step-by-step process with concrete examples.[Note: If you are interested to implement a broader version of this system as a Capstone project, pleasecontact the Lecturer],Page 6 of 8Q4. Breaking RSA Key Faster with Multiple Servers (5 Marks)[Note: Only for this question, you can submit the solution individually or in a group. In the case of agroup submission, the maximum group members can be 3 (three), and you must mention the names ofgroup members in the solution of this question.]It has been found that a quantum computer with 4099 perfectly stable qubits could break the RSA-2048 encryption in 10 seconds, while a classic computer of present days requires 300 trillion years. Itmeans, the powerful computers make the RSA cryptosystem vulnerable.RSA cryptosystem is Mainly built on the concept of prime numbers. The public-key component (n) ofRSA cryptosystem is an integer that is the product of two prime numbers. Hence, prime factorizationis a technique that can be used for breaking RSA private-key (d).Prime factorization Or integer factorization of a number is breaking a number down into the set of primenumbers which multiply together to result in the original number. This is also known as primedecomposition. Assume a number 77 has two prime factors. That is, 77 is a product of two primenumbers: 7 and 11 (i.e., 77 = 7 X 11)….Figure-4: Partial list of first 10000 Prime Numbers,Page 7 of 8However, a simple method to find the prime factors is to take a list of prime numbers, and start dividinga number by each prime number starting from 2 in the prime numbers list. For example, first 10 primenumbers are: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29. Now, to find out the prime factors of 77, you shoulddivide 77 by each prime number in the above list as follows unless you get another prime number asa quotient:77 / 2 = Quotient is NOT a prime number77 / 3 = Quotient is NOT a prime number77 / 5 = Quotient is NOT a prime number77 / 7 = 11 (Quotient is a prime number)Hence, 7 and 11 are two prime factors of 77.As you know from Lecture-3 and Tutorial-3, the public-key component (n) of the RSA cryptosystems isan integer that has two prime numbers. Assume that you have found the RSA public-key as: n =10772542097 and e = 95177. You want to find the private-key (d) for the above RSA public-key.Say, you have the list of first 10000 prime numbers as partially shown in Figure-4. A complete list offirst 10000 prime numbers can be found in the URL: httpss://primes.utm.edu/lists/small/10000.txt.Assume that you have 10 computers. How can you take advantage of the 10 computers and performthe integer factorization tasks mentioned above to break RSA faster? Explain your algorithm and showdetail steps. Please note that we are not interested in any established approach found in textbooks tofind prime factors. A simple brute-force method should do the work.[ httpss://www.quintessencelabs.com/blog/breaking-rsa-encryption-update-state-art/]6. Academic integrity and plagiarism (standard warning)Academic integrity is about honest presentation of your academic work. It means acknowledging the work of others while developingyour own insights, knowledge, and ideas. You should take extreme care that you have: Acknowledged words, data, diagrams, models, frameworks and/or ideas of others you have quoted (i.e. directlycopied), summarized, paraphrased, discussed, or mentioned in your assessment through the appropriatereferencing methods, Provided a reference list of the publication details so your reader can locate the source if necessary. Thisincludes material taken from Internet sites.If you do not acknowledge the sources of your material, you may be accused of plagiarism because you have passed off the work andideas of another person without appropriate referencing, as if they were your own.RMIT University treats plagiarism as a very serious offence constituting misconduct. Plagiarism covers a variety of inappropriatebehaviors, including: Failure to properly document a source Copyright material from the internet or databases Collusion Between studentsFor further information on our policies and procedures, please refer to the University website.7. Assessment declarationWhen you submit work electronically, you agree to the assessment declaration.,Page 8 of 88. Rubric/assessment criteria for markingAll of the computations must be correct and only provided values must be used. Instructions must be followed.CriteriaThe characteristicor outcome that isbeing judged. TotalQuestion 1DesigningCryptographicAlgorithmThe answer is correct andthe explanation is up to themark3 MarksThe answer is correct,but the Explanation is notup to the mark2 MarksThe answer is partially correct and theexplanation is not up to the mark1 MarksThe question is attempted withthe correct approach but theanswer is not correct.0.5 MarksNot answered.0 Marks3 MarksQuestion 2DesigningAlgorithm forCryptanalysisPlaintext is correctSteps are shown in a systematic way andalgorithm is presented well.3 MarksPlaintext is correctSteps are shown in a systematic way, butalgorithm is not presented well orSomewhat incorrect.2 MarksPlaintext is partially correctOrPlaintext is correct. Steps are not shownin a systematic way and algorithm is notpresented.1 MarksNot answered0 Marks3 MarksQuestion 3CryptographicHash AlgorithmThe answer is correct, andthe explanation is up to themark4 MarksThe answer is correct,but the Explanation is notup to the mark3 MarksThe answer is partially correct, and theexplanation is not up to the mark2 MarksThe question is attempted butthe answer is not correct.1 MarksNot answered0 Marks4 MarksQuestion 4Breaking RSAEncryptionalgorithmStep-by-step processes ofprivate-key computationare shown with adistributed algorithm.All of the computations areshown correctly in detail5 MarksStep-by-step processesof private-keycomputation are shownwith a distributedalgorithm.Not all of thecomputations are showncorrectly in detail4 MarksStep-by-step processes of private-keycomputation are shown correctly anddistributed algorithm is not convincingor somewhat incorrect.However, private-key computation stepsare not shown or incorrectly shown2 MarkStep-by-step processes ofprivate-key computation areshown that are partiallyCorrect/ completely wrong.Distributed algorithm is notdiscussed.1 MarksNot answered0 Marks5 Marks如有需要，请加QQ：99515681 或邮箱：99515681@qq.com

“