Section 6.1 - 6.2

The timing attack is awesome, its a very interesting and different approach from the way we have attacked other encryption methods in the past. I'm not sure how easy it would be to do though. I also wonder if there is any weakness from the fact that RSA takes its input from only a small subset of numbers (ie printable ascii) if we were to use RSA to just encrypt arbitrary numbers, I wonder what difference it would make. I also don't completely understand the proof that shows that knowing n and phi(n) gives away p and q.