This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: ICS 268: Cryptography and Communication Security 10/14/2004 Homework 3 Due Thursday , 10/21/2004 1 Shanks Discrete Logarithm Algorithm : Modification Describe how to modify Shanks Baby Step  Giant Step algorithm so that to compute the discrete logarithm DL g,p ( y ) for elements y of the form y = g x mod p where x is known to lie in an interval [ s, t ] s.t. 0 s < t < q where q = ord p ( g ) is the order of element g in Z * p . We want an algorithm which runs in time O ( t s ), or, if you want to be more exact, in time O ( t s *  p  c ) for some small constant c . Prove that your algorithm is correct. 2 Boosting a Nonnegligible Probability Attack Show that if there is a constant d s.t. some probabilistic polynomial time algorithm A computes the discrete logarithm DL ( g, p )( y ) = x s.t. g x = y mod p with a (nonnegligible) probability A ( ) 1 d for every input y , then this algorithm can be used to obtain a different probabilistic polynomial time algorithm...
View
Full
Document
This homework help was uploaded on 01/30/2008 for the course ICS 268 taught by Professor Jarecki during the Fall '04 term at UC Irvine.
 Fall '04
 Jarecki

Click to edit the document details