Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Addition and multiplication also leak more information via side channels than bit shift and xor.


I'd be surprised if that's true.

I'm pretty sure addition is always 1-clock tick latency / 3-instructions per cycle. While Multiplication is 5-clock tick latency / 1-instruction per cycle IIRC.

So if the timing of those instructions are constant, it seems difficult to side-channel / timing attack them.


there's also power, 0xffffffff + 0x1 results in 32 bit flips, 0x0 + 0x1 results in 1, they don't consume the same amount of energy.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: