Randomized symmetric block encryption

Authors:
B. Dinesh Reddy;V. Valli Kumari;Kvsvn Raju
Affiliations:
VIIT, Visakhapatnam, India;Andhra University, Visakhapatnam, India;ANITS, Visakhapatnam, India
Venue:
Proceedings of the First International Conference on Security of Internet of Things
Year:
2012

Citing 4
Cited 0

Differential Cryptanalysis of the Full 16-Round DES

CRYPTO '92 Proceedings of the 12th Annual International Cryptology Conference on Advances in Cryptology
Description of a New Variable-Length Key, 64-bit Block Cipher (Blowfish)

Fast Software Encryption, Cambridge Security Workshop
Practically Secure Feistel Cyphers

Fast Software Encryption, Cambridge Security Workshop
A new method for known plaintext attack of FEAL cipher

EUROCRYPT'92 Proceedings of the 11th annual international conference on Theory and application of cryptographic techniques

Quantified Score

Hi-index	0.00

Visualization

Abstract

Most of the trivial symmetric block encryption algorithms give the same cipher text for a given set of plain text and key. This property can be used for performing linear and differential cryptanalysis. Using the concept of random data generation we designed a new scheme to give different cipher texts for a given set of plain text and key (when executed many times). The randomness in the cipher text makes it very secure against linear cryptanalysis and differential cryptanalysis. This new scheme can be used in cloud computing where data is stored at different location. Encryption and decryption is very fast as data is encrypted in three rounds.