We introduce a new knapsack type public key cryptosystem. The system is based on a novel application of arithmetic in finite fields, following a construction by Bose and Chowla. Appropriately choosing the parameters, we can control the density of the resulting knapsack. In particular, the density can be made high enough to foil “low density” attacks against our system. At the moment, we do not know of any attacks capable of “breaking” this system in a reasonable amount of time.
CITATION STYLE
Chor, B., & Rivest, R. L. (1985). A Knapsack Type Public Key Cryptosystem Based On Arithmetic in Finite Fields (preliminary draft). In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 196 LNCS, pp. 54–65). Springer Verlag. https://doi.org/10.1007/3-540-39568-7_6
Mendeley helps you to discover research relevant for your work.