Parallelized RSA Algorithm: An Analysis with Performance Evaluation using OpenMP Library in High Performance Computing Environment

Ayub, Md. Ahsan; Onik, Zishan Ahmed; Smith, Steven M.

doi:10.1109/iccit48885.2019.9038275

Cited by 13 publications

(4 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Upon encountering an OpenMP directive, the system generates or awakes a new set of threads to execute tasks in parallel regions. Once all the threads have completed executing the parallel tasks, the parallel computation terminates, and the main thread resumes continuous operation while the other threads either sleep or shut down [25][26][27][28]. The Visual Studio 2019 integrated with Intel Fortran 2021 OpenMP environment is used to implement this parallel solver.…”

Section: Openmp Parallel Programming Technologymentioning

confidence: 99%

MPI/OpenMP-Based Parallel Solver for Imprint Forming Simulation

Li,

Xu,

Liu

et al. 2024

CMES

View full text Add to dashboard Cite

In this research, we present the pure open multi-processing (OpenMP), pure message passing interface (MPI), and hybrid MPI/OpenMP parallel solvers within the dynamic explicit central difference algorithm for the coining process to address the challenge of capturing fine relief features of approximately 50 microns. Achieving such precision demands the utilization of at least 7 million tetrahedron elements, surpassing the capabilities of traditional serial programs previously developed. To mitigate data races when calculating internal forces, intermediate arrays are introduced within the OpenMP directive. This helps ensure proper synchronization and avoid conflicts during parallel execution. Additionally, in the MPI implementation, the coins are partitioned into the desired number of regions. This division allows for efficient distribution of computational tasks across multiple processes. Numerical simulation examples are conducted to compare the three solvers with serial programs, evaluating correctness, acceleration ratio, and parallel efficiency. The results reveal a relative error of approximately 0.3% in forming force among the parallel and serial solvers, while the predicted insufficient material zones align with experimental observations. Additionally, speedup ratio and parallel efficiency are assessed for the coining process simulation. The pure MPI parallel solver achieves a maximum acceleration of 9.5 on a single computer (utilizing 12 cores) and the hybrid solver exhibits a speedup ratio of 136 in a cluster (using 6 compute nodes and 12 cores per compute node), showing the strong scalability of the hybrid MPI/OpenMP programming model. This approach effectively meets the simulation requirements for commemorative coins with intricate relief patterns.

show abstract

Section: Openmp Parallel Programming Technologymentioning

confidence: 99%

MPI/OpenMP-Based Parallel Solver for Imprint Forming Simulation

Li,

Xu,

Liu

et al. 2024

CMES

View full text Add to dashboard Cite

show abstract

“…Because of fewer operations, this method offered a roughly 33% greater throughput. Ayub et al [19] developed an OpenMP-based parallel CPU-based RSA method implementation that parallelizes the algorithm's exponentiation phase to aid in speedy encryption and decryption. Their analysis concludes that the program's execution time has been improved.…”

Section: Related Workmentioning

confidence: 99%

RSA Cryptosystem Speed Security Enhancement (Hybrid and Parallel Domain Approach)

2023

crypis

View full text Add to dashboard Cite

Encryption involves every aspect of working with and learning about codes. Over the last 40 years, it has grown in prominence to become a prominent scholarly discipline. Because most interactions now take place online, people require secure means of transmitting sensitive information. Several modern cryptosystems rely on public keys as a crucial component of their architecture. The major purpose of this research is to improve the speed and security of the RSA algorithm. By employing Linear Congruential Generator (LCG) random standards for randomly generating a list of large primes; and by employing other selected algorithms, such as the Chinese Remainder Theorem (CRT) in decryption, exponent selection conditions, the Fast Exponentiation Algorithm for encryption, and finally, a comparison of the enhanced RSA versus the normal RSA algorithm that shows an improvement will be provided.

show abstract

“…The traditional popular security algorithms are designed to achieve more security, but performance is not a criterion, as it uses a complex operation during implementation and uses multiple keys. The parallel encryption techniques [18][19][20][21][22][23] focus more on new hardware design than software implementation. The shortcomings of the previous algorithms are more complex processes, a lack of effective parallel computation and the use of many keys.…”

Section: Proposed Algorithmmentioning

confidence: 99%

Throughput Optimized Reversible Cellular Automata Based Security Algorithm

et al. 2022

View full text Add to dashboard Cite

Reversible cellular automation is a highly parallel system and produces enhanced throughput in its cryptographic applications. The throughput optimized security algorithm based on reversible cellular automata produces a better result in high-performance systems with many cores of CPU or GPU. We designed a throughput optimized block encryption technique using reversible cellular automata and compared its performance with other cellular automata-based algorithms. We tested its performance in both 8 core and 64 core CPU systems and the results showed an enhancement in throughput. This encryption system produced plaintext blocks that are immune to other blocks during cryptanalysis because of segmentation and the use of the different random numbers as seeds. It was built with 128 bits block encryption, but it was easily scalable to a higher block size without changing the algorithm. Each block of encryption used a cipher block chaining mode and was hence more secure and effective.

show abstract

Parallelized RSA Algorithm: An Analysis with Performance Evaluation using OpenMP Library in High Performance Computing Environment

Cited by 13 publications

References 20 publications

MPI/OpenMP-Based Parallel Solver for Imprint Forming Simulation

MPI/OpenMP-Based Parallel Solver for Imprint Forming Simulation

RSA Cryptosystem Speed Security Enhancement (Hybrid and Parallel Domain Approach)

Throughput Optimized Reversible Cellular Automata Based Security Algorithm

Contact Info

Product

Resources

About