My brilliant padlet by

6Diffie-Hellman

i19017269 — 2022-03-23 06:48:33 UTC

The Diffie-Hellman algorithm is a method for securely exchanging cryptographic keys over insecure channels without compromising the security and integrity of data transmission.
There are three distinct steps to exchange keys, right from its generation up to its transmission
Step 1: You choose a prime number q and select a primitive root of q as α.
Step 2: You assume the private key for our sender as Xa where Xa < q. The public key can be calculated as Ya = αxa mod q. So, the key pair for your sender becomes {Xa, Ya}.
Assume the private key for the receiver to be Xb where Xb < q. The public key for the receiver is calculated as Yb = αxb mod q. For the receiver, the key pair becomes {Xb, Yb}.
Step 3: To generate the final secret key, you use three parameters. For the sender, you need the private key (Xa), the receiver’s public key (Yb), and the original q. The formula to calculate the key is K = (Yb)Xa mod q.
For the receiver, you need the private key (Ya), sender’s public key (Xb), and the original q. The formula to calculate the secret key is K = (Ya)Xb mod q.
If both the values of K generated are equal, the Diffie-Hellman key exchange algorithm is complete.

Symmetric Encryption

i21020115 — 2022-03-23 06:51:18 UTC

Symmetric encryption is a type of encryption where only one key (a secret key) is used to both encrypt and decrypt electronic information. The entities communicating via symmetric encryption must exchange the key so that it can be used in the decryption process. This encryption method differs from asymmetric encryption where a pair of keys, one public and one private, are used to encrypt and decrypt messages.

There are two types of symmetric encryption algorithms:

Block algorithms. Set lengths of bits are encrypted in blocks of electronic data with the use of a specific secret key. As the data is being encrypted, the system holds the data in its memory as it waits for complete blocks.
Stream algorithms. Data is encrypted as it streams instead of being retained in the system’s memory.

Asymmetric Encryption

i21020115 — 2022-03-23 06:52:07 UTC

Asymmetric Encryption, also known as Public-Key Cryptography, is an example of one type.

Unlike “normal” (symmetric) encryption, Asymmetric Encryption encrypts and decrypts the data using two separate yet mathematically connected cryptographic keys. These keys are known as a ‘Public Key’ and a ‘Private Key.’ Together, they’re called a ‘Public and Private Key Pair.’

MD5

yipac66917 — 2022-03-23 06:58:39 UTC

MD5 (message-digest algorithm) is a cryptographic mechanism that is used for message authentication, content verification, and digital signatures. MD5 is based on a hash function that verifies that a file you send matches the file received by the person to whom you sent it. MD5 was once used for data encryption, however it is currently largely utilized for authentication.

MD5 uses a mathematical hashing process to create a signature that can be compared to the original file. As a result, a received file may be validated as matching the original file that was transmitted, guaranteeing that the correct files reach their destination.

MD5 hashes are made out of 32 hexadecimal characters.

Example:

Transmitting the word "Destination" will convert it into a 32 hexadecimal character, such as 938c2cc0dcc05f2b68c4287040cfcf71

SHA

yipac66917 — 2022-03-23 07:05:17 UTC

The Secure Hash Algorithms (SHA) are a series of cryptographic hash functions. SHA is used for a multitude of reasons, including hashing data, certificate files, and other cryptographic uses, such as bitcoin. These hashing algorithms contribute to the security of the current internet infrastructure's backbone.

The acronym SHA stands for safe hashing algorithm. SHA is a modified version of MD5 that is used for data and certificate hashing. By employing bitwise operations, modular additions, and compression functions, a hashing algorithm compresses the input data into a smaller form that cannot be comprehended.

3. HMAC

i19017125 — 2022-03-23 07:11:57 UTC

HMAC is a type of code for message authentication during the executing cryptographic hash function for the data which needed for authenticated and a secret shared key. It is similar to digital signatures as both of them use hash function and a shared key, but digital signatures used asymmetric and HMAC used symmetric key.
HMAC works as it provides the client and server with a shared private key which only known only to them. The client makes a unique hash (HMAC) for every request. When the client requests the server, it hashes the requested data with a private key and sends it as a part of the request. Both the message and key are hashed in separate steps making it secure. When the server receives the request, it makes its own HMAC. Both the HMACS are compared and if both are equal, then the client will be considered as the real client. If there are attackers interrupt and modified for the request and data, then the resulting hash will not match with the original hash so that the receiver will know the request had been interrupted and modified.