lec42a - Announcements Assignment 4 due by noon Friday...

Info iconThis preview shows pages 1–10. Sign up to view the full content.

View Full Document Right Arrow Icon
Announcements Assignment 4 due by noon Friday Final Exam Thursday April 29, 7:00-9:00. CSE A101 Cumulative, emphasis on part III Pick up graded work by May 28.
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Lecture 42 Solution space trees and backtracking 21.1
Background image of page 2
Hard Problems Some problems are hard to solve. No polynomial time algorithm is known. E.g., NP-hard problems such as machine scheduling, bin packing, 0/1 knapsack. Is this necessarily bad? Data encryption relies on difficult to solve problems.
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Cryptography decryption algorithm encryption algorithm message message Transmission Channel encryption key decryption key
Background image of page 4
Public Key Cryptosystem (RSA) A public encryption method that relies on a public encryption algorithm, a public decryption algorithm, and a public encryption key. Using the public key and encryption algorithm, everyone can encrypt a message. The decryption key is known only to authorized parties. Asymmetric method. Encryption and decryption keys are different; one is not easily computed from the other.
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Public Key Cryptosystem (RSA) p and q are two prime numbers. n = pq m = (p-1)(q-1) a is such that 1 < a < m and gcd(m,a) = 1 . b is such that (ab) mod m = 1 . a is computed by generating random positive integers and testing gcd(m,a) = 1 using the extended Euclid’s gcd algorithm. The extended Euclid’s gcd algorithm also computes b when gcd(m,a) = 1 .
Background image of page 6
RSA Encryption And Decryption Message M < n . Encryption key = (a,n) . Decryption key = (b,n) . Encrypt => E = M a mod n . Decrypt => M = E b mod n .
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Breaking RSA Factor n and determine p and q , n = pq . Now determine m = (p-1)(q-1) . Now use Euclid’s extended gcd algorithm to compute gcd(m,a) . b is obtained as a byproduct. The decryption key (b,n) has been determined!
Background image of page 8
Security Of RSA Relies on the fact that prime factorization is computationally very hard. Let
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 10
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 01/18/2012 for the course COP 3530 taught by Professor Davis during the Fall '08 term at University of Florida.

Page1 / 34

lec42a - Announcements Assignment 4 due by noon Friday...

This preview shows document pages 1 - 10. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online