liveBook · Manning

Leakage-resilient cryptography

As explained in Real-World Cryptography

Leakage-resilient cryptography is the study and practice of designing cryptographic implementations that remain secure despite bounded information leakage.

A cryptographic implementation can reveal secrets through its behavior, not just its outputs. Leakage-resilient cryptography addresses this threat with software mitigations intended to reduce information exposed through side channels such as power use, execution time, or cache activity. section 13.4

A power trace reveals a private key

An RSA square-and-multiply implementation performs multiplication only for set bits of the private exponent. Because multiplication consumes more power, a single power trace can expose the exponent's bits and potentially the private key. section 13.4

Figure 13.5 Some cryptographic algorithms leak so much information via their power consumption that a simple power analysis of a single power trace (a measure of the power consumed in time) can leak the private key of the algorithm. For example, this figure represents a trace of an RSA exponentiation (the message being exponentiated to the private exponent; see chapter 6). The RSA exponentiation is implemented with a square-and-multiply algorithm that iterates through the bits of the private exponent; for each bit it applies a square operation followed by a multiply operation only if the bit is set. In this example, multiplication is obviously consuming more power; hence, the clarity of the power trace.

Use the power-trace figure to see how visibly different operations can turn an implementation's physical behavior into key-revealing evidence. section 13.4

How Real-World Cryptography covers it

How deep it goes
Defines the field and motivates its purpose, but stops short of an exhaustive mitigation treatment.
Examples
Uses an RSA square-and-multiply power trace in which multiplication reveals bits of a private exponent.
What you can do after
Evaluate why cryptographic software needs mitigations for power, timing, and cache-based leakage.
How it connects
Connects cryptographic implementations with side-channel attacks, power analysis, cache attacks, and physical attackers.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Real-World Cryptography. The section links point to the parts of the book it draws on.