Question

PLEASE GIVE BRIEF DEFINITIONS OF:

ElGamal

Asymetric algorithm

symmetric algorithm

Diffe-Hellman key aggrement

How they are related each other and how it is encrypted in bit wise explanations (with the octect rule and ip addresses, and how it was encrypted using those) and how it would be coded as an example.

PLEASE GIVE FULL DEFINITIONS AND EQUATIONS INVOLVED AND GIVE SOME EXPLANATIONS HOW IT IS RELATED IN BIT WISE

2^n

Answer 1

Symmetric-key algorithms^[1] are algorithmsfor cryptography that use the same cryptographic keys for both encryption of plaintext and decryption of ciphertext. The keys may be identical or there may be a simple transformation to go between the two keys.^[2] The keys, in practice, represent a shared secret between two or more parties that can be used to maintain a private information link.^[3] This requirement that both parties have access to the secret key is one of the main drawbacks of symmetric key encryption, in comparison to public-key encryption (also known as asymmetric key encryption).

The Diffie–Hellman protocol is a type of key agreement protocol. It was originally described in Diffie and Hellman's seminal paper on public key cryptography.

This key agreement protocol allows Alice and Bob to exchange public key values, and from these values and knowledge of their own corresponding private keys, securely compute a shared key K, allowing for further secure communication. Knowing only the exchanged public key values, an eavesdropper is not able to compute the shared key.

As a preamble to the protocol, the following public parameters are assumed to exist (see NumberTheory): a large prime numberp such that discrete logarithms in the multiplicative group of integers from 1 to p?1(Z?p)