3 ms·
I've only read about the relevance of constant-time comparisons in relation to comparisons, such as checking that a calculated hash is the same as a stored hash
by GordonS 8y ago
I've only read about the relevance of constant-time comparisons in relation to comparisons, such as checking that a calculated hash is the same as a stored hash - could you elaborate on how it applied to symmetric encryption?
- vardump 8y agoSome operations, such as integer multiplication and division have data dependent latency. Depends on CPU model. See for example this page: https://bearssl.org/ctmul.html https://bearssl.org/ctmul.html > could you elaborate on how it applied to symmetric encryption? Non-constant time multiplication is mostly (only?) an issue with asymmetric crypto.
- fpgaminer 8y agoIf an implementation isn't constant time it can potentially leak information about the key. i.e. the relative length of time it takes to encrypt may be dependent on properties of the key. So an attacker that can measure how long it takes you to encrypt something can begin to derive the key. Similar attacks occur when your encryption uses lookup tables depending on key bits, uses different amounts of power, etc. It's a surprisingly effective attack surface, and why the industry is moving away from older style schemes like AES and towards ARX based constructions like ChaCha.