An Approach to Block Ciphering Using Root of Perfect Square Number

Abstract

In recent days, for secure information transmission through internet, Cryptography is used. Here for secure data communication the plain text would be encrypted into cipher text using encryption process. This encrypted text along with the key or information would be send by the sender at receiver’s end. Then using the key or information, the receiver would able to decrypt the encrypted text. Using this base idea there exist different algorithm for encryption and decryption and for key generation. Here the main concept of the algorithm comes from cryptography, to secure any kind of file as it is implemented on bit-level. The strength of the technique is analyzed in this paper. This is a block based private key cryptographic technique. Here the main idea is developed on the basis of finding the number which appears maximum time and replace all the numbers with another numbers with the help of suitable technique which is described in the algorithm section. Then there also exist another technique which is based on finding root of the closest smaller perfect square. It can be possible that after encryption the encrypted file size can be reduced compared to the original file size. In case of encrypted file size reduced, lossless compression added extra flavour to it. The encryption and decryption process is clearly described in the algorithm section.