Title of Invention

"A DEVICE FOR PREVENTING HACKING OF DIGITAL INFORMATION".

Abstract

The present invention is relate to a device for preventing hacking of digital information by means of encrypting the input information with the help of chaos functions, random numbers generated thereby and with the help of permutation matrices generate therewith. By the use of this device the hacker will not only have to identify the original location of the coded information but also the actual values of the operands acting on this coded information. The present devise also enables encryption of digital information such that the proposed encryption and decryption technique is easily in realizable real time. Through this devise the level of security can be increase or decreased as per the requirements at any given time.

Full Text

FIELD OF INVENTION: The present invention relates to a Device for preventing hacking of digital information using Chaos based Real Permutation Matrix PRIOR ART: Cryptanalysis or hacking is the science of recovering the plaintext of a message from the ciphertext without access to the key. In cryptanalysis, it is always assumed that the cryptanalyst has full access to the algorithm. If an algorithm is presumed to be perfect, then the only method of breaking it relies on trying every possible key combination until the resulting ciphertext makes sense, this type of attack is called a brute-force attack. The field of parallel computing is perfectly suited to the task of brute force attacks, as every processor can be given a number of possible keys to try, and they do not need to interact with each other at all except to announce the result. A technique that is becoming increasingly popular is parallel processing using thousands of individual computers connected to the Internet. This is known as distributed computing. Many cryptographers believe that brute force attacks are basically ineffective when long keys are used. An encryption algorithm with a large key (over 100 bits) can take millions of years to crack, even with powerful, networked computers of today. Besides, adding a single extra key doubles the cost of performing a brute force cryptanalysis. Cryptography is the science of devising methods that allow information to be sent in a secure form in such a way that the only person able to retrieve this information is the intended recipient. Encryption is based on algorithms that scramble information into unreadable or non-discernable form. Decryption is the process of restoring the scrambled information to its original form. A key is a value that causes a cryptographic algorithm to run in a specific manner and produce a specific ciphertext as an output. The key size is usually measured in bits. The bigger the key size, the more secure will be the algorithm. Single Key Cryptodevices: Suppose we have to encrypt and send the following stream of binary data (which might be originating from voice, video, text or any other source) 0110001010011111 .... We can use a 4-bit long key, x - 1011, to encrypt this bit stream. To perform encryption, the plaintext (binary bit stream) is first subdivided into blocks of 4 bits. 0110 0010 1001 111 1.... Each sub-block is XORed (binary addition) with the key, x = 1011. The encrypted message will be 1101 1001 0010 01 00.... The recipient must also possess the knowledge of the key in order to decrypt the message. The decryption process is fairly simple in this case. The ciphertext (the received binary bit stream) is first subdivided in to blocks of 4 bits. Each sub-block is XORed with the key, x = 1011. The decrypted message will be the original plaintext 0110 0010 1001 111 1.... Just one key is used both for encryption and decryption. Because there is just one key which is used for encryption and decryption, this kind of technique is called symmetric cryptography or single key cryptograpny or secret key cryptography. The problem with this technique is that the key has to be kept confidential. Also, the key must be changed from time to time to ensure secrecy of transmission. This means that the secret key (or the set of keys) has to be communicated to the recipient. This might be done physically. Public key cryptodevices: In order to overcome the problems of communicating the key, the concept of public key cryptography was developed by Difie and Hellman. This technique is also called the asymmetric encryption. There are two keys, one is held privately and the other one is made public. What one key can lock, the other key can unlock. Suppose we want to send an encrypted message to recipient A using the public key encryption technique. To do so we will use the public key of the recipient A and use it to encrypt the message. After the recipient receives the message, recipient A decrypts it with his private key. Only the private key of recipient A can decrypt a message that has been encrypted with his public key. Similarly, recipient B can only decrypt a message that has been encrypted with his public key. Thus, no private key ever needs to be communicated and hence one does not have to trust any communication channel to convey the keys. Suppose we want to send somebody a message and also provide a proof that the message is actually from us (a lot of harm can be done by providing bogus information, or rather, misinformation!). In order to keep a message private and also provide the authentication (that it is indeed from us), we can perform a special encryption on the plain text with our private key, then encrypt it again with the public key of the recipient. The recipient uses his private key to open the message and then use our public key to verify the authenticity. This technique is said to use digital signatures. One-way function: it is basically a non-reversible quick encryption method. The encryption is easy and fast, but the decryption is not. Suppose we send a document to recipient A and want to check at a later time whether the document has been tampered with. We can do so by running a one-way function, which produces a fixed length value called a hash (also called the message digest). The hash is the unique signature of the document that can be sent along with the document. Recipient A can run the same one-way function to check whether the document has been altered. OBJECT OF THE INVENTION: 1. One of the objects of the present invention is to propose a device and method of encryption of digital information such that a hacker not only has to identify the original location of the coded information but also the actual values of the operands acting onthis coded information. 2. Another object of the present invention is to propose a device for encryption of digital informationsuch that the proposed encryption and decryption technique is easily realizable in real time. 3. Yet another object of the present invention is to propose a device and method for encryption of digital information such that the complexity of the resultant encrypted code grows faster than the polynomial time as weincrease the size of the permutation matrix. 4. Yet another objective of the pesent invention is to propose a device and method for encryption of digital information wherein the level of security can be increased or decresed as per the requirements at any given time. BRIEF DESCRIPTION OF THE FIGURES: Figure 1 describes the concept of an encryption device and the method embodied therein for preventing hacking of digital information.. Figure 2 describes a block diagram for how chaos based random numbers are used to generate a Real Permutation Matrix. Figure 3 describes the complexity of the permuter. The x-axis represents the size of the permutation matrix. The mathematical complexity that grows faster than polynomial time as we increase the size of the permutation matrix. Figure 4 describes the complexity of the sealer. Let the floating point arithmetic used use a precision of m decimal places after the decimal point (m is plotted on the x-axis). The level of security offered by scaling depends on the precision of the floating point arithmetic used. Thus the level of security can be increased by increasing the precision of arithmetic. Fig. 5 shows the complete Cryptographic device with memory sections A,B,D,E and F and multipliers xl and x2. DESCRIPTION OF THE INVENTION: The present invention relate to :- - a method for preventing hacking of digital information, said method comprising the steps of - choosing a set of initial parameters - choosing a set of chaos functions - combining the said initial parameters with the said set of chaos function to generate different sets of random numbers - generating a Permutation Matrix of variable size using one set of the said random numbers - generating a Real Permutation matrix by multiplying the said Permutation matrix with the said set of random numbers - combining the said digital information with the said Real Permutation Matrix so as to render the said digital information highly indeterminable and indiscernible for a hacker. - a method for preventing hacking of digital information as mentioned herein above wherein the said sets of initial parameters are iterative. - a method for preventing hacking of digital information as mentioned herein above wherein the said set of initial parameters generate uniformly distributed random numbers. - a method for preventing hacking of digital information as mentioned herein above wherein the said set of initial parameters generate chaos random numbers. a method for preventing hacking ot digital information as mennonea herein above wherein the said set of chaos functions generate different sets of random numbers. a method for preventing hacking of digital information as mentioned herein above wherein the said random numbers can be generated either by dividing the bank of chaos functions into sub-sets or by using different sets of initial parameters. a method for preventing hacking of digital information as mentioned herein above wherein the size of the said permutation matrix is dictated by the degree of the security required. a method for preventing hacking of digital information as mentioned herein above wherein the complexity of the said Real Permutation Matrix is determined by the size of the said Permutation Matrix. a method for preventing hacking of digital information as mentioned herein above wherein the said combination of the digital information with the Real Permutation Matrix can be achieved by means of multiplication. a method for preventing hacking of digital information as mentioned herein above wherein the said combination of the digital information with the Real Permutation Matrix can be achieved by means of addition. a method for preventing hacking of digital information as mentioned herein above wherein the said combination of the digital information with the Real Permutation Matrix can be achieved by means of exponentiation. a method for preventing hacking of digital information as mentioned herein above wherein the said combination of the digital information with the Real Permutation Matrix can be achieved by means of powers. a method for preventing hacking of digital information as mentioned herein above wherein the said combination of the digital information with the Real Permutation Matrix can be achieved by means of non linear operations. a method for preventing hacking of digital information as mentioned herein above wherein the said combination of the digital information with the Real Permutation Matrix can be achieved by means of any of the said means as mentioned above.. a method for preventing hacking of digital information substantially as herein described with reference to the accompanying figures. The present invention also relates to :- A device for preventing hacking of digital information comprising of - a receiver of information - means for converting the said digital information into a set of chaos functions. - means for choosing a set of initial parameters - means for choosing a set of chaos functions - means for combining the said initial parameters wnn me said set of chaos function to generate different sets of random numbers - means for generating a permutation matrix of variable size using one set of the said random numbers - means of generating a Real Permutation matrix by multiplying the said Permutation matrix with the said set of random numbers - means for combining the said digital information with the said Real Permutation matrix so as to render the said digital information highly indeterminable and indiscernible for a hacker a device for preventing hacking of digital information as mentioned herein above wherein the said means for converting the said digital information into a set of chaos function is an input device coupled with multiplier and a memory section (A) a device as mentioned herein above wherein the said means for choosing a set of initial parameters is a memory section (B) said means for combining the said set of initial parameters with the said set of chaos function to generate different sets of random numbers is a data bus (C) coupled between the memory section (A) memory section (B) and a memory section (D) for storing the different sets of random number so produced. a device as mentioned herein above wherein the said means for generating a permutation matrix of variable size using the set of the said random number is a second data bas(E) connecting a memory section (F) for storing the galused of the said permutation matrix to the said memory section (U) wnicn stories the different set of random numbers a device for preventing tracking of digital information as mentioned herein above wherein the said means for generating a Real Permutation matrix is a third data bus (G) connected between memory section (H) for sting the variables of the said Real Permutation matrix and the said memory section (D) through a multiplier circuit(l). a device for preventing tracking of digital information as mentioned herein above wherein the input digital information as obtained from the input device (1) is combined with the variables of the said Real Permutation matrix as herein described. a device for preventing hacking of digital information substantially as herein described with reference to the accompanying figures. The present invention proposes an RN generation device to excue me chaos functions with different and randomly chosen initial conditions over time. In addition, we randomly choose different chaos functions and perform random number of iterations on the selected initial conditions. Chaos based random numbers: The present invention is based on chaotic equations. By chaos we mean an irregular, seemingly random change in time. The function is excited with an initial value or initial condition. The output of the function is fed back as an input to the same function, successively, to generate a stream of "random" numbers. One example of a chaos function is the logistic map given by For a chaos function we note that: • Given two inputs that are reasonably close together, corresponding outputs have a disproportionately large variation (exponential sensitivity to initial conditions) • The sequence of numbers generated by the chaos function are highly unpredictable without the knowledge of the exact initial condition. We consider a set ot cnaos runctions i.e. me cnaos runcuon pooi. of initial values is associated with each chaos function. Only a few initial values are suitable for generating random numbers. Note: Not all initial values to chaos functions result in generation of random values. The number of iterations with respect to any chaos functions is fixed else there will be cycles. Permutation Matrix: A permutation matrix is any matrix which can be created by rearranging the rows and/or columns of an identity matrix. Pre-multiplying a matrix A by a permutation matrix P results in a rearrangement of the rows of A. Post-multiplying by P results in a rerrangement of the columns of A. Let A be an n x n matrix. If the matrix P is obtained by swapping rows / and ;' of the n x n identity matrix ln, then rows / and j of A will be swapped in the product PA, and columns / and j of A will be swapped in the product AP. A permutation matrix can alternately be viewed as a matrix p,y obtained by permuting the rth and yth rows of the identity matrix with / row and column therefore contains precisely a single 1, and every permutation corresponds to a unique permutation matrix. There are (2) therefore 2 permutation matrices of size n, where A? is a binomial coefficient. A permutation matrix is nonsingular, so the determinant is always nonzero. In addition, a permutation matrix satisfies where I is the identity matrix. Applying to another matrix, p,y A gives A with the /th and yth rows interchanged, and Apg gives A with the /th and /th columns interchanged. Interpreting the 1s in an n x n permutation matrix as rooks gives an allowable configuration of non-attacking rooks on an n x n chessboard. However, the permutation matrices provide only a subset of possible solutions. The proposed method encrypts the data using a combination of two techniques: • Scaling • Permuting Both of these tasks are carried out by the Real-Permutation Matrix (RPM). The RPM is constructed using the standard permutation matrix except that the 1's are replaced by values generated using the chaos number generator. The hacker not only has to guess the original location of the original symbols but also the actual values. The Real-Permutation Matrix based on chaos functions, which performs permutation and scaling, has not been found in literature. Fast encoding and decoding by matrix multiplication: The proposed encryption and decryption technique is easily realizable in real-time. The fast encoding and decoding methodologies are given below: Encoding: uME = Mu * MRPM FMu : Uncoded Matrix FME : Encoded Matrix FMRPM : Real Permutation Matrix Decoding: uMD = ME * (MRPM)T FMo : Decoded Matrix The strength of the algorithm depends on two factors, which are described below: Strength of the technique due to the permutation operation: Determining the RPM is an NP hard problem, that is, the mathematical complexity that grows faster than polynomial time as we increase the size of the permutation matrix. This gives us a very simple way to increase the mathematical complexity of breaking into the device. For an N * A/ RPM, the hacker would need N\ (factorial A/) attempts. Strength of the technique due to the scaling operation: The non-zero elements of the RPM come from the chaotic random-number generator. This chaotic random-number generator consists of a bank of chaos functions and a set of good seed values. The level of security offered by scaling depends on the precision of the floating point arithmetic used. I hus tne level or securny can oe increased oy increasing the precision of arithmetic. Let the floating point arithmetic used use a precision of m decimal places after the decimal point. Thus an element of the permutation matrix can be represented as o.x}x2x3...xm where *, e {o,i,2,...,9}for / = 1 ,2, . . . ., m. For a brute-force attack, the hacker would need iom-i distinct attempts. Both of these strength factors work simultaneously. A hacker must guess/estimate the RPM exactly in order to break into the cryptodevice. Application/ Usage: The proposed device is ideal for any secure Cryptographic Communication device. The device is not only mathematically robust and secure but also simple. Example 1 Permutation matrix: (Table Removed) Chaos based Random Numbers (Table Removed) Real permutation matrix (Table Removed) Bit stream to be encoded: 10001111 01 01001011111 Integer representation 4365137... Encoded sequence 1.6265 3.2195 0.9943 0.1144 2.8027 5.2223 1.7306 Example 2 Permutation matrix: (Table Removed) Chaos based Random Numbers (Table Removed) Real permutation matrix (Table Removed) Bit stream to be encoded: (Table Removed) Integer representation (Table Removed) Encoded sequence (Table Removed) We claim 1. A device for preventing hacking of digital information said device comprising of :- - a receiver of information,. - means for choosing a set of initial parameters - means for choosing a set of chaos functions - means for combining the said initial parameters with the said set of chaos function to generate different sets of random numbers - means for generating a permutation matrix of variable size using one set of the said random numbers - means of generating a Real Permutation matrix by multiplying the said Permutation matrix with the said set of random numbers - means for combining the said digital information with the said Real Permutation matrix so as to render the said digital information highly indeterminable and indiscernible for a hacker 2. A device for preventing hacking of digital information as claimed in claim 1 wherein the said means for choosing a set of chaos functions is a memory section (A). 3. A device as claimed in claim 1 wherein the said means for choosing a set of initial parameters is a memory section (B). 4. A device as claimed in claim 1 wherein the said means for combining the said set of initial parameters with the said set of chaos functions is a data bus (C) connected between the memory section (A) , memory section (B) and a memory section (D) for storing the different sets or random mincers produced by the said combination. 5. A device as claimed in claim 1 wherein the said means for generating a permutation matrix of variable size using the set of the said random numbers is a memory section (E) for storing the values of the said permutation matrix as herein described. 6. A device for preventing tracking of digital information as claimed in claim 1 wherein the said means for generating a Real Permutation Matrix is a memory section (F) connected through a multiplier (X1) to the said memory section (D) and (E) as herein described. 7. A device as claimed in claim 1 wherein the input digital information as obtained from the Buffer (T) is combined with the variables of the said Real Permutation matrix through a multiplier (X2) as herein described. 8. A device for preventing hacking of digital information substantially as herein described with reference to the accompanying figures.

Documents:

138-del-2004-abstract.pdf

138-del-2004-claims.pdf

138-del-2004-complete specification (granded).pdf

138-DEL-2004-Correspondence Others-(21-07-2011).pdf

138-del-2004-correspondence-others.pdf

138-del-2004-correspondence-po.pdf

138-del-2004-description (complete).pdf

138-del-2004-drawings.pdf

138-del-2004-form-1.pdf

138-DEL-2004-Form-15-(21-07-2011).pdf

138-del-2004-form-19.pdf

138-del-2004-form-2.pdf

138-del-2004-form-26.pdf

138-del-2004-form-3.pdf

138-del-2004-form-5.pdf