World Library  
Flag as Inappropriate
Email this Article

Cryptosystem

Article Id: WHEBN0000506383
Reproduction Date:

Title: Cryptosystem  
Author: World Heritage Encyclopedia
Language: English
Subject: Cryptography, Kerckhoffs's principle, Information-theoretic security, Passive attack, Key distribution center
Collection: Cryptography
Publisher: World Heritage Encyclopedia
Publication
Date:
 

Cryptosystem

In cryptography cryptosystem refers to a suite of cryptographic algorithms needed to implement a particular security service, most commonly for achieving confidentiality (encryption).[1]

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 (\mathcal{P},\mathcal{C},\mathcal{K},\mathcal{E},\mathcal{D}) with the following properties.

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

For each e \in \mathcal{K}, there is d \in \mathcal{K} such that D_d(E_e(p)) = p for all p \in \mathcal{P}.[2]

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.

References

  1. ^ Menezes, A.; Oorschot, P. van; Vanstone, S. Handbook of Applied Cryptography (5th ed.). CRC Press.  
  2. ^ Buchmann, Johannes A. Introduction to Cryptography (2nd ed.). Springer.  


This article was sourced from Creative Commons Attribution-ShareAlike License; additional terms may apply. World Heritage Encyclopedia content is assembled from numerous content providers, Open Access Publishing, and in compliance with The Fair Access to Science and Technology Research Act (FASTR), Wikimedia Foundation, Inc., Public Library of Science, The Encyclopedia of Life, Open Book Publishers (OBP), PubMed, U.S. National Library of Medicine, National Center for Biotechnology Information, U.S. National Library of Medicine, National Institutes of Health (NIH), U.S. Department of Health & Human Services, and USA.gov, which sources content from all federal, state, local, tribal, and territorial government publication portals (.gov, .mil, .edu). Funding for USA.gov and content contributors is made possible from the U.S. Congress, E-Government Act of 2002.
 
Crowd sourced content that is contributed to World Heritage Encyclopedia is peer reviewed and edited by our editorial staff to ensure quality scholarly research articles.
 
By using this site, you agree to the Terms of Use and Privacy Policy. World Heritage Encyclopedia™ is a registered trademark of the World Public Library Association, a non-profit organization.
 


Copyright © World Library Foundation. All rights reserved. eBooks from Project Gutenberg are sponsored by the World Library Foundation,
a 501c(4) Member's Support Non-Profit Organization, and is NOT affiliated with any governmental agency or department.