Secure and Cost Effective Cryptosystem Design Based on Random Multiple Key Streams
Penchalaiah Padugupati, Ramesh Reddy K
Journal of Information Security Research, Vol. 7, No. 1, 2016.
DOI: 
Link: http://www.dline.info/jisr/fulltext/v7n1/jisrv7n1_3.pdf
Abstract:
There are many cryptographic systems that use complex operations involving substitutions and permutations
to produce resistant ciphertext, even if the level of the security of these cryptosystems are good, there should be tradeoff
between security level and operational cost and the ever increasing virtual infrastructure and mobile, cloud computing
technologies creating much more complexities and demanding cost effective and secure cryptographic algorithms.
In order to make a cipher more difficult to break, one could use various keys in cryptosystem. This would help to cover any
perceptible patterns in the ciphertext. In fact, one can produce unbreakable ciphertext by supplying randomly generated key
on each bit of data that is mathematically infeasible to break. Since different random bits or keys would not lead to any
repeating patterns.
For the first time, in this paper, we present a construction method to generate multiple random keys from a core-key with
highest possible immunity to crack. We are with a particular emphasis on novel technique to secure user data, we have
designed a secure and cost effective new cryptosystem called Rbits (Random bits) cipher. In different directions we identify
that Rbits having highest immunity to crack and presenting various analysis tests in support from this viewpoint.