# q3 - th step of the giant list and the 16 th step of the...

This preview shows pages 1–2. Sign up to view the full content.

3. We choose a bound about square root 6917: N=84. Then we makes two lists; the first increase the exponent only by one each time. While the second increase the exponent by a multiple of N each time. Baby step list: 1,2,4,8,16,32,64,128,256,512,1024,2048,4096,1275,2550,5100,3283(16 th ) Giant step list: 329,472,3137,611,3841,6814,3111,5157,1785,1825,684,3315,1413,6211,3912,1636,6594(16 th ) >>>> 3283(62th) We have a match between the 62

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

View Full Document
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: th step of the giant list and the 16 th step of the baby list. We can therefore write 2 16 329*2-84*62 (mod 6917) which implies that 2 5224 329(mod 6917) and so the solution for x is 5224. This can be verified directly now. So we can get j=16 k=62 2 16+84*62 329 (mod 6917) So we get 21 5224 329 (mod 6917) The Maple routine looks like this: ) 6917 (mod 2 * 329 2 84 k j ) 6917 (mod 329 2 84 k j &gt; &gt;...
View Full Document

## This note was uploaded on 10/03/2011 for the course SIT 281 taught by Professor Vickymak during the Three '09 term at Deakin.

### Page1 / 2

q3 - th step of the giant list and the 16 th step of the...

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

View Full Document
Ask a homework question - tutors are online