Re:Introduction to Go 1.1
by laurent123456 on Tuesday March 26, 2013 @05:06AM
(#5442000)
Shouldn't that be a property of the algorithm rather than the implementation? I mean as long as they implement the algorithm correctly, do they need to care about being timing-attack-safe?
[ Parent
| on HN ]
Re:Introduction to Go 1.1
by arnehormann on Tuesday March 26, 2013 @05:19AM
(#5442044)
Yes, they do. Read http://www.imperialviolet.org/2013/02/04/luckythirteen.html - even a division in the cpu may introduce timing differences depending on the input (bottom of the blog post). https://groups.google.com/forum/?fromgroups=#!topic/golang-n... indicates golangs implentation may not be timing attack safe, but that's another version and I don't know for sure.
Yes and no. Certain algorithms make it harder to do timing-resistant implementations, but by no means impossible.
Probably the easiest mistake to make is on DH/RSA exponentiation. Using the simple square-and-multiply algorithm gives away plenty of timing data; you usually need to explicitly protect against it by either using blinding or always performing both the square and multiply at each iteration.