{'fraction_non_alphanumeric': 0.015250544662309368, 'fraction_numerical': 0.002904865649963689, 'mean_word_length': 5.625, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
PACMA : An Adaptive Symmetric Cryptographic Algorithm for Parallel Computing Environments

Traditional symmetric cryptographic algorithms are designed considering the cryptographic complexities rather than the processing capacities of the modern computing systems. Hence the performances of these algorithms are inconsistent and vary enormously when implemented in different computing systems with different processing capabilities. Parallelized adaptive cryptographic algorithms that can fit into the nature of the processing devices are the need of the hour. “Parallelized Adaptive Cipher with Modular Arithmetic” (PACMA) is a different class of cryptographic algorithm involving modular arithmetic concepts, which addresses these issues effectively. The size of the key and the plain text blocks are each 1024-bits. This symmetric block cipher is made adaptive by incorporating flexibility in the size of the key and plain text sub-blocks and the number of rounds. Level of Intra-packet parallelization, variety in grain size and the required security strength are achieved by suitably deciding the sub-block size. Flow of the algorithm is made dynamic by determining the execution steps through each key value at the runtime. The performance of the PACMA is analyzed with implementations in shared memory parallel programming environment using OpenMP, Java Threads and MPI.