KINDLY ANSWER FROM THE TUTORS VIEW POINT IF POSSIBLE AND FOR
1 AND 2 JUST 125 WORDS EACH JUST
INTERACT WITH THE NUMBER 1 AND 2 AS THESE ARE MY CLASSMATES WORKS AND I NEEDED
TO INTERACT WITH THEM IN OUR DISCUSSION BOARD. NO NEED REFERENCE SINCE IT WILL
BE FROM THE TUTOR VIEW POINT IF REFERENC NEEDED IT SHOULD BE APA BUT I PREFER
FROM THE TUTOR VIEW POINT
1)
The Diffie-Hellman key exchange was an algorithm invented in
1776 by three cryptographers. The work was mainly based on Ralph Merkle even
though his name wasn't titled in the process. The work turned into a practical
algorithm by Whitfield Diffie and Martin Hellman. According to (Chapple, M.
(2022, January 12). Diffie-Hellman - SSCP Cert Prep: 5 Cryptography. LinkedIn )
“The Diffie-Hellman key exchange algorithm solves problems of the key exchange
for symmetric algorithms by allowing the secure online exchange of keying
material between two parties that did not previously know each other.”
What is the purpose of the algorithm? Be specific.
The purpose of the Diffie-Hellman key exchange solves the
problem of the key exchange for symmetric algorithms. This key exchange lets
each person that has knowledge of each other establish a shared key using a
symmetric cipher. This also uses a mathematical algorithm formula to secure the
key from both people.
2)
"Diffie-Hellman key exchange is a method of securely
exchanging cryptographic keys over a public channel invented by Ralph Merkle
and named after Whitfield Diffie and Martin Hellman. The Diffie-Hellman key
exchange is a form of digital encryption that allows two parties to safely
exchange cryptographic keys over a public channel without their discussion
being sent over the internet". This is accomplished via a critical public
infrastructure (Owoh & Singh, 2019). The fact that the sender and recipient
are not required to have any previous knowledge of each other makes the
information very relevant to me. Furthermore, after the keys have been traded,
data transfer may occur across a channel that could be more secure. Therefore,
the divulging of the hidden key is very safe to do.
The algorithm purposes. The Diffie-Hellman algorithm is
going to be used so that we may set up a secure communication channel (Sethuraman
et al.,2019). First, the systems communicate over this channel to exchange a
private key. After then, the symmetric encryption process between the two
systems is carried out with the help of this private key. This algorithm uses
the following key steps:
- "Select
the shared numbers. Select a large prime number."
- "Select
the private key and share the public key. Let's look at two users, Alice
and Bob."
- "Compute
the super key for encoding and decoding. For example, Alice computes her
super key as X = B^a mod P".
- "Use
the superkey to encrypt and decrypt."
El Gamal
encryption was one of the first methods developed after the Diffie-Hellman key
exchange algorithm became available in the encryption process. One contemporary
illustration of this concept is known as the Integrated Encryption Scheme,
which offers protection against assaults using selected plain text and selected
clipboard data.
The algorithm will primarily find its use in settings where
organizations extensively use various communication channels (Sethuraman et
al.,2019). The Diffie-Hellman algorithm is going to be used so that we may set
up a safe communication channel. The systems communicate over this channel to
exchange a private key. After then, symmetric encryption between the two
systems is carried out using the private key that was previously mentioned. RSA
stands for "Reverse Shamir Adelman," the algorithm's name.
References
Owoh, N. P., & Singh, M. M. (2019). Applying the
Diffie-Hellman algorithm to solve the critical agreement problem in mobile
blockchain-based sensing applications. International Journal of Advanced
Computer Science and Applications, 10(3).
Sethuraman, P., Tamizharasan, P. S., & Arputharaj, K.
(2019). Fuzzy genetic elliptic curve Diffie Hellman algorithm for secured
communication in networks. Wireless Personal Communications, 105(3), 993-1007.