Answers are grounded in this paper and cite their sources.
A knapsack-type public key cryptosystem is introduced that is the system is based on a novel application of arithmetic in finite fields. By appropriately choosing the parameters, one can control the density of the resulting knapsack, which is the ratio between the number of elements in the knapsack and their size in bits. In particular, the density can be made high enough to foil so-called low-density attacks against the system. At the moment, no attacks capable of breaking the system in a reasonable amount of time are known.>
No takes yet. Share an insight, caveat, or question.
Chor et al. (1988) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: