labs.blogg.se

The proposed algorithm (Roty_Shift) was tested using different key sizes and obtained good results.

The proposed algorithm consists of five levels, and according to these five levels the subkeys will be generated and the size of each one is (N*N), each one of these subkeys is possible to use it in any encryption strategy of block cipher type. Roty_Shift needs two secret seeds as secret keys, seed1 will be generated by true random number generator (TRNG) while seed1and seed2 will be used in pseudorandom number generator (PRNG), also this research utilizes the mechanism of the key derivation function (KDF) to generate the subkeys, on other hand Roty_Shift can be considered as PRNG.

In this research a proposed algorithm to generate secret keys was accomplished, the proposed key generation algorithm will be called (Roty_Shift algorithm) and it will generate a series (list) of subkeys may be used for data encryption.