Encryption Using Binary Randomization

ENCRYPTION USING BINARY RANDOMIZATION

ABSTRACT

The contest between code makers and code breakers has been going on for thousands of years. The purpose of cryptography is to transmit information in such a way that access to it is restricted entirely to the intended recipient, even if the transmission itself is received by others. This paper deals with a new technique involving randomization.

It makes use of three functions namely

* Encrypt

* Secure (authenticate)

* Compress

It also discusses the fundamentals behind authentication and compression. The code was implemented using an programming language and found that its authenticity surpassed many others. Its uniqueness prevents the unauthorized even to guess a solution .

Further in the paper the working, design and implementation of the code is discussed in detail.

Background of Cryptography:

Cryptography is nowadays a very important and lively subject, a wide reaching subject, related to information security. Cryptography (from the Greek kriptos, hidden, and grafein, writing) was until recently - no more than thirty years ago - of interest only in small specialist circles such as intelligence and diplomacy and was surrounded by an aura of mystery.

The reason for the widespread and increasing interest in cryptography is due to the importance today of information which has become the centre and motor of the world in which we live. Initially cryptography can be defined as a discipline which studies the principles. Methods , and means of transforming data in order to hide its meaning. The process consists of enciphering the information to be transmitted (which requires the knowledge of secret data which is called the key cipher) into what is called cipher text. Reversing the process (which equally requires the knowledge of key ciphers which may be the same as or different to that used to encipher the information ) is known as deciphering the text. the corresponding key ciphers, is called cryptanalysis.

Finally, the study of both cryptography and cryptanalysis is the subject of the branch of knowledge called cryptology. Currently, cryptographic systems, or cryptosystems, are very complex and make use, in the case of the sender, of a cryptographic device, or coder, which can be a combination of hardware and software ( in essence an extraordinarily complex mathematical algorithm ) which with the help of a cipher key, kE, transforms the text - called plain text - into an unintelligible text called the cipher text. The receiver uses a similar cryptographic device, a decoder, which with the help of another cipher key, kD, reverses the process obtaining once again the plain text via a cryptogram.

Today's Cryptographic Systems

There are many examples of this type of cipher algorithm, most notably

* DEA ( the basis for the former United States Federal Government DES, Data Encryption Standard ),

* the IDEA ( International Data Encryption Algorithm ),

* the A-5 ( used in the mobile telephone cellular system GSM ),

* the RC-X family ( X = 2, 4, 5, 6) and, most recently,

* the AEA (Advanced Encryption Algorithm, basis of the United States Federal Government AES, Advanced Encryption Standard ).

Introduction:

This technique was introduced by us in order to send a common mail to our group which addresses all the group members individually with private messages. The messages are encrypted using this algorithm thus giving a free roam security. Here each individual or group member has a key or a password with which he can read the data sent to him. Its specialty lies in the concept of randomization where in data is selected in random thus putting the third party into a confusion of what the code would be like. The algorithm in detail is explained in the working principle.

Working Principle:

This algorithm encrypts using binary randomization. Basically it uses 3 functions.

* Encrypt

* Secure (Authentication)

* Compress

Encrypt:

This