The encryption function E should be easy to compute, while it should be computationally infeasible to determine the decryption function D given E unless someone has secret knowledge that provides easy inversion of E.  FTP, what is this type of cryptosystem in which some encryption information is freely published, the best known example of which is RSA?
Examples include the ElGamal, Chor-Rivest, Merkle-Hellman Knapsack, which has been shown to be insecure, and the McEliece cryptosystem, which is based on algebraic coding theory. The encryption function E should be easy to compute, while it should be computationally infeasible to determine the decryption function D given E unless someone has secret knowledge that provides easy inversion of E.  FTP, what is this type of cryptosystem in which some encryption information is freely published, the best known example of which is RSA?
Examples include the ElGamal, Chor-Rivest, Merkle-Hellman Knapsack, which has been shown to be insecure, and the McEliece cryptosystem, which is based on algebraic coding theory.
public-key cryptosystem (do not prompt on RSA)