Dynamic Selection of Symmetric Key Cryptographic Algorithms for Securing Data Based on Various Parameters
Ranjeet Masram, Vivek Shahare, Jibi Abraham, Rajni Moona, Pradeep, Sinha, Gaur Sunder, Prashant Bendale, Sayali Pophalkar

TL;DR
This paper compares the encryption time of seven symmetric cryptographic algorithms across various data types, sizes, and key parameters to evaluate their performance for secure electronic data exchange.
Contribution
It provides a comparative analysis of multiple symmetric algorithms considering practical factors like data type, size, and key variation for better algorithm selection.
Findings
AES and Blowfish show faster encryption times.
Encryption time varies significantly with data size and type.
Triple DES is slower compared to other algorithms.
Abstract
Most of the information is in the form of electronic data. A lot of electronic data exchanged takes place through computer applications. Therefore information exchange through these applications needs to be secure. Different cryptographic algorithms are usually used to address these security concerns. However, along with security there are other factors that need to be considered for practical implementation of different cryptographic algorithms like implementation cost and performance. This paper provides comparative analysis of time taken for encryption by seven symmetric key cryptographic algorithms (AES, DES, Triple DES, RC2, Skipjack, Blowfish and RC4) with variation of parameters like different data types, data density, data size and key sizes.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
