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.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.