Hiding information and signatures in trapdoor knapsacks
The knapsack problem is an NP-complete combinatorial problem that is strongly believed to be computationally difficult to solve in general. Specific instances of this problem th...
Publications
1 shownFrequent Co-Authors
Researcher Info
- h-index
- 1
- Publications
- 1
- Citations
- 805
- Institution
- Stanford University
External Links
Impact Metrics
h-index
1
h-index: Number of publications with at least h citations each.