Asymmetric key cryptography/Related Articles: Difference between revisions
Jump to navigation
Jump to search
imported>Sandy Harris |
No edit summary |
||
| (4 intermediate revisions by one other user not shown) | |||
| Line 3: | Line 3: | ||
==Parent topics== | ==Parent topics== | ||
{{r|Cryptography}} | {{r|Cryptography}} | ||
== Sibling topic == | |||
{{r|Symmetric key cryptography}} | |||
==Techniques== | ==Techniques== | ||
| Line 8: | Line 12: | ||
{{r|RSA algorithm}} | {{r|RSA algorithm}} | ||
== | == Applications == | ||
{{r|Digital signature}} | |||
{{r|Hybrid cryptosystem}} | |||
{{r|Public key infrastructure}} | |||
==Other related topics== | |||
== | |||
{{r|Computational complexity theory}} | {{r|Computational complexity theory}} | ||
{{r|Modular arithmetic}} | {{r|Modular arithmetic}} | ||
{{r|Number theory}} | {{r|Number theory}} | ||
{{r| | ==Articles related by keyphrases (Bot populated)== | ||
{{r| | {{r|Hybrid cryptosystem}} | ||
{{r| | {{r|Digital signature}} | ||
{{r| | {{r|Diffie-Hellman}} | ||
{{r|Cryptographic key}} | |||
Latest revision as of 06:00, 14 July 2024
- 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
- Cryptography [r]: A field at the intersection of mathematics and computer science that is concerned with the security of information, typically the confidentiality, integrity and authenticity of some message. [e]
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
- Digital signature [r]: A technique based on public key cryptography to allow people to "sign" documents using their private keys. [e]
- Hybrid cryptosystem [r]: A system that combines public key with secret key methods; usually with a cryptographic hash for authentication as well. [e]
- Public key infrastructure [r]: Add brief definition or description
- Computational complexity theory [r]: Add brief definition or description
- Modular arithmetic [r]: Form of arithmetic dealing with integers in which all numbers having the same remainder when divided by a whole number are considered equivalent. [e]
- Number theory [r]: The study of integers and relations between them. [e]
- Hybrid cryptosystem [r]: A system that combines public key with secret key methods; usually with a cryptographic hash for authentication as well. [e]
- Digital signature [r]: A technique based on public key cryptography to allow people to "sign" documents using their private keys. [e]
- 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]
- Cryptographic key [r]: Value used by a computer together with a complex algorithm to encrypt and decrypt messages. [e]