homework 1

# Introduction to Modern Cryptography: Principles and Protocols (Chapman & Hall/CRC Cryptography and Network Security Series)

This preview shows page 1. Sign up to view the full content.

Homework 1: Due Monday, October 15 (or email me if you need time till Wednesday). First part: Chapter 2, problems 2.1, 2.2, 2.3, and 2.4. Second part: Prove both parts of proposition 3.6 on page 57. In other words, prove the following two lemmas about negligible functions: If e1 and e2 are two negligible functions then e3, where e3(n) = e1(n)+e2(n), is also a negligible
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: function. ● If e is a negligible function and p is a polynomial then e', where e'(n) = p(n)*e(n), is also a negligible function. Bonus points: Chapter 2, problems 2.12 and 2.13. . ..ocuments/Dolores/UC%20Irvine-Harvest/CS%20201/hmw1.htm [1/30/2008 11:32:10 AM]...
View Full Document

{[ snackBarMessage ]}

### What students are saying

• As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

Kiran Temple University Fox School of Business ‘17, Course Hero Intern

• I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

Dana University of Pennsylvania ‘17, Course Hero Intern

• The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

Jill Tulane University ‘16, Course Hero Intern