Beyond+chapter+6

Since some of our investigations have gone outside Chapter 6, yet our work involves RSA, I thought we'd start a new page for the weird stuff. I still cannot get findd to work, could you send me the file? Or I can wait until class tuesday & bring a flashdrive user:bea001 findd isn't working for me either, so right now I'm trying one in small chunks on my calculator with that bruted program. user:meganternes I started a findd problem with PQ=7373 and e=143. I got one that doesn't seem to work for one of my numbers, but the other two are just fine. I think it's that I don't have a big enough range to find D, but I'm not sure yet. Otherwise I'm getting patterns. user:kml003 The Big One 1. Can we use brute force d searches to get factors of Phi? 1 A) For a fixed plaintext/ciphertext pair, are candidates for d always some factors of Phi apart? Can we prove this? 1 B) Why do some plaintext, ciphertext pairs give more candidates for decrypter d than other pairs? 1 C) If we have evidence for A), can we find properties of plaintext, ciphertext pairs which make our search for decrypter d more efficient?

Other questions. Show your work. Use Pollard to find the factors of 17314340902472010197

1730988027418047907

124746363530114687

Enjoy!

in maple, this program gives me no factors for all three n... what types of a & B should I be using? for i from 2 to 100 do <-- a  for n from 3 to 100 do <-- b   if igcd( (i&^(n!)-1) mod 124746363530114687, 124746363530114687) <> 1 then print(igcd( (i&^(n!)-1) mod 124746363530114687, 124746363530114687)) end if end do end do user:bea001

I've been trying various a's and B's as well and keep getting gcd=1 each time. user:meganternes I have the same problem. user:kml003