Your first paragraph is correct. Your second is not in most cases. You're right that, in general, once you've guessed enough of a secret, you can just brute-fo

Your first paragraph is correct. Your second is not in most cases. You're right that, in general, once you've guessed enough of a secret, you can just brute-force the rest offline. However, a timing attack is online, so you have to issue a query for each guess. Thus, there is no way to turn this into an offline attack and thus nothing changes about the process along the way. You do the same thing for the last byte as for the first. The other is that entropy has nothing to do with this really. You have to guess bytes sequentially from first to last, you can't gain information about the last byte from the first. Now if the secret is a password and not a cryptographic key or MAC, incremental information does help you. So in this case, you're right. PS. no idea about your downvote