scientific article; zbMATH DE number 3693147
From MaRDI portal
Publication:3887342
Recommendations
Cited in
(11)- The bounded subset sum problem is almost everywhere randomly decidable in O(n)
- The Future of Cryptographic Algorithms
- Whither Cryptography?
- Recent Trends in Algebraic Development Techniques
- scientific article; zbMATH DE number 813995 (Why is no real title available?)
- A first study of improving transposition cryptosystem
- A time-luck tradeoff in relativized cryptography
- Uniform complexity and digital signatures
- A nonlinear public key cryptosystem
- Evaluation of the Adleman attack on multiply iterated knapsack cryptosystems
- Solving low density knapsacks
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3887342)