A new symmetric probabilistic encryption scheme based on random numbers
B. Dinesh Reddy, V. Valli Kumari, K. V. S. V. N. Raju · 2014
A majority of the existing symmetric block encryption algorithms are deterministic in nature, i.e. for a given message and key combination, the encryption always results the same cipher text. An adversary can exploit this deterministic nature of symmetric block encryption algorithms by performing linear and differential cryptanalysis. Various block cipher modes like CBC are used in addition to these algorithms to randomize the ciphers. However, the use of block cipher modes makes symmetrical algorithms to execute sequentially. The proposed algorithm removes the essence of using such modes by incorporating the randomness into the algorithm itself. This enables the possibility to encrypt the data blocks faster on an N-processor system concurrently. Amalgamating the idea of probabilistic encryption with a six round random symmetric block encryption technique using a pseudorandom number generation scheme we present a new breed of fast paced symmetric-probabilistic encryption algorithm which yields cipher text that is resistant to not only to the trivial linear cryptanalytic techniques but also to differential cryptanalysis.