Computer Science - Cryptography and SecurityComputer Science - Computational ComplexityComputer Science - Discrete MathematicsComputer Science - Data Structures and AlgorithmsWe construct three public key knapsack cryptosystems. Standard knapsack cryptosystems hide easy instances of the knapsack problem and have ...
The above-mentioned knapsack problem is not the one that was proposed for cryptographic purposes. The one used is a only a special case, namely, the one in which the economical value of each good is equal to its size. This special problem is known as the... ...
The knapsack problem is an example of a combinational optimization problem, a topic in mathematics and computer science about finding the optimal object among a set of objects. This is a problem that has been studied for more than a century and is a commonly used example problem in combinatoria...
We analyze the auction protocol based on the well-known mathematical public-key knapsack problem for the design of asymmetric public-key knapsack trapdoor cryptosystem. Even though the knapsack system is not cryptographically secure, it can be used in certain auction situations. We describe the ...
This exponential time complexity is due to a combinatorial problem: the problem of choosing the right subsets of these n factors. In this paper, this combinatorial problem is reduced to a type of Knapsack problem that can be solved with lattice reduction algorithms. The result is a practical ...
Such a classical problem has not only motivated the development and exploration of numerous related variants across diverse domains but has also found applications in various fields. For instance, in the domain of cryptography [19], a knapsack problem variant was explored for encryption and security...
It leverages dynamic programming to efficiently compute the maximum value that can be carried in a knapsack of fixed capacity. The knapsack problem is a common algorithmic problem used in various fields such as operations research, cryptography, and logistics. This implementation solves the problem ...
One of the classical examples of complex optimization problems that has numerous applications in different areas is the multidimensional knapsack problem (MKP). Basically, the practical applications of MKP can be found in cryptography [10, 21, 24], warehouse location problem, production scheduling ...
Yvo DesmedtDesmedt Y (2011) Knapsack cryptographic schemes. In: Encyclopedia of cryptography and security, 2nd edn. pp 695–704Desmedt Y (2011) Knapsack cryptographic schemes. In: Encyclopedia of cryptography and security, 2nd edn. pp 695-704...
The fuzzy set theory is employed as an influential in mathematics by many researchers. The fuzzy models are used as a fundamental tool to solve several problems in cryptography. This work proposed alternative version of the fuzzy chaotic cryptosystem through employing the Knapsack problem and the ...