|
|
|
|
|
by 5gaKanchAFD2
3277 days ago
|
|
No algorithm is secure by design against these DPA attacks. They exploit data-dependencies. The only 'provably secure' (e.g., on paper (+)) countermeasure you can apply to these symmetric schemes is something typically called masking. You can view masking as using secret sharing techniques to split up all intermediate computation into independent operations. To defeat masking an attacker needs to be able to re-combine the data dependent information leakage associated with all the split components. This is always a possibility. Thus it becomes a risk/cost tradeoff. The more you mask, the more secure you become, but at a cost of speed/area/power draw. (+) It's decidedly non-trivial to implement a masking scheme such that you get the theoretical security. This is an active research area. |
|
Or alternatively run the algorithm through an emulator that does the same thing.