liveBook · Manning

Math-based construction

As explained in Real-World Cryptography

A cryptographic construction whose security relies on the presumed difficulty of mathematical problems.

A math-based construction is a cryptographic construction whose security depends on the presumed difficulty of a mathematical problem, such as factoring large numbers. section 1.5

RSA as a concrete example

RSA uses a mathematical foundation for digital signatures and asymmetric encryption. Public-key cryptography commonly follows this pattern: different participants may know a public key, while some also possess the private key. section 1.5 section 1.5

Use the category as a practical orientation, not as a complete classification:

  • Often runs more slowly than heuristic-based constructions. section 1.5
  • Frequently appears in asymmetric cryptography, while symmetric constructions are more often heuristic-based. section 1.5
  • Functions as a building block for protocols whose security claims must be understood individually. section 1.5

How Real-World Cryptography covers it

How deep it goes
Defines the category, gives factoring and RSA examples, and contrasts speed with heuristics without developing mathematical details.
Examples
Uses factoring numbers, RSA digital signatures, RSA asymmetric encryption, and heuristic-based AES as contrasting examples.
What you can do after
Evaluate/understand cryptographic primitives as distinct tools by their assumptions and security claims.
How it connects
Connects mathematical hardness with asymmetric cryptography, public-key cryptography, RSA, digital signatures, encryption, and cryptographic protocols.
Cover of Real-World Cryptography
liveBookmanning.com
Read Real-World Cryptography on liveBook Get the book at manning.com

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.