Jump to content
Main menu
Main menu
move to sidebar
hide
Navigation
Main page
Recent changes
Random page
Help about MediaWiki
Special pages
Niidae Wiki
Search
Search
Appearance
Create account
Log in
Personal tools
Create account
Log in
Pages for logged out editors
learn more
Contributions
Talk
Editing
Key (cryptography)
(section)
Page
Discussion
English
Read
Edit
View history
Tools
Tools
move to sidebar
hide
Actions
Read
Edit
View history
General
What links here
Related changes
Page information
Appearance
move to sidebar
hide
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== Establishment scheme == {{Main|Key exchange}} The security of a key is dependent on how a key is exchanged between parties. Establishing a secured communication channel is necessary so that outsiders cannot obtain the key. A key establishment scheme (or key exchange) is used to transfer an encryption key among entities. Key agreement and key transport are the two types of a key exchange scheme that are used to be remotely exchanged between entities . In a key agreement scheme, a secret key, which is used between the sender and the receiver to encrypt and decrypt information, is set up to be sent indirectly. All parties exchange information (the shared secret) that permits each party to derive the secret key material. In a key transport scheme, encrypted keying material that is chosen by the sender is transported to the receiver. Either symmetric key or asymmetric key techniques can be used in both schemes.<ref name=NIST/> The [[Diffie–Hellman key exchange]] and [[Rivest-Shamir-Adleman]] (RSA) are the most two widely used key exchange algorithms.<ref name=":1">{{Cite book|last1=Yassein|first1=M. B.|last2=Aljawarneh|first2=S.|last3=Qawasmeh|first3=E.|last4=Mardini|first4=W.|last5=Khamayseh|first5=Y.|title=2017 International Conference on Engineering and Technology (ICET) |chapter=Comprehensive study of symmetric key and asymmetric key encryption algorithms |date=2017|chapter-url=https://ieeexplore.ieee.org/document/8308215/;jsessionid=aTy3qyMmnoiUUKufk8VEl4llW1jnhntWSm9CUa21rjkJ3qW3bths!861039390|pages=1–7|doi=10.1109/ICEngTechnol.2017.8308215|isbn=978-1-5386-1949-0 |s2cid=3781693 }}</ref> In 1976, [[Whitfield Diffie]] and [[Martin Hellman]] constructed the [[Diffie–Hellman key exchange|Diffie–Hellman]] algorithm, which was the first public key algorithm. The [[Diffie–Hellman key exchange|Diffie–Hellman]] key exchange protocol allows key exchange over an insecure channel by electronically generating a shared key between two parties. On the other hand, [[Rivest–Shamir–Adleman|RSA]] is a form of the asymmetric key system which consists of three steps: key generation, encryption, and decryption.<ref name=":1" /> Key confirmation delivers an assurance between the key confirmation recipient and provider that the shared keying materials are correct and established. The [[National Institute of Standards and Technology]] recommends key confirmation to be integrated into a key establishment scheme to validate its implementations.<ref name=NIST/>
Summary:
Please note that all contributions to Niidae Wiki may be edited, altered, or removed by other contributors. If you do not want your writing to be edited mercilessly, then do not submit it here.
You are also promising us that you wrote this yourself, or copied it from a public domain or similar free resource (see
Encyclopedia:Copyrights
for details).
Do not submit copyrighted work without permission!
Cancel
Editing help
(opens in new window)
Search
Search
Editing
Key (cryptography)
(section)
Add topic