itzYubi/Puzzle-Encryption-Algorithm

The underlying structure of network security mainly consists of encryption algorithms. These algorithms are broadly divided into two categories symmetric encryption algorithm and asymmetric encryption algorithm both having their own pros and cons. In this algorithm the sender and the receiver receive the same key which is why it symmetric encryption approach . The objective of the paper is to delineate the security of the algorithm. The strength of the algorithm is tested by using various cryptanalytic attacks such as Linear, Brute force, Differential, Differential-linear Crypt-analysis. The scrupulous juxtaposition of the puzzle encryption with the Advanced Encryption Standard (AES) which is yet another method to encrypt data, is a vital ground for exegesis. The algorithm has some interesting properties: Variable block size, Key size is erratic and the algorithm is much faster than the average cryptography function. The algorithm is created while acknowledging the concepts of Confusion and Diffusion and the observable universe. The cryptography is non-linear and is multi-operational on bits as well as bytes.

TeX