Parallel time–space reduction by unbiased filtering for solving the 0/1-Knapsack problem

Buayen, Patcharin; Werapun, Jeeraporn

doi:10.1016/j.jpdc.2018.08.003

Cited by 4 publications

(1 citation statement)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The implicit intruder must therefore solve at least two challenging number theoretical problems in order to recover the information of the trapdoor, namely Integer factorization and Diophantine approximation problems. P a t c h a r i n B u a y e n and J e e r a p o r n W e r a p u n [3] suggests a parallel timespace reduction of polynomial time to solve the 0-1 knapsack. This focuses on achieving quick processing by unbiased-filtering as the FS (Feature Sorting) and the optimal solutions are similar to the DP where O(n/plog2p + C΄/p) is the optimized time-complexity.…”

Section: Related Workmentioning

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: Related Workmentioning

confidence: 99%