Shiksha Nation
Skip to content

Probabilistic encryption

Use of randomness in key code generation

  • 2 min read
  • 3 chapters

Related on Lably

Through Randomness

History

The first provably-secure probabilistic public-key encryption scheme was proposed by Shafi Goldwasser and Silvio Micali, based on the hardness of the quadratic residuosity problem and had a message expansion factor equal to the public key size. More efficient probabilistic encryption algorithms include Elgamal, Paillier, and various constructions under the random oracle model, including optimal asymmetric encryption padding (OAEP).

Sign up free to read the rest

2 more chapters are free with a Lably account.

Already have an account?

More in Computing and communication