The following pages link to (Q3887342):
Displayed 6 items.
- The bounded subset sum problem is almost everywhere randomly decidable in O(n) (Q1083370) (← links)
- A nonlinear public key cryptosystem (Q1102923) (← links)
- Uniform complexity and digital signatures (Q1154262) (← links)
- A time-luck tradeoff in relativized cryptography (Q1171879) (← links)
- Solving Low Density Knapsacks (Q5019315) (← links)
- Evaluation of the Adleman Attack on Multiply Iterated Knapsack Cryptosystems (Q5019316) (← links)