## A new knapsack based cryptosystem", Presented in Crypto83. Brickell, E.F., "Are most low density knapsacks solvable in polynomial time?

- E. F. Brickell
- Proceedings of the Fourteenth Soctheastern…
- 1983

- Published 2002

Absttact-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 t h e parameters, we can control the density of the resulting knapsack. In particular, the density can be made high enough to foil "low density… CONTINUE READING

### Presentations referencing similar topics