Key generation technique by data diffusion through prism

One of the main challenges in cryptography is key generation for a particular any symmetric key algorithms. The foremost idea in key generation lies in using very small passwords which can easily be remembered by the users and creating keys of large size for the symmetric key encryption procedure [1][2][3] to be quite strong. The particular key generation technique forms a huge sized key of 64 bytes even when the password provided by the user comprises of a single byte. The main procedure makes use of theory of white light beam when made to fall on prism gives rise to a spectrum of light rays as velocity of light depends on the wavelength of light in a particular medium. Data given as password from the user has been converted to its hexadecimal equivalent and stored in a list. This list is then created as input to Fisher Yates Shuffling Algorithm and a pseudo-random shuffled list is extracted as output. Then random positions are extracted from this list and we get our particular angle of incidence, the refractive indices of the three mediums and the different angles of the prism. Thus we place data in a two dimensional data matrix in the particular angle as calculated. The data is made to fall on the first surface of the prism. As soon as the data falls, the data breaks into numbers of a lower base. Each byte is xor-ed with each other and both the resultant byte and an original byte are stored. The bytes are then stored in another matrix in an angle where the angle is calculated using the Snell’s law. Data is placed in a two dimensional matrix inside the prism according to the given angle of refraction. Then the data is made to fall on the second inner face of the prism. After refraction the data again spits to numbers of lower base and thus creates a larger matrix. At all the time of positioning of data in the matrix according to given calculated angles there will always remain some empty spaced cells. These cells are filled up with random data of the particular number system the other part of the data is in. This matrix can then be used for any Symmetric Key encryption algorithm that needs to be much secured with a large key size as well as very user-friendly with a very small sized password.