How JustAnswer Works:
  • Ask an Expert
    Experts are full of valuable knowledge and are ready to help with any question. Credentials confirmed by a Fortune 500 verification firm.
  • Get a Professional Answer
    Via email, text message, or notification as you wait on our site. Ask follow up questions if you need to.
  • Go back-and-forth until satisfied
    Rate the answer you receive.
Ask Ryan Your Own Question
Ryan, Engineer
Category: Homework
Satisfied Customers: 9218
Experience:  B.S. in Civil Engineering
Type Your Homework Question Here...
Ryan is online now

May I please have answers for all the question please. Thank

This answer was rated:

May I please have answers for all the question please. Thank you


Thank you for using the site. I'll be happy to help you with these problems.


Customer: replied 4 years ago.
HiThank you, ***** ***** can I expect the solution please.

I'll get the solutions posted as soon as I can. I would expect to have them posted for you later today, but certainly before the deadline.

Customer: replied 4 years ago.
Thank you very much. I appreciate. Ive just attached some of his examples in case you might get stuck. Lecture 5 file is for question 1, 2 and 3Then Lecture 7 is for question 4 & 5. Cheers

Ok, thanks.


Thank you for your patience. Here are the solutions:


Clicking the above link will take you to a page where you can download the solutions as a Word document. Please let me know if you have any difficulty accessing this file.

Please feel free to ask if you have questions about any of these solutions.



Ryan and other Homework Specialists are ready to help you
Customer: replied 4 years ago.
Hi Ryan.Thank you for the solution. Just want to ask a quick question on number 2 for p and q? Why does it have to be large numbers. That's where I'm a bit lost. Cheers.

The idea behind the encryption scheme is that even if someone had the encryption key, e, and the value of n, it is extremely difficult to get the value of the decryption key, d. To get d, you would need the value of f, which requires that you know the values of p and q. Knowing n, the only way to get the values of p and q is to determine the two prime factors of n. The larger n is, the harder this is to accomplish.

As noted in the lecture material, the computer algorithm for integer factoring has a run time that is exponentially related to the size of n. Thus, the larger n is, the harder it is for the computer to figure out the prime factors. In fact, each incremental increase in the size of n has a larger impact on the complexity of the problem than the preceding incremental increase. And the way to make n large is to make p and q large.

So, by making p and q large prime numbers, you make it so that even if your computer system was hacked and the encryption key was obtained, the attacker still wouldn't be able to determine the decryption key. The value n is usually made large enough so that 'every computer in the world, working simultaneously on the problem, would take more years than the Universe has been in existence', to come up with a solution. That might be a bit of hyperbole, but the general idea is that it would take a machine with significant computer power (i.e. a supercomputer) an exceedingly long time to solve the problem, to the point that by the time a solution was obtained, the value of the encrypted information would have long since become zero.