homework 1

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

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

View Full Document Right Arrow Icon
file:///C|/Documents%20and%20Settings/Linda%20Grauer/My%20Documents/Dolores/UC%20Irvine-Harvest/CS%20201/hmw1.htm 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
Background image of page 1
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. file:///C|/Documents%20and%20Settings/Linda%20Grauer/M. ..ocuments/Dolores/UC%20Irvine-Harvest/CS%20201/hmw1.htm [1/30/2008 11:32:10 AM]...
View Full Document

Ask a homework question - tutors are online