



Study with the several resources on Docsity
Earn points by helping other students or get them with a premium plan
Prepare for your exams
Study with the several resources on Docsity
Earn points to download
Earn points by helping other students or get them with a premium plan
Community
Ask the community for help and clear up your study doubts
Discover the best universities in your country according to Docsity users
Free resources
Download our free guides on studying techniques, anxiety management strategies, and thesis advice from Docsity tutors
Material Type: Exam; Class: Sp Top: Game Engineering; Subject: Computer Science; University: University of San Francisco (CA); Term: Unknown 1989;
Typology: Exams
1 / 7
This page cannot be seen from the preview
Don't miss anything!
Instructions: You will have 105 minutes to complete this midterm. The test is closed book; no notes, computers, or calculators are allowed. Please show all relevant work and calcuations in order to receive partial credit (when appropriate). Many of the questions on this test are short answer, and are designed to get you to think about or explain the topics we have covered. You should answer these at an appropriate length and explain your reasoning when asked to do so. A one-word answer is usually too short; a one-page answer is usually too long.
In this section, you are provided with a list of terms and concepts. For each item in the list, give a concise (one or two sentence) explanation or description of that item.
Example: One-time pad: A one-time pad is a means of symmetric-key encryption where a different key of the same length as the message is used for each message. It has the advantage of being theoretically unbreakable, since no frequency information about the key is revealed, but requires participants to securely distribute the secret keys, which is a non-trivial problem.
(5 points) When using RSA, we must first generate two keys, the public and private keys. If we pick two primes p=5 and q=13, how do we then find d (the public key) and e (the private key)? Note: you do not need to find the actual values; an equation or precise description is fine. Let N = pq d is a small number relatively prime to (p-1)(q-1). e is the multiplicative inverse of d, mod (p-1)(q-1).
(3 points) Why is RSA considered secure? (What is the operation needed to ’break’ RSA?) RSA’s security depends on the conjecture that it is computationally difficult to factor large numbers. An attacker who can factor N can easily discover the private key (d) from N and the public key (e).
Say that Alfred wants to send a message M to Betty. Alfred would like to make sure that only Betty can read M. In addition, Alfred would like to ensure that Betty can verify that the message M is from Alfred.
(5 points) 1. Describe (in order) the steps that Alfred must go through to send this message using public-key encryption. Be clear about which keys are used; I recommend using Apub and Apriv (and Bpub and Bpriv ) to indicate the keys. Alfred emphencrypts the email with Betty’s public key Bpub, ensuring that only Betty (or someone else with her private key) can decrypt it. He then signs the email by encrypting it (or, alternatively, a hash of it), with his private key Apriv ; this proves that he (or someone with his private key) is the sender.
(5 points) 2. Describe, in order, the steps Betty must take to read the message and verify that it is indeed from Alfred. Betty first verifies Alfred’s identity by decrypting the message using Alfred’s public key Apub. She then decrypts the message itself using her private key Bpriv. Alternately, if Alfred had signed a hash of the message, she would decrypt it with her private key, hash it, and compare the result to the message Alfred had signed.
Watermarking One way that vendors of digital information try to track and prevent piracy is through the use of digital watermarks. For the purposes of this question, let us assume that it is possible to embed a digital watermark in a document in such a way that the watermark cannot be removed without destroying the document, and illegitimate copies of a document will never contain a valid watermark.
(5 points) Part a: One use of digital watermarks is for usage tracking. If you had perfect, tamperproof watermarks, how could you use this to track unauthorized usage of a graphic image, such as a JPEG. You would use a web crawler to search for JPEGs. When one is found, the watermark is extracted and compared to a database of registered images and owners. Part b: Another use of digital watermarks is copy protection. If a vendor also has control of the hardware, it is possible to implement copy protection.
(3 points) Propose a means by which a vendor that had secure, tamperproof watermarking technology and control of the hardware on which the information is played (such as a DVD player) could ensure that only people who had legitimately purchased their product could view it. (In other words, pirated copies can’t be viewed.) A vendor could include a key in the watermark. Players that cannot locate this key would refuse to play the DVD. This key would have to be unique and cryptographically signed to prevent tampering. (2 points) Why is it necessary for the vendor to have control of the hardware in order to ensure copy protection? If the vendor cannot control the playback mechanism, he can’t prevent someone reverse- engineering a player that circumvents the watermark
Keyspaces (5 points) Recall from Homework #1 that adding a linear number of bits to a DES key required an exponential increase in the time needed to decrypt a message encrypted with that key. for example, a 40-bit key was broken in 3.5 hours, while a 48-bit key required 313 hours. Concisely explain why it is that this problem is exponentially hard. You should mention both the problem characteristics (what it is that is growing exponentially) and the method of ‘cracking’ the DES key being used. Each bit added to the key soubles the size of the keyspace. Since the only known way to crack DES is through brute force exponential search, the problem difficulty grows exponentially with key length.
A bookseller has decided that they want to make their book data available to customers over the Web using XML. Their representation of a book is as follows:
(5 points) 1. Give an XML representation of the following book (there is more than one correct answer for this; I’m interested in seeing that you understand the syntax and structure of XML). Assume that each of the lines here corresponds to a separate element, and that the ‘genre’ of computers is an attribute associated with the ’book’ element.
Title: I Love Electronic Commerce (genre: computers) Subtitle: How e-commerce Will Change The World Authors: R.U. Sirius and M.T. Head ISBN: 0072227427 Related Books: 1022101011, 0447701232 Reviews: “It’s Wonderful!” by Anne Elk.
There’s more than one way to skin this cat ...
The asymmetric, or public, key, is used to exchange the session, or symmetric key. the symmetric session key is then used for the actual communication.