How deeply does Real-World Cryptography cover blinding?

Explains RSA base blinding and elliptic-curve scalar blinding as procedures, but does not provide proofs or implementation details.

Blinding

As explained in Real-World Cryptography

Base blinding is a public-key cryptographic technique that multiplies an input by a random invertible factor before secret-dependent processing and removes that factor afterward.

When an attacker can observe leaks from secret-dependent computations, blinding adds a layer of indirection: the operation processes a randomized equivalent instead of the known value or original secret. section 13.4.2 section 13.5

Base blinding applies this idea to RSA decryption:

Generate a random invertible factor r. section 13.4.2
Compute message = (ciphertext × r^e)^d mod N. section 13.4.2
Remove the factor with real_message = message × r⁻¹ mod N. section 13.4.2

Scalar blinding protects elliptic-curve operations differently: replace secret scalar d with d + k₁ × order, which produces the same point while hiding the scalar used during computation. Blinding commonly complements constant-time algorithms, masking, and other hardware or software mitigations. section 13.4.2 section 13.5

How Real-World Cryptography covers it

liveBook manning.com

Read Real-World Cryptography on liveBook Get the book at manning.com

Related concepts

side-channel attackaddresses · A side-channel attack infers secret information from unintended physical or operational leakage produced by a system’s implementation rather than its intended outputs.
blinding factoruses · A blinding factor is a random value used to conceal an input or intermediate cryptographic value while preserving the ability to later remove the concealment.

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.