3 ms·
I like the presentation with the colored graphs, it definitely it a good way of demonstrating the problem. However for his own implementation, it's hard to see
by bradleyjg 13y ago
I like the presentation with the colored graphs, it definitely it a good way of demonstrating the problem.
However for his own implementation, it's hard to see how significant the residual timing attacks are. If fact just looking at the graph, and without the acknowledgment in the introduction, I'd be hard pressed to say that those pictures had any irregularity at all.
- rheide 13y agoWouldn't that just mean that you need a lot more tries to do a successful timing attack? Not sure if the regularity of his algorithm is enough to make it entirely impractical. I'm not even sure if it's not entirely impractical already using one of the less regular algorithms.