Public-key cryptography

) number is used to begin generation of an acceptable pair of keys suitable for use by an asymmetric key algorithm. with Alice's private key, but the message itself is not encrypted. 1) Alice signs a message with her private key. 2) Using…

Uses your system voice; voice and rate in settings.

Snapshot

≈ 5 min read

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

) number is used to begin generation of an acceptable pair of keys suitable for use by an asymmetric key algorithm. with Alice's private key, but the message itself is not encrypted. 1) Alice signs a message with her private key.

2) Using Alice's public key, Bob can verify that Alice sent the message and that the message has not been modified. scheme, each party generates a public/private key pair and distributes the public key of the pair. After obtaining an authentic (n.b., this is critical) copy of each other's public keys, Alice and Bob can compute a shared secret offline.

The shared secret can be used, for instance, as the key for a symmetric cipher. Public-key cryptography, or asymmetric cryptography, is the field of cryptographic systems that use pairs of related keys. Each key pair consists of a public key and a corresponding private key.

Key pairs are generated with algorithms based on mathematical problems termed one-way functions. Security of public-key cryptography depends on keeping the private key secret; the public key can be openly distributed without compromising security.

There are many kinds of public-key cryptosystems, with different security goals, including digital signature, Diffie–Hellman key exchange, public-key key encapsulation, and public-key encryption.…

) number is used to begin generation of an acceptable pair of keys suitable for use by an asymmetric key algorithm. with Alice's private key, but the message itself is not encrypted. 1) Alice signs a message with her private key.

2) Using Alice's public key, Bob can verify that Alice sent the message and that the message has not been modified. scheme, each party generates a public/private key pair and distributes the public key of the pair. After obtaining an authentic (n.b., this is critical) copy of each other's public keys, Alice and Bob can compute a shared secret offline.

The shared secret can be used, for instance, as the key for a symmetric cipher. Public-key cryptography, or asymmetric cryptography, is the field of cryptographic systems that use pairs of related keys. Each key pair consists of a public key and a corresponding private key.

Key pairs are generated with algorithms based on mathematical problems termed one-way functions. Security of public-key cryptography depends on keeping the private key secret; the public key can be openly distributed without compromising security.

There are many kinds of public-key cryptosystems, with different security goals, including digital signature, Diffie–Hellman key exchange, public-key key encapsulation, and public-key encryption. Public key algorithms are fundamental security primitives in modern cryptosystems, including applications and protocols that offer assurance of the confidentiality and authenticity of electronic communications and data storage.

They underpin numerous Internet standards, such as Transport Layer Security (TLS), SSH, S/MIME, and PGP. Compared to symmetric cryptography, public-key cryptography can be too slow for many purposes, so these protocols often combine symmetric cryptography with public-key cryptography in hybrid cryptosystems.

Unencrypted metadata

Most of the available public-key encryption software does not conceal metadata in the message header, which might include the identities of the sender and recipient, the sending date, subject field, and the software they use etc. Rather, only the body of the message is concealed and can only be decrypted with the private key of the intended recipient. This means that a third party could construct quite a detailed model of participants in a communication network, along with the subjects being discussed, even if the message body itself is hidden.

However, there has been a recent demonstration of messaging with encrypted headers, which obscures the identities of the sender and recipient, and significantly reduces the available metadata to a third party. The concept is based around an open repository containing separately encrypted metadata blocks and encrypted messages.

Only the intended recipient is able to decrypt the metadata block, and having done so they can identify and download their messages and decrypt them. Such a messaging system is at present in an experimental phase and not yet deployed. Scaling this method would reveal to the third party only the inbox server being used by the recipient and the timestamp of sending and receiving.

The server could be shared by thousands of users, making social network modelling much more challenging.

Sources

. The first two sections contain a very good introduction to public-key cryptography. IEEE 1363: Standard Specifications for Public-Key Cryptography Christof Paar, Jan Pelzl, , Chapter 6 of "Understanding Cryptography, A Textbook for Students and Practitioners". (companion web site contains online cryptography course that covers public-key cryptography), Springer, 2009.

Text derived from https://en.wikipedia.org/w/index.php?oldid=1377469927 under CC BY-SA 4.0; modifications have been made.

Sources cited in this revision

25 named source(s) extracted from the cited revision. A source with no author is shown by its publication; nothing is invented.