Misplaced Pages

This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Cryptosystem" – news · newspapers · books · scholar · JSTOR (August 2024) (Learn how and when to remove this message)

In cryptography, a cryptosystem is a suite of cryptographic algorithms needed to implement a particular security service, such as confidentiality (encryption).

Typically, a cryptosystem consists of three algorithms: one for key generation, one for encryption, and one for decryption. The term cipher (sometimes cypher) is often used to refer to a pair of algorithms, one for encryption and one for decryption. Therefore, the term cryptosystem is most often used when the key generation algorithm is important. For this reason, the term cryptosystem is commonly used to refer to public key techniques; however both "cipher" and "cryptosystem" are used for symmetric key techniques.

Formal definition

Mathematically, a cryptosystem or encryption scheme can be defined as a tuple ${\displaystyle ({\mathcal {P}},{\mathcal {C}},{\mathcal {K}},{\mathcal {E}},{\mathcal {D}})}$ with the following properties.

1. ${\displaystyle {\mathcal {P}}}$ is a set called the "plaintext space". Its elements are called plaintexts.
2. ${\displaystyle {\mathcal {C}}}$ is a set called the "ciphertext space". Its elements are called ciphertexts.
3. ${\displaystyle {\mathcal {K}}}$ is a set called the "key space". Its elements are called keys.
4. ${\displaystyle {\mathcal {E}}=\{E_{k}:k\in {\mathcal {K}}\}}$ is a set of functions ${\displaystyle E_{k}:{\mathcal {P}}\rightarrow {\mathcal {C}}}$. Its elements are called "encryption functions".
5. ${\displaystyle {\mathcal {D}}=\{D_{k}:k\in {\mathcal {K}}\}}$ is a set of functions ${\displaystyle D_{k}:{\mathcal {C}}\rightarrow {\mathcal {P}}}$. Its elements are called "decryption functions".

For each ${\displaystyle e\in {\mathcal {K}}}$, there is ${\displaystyle d\in {\mathcal {K}}}$ such that ${\displaystyle D_{d}(E_{e}(p))=p}$ for all ${\displaystyle p\in {\mathcal {P}}}$.

Note; typically this definition is modified in order to distinguish an encryption scheme as being either a symmetric-key or public-key type of cryptosystem.

Examples

A classical example of a cryptosystem is the Caesar cipher. A more contemporary example is the RSA cryptosystem.

Another example of a cryptosystem is the Advanced Encryption Standard (AES). AES is a widely used symmetric encryption algorithm that has become the standard for securing data in various applications.

Paillier cryptosystem is another example used to preserve and maintain privacy and sensitive information. It is featured in electronic voting, electronic lotteries and electronic auctions.

See also

• List of cryptosystems
• Semantic security

References

1. Menezes, A.; Oorschot, P. van; Vanstone, S. (1997). Handbook of Applied Cryptography (5th ed.). CRC Press. ISBN 0-8493-8523-7.
2. Buchmann, Johannes A. (13 July 2004). Introduction to Cryptography (2nd ed.). Springer. ISBN 0-387-20756-2.
3. Xia, Zhe; Yang, Xiaoyun; Xiao, Min; He, Debiao (2016). "Provably Secure Threshold Paillier Encryption Based on Hyperplane Geometry". In Liu, Joseph K.; Steinfeld, Ron (eds.). Information Security and Privacy. Lecture Notes in Computer Science. Vol. 9723. Cham: Springer International Publishing. pp. 73–86. doi:10.1007/978-3-319-40367-0_5. ISBN 978-3-319-40367-0.

This cryptography-related article is a stub. You can help Misplaced Pages by expanding it.

• v
• t
• e

• Cryptography
• Cryptography stubs