Network Security

Encryption

In cryptography, encryption is the way towards encoding a message or information so that only authorized parties can access it, and the individuals who are not approved cannot. Encryption does not itself forestall interference but denies the intelligible content to a would-be interceptor. Encryption takes readable data and alters it so that it seems irregular. Encryption requires the use of an encryption key: a set of mathematical values that both the sender and the recipient of an encrypted message know.‍

To ensure that the content of a message remains confidential despite wiretapping, messages must be encrypted. In essence, encryption scrambles bits of the message in Such a way that only the intended recipient can unscramble them. Someone who intercepts a copy of an encrypted message will not be able to extract information. Several technologies exist for encryption. In some technologies, a sender and receiver must both have a copy of an encryption key, which is kept secret. The sender uses the key to produce an encrypted message, which is then sent across a network.

The receiver uses the key to decode the encrypted message. That is, the encrypt function used by the sender takes two arguments: a key, K, and a message to be encrypted M. The function produces an encrypted version of the message, E.

$$E = encrypt ( K, M )$$

The decrypt function reverses the mapping to produce the original message

$$M = decrypt ( K, E )$$

Mathematically, decrypt is the inverse of encrypt

$$M = decrypt ( K, encrypt( K, M ))$$

Public Key Encryption

In many encryption schemes, the key must be kept secret to avoid compromising security. One particularly interesting encryption technique assigns each user a pair of keys. One of the user’s keys, called the private key is kept secret, while the other called the public key is published along with the name of the user, so everyone knows the value of the key.

The encryption function has the mathematical property that a message encrypted with the public key cannot be easily decrypted except with the private key and a message encrypted with the private key cannot be decrypted except with the public key. ‍

The relationships between encryption and decryption with the two keys can be expressed mathematically. Let M denote a message, public_u1 denote user’s 1’s public key, and private_u1 denote user 1’s private key.

$$M = decrypt ( public_u1, encrypt ( private_u1, M ))$$

and

$$M = decrypt ( private_u1, encrypt ( public_u1, M ))$$

Revealing a public key is safe because the functions used for encryption and decryption have a one way property. That is, telling someone the public key does not allow the person to forge a message that appears to be encrypted with the private key. Public key encryption can be used to guarantee confidentiality. A sender who Wishes a message to remain confidential uses the receiver’s public key to encrypt the message. Obtaining a copy of the message as it passes across the network does not enable someone to read the contents because decryption requires the receiver’s private Key. Thus, the scheme ensures the data remains confidential because only the receiver can decrypt the message.

Hashing

Hash functions are mathematical functions that create a synopsis, a data fingerprint. At that point, when applied to a given dataset, it generates an output, which is unique (there may be two data sets with the same hash, but the likelihood of occurrence is extremely low in Zeno network). One of the most incessant uses for the hash is checking data integrity. The hash output size depends on the web for execution is always the same size, regardless of input size. ‍

Our hashing algorithm is KangarooTwelve made by Keekack group; it is based on sponge construction. KangarooTwelve is a quick and secure extendable-output function (XOF), the generalization of hash functions to arbitrary output lengths. Derived from Keccak, it aims at higher speeds than FIPS 202’s SHA-3 and SHAKE functions, while retaining their flexibility and basis of security. On high-end platforms, it can exploit a high degree of parallelism, whether using multiple cores or the single-instruction multiple-data (SIMD) instruction set of modern processors.

KangarooTwelve hash algorithms have the following attributes:-

1. One way: it is computationally tough to discover the contribution from hash esteems.

2. Compression: In KangarooTwelve, the hash size should represent a small fraction of data.

3. Ease calculation: KangarooTwelve hash algorithm is not exorbitant to compute the hash values.

4. Diffusion: K12 hinders the reverse engineering of the algorithm when one bit of input is changed, the hash also results in change.

5. Collision: In K12, it gets computationally tricky to find two inputs that generate the same hash.