Asymmetric key cryptography/Related Articles: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Sandy Harris
imported>Sandy Harris
Line 11: Line 11:
{{r|Diffie-Hellman}}
{{r|Diffie-Hellman}}
{{r|RSA algorithm}}
{{r|RSA algorithm}}
== Applications ==
{{r|Digital signature}}
{{r|Hybrid cryptosystem}}
{{r|Public key infrastructure}}


==Other related topics==
==Other related topics==


{{r|Computational complexity theory}}
{{r|Computational complexity theory}}
{{r|Digital signature}}
{{r|Hybrid cryptosystem}}
{{r|Modular arithmetic}}
{{r|Modular arithmetic}}
{{r|Number theory}}
{{r|Number theory}}
{{r|Public key infrastructure}}

Revision as of 19:00, 29 July 2010

This article is developing and not approved.
Main Article
Discussion
Related Articles  [?]
Bibliography  [?]
External Links  [?]
Citable Version  [?]
 
A list of Citizendium articles, and planned articles, about Asymmetric key cryptography.
See also changes related to Asymmetric key cryptography, or pages that link to Asymmetric key cryptography or to this page or whose text contains "Asymmetric key cryptography".

Parent topics

Sibling topic

  • Symmetric key cryptography [r]: A cryptographic system in which there is only one key; the same secret key is used for encryption and decryption. [e]

Techniques

  • Diffie-Hellman [r]: A technique that allows two parties to safely establish a shared secret for use as a cryptographic key, even if someone is eavesdropping on their interaction. It requires that the parties have some means of authentication to be sure they are talking to the right person. [e]
  • RSA algorithm [r]: A widely used public key encryption algorithm whose strength depends on the difficulty of integer factorisation. [e]

Applications

Other related topics