liveBook · Manning

Trapdoor function

As explained in Software Security for Developers

A mathematical function that is easy to compute in one direction but computationally infeasible to invert without special information.

A trapdoor function is easy to compute in one direction but computationally infeasible to reverse without special information. This asymmetry supports public key cryptography: multiplying two large primes is quick, while recovering the original primes from their product is impractical. section 6.2

Why the asymmetry matters

Public key systems use mathematical problems that are easy to perform but difficult to undo. RSA relies on factoring the product of two large primes; elliptic-curve systems rely on the elliptic-curve discrete logarithm problem. Related public and private keys make the private information the protected part of the arrangement. section 6.2

How Software Security for Developers covers it

How deep it goes
Defines the one-way property with prime multiplication and names RSA and elliptic-curve problems without developing mathematical proofs.
Examples
Uses large-prime multiplication, RSA factoring, elliptic-curve discrete logarithms, and related key pairs.
What you can do after
Evaluate why public key systems can share public keys while requiring private keys to remain secret.
How it connects
Connects public key cryptography with RSA, elliptic curves, digital signatures, and public-private key pairs.

Also explained in

Compare how 2 books explain trapdoor function →

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Software Security for Developers. The section links point to the parts of the book it draws on.