Asymmetric-Key Cryptosystems

Source: Wikipedia. Pages: 95. Chapters: RSA, Public-key cryptography, Fermat pseudoprime, Elliptic curve cryptography, Diffie¿Hellman key exchange, ElGamal encryption, Digital Signature Algorithm, Merkle¿Hellman knapsack cryptosystem, XTR, NTRUEncrypt, Schoof's algorithm, Primality test, Quantum digital signature, Public key infrastructure, Hidden Field Equations, McEliece cryptosystem, Rabin cryptosystem, Wiener's Attack, Web of trust, Lamport signature, Hyperelliptic curve cryptography, Secure Remote Password protocol, Paillier cryptosystem, Transient-key cryptography, Three-pass protocol, Public key fingerprint, Cramer¿Shoup cryptosystem, Diffie¿Hellman problem, Unbalanced Oil and Vinegar, Elliptic Curve DSA, Signcryption, Cayley¿Purser algorithm, Goldwasser¿Micali cryptosystem, Blum¿Goldwasser cryptosystem, Registration authority, Merkle signature scheme, Implicit certificate, ECC patents, Optimal asymmetric encryption padding, Decisional Diffie¿Hellman assumption, Table of costs of operations in elliptic curves, Niederreiter cryptosystem, SAFE-BioPharma Association, RSA problem, SPEKE, Key encapsulation, IEEE P1363, MQV, ElGamal signature scheme, Rabin signature algorithm, XDH assumption, CEILIDH, Damgård¿Jurik cryptosystem, NTRUSign, OkamotöUchiyama cryptosystem, Jumbleme, Integrated Encryption Scheme, Elliptic curve Diffie¿Hellman, Naccache¿Stern cryptosystem, Encrypted key exchange, Merkle's Puzzles, Schoof¿Elkies¿Atkin algorithm, Benaloh cryptosystem, Computational Diffie¿Hellman assumption, Schnorr signature, Naccache¿Stern knapsack cryptosystem, Efficient Probabilistic Public-Key Encryption Scheme, Certificate-based encryption, Schmidt¿Samoa cryptosystem, Full Domain Hash, Schnorr group, Certificateless cryptography, Threshold cryptosystem, Strong RSA assumption, Distributed key generation, Bilateral key exchange, Pointcheval-Stern signature algorithm, GGH encryption algorithm, Decision Linear assumption, GGH signature scheme, Decisional composite residuosity assumption, KCDSA, GMR, Torus-based cryptography, Sub-group hiding, Wireless Public Key Infrastructure. Excerpt: Public-key cryptography refers to a cryptographic system requiring two separate keys, one to lock or encrypt the plaintext, and one to unlock or decrypt the cyphertext. Neither key will do both functions. One of these keys is published or public and the other is kept private. If the lock/encryption key is the one published then the system enables private communication from the public to the unlocking key's owner. If the unlock/decryption key is the one published then the system serves as a signature verifier of documents locked by the owner of the private key. This cryptographic approach uses asymmetric key algorithms, hence the more general name of "asymmetric key cryptography". Some of these algorithms have the public key / private key property, that is, neither key is derivable from knowledge of the other; not all asymmetric key algorithms do. Those with this property are particularly useful and have been widely deployed and are the source of the commonly used name. The public key is used to transform a message into an unreadable form, decryptable only by using the (different but matching) private key. Participants in such a system must create a mathematically linked key pair (i.e., a public and a private key). By publishing the public key, the key producer empowers anyone who gets a copy of the public key to produce messages only he can read -- because on...