Time Improvement of Smith-Waterman Algorithm Using OpenMP and SIMD

Malik, Mehak; Malhotra, Srijan; Prasanth, N. Narayanan

doi:10.1007/978-981-15-4451-4_54

Cited by 4 publications

(1 citation statement)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It supports parallel multi-platform shared-memory programming on all architectures including Unix and Windows Platforms in C, C ++ and Fortran. We can add vectorized implementations by using the pragma directives present in OpenMP, which help in catalysing the decryption process; hence making it very efficient [1]. This paper presents an exact recursive and parallelized dynamic programming implementation for solving the Hard knapsack.…”

Section: Introductionmentioning

confidence: 99%

A Recursive and Parallelized Dynamic Programming Implementation of Hard Merkle-Hellman Knapsack System for Public Key Cryptography

Rahul

Prasanth

Raja

2021

Cybernetics and Information Technologies

View full text Add to dashboard Cite

Merkle-Hellman public key cryptosystem is a long-age old algorithm used in cryptography. Despite being computationally fast, for very large input sizes it may operate slower due to thread creation overhead or reaching a deadlock situation. In this paper, we discuss the working principles of the Traditional Merkle-Hellman knapsack cryptosystem, which is an Easy knapsack. The challenges of Hard Knapsack and how it overcomes the shortcomings of the Traditional Easy Knapsack, are also discussed. The Hard knapsack variant of Merkle-Hellman is solved first using plain recursion and then improvised using a dynamic programming approach to the problem. Parallelism and Concurrency has been achieved on the dynamic programming implementation using OpenMP API which further has enhanced the performance time. A comparative study of both variants of Hard Knapsack for messages of different lengths has shown that the latter is faster.

show abstract

Section: Introductionmentioning

confidence: 99%