Comparative Analysis of Symmetric Cryptographic Algorithms for Varying Text File Sizes | Chapter 6 | Mathematics and Computer Science: Contemporary Developments Vol. 4

 

This research aims to investigate five different symmetric algorithms: AES, DES, 3DES, Rijndael, and RC2. The primary objective is to identify the most suitable algorithm for encrypting text files of varying sizes and to promote a positive cryptographic culture for text file security.

 

Each algorithm is evaluated based on its performance in encrypting and decrypting text files of different sizes, specifically 10 KB, 20 KB, 50 KB, 1 MB, 2 MB, and 5 MB. The study focuses on measuring the time duration each algorithm requires for these processes. While numerous encryption algorithms can secure computerized information across different organizations, the time efficiency of each algorithm varies with the size of the text file. Some algorithms perform optimally for small files, while others are more suitable for larger files.

 

In this study, five symmetric algorithms are integrated into a single program using object-oriented programming concepts such as classes and inheritance. The program automatically selects the appropriate encryption algorithm based on the size of the text file to be encrypted. The file size remains stable before and after encryption, ensuring the same process is applied during decryption. The encryption and decryption code is developed using Visual Studio 2013, and the results are analyzed using the R programming language.

 

The encrypted text, or ciphertext, is represented in UTF-8 format, where "UTF-8" stands for Unicode Transformation Format, with "8" indicating that each character is represented by 8 bits. The file sizes are measured in kilobytes (KB). The performance analysis prioritizes smaller text files and arranges the algorithms in ascending order of their suitability: AES, 3DES, DES, RC2, and Rijndael. AES is found to be most effective for small text files, while Rijndael is more suitable for larger text files.

 

Author (s) Details

Allajabu Dafalla Khamis
College of Computer and Information Science, Faculty of Graduate Studies, Alzaem Alazhari University, Khartoum, Sudan.

 

Saad Subair
College of Computer Studies, International University of Africa, Khartoum, Sudan.

 

Please see the book here:- https://doi.org/10.9734/bpi/mcscd/v4/1704

Robust Encryption-Compression Scheme Based on Multiple Parameter Discrete Fractional Fourier Transform for JPEG 2000 | Chapter 5 | Mathematics and Computer Science: Contemporary Developments Vol. 7

The concept of Fractional Fourier transform (FRFT) was first introduced by N. Wiener in 1929, in quantum mechanics, the FRFT was recognized as a ‘transform method’ by mathematical bodies after the work of Victor Namias in 1980 in which the concept of FRFT had introduced by considering fractional power of eigenfunctions of the ordinary FT. Encryption along with compression is the process used to secure any multimedia content processing with minimum data storage and transmission. The transforms play a vital role in optimizing any encryption-compression systems. Earlier the original information in the existing security system based on the fractional Fourier transform (FRFT) is protected by only a certain order of FRFT. In this article, a novel method for an encryption-compression scheme based on multiple parameters of discrete fractional Fourier transform (DFRFT) with random phase matrices is proposed. The performance analysis and salient features of the proposed encryption-compression scheme are discussed in detail. The multiple-parameter discrete fractional Fourier transform (MPDFRFT) possesses all the desired properties of discrete fractional Fourier transform. The MPDFRFT converts to the DFRFT when all of its order parameters are the same. We exploit the properties of multiple-parameter DFRFT and propose a novel encryption-compression scheme using the double random phase in the MPDFRFT domain for encryption and compression data. The proposed scheme provides two-way options for data encryption and compression as well. The proposed scheme with MPDFRFT significantly enhances the data security along with the image quality of decompressed images compared to DFRFT and FRFT and it shows consistent performance with different images. The numerical simulations demonstrate the validity and efficiency of this scheme based on Peak signal to noise ratio (PSNR) and compression ratio (CR) and the robustness of the schemes against bruit force attack is examined.

 

Author (s) Details

 

Deepak Sharma
Electronics and Communication Engineering Department, Jaypee University of Engineering and Technology, Guna, India.

 

Manish Patidar
Electronics and Communication Engineering Department, Jaypee University of Engineering and Technology, Guna, India.

 

Please see the book here:- https://doi.org/10.9734/bpi/mcscd/v7/2789

Encryption and Decryption Process of RGB Colour Image Using by Matrix Method | Chapter 3 | Research and Applications Towards Mathematics and Computer Science Vol. 1

 In this research work, we intend a new technique for RGB colour figure encryption based on change matrix. The colour concept is encrypted into Red, Green and Blue channels place each channel uses a double permutation key method for assigning a new colour to all pixel of RGB colour representation. Each channel is encrypted with a method known as double change key encoding, that assigns a various color to each pel of an RGB color image.  Additionally, we present a novel approach of detached block encryption. The number of possible encryptions is provided along with a particularized study of the encryption of a 9-pixel representation. Additionally, the Matrix representation efficiently conveys the explanation process.

Author(s) Details:

N. Avinash,
Department of Mathematics, Sacred Heart College (Autonomous), Tirupattur-635 601, Tamil Nadu, India.

S. Jaraldpushparaj,
Department of Mathematics, Sacred Heart College (Autonomous), Tirupattur-635 601, Tamil Nadu, India.

T. Sathinathan,
Department of Mathematics, Sacred Heart College (Autonomous), Tirupattur-635 601, Tamil Nadu, India.

G. Britto Antony Xavier,
Department of Mathematics, Sacred Heart College (Autonomous), Tirupattur-635 601, Tamil Nadu, India.

Please see the link here: https://stm.bookpi.org/RATMCS-V1/article/view/10686

Double Fold Encryption Algorithm Using Adjacency Matrix and Linear Feedback Shift Register (LFSR) as Diffusion | Chapter 3 | Research Highlights in Mathematics and Computer Science Vol. 2

 Sensitive dossier transfer and sharing 'tween two or more legitimate entities have enhance a difficult task on account of indiscriminate and always-increasing usage of cyberspace in technology and route. The sole plan for defending data against high-tech-attacks is to mask the main information along the way. For a very long time, diagram theory plays a important role in encryption. The proximity matrices of undirected graphs, specifically, are used in the current research to evolve a block cypher. The data is encrypted in blocks, accompanying each block having three rounds and each round bearing two different phases: the first point uses an adjacency forge, and the second phase applies a reasonable XOR operation in a particular pattern for each component of the message. The proximity matrix in this place case is known to everyone, and the systems use a linear response shit register (LFSR) to found new matrices for encrypting each block. The diffusion tier in this case is the LFSR. The LFSR polynomial is a secret key that admits the entities to communicate with one another or with a trustworthy third party.

Author(s) Details:

Ch Suneetha,
Department of Mathematics, GITAM University, Visakhapatnam, India.

Please see the link here: https://stm.bookpi.org/RHMCS-V2/article/view/8570