This preview shows page 1. Sign up to view the full content.
Unformatted text preview: fails. If it terminates, will produce the right answer .if it doesnt produce an answer 4c. expectation = 1/prob = 1/(1/n) = n iterations. = n(T a (n) + T b (n)) Expection = 1/prob = 1/(1/2) = 2 > 2 (T a (n) + T b (n)) B c mod (p 1) O(#bits 3 ) Alg: compute x b c mod (p1) time O(#bits 3 ) b === b (mod p 1) X + k(p1) = b c a kc mod p = a x+k(p1) mod p = a x (a (p1 ) k <= goes to one because of fermats theorem = 1 mod p, so a x mod p. 8. need to choose gcd(e, p1). If e = p1, then anything mod p = 1so all messages would be 1. Breaking this means recover M mod p = M. Compute d so hat ed = 1(mod(p1)) ed 1 = k(p1) > ed = 1+k(p1) (M e mod(p1)) d = (M e ) d mod p = (M e mod p) d = M 1 +k(p1) mod p = M(M p1)k ) mod p = M mod p....
View
Full
Document
This note was uploaded on 01/09/2012 for the course CSE 101 taught by Professor Staff during the Spring '08 term at UCSD.
 Spring '08
 staff
 Algorithms

Click to edit the document details