Math 2.0

concept

Public-key cryptography

Summary

Public-key cryptography is a kind of cryptography in which each user has a pair of keys: a public key and a private key. Anyone can use the public key to encrypt a message or to check a signature. Only the owner of the private key can decrypt the message or make the signature. Its security depends on problems that are believed to be hard to solve, such as integer factorization or the discrete logarithm.

Remarks

Before the mid-1970s, all ciphers were symmetric: both parties used the same secret key, which they had to exchange in a secure way. The RSA cryptosystem and the Diffie–Hellman key exchange are two early examples. Whitfield Diffie and Martin Hellman published the idea in 1976.

Explanations

L1 human

Think of a mailbox with a slot: anyone can drop a letter in, but only the owner has the key to open it. The public key is the slot, and the private key is the key of the mailbox.

What this node needs for W2
  • edge defines in: at least one definition (0 of 1)
  • edge not_instance_of in: at least one non-example (0 of 1)
  • edge specializes both: the more general notions and the special cases (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

Sources

  1. Web https://en.wikipedia.org/wiki/Public-key_cryptography, lead section
  2. Web https://en.wikipedia.org/wiki/Public-key_cryptography, Description