The following example implements Diffie Helman Exchange Algorithm.
Click here to download the PDF File
Related Articles
-
Explain Asymmetric key cryptography
In Asymmetric key cryptography, each person has two keys i.e. Public key& Private key. The public key is known...
-
Non-repudiation
There are situation where a user sends a message, and later on refuses that he had sent that message...
-
What are the typical phases of operation of a virus?
The first stage is called Pre-trigger stage or the dormant stage. In this stage viruses lie dormant, and does...
-
Integrity in network security
When content of message change after sending the message by sender but before receiver receive it then we can...
-
Rail Fence Algorithm
Rail fence cipher The rail-fence technique is an example of transposition technique. It uses a simple algorithm. Steps...
-
Difference between symmetric-key cryptography and asymmetric-key cryptography.
Keys distribution in each technique Symmetric-key: It only needs one key to encrypt and decrypt the message. Both user...
-
Confidentiality in Network Security
The principle of confidentiality specifies that only the sender and intended recipient should be able to access the...
-
RC4 Algorithm in Network Security tybscit Semester 5
RC4was designed by Ron Rivest. It is based on stream cipher i.e. the encryption & decryption happens byte by...
